Christian Wulff-Nilsen

Christian Wulff-Nilsen

Associate Professor

ORCID: 0000-0002-3699-7821

Publication year:
All
1 - 5 out of 5Page size: 10
  1. 2022
  2. 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-112

    Research output: Contribution to journal › Journal article › Research › peer-review

  3. Published

    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., p. 3482-3495

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  4. Published

    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, p. 1-11

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  5. 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

  6. Published

    Optimal Approximate Distance Oracle for Planar Graphs

    Le, H. & Wulff-Nilsen, Christian, 2022, p. 1-61.

    Research output: Contribution to conference › Paper › Research

ID: 40450735