Dynamic Algorithms Against Strong Adversaries

Project Information

DynASoAr

Grant agreement ID: 947702

DOI

10.3030/947702

EC signature date 1 September 2020

Start date 1 September 2021

End date 31 August 2026

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost

€ 1 499 843,00

EU contribution

€ 1 499 843,00

Coordinated by

PARIS-LODRON-UNIVERSITAT SALZBURG
Austria

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

Book chapters (3)

Matching Composition and Efficient Weight Reduction in Dynamic Matching

Author(s): Aaron Bernstein, Jiale Chen, Aditi Dudeja, Zachary Langley, Aaron Sidford, Ta-Wei Tu
Published in: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025, Page(s) 2991-3028
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.97

Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity

Author(s): Tijn de Vos, Aleksander B. G. Christiansen
Published in: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025, Page(s) 700-749
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.21

Dynamic Consistent <i>k</i>-Center Clustering with Optimal Recourse

Author(s): Sebastian Forster, Antonis Skarlatos
Published in: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025, Page(s) 212-254
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.7

Conference proceedings (23)

Faster Cut Sparsification of Weighted Graphs

Author(s): Sebastian Forster, Tijn de Vos
Published in: 49th International Colloquium on Automata, Languages, and Programming, 2022, Page(s) 61:1–61:19
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2022.61

Towards Constant Time Multi-Call Rumor Spreading on Small-Set Expanders

Author(s): Emilio Cruciani, Sebastian Forster, Tijn de Vos
Published in: 39th International Symposium on Distributed Computing (DISC 2025), Issue 356, 2025, Page(s) 26:1-26:25, ISBN 978-3-95977-402-4
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.disc.2025.26

Fast Deterministic Fully Dynamic Distance Approximation

Author(s): Jan van den Brand, Sebastian Forster, Yasamin Nazari
Published in: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science, 2022, Page(s) 1011–1022
Publisher: IEEE
DOI: 10.1109/focs54457.2022.00099

Bootstrapping Dynamic Distance Oracles

Author(s): Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos
Published in: Proc. of the 31st Annual European Symposium on Algorithms, 2023
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.esa.2023.50

The Careless Coupon Collector’s Problem

Author(s): Emilio Cruciani, Aditi Dudeja
Published in: 13th International Conference on Fun with Algorithms (FUN 2026), Issue 366, 2026, Page(s) 14:1--14:21, ISBN 978-3-95977-417-8
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.fun.2026.14

Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model

Author(s): Tijn de Vos
Published in: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, Issue 17, 2023, Page(s) 71-74
Publisher: ACM
DOI: 10.1145/3583668.3594566

Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique

Author(s): Sebastian Forster, Tijn de Vos
Published in: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, Issue 20, 2023, Page(s) 75-78
Publisher: ACM
DOI: 10.1145/3583668.3594577

The Laplacian Paradigm in the Broadcast Congested Clique

Author(s): Sebastian Forster; Tijn de Vos
Published in: Proceedings of the 2022 ACM Symposium on Distributed Computing, 2022, Page(s) 335–344
Publisher: ACM
DOI: 10.1145/3519270.3538436

Minimum Cost Flow in the CONGEST Model

Author(s): Tijn de Vos
Published in: Lecture Notes in Computer Science, Structural Information and Communication Complexity, 2023, Page(s) 406-426
Publisher: -
DOI: 10.1007/978-3-031-32733-9_18

Incremental (k, z)-Clustering on Graphs

Author(s): Emilio Cruciani, Sebastian Forster, Antonis Skarlatos
Published in: 53rd International Colloquium on Automata, Languages, and Programming (ICALP 2026), Issue 374, 2026, Page(s) 70:1--70:24, ISBN 978-3-95977-428-4
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2026.70

Decremental Matching in General Weighted Graphs

Author(s): Aditi Dudeja
Published in: Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, 2024
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2024.59

New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths

Author(s): Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos
Published in: Proceedings of the 51st International Colloquium on Automata, 4 Languages, and Programming, ICALP 2024, 2024
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2024.58

