Christian Wulff-Nilsen
Associate Professor
Algorithms and Complexity
Universitetsparken 1, 2100 København Ø
- 2016
- Published
Faster deterministic fully-dynamic graph connectivity
Wulff-Nilsen, Christian, 2016, Encyclopedia of algorithms. Kao, M-Y. (ed.). Springer, p. 738-741 4 p.Research output: Chapter in Book/Report/Conference proceeding › Encyclopedia chapter › Research › peer-review
- Published
Near optimal adjacency labeling schemes for power-law graphs
Petersen, C., Rotbart, N. G., Simonsen, Jakob Grue & Wulff-Nilsen, Christian, 2016, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y. & Sangiorgi, D. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 15 p. 133. (Leibniz International Proceedings in Informatics, Vol. 55).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
Near-optimal light spanners
Chechik, S. & Wulff-Nilsen, Christian, 2016, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, p. 883-892 10 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
Space-efficient path-reporting approximate distance oracles
Elkin, M., Neiman, O. & Wulff-Nilsen, Christian, 2016, In: Theoretical Computer Science. 651, p. 1-10 10 p.Research output: Contribution to journal › Journal article › Research › peer-review
- 2015
- 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
- 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
- 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
- 2014
- Published
Approximate distance oracles with improved query time
Wulff-Nilsen, Christian, 2014, Encyclopedia of Algorithms. Kao, M-Y. (ed.). Springer, p. 1-4 4 p.Research output: Chapter in Book/Report/Conference proceeding › Encyclopedia chapter › Research › peer-review
- Published
Faster separators for shallow minor-free graphs via dynamic approximate distance oracles
Wulff-Nilsen, Christian, 2014, Automata, languages, and programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I. Esparza, J., Fraigniaud, P., Husfeldt, T. & Koutsoupias, E. (eds.). Springer, p. 1063-1074 12 p. (Lecture notes in computer science, Vol. 8572).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- 2013
- 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
-
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