No. |
Title |
Author |
Year |
---|

1 |
Augmenting the Algebraic Connectivity of Graphs |
Manghiuc, Bogdan-Adrian et al. |
2020 |

2 |
Constant-Time Dynamic (Δ+1)-Coloring |
Henzinger, Monika et al. |
2020 |

3 |
Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time |
Fichtenberger, Hendrik et al. |
2020 |

4 |
Testable Properties in General Graphs and Random Order Streaming |
Czumaj, Artur et al. |
2020 |

5 |
Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs |
Goranci, Gramoz et al. |
2018 |

6 |
Improved Guarantees for Vertex Sparsification in Planar Graphs |
Goranci, Gramoz et al. |
2017 |

7 |
Testable Bounded Degree Graph Properties Are Random Order Streamable |
Monemizadeh, Morteza et al. |
2017 |

8 |
The Power of Vertex Sparsifiers in Dynamic Graph Algorithms |
Goranci, Gramoz et al. |
2017 |

9 |
Dynamic Graph Stream Algorithms in o(n) Space |
Huang, Zengfeng et al. |
2016 |

10 |
On Constant-Size Graphs That Preserve the Local Structure of High-Girth Graphs |
Fichtenberger, Hendrik et al. |
2015 |

11 |
Testing Small Set Expansion in General Graphs |
Li, Angsheng et al. |
2015 |