Christian Wulff-Nilsen
Lektor, Gæsteforsker
Algorithms and Complexity
Universitetsparken 1, 2100 København ÃÂ
Datalogisk Institut
Universitetsparken 1
2100 København Ø
- 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 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
- Udgivet
Solving the replacement paths problem for planar directed graphs in O(n logn) time
Wulff-Nilsen, Christian, 2010, Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms. Charikar, M. (red.). Society for Industrial and Applied Mathematics, s. 756-765 10 s.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time
Wulff-Nilsen, Christian, 2013, I: Computational Geometry. 46, 7, s. 831-838 8 s.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
- Udgivet
Faster deterministic fully-dynamic graph connectivity
Wulff-Nilsen, Christian, 2016, Encyclopedia of algorithms. Kao, M-Y. (red.). Springer, s. 738-741 4 s.Publikation: Bidrag til bog/antologi/rapport › Encyclopædiartikel › Forskning › fagfællebedømt
- Udgivet
Computing the dilation of edge-augmented graphs in metric spaces
Wulff-Nilsen, Christian, 2010, I: Computational Geometry. 43, 2, s. 68-72 5 s.Publikation: Bidrag til tidsskrift › Konferenceartikel › Forskning › fagfællebedømt
- 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
- 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
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 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
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