Christian Wulff-Nilsen
Associate Professor, Guest Researcher
Algorithms and Complexity
Universitetsparken 1, 2100 København Ø
Department of Computer Science
Universitetsparken 1
2100 København Ø
ORCID: 0000-0002-3699-7821
1 - 1 out of 1Page size: 10
- 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, p. 37-46 10 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
ID: 40450735
Most downloads
-
1976
downloads
Wiener Index, Diameter, and Stretch Factor of a Weighted Planar Graph in Subquadratic Time
Research output: Working paper › Research
Published -
1574
downloads
Sum of All-Pairs Shortest Path Distances in a Planar Graph in Subquadratic Time
Research output: Working paper › Research
Published -
771
downloads
Computing the Maximum Detour of a Plane Graph in Subquadratic Time
Research output: Working paper › Research
Published