Christian Wulff-Nilsen
Lektor, Gæsteforsker
Algorithms and Complexity
Universitetsparken 1, 2100 København ÃÂ
Datalogisk Institut
Universitetsparken 1
2100 København Ø
- 2023
- 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 › fagfællebedømt
- 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 › 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 › 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
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
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
- 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
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 › 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
- 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
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
- 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
- 2017
- Udgivet
Best laid plans of lions and men
Abrahamsen, Mikkel, Holm, Jacob, Rotenberg, E. & Wulff-Nilsen, Christian, 2017, 33rd International Symposium on Computational Geometry (SoCG 2017). Aronov, B. & Katz, M. J. (red.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16 s. 6. (Leibniz International Proceedings in Informatics, Bind 77).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
Minor-free graphs have light spanners
Borradaile, G., Le, H. & Wulff-Nilsen, Christian, 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, s. 767-778 12 s.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time
Borradaile, G., Klein, P. N., Mozes, S., Nussbaum, Y. & Wulff-Nilsen, Christian, 2017, I: SIAM Journal on Computing. 46, 4, s. 1280-1303 24 s.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › fagfællebedømt
- Udgivet
Fast and Compact Exact Distance Oracle for Planar Grap
Cohen-Addad, V. P., Dahlgaard, S. & Wulff-Nilsen, Christian, 2017, 2017 IEEE 58th Annual IEEE Symposium on Foundations of Computer Science (FOcS). IEEE, s. 962-973Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time
Nanongkai, D., Saranurak, T. & Wulff-Nilsen, Christian, 2017, 2017 IEEE 58th Annual IEEE Symposium on Foundations of Computer Science (FOcS). IEEE, s. 950-961Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
Fully-dynamic minimum spanning forest with improved worst-case update time
Wulff-Nilsen, Christian, 2017, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, s. 1130-1143 14 s.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
ID: 40450735
Flest downloads
-
1972
downloads
Wiener Index, Diameter, and Stretch Factor of a Weighted Planar Graph in Subquadratic Time
Publikation: Working paper › Forskning
Udgivet -
1572
downloads
Sum of All-Pairs Shortest Path Distances in a Planar Graph in Subquadratic Time
Publikation: Working paper › Forskning
Udgivet -
766
downloads
Computing the Maximum Detour of a Plane Graph in Subquadratic Time
Publikation: Working paper › Forskning
Udgivet