Christian Wulff-Nilsen
Lektor
Algorithms and Complexity
Universitetsparken 1, 2100 København Ø
- 2024
- Udgivet
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, s. 5332-5360Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- 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
- 2022
- Udgivet
Constructing light spanners deterministically in near-linear time
Alstrup, Stephen, Dahlgaard, S., Filtser, A., Stöckel, M. & Wulff-Nilsen, Christian, 12 mar. 2022, I: Theoretical Computer Science. 907, s. 82-112Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
- Udgivet
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., s. 3482-3495Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
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, s. 1-11Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
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, s. 600-611 (Annual IEEE Symposium on Foundations of Computer Science).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
Optimal Approximate Distance Oracle for Planar Graphs
Le, H. & Wulff-Nilsen, Christian, 2022, s. 1-61.Publikation: Konferencebidrag › Paper › Forskning
- 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
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