Christian Wulff-Nilsen

Christian Wulff-Nilsen

Associate Professor, Guest Researcher

ORCID: 0000-0002-3699-7821

Publication year:
All
1 - 67 out of 67Page size: 100
  1. 2023
  2. Published

    Almost Optimal Exact Distance Oracles for Planar Graphs

    Charalampopoulos, P., Gawrychowski, P., Long, Y., Mozes, S., Pettie, S., Weimann, O. & Wulff-Nilsen, Christian, 2023, In: Journal of the ACM. 70, 2, 50 p., 12.

    Research output: Contribution to journal › Journal article › Research › peer-review

  3. Published

    Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time

    Bernstein, A., Gutenberg, M. P. & Wulff-Nilsen, Christian, 2023, In: SIAM Journal on Computing. 52, 2, p. 128-155

    Research output: Contribution to journal › Journal article › Research › peer-review

  4. Published

    Fully Dynamic Exact Edge Connectivity in Sublinear Time

    Goranci, G., Henzinger, M., Nanongkai, D., Saranurak, T., Thorup, Mikkel & Wulff-Nilsen, Christian, 2023, Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Bansal, N. & Nagarajan, V. (eds.). Society for Industrial and Applied Mathematics, p. 70-86

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  5. 2022
  6. Published

    Constructing light spanners deterministically in near-linear time

    Alstrup, Stephen, Dahlgaard, S., Filtser, A., Stöckel, M. & Wulff-Nilsen, Christian, 12 Mar 2022, In: Theoretical Computer Science. 907, p. 82-112

    Research output: Contribution to journal › Journal article › Research › peer-review

  7. Published

    A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs

    Das, D., Gutenberg, M. P. & Wulff-Nilsen, Christian, 2022, ACM-SIAM Symposium on Discrete Algorithms, SODA 2022. Association for Computing Machinery, Inc., p. 3482-3495

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  8. Published

    A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs

    Das, D., Kipouridis, Evangelos, Gutenberg, M. P. & Wulff-Nilsen, Christian, 2022, Proceedings, Symposium on Simplicity in Algorithms (SOSA). SIAM, p. 1-11

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  9. Published

    Negative-Weight Single-Source Shortest Paths in Near-linear Time

    Bernstein, A., Nanongkai, D. & Wulff-Nilsen, Christian, 2022, 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, p. 600-611 (Annual IEEE Symposium on Foundations of Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  10. Published

    Optimal Approximate Distance Oracle for Planar Graphs

    Le, H. & Wulff-Nilsen, Christian, 2022, p. 1-61.

    Research output: Contribution to conference › Paper › Research

  11. 2021
  12. Published

    Decremental APSP in unweighted digraphs versus an adaptive adversary

    Evald, J., Fredslund-Hansen, V., Gutenberg, M. P. & Wulff-Nilsen, Christian, 2021, 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021. Bansal, N., Merelli, E. & Worrell, J. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-20 64. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 198).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  13. Published

    Near-Optimal Distance Oracles for Vertex-Labeled Planar Graphs

    Evald, J., Fredslund-Hansen, V. & Wulff-Nilsen, Christian, 2021, 32nd International Symposium on Algorithms and Computation, ISAAC 2021. Ahn, H-K. & Sadakane, K. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 14 p. 23. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 212).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  14. Published

    Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs

    Fredslund-Hansen, V., Mozes, S. & Wulff-Nilsen, Christian, 2021, 32nd International Symposium on Algorithms and Computation, ISAAC 2021. Ahn, H-K. & Sadakane, K. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 12 p. 25. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 212).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  15. 2020
  16. Published

    Decremental SSSP in weighted digraphs: Faster and against an adaptive adversary

    Gutenberg, M. P. & Wulff-Nilsen, Christian, 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (ed.). Association for Computing Machinery, p. 2542-2561

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  17. Published

    Deterministic algorithms for decremental approximate shortest paths: Faster and Simpler

    Gutenberg, M. P. & Wulff-Nilsen, Christian, 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (ed.). Association for Computing Machinery, p. 2522-2541

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  18. Published

    Escaping an Infinitude of Lions

    Abrahamsen, Mikkel, Holm, Jacob, Rotenberg, E. & Wulff-Nilsen, Christian, 2020, In: The American Mathematical Monthly. 127, 10, p. 880-896

    Research output: Contribution to journal › Journal article › Research › peer-review

  19. Published

    Fully-dynamic all-pairs shortest paths: Improved worst-case time and space bounds

    Gutenberg, M. P. & Wulff-Nilsen, Christian, 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (ed.). Association for Computing Machinery, p. 2562-2574

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  20. Published

    Near-optimal decremental sssp in dense weighted digraphs

    Bernstein, A., Gutenberg, M. P. & Wulff-Nilsen, Christian, 2020, Proceedings - 2020 IEEE 61st Annual Symposium on Foundations of Computer Science, FOCS 2020. IEEE, p. 1112-1122 9317923

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  21. 2019
  22. Published

    Constructing light spanners deterministically in near-linear time

    Alstrup, Stephen, Dahlgaard, S., Filtser, A., Stöckel, M. & Wulff-Nilsen, Christian, 2019, 27th Annual European Symposium on Algorithms, ESA 2019. Bender, M. A., Svensson, O. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 15 p. 4. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 144).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  23. Published

    Decremental strongly-connected components and single-source reachability in near-linear time

    Bernstein, A., Probst, M. & Wulff-Nilsen, Christian, 2019, STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Charikar, M. & Cohen, E. (eds.). Association for Computing Machinery, p. 365-376 12 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  24. 2018
  25. Published

    Better tradeoffs for exact distance oracles in planar graphs

    Gawrychowski, P., Mozes, S., Weimann, O. & Wulff-Nilsen, Christian, 2018, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms . Czumaj, A. (ed.). Society for Industrial and Applied Mathematics, p. 515-529

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  26. 2017
  27. Published

    Best laid plans of lions and men

    Abrahamsen, Mikkel, Holm, Jacob, Rotenberg, E. & Wulff-Nilsen, Christian, 2017, 33rd International Symposium on Computational Geometry (SoCG 2017). Aronov, B. & Katz, M. J. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16 p. 6. (Leibniz International Proceedings in Informatics, Vol. 77).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  28. Published

    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, p. 950-961

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  29. Published

    Fast and Compact Exact Distance Oracle for Planar Grap

    Cohen-Addad, V. P., Dahlgaard, S. & Wulff-Nilsen, Christian, 2017, 2017 IEEE 58th Annual IEEE Symposium on Foundations of Computer Science (FOcS). IEEE, p. 962-973

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  30. Published

    Fully-dynamic minimum spanning forest with improved worst-case update time

    Wulff-Nilsen, Christian, 2017, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, p. 1130-1143 14 p.

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  31. Published

    Minor-free graphs have light spanners

    Borradaile, G., Le, H. & Wulff-Nilsen, Christian, 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, p. 767-778 12 p.

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  32. Published

    Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time

    Borradaile, G., Klein, P. N., Mozes, S., Nussbaum, Y. & Wulff-Nilsen, Christian, 2017, In: SIAM Journal on Computing. 46, 4, p. 1280-1303 24 p.

    Research output: Contribution to journal › Journal article › Research › peer-review

  33. 2016
  34. Published

    All-pairs minimum cuts in near-linear time for surface-embedded graphs

    Borradaile, G., Eppstein, D., Nayyeri, A. & Wulff-Nilsen, Christian, 2016, 32nd International Symposium on Computational Geometry (SoCG 2016). Fekete, S. & Lubiw, A. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16 p. (Leibniz International Proceedings in Informatics, Vol. 51).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  35. Published

    Approximate distance oracles for planar graphs with improved query time-space tradeoff

    Wulff-Nilsen, Christian, 2016, 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016. Krauthgamer, R. (ed.). Association for Computing Machinery, p. 351-362 12 p.

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  36. Published

    Approximate distance oracles with improved query time

    Wulff-Nilsen, Christian, 2016, Encyclopedia of algorithms. Kao, M-Y. (ed.). Springer, p. 94-97 4 p.

    Research output: Chapter in Book/Report/Conference proceeding › Encyclopedia chapter › Research › peer-review

  37. Published

    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, p. 39-41 3 p.

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  38. Published

    Faster deterministic fully-dynamic graph connectivity

    Wulff-Nilsen, Christian, 2016, Encyclopedia of algorithms. Kao, M-Y. (ed.). Springer, p. 738-741 4 p.

    Research output: Chapter in Book/Report/Conference proceeding › Encyclopedia chapter › Research › peer-review

  39. Published

    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. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 15 p. 133. (Leibniz International Proceedings in Informatics, Vol. 55).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  40. Published

    Near-optimal light spanners

    Chechik, S. & Wulff-Nilsen, Christian, 2016, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, p. 883-892 10 p.

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  41. Published

    Space-efficient path-reporting approximate distance oracles

    Elkin, M., Neiman, O. & Wulff-Nilsen, Christian, 2016, In: Theoretical Computer Science. 651, p. 1-10 10 p.

    Research output: Contribution to journal › Journal article › Research › peer-review

  42. 2015
  43. Published

    Faster fully-dynamic minimum spanning forest

    Holm, J., Rotenberg, E. & Wulff-Nilsen, Christian, 2015, Algorithms - ESA 2015: 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings. Springer, p. 742-753 12 p. (Lecture notes in computer science, Vol. 9294).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  44. Published

    Min st-cut oracle for planar graphs with near-linear preprocessing time

    Borradaile, G., Sankowski, P. & Wulff-Nilsen, Christian, 2015, In: A C M Transactions on Algorithms. 11, 3, p. 16:1-16:29 16.

    Research output: Contribution to journal › Journal article › Research › peer-review

  45. Published

    Near-optimal adjacency labeling scheme for power-law graphs

    Petersen, C., Rotbart, N. G., Simonsen, Jakob Grue & Wulff-Nilsen, Christian, 2015, In: arXiv.org: Computer science. arXiv:1502.03971, 18 p.

    Research output: Contribution to journal › Journal article › Research

  46. 2014
  47. Published

    Approximate distance oracles with improved query time

    Wulff-Nilsen, Christian, 2014, Encyclopedia of Algorithms. Kao, M-Y. (ed.). Springer, p. 1-4 4 p.

    Research output: Chapter in Book/Report/Conference proceeding › Encyclopedia chapter › Research › peer-review

  48. Published

    Faster separators for shallow minor-free graphs via dynamic approximate distance oracles

    Wulff-Nilsen, Christian, 2014, Automata, languages, and programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I. Esparza, J., Fraigniaud, P., Husfeldt, T. & Koutsoupias, E. (eds.). Springer, p. 1063-1074 12 p. (Lecture notes in computer science, Vol. 8572).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  49. 2013
  50. Published

    Approximate distance oracles with improved query time

    Wulff-Nilsen, Christian, 2013, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Khanna, S. (ed.). Association for Computing Machinery, p. 539-549 11 p. (The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  51. Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time

    Wulff-Nilsen, Christian, 2013, In: Computational Geometry. 46, 7, p. 831-838 8 p.

    Research output: Contribution to journal › Journal article › Research › peer-review

  52. Published

    Faster deterministic fully-dynamic graph connectivity

    Wulff-Nilsen, Christian, 2013, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Khanna, S. (ed.). Association for Computing Machinery, p. 1757-1769 13 p.

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  53. 2012

  54. 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, p. 202-208 7 p.

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  55. Published

    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, In: International Journal of Computational Geometry and Applications. 22, 1, p. 45-60 16 p.

    Research output: Contribution to journal › Journal article › Research › peer-review

  56. 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. (eds.). Springer, p. 316-327 12 p. (Lecture notes in computer science, Vol. 7357).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  57. Published

    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, p. 599-608 10 p.

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  58. 2011

  59. 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

  60. 2010
  61. Published

    Algorithms for Planar Graphs and Graphs in Metric Spaces

    Wulff-Nilsen, Christian, 2010, Museum Tusculanum. 230 p.

    Research output: Book/Report › Ph.D. thesis › Research

  62. Published

    Bounding the expected number of rectilinear full Steiner trees

    Wulff-Nilsen, Christian, 2010, In: Networks. 56, 1, p. 1-10 10 p.

    Research output: Contribution to journal › Journal article › Research › peer-review

  63. Published

    Computing the dilation of edge-augmented graphs in metric spaces

    Wulff-Nilsen, Christian, 2010, In: Computational Geometry. 43, 2, p. 68-72 5 p.

    Research output: Contribution to journal › Conference article › Research › peer-review

  64. Published

    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, p. 601-610 10 p.

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  65. Published

    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. (eds.). Springer, Vol. Part II. p. 206-217 12 p.

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  66. Published

    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. (ed.). Society for Industrial and Applied Mathematics, p. 756-765 10 p.

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  67. 2009
  68. Published

    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, In: Networks (New York). 53, 2, p. 104-111

    Research output: Contribution to journal › Journal article › Research › peer-review

  69. Published

    Girth of a Planar Digraph with Real Edge Weights in O(nlog3n) Time.

    Wulff-Nilsen, Christian, 2009, p. 1-8, 8 p.

    Research output: Working paper › Research

  70. Published

    Korteste Veje i Planare Grafer med Reelle Kantvægte i O(n(log n)^2/loglog n) Tid

    Wulff-Nilsen, Christian, 2009, Datalogisk Institut, Københavns Universitet (DIKU), 15 p.

    Research output: Working paper › Research

  71. Published

    Minimum Cycle Basis and All-Pairs Min Cut of a Planar Graph in Subquadratic Time.

    Wulff-Nilsen, Christian, 2009, p. 1-47, 47 p.

    Research output: Working paper › Research

  72. Published

    Solving the Replacement Paths Problem for Planar Directed Graphs in O(nlog n) Time

    Wulff-Nilsen, Christian, 2009, København: Datalogisk Institut, p. 1-21, 21 p.

    Research output: Working paper › Research

  73. Published

    Wiener index and Diameter of a Planar Graph in Subquadratic Time

    Wulff-Nilsen, Christian, 2009, Proceedings of the 25th European Workshop on Computational Geometry (EuroGC´09). p. 25-28 4 p.

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  74. 2008
  75. Published

    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. (eds.). Springer, p. 764-775 12 p. (Lecture notes in computer science; No. 5369).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  76. Published

    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. (ed.). LORIA, Nancy, France, p. 123-126 4 p.

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  77. Published

    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. (eds.). Springer, p. 740-751 12 p. (Lecture notes in computer science; No. 5369).

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  78. Published

    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 p.

    Research output: Working paper › Research

  79. Published

    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, p. 59-62 4 p.

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  80. Published

    Steiner hull algorithm for the uniform orientation metrics

    Wulff-Nilsen, Christian, 2008, In: Computational Geometry. 40, 1, p. 1-13 13 p.

    Research output: Contribution to journal › Journal article › Research › peer-review

  81. Published

    Sum of All-Pairs Shortest Path Distances in a Planar Graph in Subquadratic Time

    Wulff-Nilsen, Christian, 2008, DIKU, p. 1-10, 10 p.

    Research output: Working paper › Research

  82. Published

    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 p.

    Research output: Working paper › Research

  83. 2007
  84. Published

    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. (eds.). Verlag der Technische Universität Graz, p. 158-161 4 p.

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

ID: 40450735