No. Title Author Year
1 A Generalized Matching Reconfiguration Problem Solomon, Noam et al. 2021
2 Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs: Simpler, Faster, and Combinatorial Morgan, Adir et al. 2021
3 Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach Assadi, Sepehr et al. 2021
4 Light Euclidean Spanners with Steiner Points Le, Hung et al. 2020
5 When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time Assadi, Sepehr et al. 2019
6 Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier Charikar, Moses et al. 2018
7 Fully Dynamic MIS in Uniformly Sparse Graphs Onak, Krzysztof et al. 2018
8 Improved Dynamic Graph Coloring Solomon, Shay et al. 2018
9 Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs Solomon, Shay 2018
Current Page :
Number of result pages: 1
Number of documents: 9

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