| 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 | 56 | 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 | 42 | 2020 |
| 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 | 31 | 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 | 31 | 2019 |
| 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 | 30 | 2020 |
| 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 | 27 | 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 | 26 | 2022 |
| 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 | 24 | 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 | 21 | 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 | 18 | 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 | 14 | 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 | 11* | 2021 |
| On the complexity of the (approximate) nearest colored node problem M Probst arXiv preprint arXiv:1807.03721, 2018 | 4 | 2018 |
| 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 | 2 | 2023 |
| 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 | 2 | 2022 |
| 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 | 1 | 2023 |
| 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 | 1 | 2022 |
| Hardness results for laplacians of simplicial complexes via sparse-linear equation complete gadgets M Ding, R Kyng, MP Gutenberg, P Zhang arXiv preprint arXiv:2202.05011, 2022 | 1 | 2022 |
| Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch S Forster, Y Nazari, MP Gutenberg arXiv preprint arXiv:2211.04217, 2022 | | 2022 |
| A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs∗ D Das, E Kipouridis, MP Gutenberg, C Wulff-Nilsen Symposium on Simplicity in Algorithms (SOSA), 1-11, 2022 | | 2022 |
Christian Wulff-NilsenAssociate professor, Department of Computer Science, University of CopenhagenE-mailová adresa ověřena na: di.ku.dk
