No. Title Author Year
1 Dynamic Graph Algorithms (Dagstuhl Seminar 22461) Bernstein, Aaron et al. 2023
2 Hardness of Token Swapping on Trees Aichholzer, Oswin et al. 2022
3 Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost Berger, Aaron et al. 2022
4 Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs: Simpler, Faster, and Combinatorial Morgan, Adir et al. 2021
5 Lower Bounds for Dynamic Distributed Task Allocation Su, Hsin-Hao et al. 2020
6 Algorithms and Hardness for Diameter in Dynamic Graphs Ancona, Bertie et al. 2019
7 Approximation Algorithms for Min-Distance Problems Dalirrooyfard, Mina et al. 2019
8 Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems Dalirrooyfard, Mina et al. 2019
9 Finding Cliques in Social Networks: A New Distribution-Free Model Fox, Jacob et al. 2018
10 Fully Dynamic MIS in Uniformly Sparse Graphs Onak, Krzysztof et al. 2018
11 Improved Dynamic Graph Coloring Solomon, Shay et al. 2018
Current Page :
Number of result pages: 1
Number of documents: 11


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