Christian Wulff-Nilsen
Associate Professor
Algorithms and Complexity
Universitetsparken 1, 2100 København Ø
- 2024
- Published
VC Set Systems in Minor-free (Di)Graphs and Applications
Le, H. & Wulff-Nilsen, Christian, 2024, Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, p. 5332-5360Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- 2023
- Published
Almost Optimal Exact Distance Oracles for Planar Graphs
Charalampopoulos, P., Gawrychowski, P., Long, Y., Mozes, S., Pettie, S., Weimann, O. & Wulff-Nilsen, Christian, 2023, In: Journal of the ACM. 70, 2, 50 p., 12.Research output: Contribution to journal › Journal article › Research › peer-review
- Published
Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time
Bernstein, A., Gutenberg, M. P. & Wulff-Nilsen, Christian, 2023, In: SIAM Journal on Computing. 52, 2, p. 128-155Research output: Contribution to journal › Journal article › Research › peer-review
- Published
Fully Dynamic Exact Edge Connectivity in Sublinear Time
Goranci, G., Henzinger, M., Nanongkai, D., Saranurak, T., Thorup, Mikkel & Wulff-Nilsen, Christian, 2023, Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Bansal, N. & Nagarajan, V. (eds.). Society for Industrial and Applied Mathematics, p. 70-86Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- 2022
- Published
Constructing light spanners deterministically in near-linear time
Alstrup, Stephen, Dahlgaard, S., Filtser, A., Stöckel, M. & Wulff-Nilsen, Christian, 12 Mar 2022, In: Theoretical Computer Science. 907, p. 82-112Research output: Contribution to journal › Journal article › Research › peer-review
- Published
A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs
Das, D., Gutenberg, M. P. & Wulff-Nilsen, Christian, 2022, ACM-SIAM Symposium on Discrete Algorithms, SODA 2022. Association for Computing Machinery, Inc., p. 3482-3495Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs
Das, D., Kipouridis, Evangelos, Gutenberg, M. P. & Wulff-Nilsen, Christian, 2022, Proceedings, Symposium on Simplicity in Algorithms (SOSA). SIAM, p. 1-11Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
Negative-Weight Single-Source Shortest Paths in Near-linear Time
Bernstein, A., Nanongkai, D. & Wulff-Nilsen, Christian, 2022, 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, p. 600-611 (Annual IEEE Symposium on Foundations of Computer Science).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
Optimal Approximate Distance Oracle for Planar Graphs
Le, H. & Wulff-Nilsen, Christian, 2022, p. 1-61.Research output: Contribution to conference › Paper › Research
- 2021
- Published
Decremental APSP in unweighted digraphs versus an adaptive adversary
Evald, J., Fredslund-Hansen, V., Gutenberg, M. P. & Wulff-Nilsen, Christian, 2021, 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021. Bansal, N., Merelli, E. & Worrell, J. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-20 64. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 198).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
ID: 40450735
Most downloads
-
1991
downloads
Wiener Index, Diameter, and Stretch Factor of a Weighted Planar Graph in Subquadratic Time
Research output: Working paper › Research
Published -
1582
downloads
Sum of All-Pairs Shortest Path Distances in a Planar Graph in Subquadratic Time
Research output: Working paper › Research
Published -
785
downloads
Computing the Maximum Detour of a Plane Graph in Subquadratic Time
Research output: Working paper › Research
Published