No. Title Author Year
1 An Optimal Separation Between Two Property Testing Models for Bounded Degree Directed Graphs Peng, Pan et al. 2023
2 Effective Resistances in Non-Expander Graphs Cai, Dongrun et al. 2023
3 Massively Parallel Algorithms for the Stochastic Block Model Li, Zelin et al. 2023
4 GSF-Locality Is Not Sufficient For Proximity-Oblivious Testing Adler, Isolde et al. 2021
5 Augmenting the Algebraic Connectivity of Graphs Manghiuc, Bogdan-Adrian et al. 2020
6 Constant-Time Dynamic (Δ+1)-Coloring Henzinger, Monika et al. 2020
7 Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time Fichtenberger, Hendrik et al. 2020
8 Testable Properties in General Graphs and Random Order Streaming Czumaj, Artur et al. 2020
9 Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs Goranci, Gramoz et al. 2018
10 Improved Guarantees for Vertex Sparsification in Planar Graphs Goranci, Gramoz et al. 2017
11 Testable Bounded Degree Graph Properties Are Random Order Streamable Monemizadeh, Morteza et al. 2017
12 The Power of Vertex Sparsifiers in Dynamic Graph Algorithms Goranci, Gramoz et al. 2017
13 Dynamic Graph Stream Algorithms in o(n) Space Huang, Zengfeng et al. 2016
14 On Constant-Size Graphs That Preserve the Local Structure of High-Girth Graphs Fichtenberger, Hendrik et al. 2015
15 Testing Small Set Expansion in General Graphs Li, Angsheng et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 15

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI