Christian Wulff-Nilsen
Lektor, Gæsteforsker
Algorithms and Complexity
Universitetsparken 1, 2100 København Ø
Datalogisk Institut
Universitetsparken 1
2100 København Ø
- 2007
- Udgivet
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. (red.). Verlag der Technische Universität Graz, s. 158-161 4 s.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- 2008
- Udgivet
Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces
Wulff-Nilsen, Christian & Luo, J., 2008, Algorithms and Computation: 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008, Proceedings. Hong, S-H., Nagamochi, H. & Fukunaga, T. (red.). Springer, s. 764-775 12 s. (Lecture notes in computer science; Nr. 5369).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
Computing the Dilation of Edge-Augmented Graphs Embedded in Metric Spaces
Wulff-Nilsen, Christian, 2008, Collection of Abstracts of the 24th European Workshop on Computational Geometry: EuroCG, LORIA, Nancy, France, March 18-20, 2008. Petitjean, S. (red.). LORIA, Nancy, France, s. 123-126 4 s.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
Computing the Maximum Detour of a Plane Graph in Subquadratic Time
Wulff-Nilsen, Christian, 2008, Algorithms and Computation: 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008, Proceedings. Hong, S-H., Nagamochi, H. & Fukunaga, T. (red.). Springer, s. 740-751 12 s. (Lecture notes in computer science; Nr. 5369).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
Computing the Maximum Detour of a Plane Graph in Subquadratic Time
Wulff-Nilsen, Christian, 2008, København: Department of Computer Science, University of Copenhagen, 25 s.Publikation: Working paper › Forskning
- 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
Steiner hull algorithm for the uniform orientation metrics
Wulff-Nilsen, Christian, 2008, I: Computational Geometry. 40, 1, s. 1-13 13 s.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
- Udgivet
Sum of All-Pairs Shortest Path Distances in a Planar Graph in Subquadratic Time
Wulff-Nilsen, Christian, 2008, DIKU, s. 1-10, 10 s.Publikation: Working paper › Forskning
- Udgivet
Wiener Index, Diameter, and Stretch Factor of a Weighted Planar Graph in Subquadratic Time
Wulff-Nilsen, Christian, 2008, København: Department of Computer Science, University of Copenhagen, 30 s.Publikation: Working paper › Forskning
- 2009
- Udgivet
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, I: Networks (New York). 53, 2, s. 104-111Publikation: 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