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

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