Skip to main content
European Commission logo
English English
CORDIS - EU research results
CORDIS
CORDIS Web 30th anniversary CORDIS Web 30th anniversary

Distributed and Dynamic Graph Algorithms and Complexity

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

Negative-Weight Single-Source Shortest Paths in Almost-linear Time

Author(s): Aaron Bernstein, Danupon Nanongkai, Christian Wulff-Nilsen
Published in: FOCS, 2022
Publisher: IEEE

A New Deterministic Algorithm for Dynamic Set Cover

Author(s): Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai
Published in: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019, Page(s) 406-423, ISBN 978-1-7281-4952-3
Publisher: IEEE
DOI: 10.1109/focs.2019.00033

Breaking the quadratic barrier for matroid intersection

Author(s): Joakim Blikstad; Jan van den Brand; Sagnik Mukhopadhyay; Danupon Nanongkai
Published in: STOC, Issue 7, 2021
Publisher: ACM
DOI: 10.1145/3406325.3451092

Distributed weighted min-cut in nearly-optimal time

Author(s): Michal Dory; Yuval Efron; Sagnik Mukhopadhyay; Danupon Nanongkai
Published in: STOC, Issue 9, 2021
Publisher: ACM
DOI: 10.1145/3406325.3451020

Sublinear-Round Parallel Matroid Intersection

Author(s): Joakim Blikstad
Published in: 2022
Publisher: Schloss Dagstuhl -- Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.icalp.2022.25

Training (Overparametrized) Neural Networks in Near-Linear Time

Author(s): Brand, Jan van den; Peng, Binghui; Song, Zhao; Weinstein, Omri
Published in: Issue 6, 2021
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
DOI: 10.4230/lipics.itcs.2021.63

Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary

Author(s): Bernstein, Aaron; Brand, Jan van den; Gutenberg, Maximilian Probst; Nanongkai, Danupon; Saranurak, Thatchaphol; Sidford, Aaron; Sun, He
Published in: Leibniz International Proceedings in Informatics, LIPIcs, 229, Issue 3, 2022
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.3929/ethz-b-000557713

Sensitive Distance and Reachability Oracles for Large Batch Updates

Author(s): Jan van den Brand, Thatchaphol Saranurak
Published in: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019, Page(s) 424-435, ISBN 978-1-7281-4952-3
Publisher: IEEE
DOI: 10.1109/focs.2019.00034

Weighted Min-Cut: Sequential, Cut-Query and Streaming Algorithms

Author(s): Mukhopadhyay, Sagnik; Nanongkai, Danupon
Published in: STOC, 2020
Publisher: ACM

Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs

Author(s): Jan van den Brand, Yin-Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang
Published in: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, Page(s) 919-930, ISBN 978-1-7281-9621-3
Publisher: IEEE
DOI: 10.1109/focs46700.2020.00090

Minimum Cuts in Directed Graphs via Partial Sparsification

Author(s): Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Kent Quanrud, Thatchaphol Saranurak
Published in: FOCS, 2021
Publisher: IEEE
DOI: 10.1109/focs52979.2021.00113

Solving tall dense linear programs in nearly linear time

Author(s): Jan van den Brand, Yin Tat Lee, Aaron Sidford, Zhao Song
Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, Page(s) 775-788, ISBN 9781450369794
Publisher: ACM
DOI: 10.1145/3357713.3384309

Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds

Author(s): Jan van den Brand, Danupon Nanongkai, Thatchaphol Saranurak
Published in: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019, Page(s) 456-480, ISBN 978-1-7281-4952-3
Publisher: IEEE
DOI: 10.1109/focs.2019.00036

Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs

Author(s): Andrés López-Martínez; Sagnik Mukhopadhyay; Danupon Nanongkai
Published in: SPAA, Issue 6, 2021
Publisher: ACM
DOI: 10.1145/3409964.3461806

A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond

Author(s): Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak
Published in: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, Page(s) 1158-1167, ISBN 978-1-7281-9621-3
Publisher: IEEE
DOI: 10.1109/focs46700.2020.00111

Faster connectivity in low-rank hypergraphs via expander decomposition

Author(s): Beideman, Calvin; Chandrasekaran, Karthekeyan; Mukhopadhyay, Sagnik; Nanongkai, Danupon
Published in: IPCO, Issue 8, 2022
Publisher: Springer
DOI: 10.48550/arxiv.2011.08097

Dynamic Algorithms for Graph Coloring

Author(s): Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger, Danupon Nanongkai
Published in: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018, Page(s) 1-20
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975031.1

"Dynamic spanning forest with worst-case update time: adaptive, las vegas, and o(n<sup>1/2 - ε</sup>)-time"

Author(s): Danupon Nanongkai, Thatchaphol Saranurak
Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017, 2017, Page(s) 1122-1129, ISBN 9781-450345286
Publisher: ACM Press
DOI: 10.1145/3055399.3055447

Distributed Exact Weighted All-Pairs Shortest Paths in Õ(n^{5/4}) Rounds

Author(s): Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak
Published in: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 2017, Page(s) 168-179, ISBN 978-1-5386-3464-6
Publisher: IEEE
DOI: 10.1109/focs.2017.24

From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More

Author(s): Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan
Published in: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 2017, Page(s) 743-754, ISBN 978-1-5386-3464-6
Publisher: IEEE
DOI: 10.1109/focs.2017.74

Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time

Author(s): Danupon Nanongkai, Thatchaphol Saranurak, Christian Wulff-Nilsen
Published in: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 2017, Page(s) 950-961, ISBN 978-1-5386-3464-6
Publisher: IEEE
DOI: 10.1109/focs.2017.92

On the Distributed Complexity of Large-Scale Graph Computations

