Christian Wulff-Nilsen

Christian Wulff-Nilsen

Associate Professor, Guest Researcher

ORCID: 0000-0002-3699-7821

Publication year:
All
1 - 10 out of 67Page size: 10
  1. 2023
  2. Published

    Almost Optimal Exact Distance Oracles for Planar Graphs

    Charalampopoulos, P., Gawrychowski, P., Long, Y., Mozes, S., Pettie, S., Weimann, O. & Wulff-Nilsen, Christian, 2023, In: Journal of the ACM. 70, 2, 50 p., 12.

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

  3. 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-155

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

  4. Published

    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. (eds.). Society for Industrial and Applied Mathematics, p. 70-86

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

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

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

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

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

  10. Published

    Optimal Approximate Distance Oracle for Planar Graphs

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

    Research output: Contribution to conference › Paper › Research

  11. 2021
  12. Published

    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. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-20 64. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 198).

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

  13. Published

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

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

Previous 1 2 3 4 5 6 7 Next

ID: 40450735