Christian Wulff-Nilsen

Christian Wulff-Nilsen

Associate Professor, Guest Researcher

ORCID: 0000-0002-3699-7821

Publication year:
All
1 - 6 out of 6Page size: 10
  1. 2010
  2. Published

    Algorithms for Planar Graphs and Graphs in Metric Spaces

    Wulff-Nilsen, Christian, 2010, Museum Tusculanum. 230 p.

    Research output: Book/Report › Ph.D. thesis › Research

  3. Published

    Bounding the expected number of rectilinear full Steiner trees

    Wulff-Nilsen, Christian, 2010, In: Networks. 56, 1, p. 1-10 10 p.

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

  4. Published

    Computing the dilation of edge-augmented graphs in metric spaces

    Wulff-Nilsen, Christian, 2010, In: Computational Geometry. 43, 2, p. 68-72 5 p.

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

  5. Published

    Min st-cut oracle for planar graphs with near-linear preprocessing time

    Borradaile, G., Sankowski, P. & Wulff-Nilsen, Christian, 2010, 2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE, p. 601-610 10 p.

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

  6. Published

    Shortest paths in planar graphs with real lengths in O(nlog2n/loglogn) time

    Mozes, S. & Wulff-Nilsen, Christian, 2010, Algorithms – ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II. de Berg, M. & Meyer, U. (eds.). Springer, Vol. Part II. p. 206-217 12 p.

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

  7. Published

    Solving the replacement paths problem for planar directed graphs in O(n logn) time

    Wulff-Nilsen, Christian, 2010, Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms. Charikar, M. (ed.). Society for Industrial and Applied Mathematics, p. 756-765 10 p.

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

ID: 40450735