Distributed and Dynamic Graph Algorithms and Complexity

Publications

Conference proceedings (12)

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
DOI: 10.1137/1.9781611975031.1

"Dynamic spanning forest with worst-case update time: adaptive, las vegas, and o(n^{1/2 - ε})-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
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
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
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
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
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
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
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
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
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
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
DOI: 10.4230/lipics.opodis.2019.33

Peer reviewed articles (2)

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
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
DOI: 10.1007/s00453-018-0512-8

Book chapters (4)

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
DOI: 10.1137/1.9781611975482.162

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
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
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
DOI: 10.1137/1.9781611975994.16