Christian Wulff-Nilsen
Lektor, Gæsteforsker
Algorithms and Complexity
Universitetsparken 1, 2100 København Ø
Datalogisk Institut
Universitetsparken 1
2100 København Ø
- 2013
- Udgivet
Faster deterministic fully-dynamic graph connectivity
Wulff-Nilsen, Christian, 2013, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Khanna, S. (red.). Association for Computing Machinery, s. 1757-1769 13 s.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- 2012
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. (red.). Springer, s. 316-327 12 s. (Lecture notes in computer science, Bind 7357).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
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, s. 599-608 10 s.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
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, s. 202-208 7 s.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
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, I: International Journal of Computational Geometry and Applications. 22, 1, s. 45-60 16 s.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
- 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, s. 37-46 10 s.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- 2010
- Udgivet
Min st-cut oracle for planar graphs with near-linear preprocessing time
Borradaile, G., Sankowski, P. & Wulff-Nilsen, Christian, 2010, 2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE, s. 601-610 10 s.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
Shortest paths in planar graphs with real lengths in O(nlog2n/loglogn) time
Mozes, S. & Wulff-Nilsen, Christian, 2010, Algorithms – ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II. de Berg, M. & Meyer, U. (red.). Springer, Bind Part II. s. 206-217 12 s.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- 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
- 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
ID: 40450735
Flest downloads
-
1974
downloads
Wiener Index, Diameter, and Stretch Factor of a Weighted Planar Graph in Subquadratic Time
Publikation: Working paper › Forskning
Udgivet -
1573
downloads
Sum of All-Pairs Shortest Path Distances in a Planar Graph in Subquadratic Time
Publikation: Working paper › Forskning
Udgivet -
770
downloads
Computing the Maximum Detour of a Plane Graph in Subquadratic Time
Publikation: Working paper › Forskning
Udgivet