Christian Wulff-Nilsen
Associate Professor, Guest Researcher
Algorithms and Complexity
Universitetsparken 1, 2100 København Ø
Department of Computer Science
Universitetsparken 1
2100 København Ø
- 2020
- Published
Decremental SSSP in weighted digraphs: Faster and against an adaptive adversary
Gutenberg, M. P. & Wulff-Nilsen, Christian, 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (ed.). Association for Computing Machinery, p. 2542-2561Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
Deterministic algorithms for decremental approximate shortest paths: Faster and Simpler
Gutenberg, M. P. & Wulff-Nilsen, Christian, 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (ed.). Association for Computing Machinery, p. 2522-2541Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
Escaping an Infinitude of Lions
Abrahamsen, Mikkel, Holm, Jacob, Rotenberg, E. & Wulff-Nilsen, Christian, 2020, In: The American Mathematical Monthly. 127, 10, p. 880-896Research output: Contribution to journal › Journal article › Research › peer-review
- Published
Fully-dynamic all-pairs shortest paths: Improved worst-case time and space bounds
Gutenberg, M. P. & Wulff-Nilsen, Christian, 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (ed.). Association for Computing Machinery, p. 2562-2574Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
Near-optimal decremental sssp in dense weighted digraphs
Bernstein, A., Gutenberg, M. P. & Wulff-Nilsen, Christian, 2020, Proceedings - 2020 IEEE 61st Annual Symposium on Foundations of Computer Science, FOCS 2020. IEEE, p. 1112-1122 9317923Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
ID: 40450735
Most downloads
-
1974
downloads
Wiener Index, Diameter, and Stretch Factor of a Weighted Planar Graph in Subquadratic Time
Research output: Working paper › Research
Published -
1573
downloads
Sum of All-Pairs Shortest Path Distances in a Planar Graph in Subquadratic Time
Research output: Working paper › Research
Published -
770
downloads
Computing the Maximum Detour of a Plane Graph in Subquadratic Time
Research output: Working paper › Research
Published