Christian Wulff-Nilsen

Christian Wulff-Nilsen

Associate Professor, Guest Researcher

ORCID: 0000-0002-3699-7821

Publication year:
All
21 - 30 out of 67Page size: 10
  1. 2017
  2. Published

    Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time

    Nanongkai, D., Saranurak, T. & Wulff-Nilsen, Christian, 2017, 2017 IEEE 58th Annual IEEE Symposium on Foundations of Computer Science (FOcS). IEEE, p. 950-961

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

  3. Published

    Fast and Compact Exact Distance Oracle for Planar Grap

    Cohen-Addad, V. P., Dahlgaard, S. & Wulff-Nilsen, Christian, 2017, 2017 IEEE 58th Annual IEEE Symposium on Foundations of Computer Science (FOcS). IEEE, p. 962-973

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

  4. Published

    Fully-dynamic minimum spanning forest with improved worst-case update time

    Wulff-Nilsen, Christian, 2017, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, p. 1130-1143 14 p.

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

  5. Published

    Minor-free graphs have light spanners

    Borradaile, G., Le, H. & Wulff-Nilsen, Christian, 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, p. 767-778 12 p.

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

  6. Published

    Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time

    Borradaile, G., Klein, P. N., Mozes, S., Nussbaum, Y. & Wulff-Nilsen, Christian, 2017, In: SIAM Journal on Computing. 46, 4, p. 1280-1303 24 p.

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

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

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

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

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

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

Previous 1 2 3 4 5 6 7 Next

ID: 40450735