Christian Wulff-Nilsen
Associate Professor, Guest Researcher
Algorithms and Complexity
Universitetsparken 1, 2100 København ÃÂ
Department of Computer Science
Universitetsparken 1
2100 København Ø
- Published
A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs
Das, D., Gutenberg, M. P. & Wulff-Nilsen, Christian, 2022, ACM-SIAM Symposium on Discrete Algorithms, SODA 2022. Association for Computing Machinery, Inc., p. 3482-3495Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs
Das, D., Kipouridis, Evangelos, Gutenberg, M. P. & Wulff-Nilsen, Christian, 2022, Proceedings, Symposium on Simplicity in Algorithms (SOSA). SIAM, p. 1-11Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
A linear bound on the expected number of rectilinear full Steiner tree components spanning a fixed number of terminals.
Wulff-Nilsen, Christian, 2007, Collection of abstracts of the 23rd European workshop on computational geometry: Technische Universität Graz, Austria, March 19-20, 2007. Aichholzer, O. & Hackl, T. (eds.). Verlag der Technische Universität Graz, p. 158-161 4 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
A novel approach to phylogenetic trees: d-dimensional geometric Steiner trees
Brazil, M., Thomas, D. A., Nielsen, B. K., Winter, Pawel, Wulff-Nilsen, Christian & Zachariasen, M., 2009, In: Networks (New York). 53, 2, p. 104-111Research output: Contribution to journal › Journal article › peer-review
- 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
- 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
- Published
Almost Optimal Exact Distance Oracles for Planar Graphs
Charalampopoulos, P., Gawrychowski, P., Long, Y., Mozes, S., Pettie, S., Weimann, O. & Wulff-Nilsen, Christian, 2023, In: Journal of the ACM. 70, 2, 50 p., 12.Research output: Contribution to journal › Journal article › peer-review
- 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
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
Approximate distance oracles with improved query time
Wulff-Nilsen, Christian, 2013, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Khanna, S. (ed.). Association for Computing Machinery, p. 539-549 11 p. (The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
ID: 40450735
Most downloads
-
1972
downloads
Wiener Index, Diameter, and Stretch Factor of a Weighted Planar Graph in Subquadratic Time
Research output: Working paper › Research
Published -
1572
downloads
Sum of All-Pairs Shortest Path Distances in a Planar Graph in Subquadratic Time
Research output: Working paper › Research
Published -
766
downloads
Computing the Maximum Detour of a Plane Graph in Subquadratic Time
Research output: Working paper › Research
Published