A Weighted-to-Unweighted Reduction for Matroid Intersection

Author(s): Aditi Dudeja, Mara Grilnberger
Published in: Integer Programming and Combinatorial Optimization - 27th International Conference, {IPCO} 2026, Padua, Italy, June 17-19, 2026, Issue 16588, 2026, Page(s) 378--393
Publisher: Springer
DOI: 10.1007/978-3-032-28691-8\_25

On a Voter Model with Context-Dependent Opinion Adoption

Author(s): Luca Becchetti, Vincenzo Bonifaci, Emilio Cruciani, Francesco Pasquale
Published in: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023, Page(s) 38-45
Publisher: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2023/5

Fully Dynamic Spectral Sparsification for Directed Hypergraphs

Author(s): Sebastian Forster, Gramoz Goranci and Ali Momeni
Published in: 43rd International Symposium on Theoretical Aspects of Computer Science (STACS 2026), Issue 364, 2026, Page(s) 38:1-38:20, ISBN 978-3-95977-412-3
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.stacs.2026.38

Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs

Author(s): Aditi Dudeja, Rashmika Goswami, Michael Saks
Published in: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025, Page(s) 4948-4982
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.168

A Framework for Distributed Quantum Queries in the CONGEST Model

Author(s): Joran van Apeldoorn; Tijn de Vos
Published in: Proceedings of the 2022 ACM Symposium on Distributed Computing, 2022, Page(s) 109–119
Publisher: ACM
DOI: 10.1145/3519270.3538413

Fast Algorithms for Energy Games in Special Cases

Author(s): Sebastian Forster, Antonis Skarlatos, Tijn de Vos
Published in: Electronic Proceedings in Theoretical Computer Science, Issue 390, 2023, Page(s) 236-252, ISSN 2075-2180
Publisher: Italy
DOI: 10.4204/eptcs.390.15

Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch

Author(s): Sebastian Forster, Yasamin Nazari, Maximilian Probst Gutenberg
Published in: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, Page(s) 1173-1186
Publisher: ACM
DOI: 10.1145/3564246.3585213

Dynamic algorithms for <i>k</i>-center on graphs

Author(s): Emilio Cruciani, Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos
Published in: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Page(s) 3441-3462
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.123

On Dynamic Graph Algorithms with Predictions

Author(s): Jan van den Brand, Sebastian Forster, Yasamin Nazari, Adam Polak
Published in: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Page(s) 3534-3557
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.126

Fast 2-Approximate All-Pairs Shortest Paths

Author(s): Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos
Published in: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Page(s) 4728-4757
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.169

On a Voter Model with Context-Dependent Opinion Adoption

Author(s): Luca Becchetti, Vincenzo Bonifaci, Emilio Cruciani, and Francesco Pasquale
Published in: Proc. of the 2023 International Conference on Autonomous Agents and Multiagent Systems. AAMAS 2023, 2023
Publisher: The International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
DOI: 10.48550/arxiv.2305.07377

Peer reviewed articles (3)

On the Convergence of Nonlinear Averaging Dynamics with Three-Body Interactions on Hypergraphs

Author(s): Emilio Cruciani, Emanuela L. Giacomelli, Jinyeop Lee
Published in: SIAM Journal on Applied Dynamical Systems, Issue 23, 2024, Page(s) 2364-2406, ISSN 1536-0040
Publisher: Society of Industrial and Applied Mathematics
DOI: 10.1137/23m1568338

Faster Cut Sparsification of Weighted Graphs

Author(s): Sebastian Forster, Tijn de Vos
Published in: Algorithmica, 2023, Page(s) 929-964, ISSN 0178-4617
Publisher: Springer Verlag
DOI: 10.1007/s00453-022-01053-4

Phase transition of the k-majority dynamics in biased communication models

Author(s): Emilio Cruciani, Hlafo Alfie Mimun, Matteo Quattropani, Sara Rizzo
Published in: Distributed Computing, Issue 36, 2023, Page(s) 107-135, ISSN 0178-2770
Publisher: Springer Verlag
DOI: 10.1007/s00446-023-00444-2