Towards a New Theory of Optimal Dynamic Graph Algorithms

Project Information

DynOpt

Grant agreement ID: 101043159

DOI

10.3030/101043159

EC signature date 16 February 2022

Start date 1 October 2022

End date 30 September 2027

Funded under

• European Research Council (ERC)

Total cost

€ 1 400 000,00

EU contribution

€ 1 400 000,00

Coordinated by

TEL AVIV UNIVERSITY
Israel

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Conference proceedings (11)

A Lossless Deamortization for Dynamic Greedy Set Cover

Author(s): Shay Solomon, Amitai Uzrad, Tianyi Zhang
Published in: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024
Publisher: IEEE
DOI: 10.1109/FOCS61266.2024.00025

Arboricity-Dependent Algorithms for Edge Coloring

Author(s): Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon
Published in: Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024), 2024
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/LIPICS.SWAT.2024.12

Faster $(\Delta+1)$-Edge Coloring: Breaking the $m\sqrt{n}$ Time Barrier

Author(s): Sayan Bhattacharya, Din Carmon, Martín Costa, Shay Solomon, Tianyi Zhang
Published in: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024
Publisher: IEEE
DOI: 10.1109/FOCS61266.2024.00128

A Unified Framework for Light Spanners

Author(s): Le, Hung; Solomon, Shay
Published in: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Publisher: Association for Computing Machinery
DOI: 10.48550/arxiv.2008.10582

Covering Planar Metrics (and Beyond): O(1) Trees Suffice

Author(s): Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
Published in: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2024
Publisher: IEEE
DOI: 10.1109/FOCS57990.2023.00139

Optimal Euclidean Tree Covers

Author(s): Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenković, Shay Solomon, Cuong Than
Published in: Proceedings of the 40th International Symposium on Computational Geometry (SoCG 2024), 2024
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/LIPICS.SOCG.2024.37

Towards Instance-Optimal Euclidean Spanners

Author(s): Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang
Published in: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024
Publisher: IEEE
DOI: 10.1109/FOCS61266.2024.00099

Dynamic ((1+) ln )-Approximation Algorithms for Minimum Set Cover and Dominating Set

Author(s): Shay Solomon, Amitai Uzrad
Published in: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Publisher: ACM
DOI: 10.1145/3564246.3585211

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω (log n) Lightness Barrier

Author(s): Hung Le, Shay Solomon, Cuong Than
Published in: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2024
Publisher: IEEE
DOI: 10.1109/FOCS57990.2023.00013

Sparse Euclidean Spanners with Optimal Diameter: A General and Robust Lower Bound via a Concave Inverse-Ackermann Function

Author(s): Le, Hung; Milenković, Lazar; Solomon, Shay
Published in: Proceedings of the 39th International Symposium on Computational Geometry, SoCG 2023, 2023
Publisher: Schloss Dagstuhl–Leibniz-Zentrum für Informatik
DOI: 10.4230/LIPICS.SOCG.2023.47

Density-Sensitive Algorithms for (Δ + 1)-Edge Coloring

Author(s): Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon
Published in: 2024
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/LIPICS.ESA.2024.23

Book chapters (4)

Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More

Author(s): Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenković, Shay Solomon, Cuong Than
Published in: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.191

Nibbling at Long Cycles: Dynamic (and Static) Edge Coloring in Optimal Time

Author(s): Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon
Published in: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.122

Even Faster (Δ + 1)-Edge Coloring via Shorter Multi-Step Vizing Chains

Author(s): Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang
Published in: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.167

Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in-<i>f</i> Time Barrier

Author(s): Anton Bukov, Shay Solomon, Tianyi Zhang
Published in: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.24