Christian Wulff-Nilsen
Lektor, Gæsteforsker
Algorithms and Complexity
Universitetsparken 1, 2100 København Ø
Datalogisk Institut
Universitetsparken 1
2100 København Ø
- 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
- Udgivet
Optimal Approximate Distance Oracle for Planar Graphs
Le, H. & Wulff-Nilsen, Christian, 2022, s. 1-61.Publikation: Konferencebidrag › Paper › Forskning
- 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
Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time
Nanongkai, D., Saranurak, T. & Wulff-Nilsen, Christian, 2017, 2017 IEEE 58th Annual IEEE Symposium on Foundations of Computer Science (FOcS). IEEE, s. 950-961Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
Brief announcement: labeling schemes for power-law graphs
Petersen, C., Rotbart, N. G., Simonsen, Jakob Grue & Wulff-Nilsen, Christian, 2016, Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, s. 39-41 3 s.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
Near-optimal adjacency labeling scheme for power-law graphs
Petersen, C., Rotbart, N. G., Simonsen, Jakob Grue & Wulff-Nilsen, Christian, 2015, I: arXiv.org: Computer science. arXiv:1502.03971, 18 s.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning
- Udgivet
Near optimal adjacency labeling schemes for power-law graphs
Petersen, C., Rotbart, N. G., Simonsen, Jakob Grue & Wulff-Nilsen, Christian, 2016, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y. & Sangiorgi, D. (red.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 15 s. 133. (Leibniz International Proceedings in Informatics, Bind 55).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
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
- 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
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
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