Christian Wulff-Nilsen

Christian Wulff-Nilsen

Associate Professor, Guest Researcher

ORCID: 0000-0002-3699-7821

Publication year:
All
1 - 3 out of 3Page size: 10
  1. 2015
  2. Published

    Faster fully-dynamic minimum spanning forest

    Holm, J., Rotenberg, E. & Wulff-Nilsen, Christian, 2015, Algorithms - ESA 2015: 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings. Springer, p. 742-753 12 p. (Lecture notes in computer science, Vol. 9294).

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

  3. Published

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

    Borradaile, G., Sankowski, P. & Wulff-Nilsen, Christian, 2015, In: A C M Transactions on Algorithms. 11, 3, p. 16:1-16:29 16.

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

  4. Published

    Near-optimal adjacency labeling scheme for power-law graphs

    Petersen, C., Rotbart, N. G., Simonsen, Jakob Grue & Wulff-Nilsen, Christian, 2015, In: arXiv.org: Computer science. arXiv:1502.03971, 18 p.

    Research output: Contribution to journal › Journal article › Research

ID: 40450735