Christian Wulff-Nilsen

Christian Wulff-Nilsen

Associate Professor, Guest Researcher

Algorithms and Complexity
Universitetsparken 1, 2100 København Ø
- koolooz@di.ku.dk
- https://di.ku.dk/english/research/ac/
Phone: +4535335695Mobile: +4560833456
Department of Computer Science
Universitetsparken 1
2100 København Ø
- koolooz@di.ku.dk
Phone: +4535335695Mobile: +4560833456

ORCID: 0000-0002-3699-7821

All
Research

Publication year:

All

1 - 1 out of 1Page size: 10

Sort by: Publication date

2018
Published
Better tradeoffs for exact distance oracles in planar graphs
Gawrychowski, P., Mozes, S., Weimann, O. & Wulff-Nilsen, Christian, 2018, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms . Czumaj, A. (ed.). Society for Industrial and Applied Mathematics, p. 515-529
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

ID: 40450735

Most downloads

1976 downloads
Wiener Index, Diameter, and Stretch Factor of a Weighted Planar Graph in Subquadratic Time
Research output: Working paper › Research
Published
1574 downloads
Sum of All-Pairs Shortest Path Distances in a Planar Graph in Subquadratic Time
Research output: Working paper › Research
Published
771 downloads
Computing the Maximum Detour of a Plane Graph in Subquadratic Time
Research output: Working paper › Research
Published