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
- Udgivet
Girth of a Planar Digraph with Real Edge Weights in O(nlog3n) Time.
Wulff-Nilsen, Christian, 2009, s. 1-8, 8 s.Publikation: Working paper › Forskning
- Udgivet
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 s.Publikation: Working paper › Forskning
- Udgivet
Minimum Cycle Basis and All-Pairs Min Cut of a Planar Graph in Subquadratic Time.
Wulff-Nilsen, Christian, 2009, s. 1-47, 47 s.Publikation: Working paper › Forskning
- Udgivet
Solving the Replacement Paths Problem for Planar Directed Graphs in O(nlog n) Time
Wulff-Nilsen, Christian, 2009, København: Datalogisk Institut, s. 1-21, 21 s.Publikation: Working paper › Forskning
- Udgivet
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). s. 25-28 4 s.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- 2010
- Udgivet
Algorithms for Planar Graphs and Graphs in Metric Spaces
Wulff-Nilsen, Christian, 2010, Museum Tusculanum. 230 s.Publikation: Bog/antologi/afhandling/rapport › Ph.d.-afhandling › Forskning
- Udgivet
Bounding the expected number of rectilinear full Steiner trees
Wulff-Nilsen, Christian, 2010, I: Networks. 56, 1, s. 1-10 10 s.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › 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
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, s. 601-610 10 s.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- 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
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
- 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, s. 37-46 10 s.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- 2012
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 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
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. (red.). Springer, s. 316-327 12 s. (Lecture notes in computer science, Bind 7357).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- 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
- 2013
- Udgivet
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. (red.). Association for Computing Machinery, s. 539-549 11 s. (The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings).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, 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
- 2014
- Udgivet
Approximate distance oracles with improved query time
Wulff-Nilsen, Christian, 2014, Encyclopedia of Algorithms. Kao, M-Y. (red.). Springer, s. 1-4 4 s.Publikation: Bidrag til bog/antologi/rapport › Encyclopædiartikel › Forskning › fagfællebedømt
- Udgivet
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. (red.). Springer, s. 1063-1074 12 s. (Lecture notes in computer science, Bind 8572).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- 2015
- Udgivet
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, s. 742-753 12 s. (Lecture notes in computer science, Bind 9294).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
Min st-cut oracle for planar graphs with near-linear preprocessing time
Borradaile, G., Sankowski, P. & Wulff-Nilsen, Christian, 2015, I: A C M Transactions on Algorithms. 11, 3, s. 16:1-16:29 16.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › 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
- 2016
- Udgivet
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. (red.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16 s. (Leibniz International Proceedings in Informatics, Bind 51).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
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. (red.). Association for Computing Machinery, s. 351-362 12 s.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- 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
- 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
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
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
- Udgivet
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, s. 883-892 10 s.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
Space-efficient path-reporting approximate distance oracles
Elkin, M., Neiman, O. & Wulff-Nilsen, Christian, 2016, I: Theoretical Computer Science. 651, s. 1-10 10 s.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
- 2017
- Udgivet
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. (red.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16 s. 6. (Leibniz International Proceedings in Informatics, Bind 77).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
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, s. 962-973Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
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, s. 1130-1143 14 s.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
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, s. 767-778 12 s.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
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, I: SIAM Journal on Computing. 46, 4, s. 1280-1303 24 s.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
- 2018
- Udgivet
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. (red.). Society for Industrial and Applied Mathematics, s. 515-529Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- 2019
- Udgivet
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. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 15 s. 4. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 144).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
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. (red.). Association for Computing Machinery, s. 365-376 12 s. (Proceedings of the Annual ACM Symposium on Theory of Computing).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- 2020
- Udgivet
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. (red.). Association for Computing Machinery, s. 2542-2561Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
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. (red.). Association for Computing Machinery, s. 2522-2541Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
Escaping an Infinitude of Lions
Abrahamsen, Mikkel, Holm, Jacob, Rotenberg, E. & Wulff-Nilsen, Christian, 2020, I: The American Mathematical Monthly. 127, 10, s. 880-896Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
- Udgivet
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. (red.). Association for Computing Machinery, s. 2562-2574Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
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, s. 1112-1122 9317923Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- 2021
- Udgivet
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. (red.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, s. 1-20 64. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 198).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
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. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 14 s. 23. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 212).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
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. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 12 s. 25. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 212).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- 2022
- Udgivet
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., s. 3482-3495Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
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, s. 1-11Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
- Udgivet
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, s. 600-611 (Annual IEEE Symposium on Foundations of Computer Science).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
Constructing light spanners deterministically in near-linear time
Alstrup, Stephen, Dahlgaard, S., Filtser, A., Stöckel, M. & Wulff-Nilsen, Christian, 12 mar. 2022, I: Theoretical Computer Science. 907, s. 82-112Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
- 2023
- Udgivet
Almost Optimal Exact Distance Oracles for Planar Graphs
Charalampopoulos, P., Gawrychowski, P., Long, Y., Mozes, S., Pettie, S., Weimann, O. & Wulff-Nilsen, Christian, 2023, I: Journal of the ACM. 70, 2, 50 s., 12.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
- Udgivet
Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time
Bernstein, A., Gutenberg, M. P. & Wulff-Nilsen, Christian, 2023, I: SIAM Journal on Computing. 52, 2, s. 128-155Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
- Udgivet
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. (red.). Society for Industrial and Applied Mathematics, s. 70-86Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
ID: 40450735
Flest downloads
-
1976
downloads
Wiener Index, Diameter, and Stretch Factor of a Weighted Planar Graph in Subquadratic Time
Publikation: Working paper › Forskning
Udgivet -
1574
downloads
Sum of All-Pairs Shortest Path Distances in a Planar Graph in Subquadratic Time
Publikation: Working paper › Forskning
Udgivet -
771
downloads
Computing the Maximum Detour of a Plane Graph in Subquadratic Time
Publikation: Working paper › Forskning
Udgivet