| Maximum flow and minimum-cost flow in almost-linear time L Chen, R Kyng, YP Liu, R Peng, MP Gutenberg, S Sachdeva 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 317* | 2022 |
| Deterministic decremental reachability, scc, and shortest paths via directed expanders and congestion balancing A Bernstein, MP Gutenberg, T Saranurak 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 71 | 2020 |
| Deterministic decremental sssp and approximate min-cost flow in almost-linear time A Bernstein, MP Gutenberg, T Saranurak 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 65 | 2022 |
| Fully-dynamic graph sparsifiers against an adaptive adversary A Bernstein, J Brand, MP Gutenberg, D Nanongkai, T Saranurak, ... arXiv preprint arXiv:2004.08432, 2020 | 58 | 2020 |
| Decremental strongly-connected components and single-source reachability in near-linear time A Bernstein, M Probst, C Wulff-Nilsen Proceedings of the 51st Annual ACM SIGACT Symposium on theory of computing …, 2019 | 49 | 2019 |
| Decremental SSSP in weighted digraphs: Faster and against an adaptive adversary MP Gutenberg, C Wulff-Nilsen Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 44 | 2020 |
| Near-optimal decremental SSSP in dense weighted digraphs A Bernstein, MP Gutenberg, C Wulff-Nilsen 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 40 | 2020 |
| Deterministic algorithms for decremental approximate shortest paths: Faster and simpler MP Gutenberg, C Wulff-Nilsen Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 40 | 2020 |
| A deterministic almost-linear time algorithm for minimum-cost flow J van den Brand, L Chen, MP Gutenberg, R Kyng, YP Liu, R Peng, ... 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS, 2023 | 38 | 2023 |
| Fully-dynamic all-pairs shortest paths: Improved worst-case time and space bounds MP Gutenberg, C Wulff-Nilsen Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 37 | 2020 |
| New algorithms and hardness for incremental single-source shortest paths in directed graphs M Probst Gutenberg, V Vassilevska Williams, N Wein Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 35 | 2020 |
| New techniques and fine-grained hardness for dynamic near-additive spanners T Bergamaschi, M Henzinger, MP Gutenberg, VV Williams, N Wein Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 33 | 2021 |
| Decremental APSP in unweighted digraphs versus an adaptive adversary J Evald, V Fredslund-Hansen, MP Gutenberg, C Wulff-Nilsen 48th International Colloquium on Automata, Languages, and Programming (ICALP …, 2021 | 19* | 2021 |
| Maintaining expander decompositions via sparse cuts Y Hua, R Kyng, MP Gutenberg, Z Wu Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 13 | 2023 |
| Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, st Shortest Path, and Minimum-Cost Flow L Chen, R Kyng, YP Liu, S Meierhans, M Probst Gutenberg Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 1165-1173, 2024 | 12 | 2024 |
| A near-optimal offline algorithm for dynamic all-pairs shortest paths in planar digraphs D Das, MP Gutenberg, C Wulff-Nilsen Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 11 | 2022 |
| A dynamic shortest paths toolbox: Low-congestion vertex sparsifiers and their applications R Kyng, S Meierhans, M Probst Gutenberg Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 1174-1183, 2024 | 9 | 2024 |
| Derandomizing directed random walks in almost-linear time R Kyng, S Meierhans, M Probst 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 7 | 2022 |
| Deterministic incremental APSP with polylogarithmic update time and stretch S Forster, Y Nazari, M Probst Gutenberg Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1173-1186, 2023 | 6* | 2023 |
| A Simple Framework for Finding Balanced Sparse Cuts via APSP L Chen, R Kyng, MP Gutenberg, S Sachdeva Symposium on Simplicity in Algorithms (SOSA), 42-55, 2023 | 6 | 2023 |
Rasmus KyngETH ZurichVerified email at kyng.dk
