Christian Wulff-Nilsen

Christian Wulff-Nilsen

Associate Professor, Guest Researcher

ORCID: 0000-0002-3699-7821

Publication year:
All
1 - 8 out of 8Page size: 10
  1. 2016
  2. Published

    All-pairs minimum cuts in near-linear time for surface-embedded graphs

    Borradaile, G., Eppstein, D., Nayyeri, A. & Wulff-Nilsen, Christian, 2016, 32nd International Symposium on Computational Geometry (SoCG 2016). Fekete, S. & Lubiw, A. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16 p. (Leibniz International Proceedings in Informatics, Vol. 51).

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

  3. Published

    Approximate distance oracles for planar graphs with improved query time-space tradeoff

    Wulff-Nilsen, Christian, 2016, 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016. Krauthgamer, R. (ed.). Association for Computing Machinery, p. 351-362 12 p.

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

  4. Published

    Approximate distance oracles with improved query time

    Wulff-Nilsen, Christian, 2016, Encyclopedia of algorithms. Kao, M-Y. (ed.). Springer, p. 94-97 4 p.

    Research output: Chapter in Book/Report/Conference proceeding › Encyclopedia chapter › Research › peer-review

  5. Published

    Brief announcement: labeling schemes for power-law graphs

    Petersen, C., Rotbart, N. G., Simonsen, Jakob Grue & Wulff-Nilsen, Christian, 2016, Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, p. 39-41 3 p.

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

  6. Published

    Faster deterministic fully-dynamic graph connectivity

    Wulff-Nilsen, Christian, 2016, Encyclopedia of algorithms. Kao, M-Y. (ed.). Springer, p. 738-741 4 p.

    Research output: Chapter in Book/Report/Conference proceeding › Encyclopedia chapter › Research › peer-review

  7. Published

    Near optimal adjacency labeling schemes for power-law graphs

    Petersen, C., Rotbart, N. G., Simonsen, Jakob Grue & Wulff-Nilsen, Christian, 2016, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y. & Sangiorgi, D. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 15 p. 133. (Leibniz International Proceedings in Informatics, Vol. 55).

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

  8. Published

    Near-optimal light spanners

    Chechik, S. & Wulff-Nilsen, Christian, 2016, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, p. 883-892 10 p.

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

  9. Published

    Space-efficient path-reporting approximate distance oracles

    Elkin, M., Neiman, O. & Wulff-Nilsen, Christian, 2016, In: Theoretical Computer Science. 651, p. 1-10 10 p.

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

ID: 40450735