Christian Wulff-Nilsen
Associate Professor
Algorithms and Complexity
Universitetsparken 1, 2100 København Ø
ORCID: 0000-0002-3699-7821
1 - 6 out of 6Page size: 10
- 2010
- 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
- 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
- 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
- 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
- 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
- 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
Most downloads
-
1978
downloads
Wiener Index, Diameter, and Stretch Factor of a Weighted Planar Graph in Subquadratic Time
Research output: Working paper › Research
Published -
1575
downloads
Sum of All-Pairs Shortest Path Distances in a Planar Graph in Subquadratic Time
Research output: Working paper › Research
Published -
773
downloads
Computing the Maximum Detour of a Plane Graph in Subquadratic Time
Research output: Working paper › Research
Published