No. Title Author Year
1 Sparse Euclidean Spanners with Optimal Diameter: A General and Robust Lower Bound via a Concave Inverse-Ackermann Function Le, Hung et al. 2023
2 Dynamic Matching Algorithms Under Vertex Updates Le, Hung et al. 2022
3 Near-Optimal Distributed Implementations of Dynamic Algorithms for Symmetry Breaking Problems Antaki, Shiri et al. 2022
4 Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound Le, Hung et al. 2022
5 A Generalized Matching Reconfiguration Problem Solomon, Noam et al. 2021
6 Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs: Simpler, Faster, and Combinatorial Morgan, Adir et al. 2021
7 Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach Assadi, Sepehr et al. 2021
8 Light Euclidean Spanners with Steiner Points Le, Hung et al. 2020
9 When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time Assadi, Sepehr et al. 2019
10 Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier Charikar, Moses et al. 2018
11 Fully Dynamic MIS in Uniformly Sparse Graphs Onak, Krzysztof et al. 2018
12 Improved Dynamic Graph Coloring Solomon, Shay et al. 2018
13 Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs Solomon, Shay 2018
Current Page :
Number of result pages: 1
Number of documents: 13

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