Christian Wulff-Nilsen
Lektor
Algorithms and Complexity
Universitetsparken 1, 2100 København Ø
- 2021
- 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
- 2020
- Udgivet
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. (red.). Association for Computing Machinery, s. 2542-2561Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
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. (red.). Association for Computing Machinery, s. 2522-2541Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
Escaping an Infinitude of Lions
Abrahamsen, Mikkel, Holm, Jacob, Rotenberg, E. & Wulff-Nilsen, Christian, 2020, I: The American Mathematical Monthly. 127, 10, s. 880-896Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
- Udgivet
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. (red.). Association for Computing Machinery, s. 2562-2574Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
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, s. 1112-1122 9317923Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- 2019
- Udgivet
Constructing light spanners deterministically in near-linear time
Alstrup, Stephen, Dahlgaard, S., Filtser, A., Stöckel, M. & Wulff-Nilsen, Christian, 2019, 27th Annual European Symposium on Algorithms, ESA 2019. Bender, M. A., Svensson, O. & Herman, G. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 15 s. 4. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 144).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
Decremental strongly-connected components and single-source reachability in near-linear time
Bernstein, A., Probst, M. & Wulff-Nilsen, Christian, 2019, STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Charikar, M. & Cohen, E. (red.). Association for Computing Machinery, s. 365-376 12 s. (Proceedings of the Annual ACM Symposium on Theory of Computing).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- 2018
- Udgivet
Better tradeoffs for exact distance oracles in planar graphs
Gawrychowski, P., Mozes, S., Weimann, O. & Wulff-Nilsen, Christian, 2018, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms . Czumaj, A. (red.). Society for Industrial and Applied Mathematics, s. 515-529Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
ID: 40450735
Flest downloads
-
1999
downloads
Wiener Index, Diameter, and Stretch Factor of a Weighted Planar Graph in Subquadratic Time
Publikation: Working paper › Forskning
Udgivet -
1592
downloads
Sum of All-Pairs Shortest Path Distances in a Planar Graph in Subquadratic Time
Publikation: Working paper › Forskning
Udgivet -
795
downloads
Computing the Maximum Detour of a Plane Graph in Subquadratic Time
Publikation: Working paper › Forskning
Udgivet