Christian Wulff-Nilsen
Associate Professor
Algorithms and Complexity
Universitetsparken 1, 2100 København Ø
ORCID: 0000-0002-3699-7821
1 - 3 out of 3Page size: 10
- 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
ID: 40450735
Most downloads
-
1978
downloads
Wiener Index, Diameter, and Stretch Factor of a Weighted Planar Graph in Subquadratic Time
Research output: Working paper › Research
Published -
1575
downloads
Sum of All-Pairs Shortest Path Distances in a Planar Graph in Subquadratic Time
Research output: Working paper › Research
Published -
773
downloads
Computing the Maximum Detour of a Plane Graph in Subquadratic Time
Research output: Working paper › Research
Published