Author(s): Gopal Pandurangan, Peter Robinson, Michele Scquizzato
Published in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18, 2018, Page(s) 405-414, ISBN 9781-450357999
Publisher: ACM Press
DOI: 10.1145/3210377.3210409

Distributed edge connectivity in sublinear time

Author(s): Mohit Daga, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak
Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, 2019, Page(s) 343-354, ISBN 9781-450367059
Publisher: ACM Press
DOI: 10.1145/3313276.3316346

Smooth heaps and a dual view of self-adjusting data structures

Author(s): László Kozma, Thatchaphol Saranurak
Published in: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018, 2018, Page(s) 801-814, ISBN 9781-450355599
Publisher: ACM Press
DOI: 10.1145/3188745.3188864

Distributed exact weighted all-pairs shortest paths in near-linear time

Author(s): Aaron Bernstein, Danupon Nanongkai
Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, 2019, Page(s) 334-342, ISBN 9781-450367059
Publisher: ACM Press
DOI: 10.1145/3313276.3316326

A Faster Distributed Single-Source Shortest Paths Algorithm

Author(s): Sebastian Forster, Danupon Nanongkai
Published in: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 2018, Page(s) 686-697, ISBN 978-1-5386-4230-6
Publisher: IEEE
DOI: 10.1109/focs.2018.00071

Breaking quadratic time for small vertex connectivity and an approximation scheme

Author(s): Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, 2019, Page(s) 241-252, ISBN 9781-450367059
Publisher: ACM Press
DOI: 10.1145/3313276.3316394

Equivalence Classes and Conditional Hardness in Massively Parallel Computations

Author(s): Danupon Nanongkai, Michele Scquizzato
Published in: 23rd International Conference on Principles of Distributed Systems (OPODIS 2019), 2019
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.opodis.2019.33

Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms

Author(s): Sebastian Forster, Danupon Nanongkai, Liu Yang, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2020, Page(s) 2046-2065, ISBN 978-1-61197-599-4
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975994.126

Coarse-Grained Complexity for Dynamic Algorithms

Author(s): Sayan Bhattacharya, Danupon Nanongkai, Thatchaphol Saranurak
Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2020, Page(s) 476-494, ISBN 978-1-61197-599-4
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975994.29

A Deterministic Linear Program Solver in Current Matrix Multiplication Time

Author(s): Jan van den Brand
Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2020, Page(s) 259-278, ISBN 978-1-61197-599-4
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975994.16

Breaking O(nr) for Matroid Intersection

Author(s): Joakim Blikstad
Published in: 2021
Publisher: Schloss Dagstuhl -- Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.icalp.2021.31

Cut query algorithms with star contraction

Author(s): Simon Apers, Yuval Efron, Pawel Gawrychowski, Troy Lee, Sagnik Mukhopadhyay, Danupon Nanongkai
Published in: FOCS, 2022
Publisher: IEEE

Minimum cost flows, MDPs, and ℓ1-regression in nearly linear time for dense instances

Author(s): Jan van den Brand; Yin Tat Lee; Yang P. Liu; Thatchaphol Saranurak; Aaron Sidford; Zhao Song; Di Wang
Published in: STOC, Issue 8, 2021
Publisher: ACM
DOI: 10.1145/3406325.3451108

Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time {LP} Solver

Author(s): Parinya Chalermsook; Chien-Chung Huang; Danupon Nanongkai; Thatchaphol Saranurak; Pattara Sukprasert; Sorrachai Yingchareonthawornchai
Published in: 49th International Colloquium on Automata, Languages, and Programming,{ICALP} 2022, July 4-8, 2022, Paris, France, 2022
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.4230/lipics.icalp.2022.37

Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time

Author(s): Jan van den Brand, Danupon Nanongkai
Published in: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019, Page(s) 436-455, ISBN 978-1-7281-4952-3
Publisher: IEEE
DOI: 10.1109/focs.2019.00035

Vertex connectivity in poly-logarithmic max-flows

Author(s): Jason Li; Danupon Nanongkai; Debmalya Panigrahi; Thatchaphol Saranurak; Sorrachai Yingchareonthawornchai
Published in: STOC, 2021
Publisher: ACM STOC
DOI: 10.1145/3406325.3451088

Nearly Optimal Communication and Query Complexity of Bipartite Matching

Author(s): Joakim Blikstad, Jan van den Brand, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai
Published in: FOCS, 2022
Publisher: IEEE

Dynamic Set Cover: Improved Amortized and Worst-Case Update Time

Author(s): Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu
Published in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Page(s) 2537-2549, ISBN 978-1-61197-646-5
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976465.150

Expander Decomposition and Pruning: Faster, Stronger, and Simpler

Author(s): Thatchaphol Saranurak, Di Wang
Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, Page(s) 2616-2635, ISBN 978-1-61197-548-2
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975482.162

Unifying Matrix Data Structures: Simplifying and Speeding up Iterative Algorithms

Author(s): Jan van den Brand
Published in: Symposium on Simplicity in Algorithms (SOSA), 2021, Page(s) 1-13, ISBN 978-1-61197-649-6
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976496.1

Multi-Finger Binary Search Trees

Author(s): Chalermsook, Parinya; Goswami, Mayank; Kozma, László; Mehlhorn, Kurt; Saranurak, Thatchaphol
Published in: 29th International Symposium on Algorithms and Computation, ISAAC 2018, 2018, ISSN 1868-8969
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ISAAC.2018.55

New Tools and Connections for Exponential-Time Approximation

Author(s): Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof
Published in: Algorithmica, Issue 81/10, 2019, Page(s) 3993-4009, ISSN 0178-4617
Publisher: Springer Verlag
DOI: 10.1007/s00453-018-0512-8

Searching for OpenAIRE data...

There was an error trying to search data from OpenAIRE

No results available