Christian Wulff-Nilsen
Associate Professor
Algorithms and Complexity
Universitetsparken 1, 2100 København Ø
- 2013
Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time
Wulff-Nilsen, Christian, 2013, In: Computational Geometry. 46, 7, p. 831-838 8 p.Research output: Contribution to journal › Journal article › Research › peer-review
- 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
- 2012
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
- 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
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
- 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
- 2011
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
- 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
ID: 40450735
Most downloads
-
2000
downloads
Wiener Index, Diameter, and Stretch Factor of a Weighted Planar Graph in Subquadratic Time
Research output: Working paper › Research
Published -
1592
downloads
Sum of All-Pairs Shortest Path Distances in a Planar Graph in Subquadratic Time
Research output: Working paper › Research
Published -
794
downloads
Computing the Maximum Detour of a Plane Graph in Subquadratic Time
Research output: Working paper › Research
Published