Christian Wulff-Nilsen
Associate Professor, Guest Researcher
Algorithms and Complexity
Universitetsparken 1, 2100 København Ø
Department of Computer Science
Universitetsparken 1
2100 København Ø
- Published
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. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16 p. 6. (Leibniz International Proceedings in Informatics, Vol. 77).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
Escaping an Infinitude of Lions
Abrahamsen, Mikkel, Holm, Jacob, Rotenberg, E. & Wulff-Nilsen, Christian, 2020, In: The American Mathematical Monthly. 127, 10, p. 880-896Research output: Contribution to journal › Journal article › Research › peer-review
- Published
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. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 15 p. 4. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 144).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
Constructing light spanners deterministically in near-linear time
Alstrup, Stephen, Dahlgaard, S., Filtser, A., Stöckel, M. & Wulff-Nilsen, Christian, 12 Mar 2022, In: Theoretical Computer Science. 907, p. 82-112Research output: Contribution to journal › Journal article › Research › peer-review
- Published
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. (eds.). Association for Computing Machinery, p. 365-376 12 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
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, p. 1112-1122 9317923Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time
Bernstein, A., Gutenberg, M. P. & Wulff-Nilsen, Christian, 2023, In: SIAM Journal on Computing. 52, 2, p. 128-155Research output: Contribution to journal › Journal article › Research › peer-review
- Published
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, p. 600-611 (Annual IEEE Symposium on Foundations of Computer Science).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
Min st-cut oracle for planar graphs with near-linear preprocessing time
Borradaile, G., Sankowski, P. & Wulff-Nilsen, Christian, 2015, In: A C M Transactions on Algorithms. 11, 3, p. 16:1-16:29 16.Research output: Contribution to journal › Journal article › Research › peer-review
- Published
All-pairs minimum cuts in near-linear time for surface-embedded graphs
Borradaile, G., Eppstein, D., Nayyeri, A. & Wulff-Nilsen, Christian, 2016, 32nd International Symposium on Computational Geometry (SoCG 2016). Fekete, S. & Lubiw, A. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16 p. (Leibniz International Proceedings in Informatics, Vol. 51).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
ID: 40450735
Most downloads
-
1976
downloads
Wiener Index, Diameter, and Stretch Factor of a Weighted Planar Graph in Subquadratic Time
Research output: Working paper › Research
Published -
1574
downloads
Sum of All-Pairs Shortest Path Distances in a Planar Graph in Subquadratic Time
Research output: Working paper › Research
Published -
771
downloads
Computing the Maximum Detour of a Plane Graph in Subquadratic Time
Research output: Working paper › Research
Published