Christian Wulff-Nilsen
Lektor
Algorithms and Complexity
Universitetsparken 1, 2100 København Ø
ORCID: 0000-0002-3699-7821
1 - 3 ud af 3Pr. side: 10
- 2023
- Udgivet
Almost Optimal Exact Distance Oracles for Planar Graphs
Charalampopoulos, P., Gawrychowski, P., Long, Y., Mozes, S., Pettie, S., Weimann, O. & Wulff-Nilsen, Christian, 2023, I: Journal of the ACM. 70, 2, 50 s., 12.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
- Udgivet
Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time
Bernstein, A., Gutenberg, M. P. & Wulff-Nilsen, Christian, 2023, I: SIAM Journal on Computing. 52, 2, s. 128-155Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
- Udgivet
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. (red.). Society for Industrial and Applied Mathematics, s. 70-86Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
ID: 40450735
Flest downloads
-
1979
downloads
Wiener Index, Diameter, and Stretch Factor of a Weighted Planar Graph in Subquadratic Time
Publikation: Working paper › Forskning
Udgivet -
1577
downloads
Sum of All-Pairs Shortest Path Distances in a Planar Graph in Subquadratic Time
Publikation: Working paper › Forskning
Udgivet -
774
downloads
Computing the Maximum Detour of a Plane Graph in Subquadratic Time
Publikation: Working paper › Forskning
Udgivet