No. Title Author Year
1 Light Euclidean Spanners with Steiner Points Le, Hung et al. 2020
2 When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time Assadi, Sepehr et al. 2019
3 Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier Charikar, Moses et al. 2018
4 Fully Dynamic MIS in Uniformly Sparse Graphs Onak, Krzysztof et al. 2018
5 Improved Dynamic Graph Coloring Solomon, Shay et al. 2018
6 Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs Solomon, Shay 2018
Current Page :
Number of result pages: 1
Number of documents: 6


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