Christian Wulff-Nilsen
Lektor
Algorithms and Complexity
Universitetsparken 1, 2100 København Ø
ORCID: 0000-0002-3699-7821
1 - 3 ud af 3Pr. side: 10
- 2021
- Udgivet
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. (red.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, s. 1-20 64. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 198).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
Near-Optimal Distance Oracles for Vertex-Labeled Planar Graphs
Evald, J., Fredslund-Hansen, V. & Wulff-Nilsen, Christian, 2021, 32nd International Symposium on Algorithms and Computation, ISAAC 2021. Ahn, H-K. & Sadakane, K. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 14 s. 23. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 212).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs
Fredslund-Hansen, V., Mozes, S. & Wulff-Nilsen, Christian, 2021, 32nd International Symposium on Algorithms and Computation, ISAAC 2021. Ahn, H-K. & Sadakane, K. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 12 s. 25. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 212).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
ID: 40450735
Flest downloads
-
1980
downloads
Wiener Index, Diameter, and Stretch Factor of a Weighted Planar Graph in Subquadratic Time
Publikation: Working paper › Forskning
Udgivet -
1578
downloads
Sum of All-Pairs Shortest Path Distances in a Planar Graph in Subquadratic Time
Publikation: Working paper › Forskning
Udgivet -
775
downloads
Computing the Maximum Detour of a Plane Graph in Subquadratic Time
Publikation: Working paper › Forskning
Udgivet