Christian Wulff-Nilsen

Christian Wulff-Nilsen

Associate Professor, Guest Researcher

ORCID: 0000-0002-3699-7821

Publication year:
All
41 - 50 out of 67Page size: 10
  1. 2013
  2. Published

    Faster deterministic fully-dynamic graph connectivity

    Wulff-Nilsen, Christian, 2013, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Khanna, S. (ed.). Association for Computing Machinery, p. 1757-1769 13 p.

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

  3. 2012

  4. Approximate distance oracles with improved preprocessing time

    Wulff-Nilsen, Christian, 2012, Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, p. 202-208 7 p.

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

  5. Published

    Computing the stretch factor and maximum detour of paths, trees, and cycles in the normed space

    Wulff-Nilsen, Christian, Grüne, A., Klein, R., Langetepe, E., Lee, D. T., Lin, T. C., Poon, S. H. & Yu, T. K., 2012, In: International Journal of Computational Geometry and Applications. 22, 1, p. 45-60 16 p.

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

  6. Connectivity Oracles for Planar Graphs

    Borradaile, G., Pettie, S. & Wulff-Nilsen, Christian, 2012, Algorithm Theory – SWAT 2012 : 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings. Fomin, F. V. & Kaski, P. (eds.). Springer, p. 316-327 12 p. (Lecture notes in computer science, Vol. 7357).

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

  7. Published

    Single source - all sinks max flows in planar digraphs

    Lacki, J., Nussbaum, Y., Sankowski, P. & Wulff-Nilsen, Christian, 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, p. 599-608 10 p.

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

  8. 2011

  9. Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications

    Wulff-Nilsen, Christian, 2011, Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on. IEEE Computer Society Press, p. 37-46 10 p.

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

  10. 2010
  11. 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

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

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

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

Previous 1 2 3 4 5 6 7 Next

ID: 40450735