Christian Wulff-Nilsen
Lektor, Gæsteforsker
Algorithms and Complexity
Universitetsparken 1, 2100 København Ø
Datalogisk Institut
Universitetsparken 1
2100 København Ø
- Udgivet
Approximate distance oracles with improved query time
Wulff-Nilsen, Christian, 2014, Encyclopedia of Algorithms. Kao, M-Y. (red.). Springer, s. 1-4 4 s.Publikation: Bidrag til bog/antologi/rapport › Encyclopædiartikel › Forskning › fagfællebedømt
- Udgivet
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. (red.). Association for Computing Machinery, s. 351-362 12 s.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
Approximate distance oracles with improved query time
Wulff-Nilsen, Christian, 2016, Encyclopedia of algorithms. Kao, M-Y. (red.). Springer, s. 94-97 4 s.Publikation: Bidrag til bog/antologi/rapport › Encyclopædiartikel › Forskning › fagfællebedømt
- Udgivet
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. (red.). Springer, s. 1063-1074 12 s. (Lecture notes in computer science, Bind 8572).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
Girth of a Planar Digraph with Real Edge Weights in O(nlog3n) Time.
Wulff-Nilsen, Christian, 2009, s. 1-8, 8 s.Publikation: Working paper › Forskning
- Udgivet
Wiener index and Diameter of a Planar Graph in Subquadratic Time
Wulff-Nilsen, Christian, 2009, Proceedings of the 25th European Workshop on Computational Geometry (EuroGC´09). s. 25-28 4 s.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
Computing the Stretch Factor of Paths, Trees, and Cycles in Weighted Fixed Orientation Metrics
Wulff-Nilsen, Christian, 2008, Proceedings of the 20th Annual Canadian Conference on Computational Geometry - CCCG 2008: August 13-15, McGill University, Montréal, Québec, Canada. CCCG - Canadian Conference on Computational Geometry, Ottawa, Ontario, Canada, s. 59-62 4 s.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
Bounding the expected number of rectilinear full Steiner trees
Wulff-Nilsen, Christian, 2010, I: Networks. 56, 1, s. 1-10 10 s.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
- Udgivet
Solving the Replacement Paths Problem for Planar Directed Graphs in O(nlog n) Time
Wulff-Nilsen, Christian, 2009, København: Datalogisk Institut, s. 1-21, 21 s.Publikation: Working paper › Forskning
- Udgivet
Algorithms for Planar Graphs and Graphs in Metric Spaces
Wulff-Nilsen, Christian, 2010, Museum Tusculanum. 230 s.Publikation: Bog/antologi/afhandling/rapport › Ph.d.-afhandling › Forskning
ID: 40450735
Flest downloads
-
1976
downloads
Wiener Index, Diameter, and Stretch Factor of a Weighted Planar Graph in Subquadratic Time
Publikation: Working paper › Forskning
Udgivet -
1574
downloads
Sum of All-Pairs Shortest Path Distances in a Planar Graph in Subquadratic Time
Publikation: Working paper › Forskning
Udgivet -
771
downloads
Computing the Maximum Detour of a Plane Graph in Subquadratic Time
Publikation: Working paper › Forskning
Udgivet