Christian Wulff-Nilsen

Christian Wulff-Nilsen

Associate Professor, Guest Researcher


  1. 2021
  2. Published

    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. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 12 p. 25. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 212).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  3. 2020
  4. Published

    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. (ed.). Association for Computing Machinery, p. 2542-2561

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  5. Published

    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. (ed.). Association for Computing Machinery, p. 2522-2541

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  6. 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-896

    Research output: Contribution to journalJournal articlepeer-review

  7. Published

    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. (ed.). Association for Computing Machinery, p. 2562-2574

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  8. 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 9317923

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  9. 2019
  10. 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 proceedingArticle in proceedingsResearchpeer-review

  11. 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 proceedingArticle in proceedingsResearchpeer-review

  12. 2018
  13. Published

    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. (ed.). Society for Industrial and Applied Mathematics, p. 515-529

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

  14. 2017
  15. 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 proceedingArticle in proceedingsResearchpeer-review

ID: 40450735