Christian Wulff-Nilsen

Christian Wulff-Nilsen, Maximilian Probst Gutenberg, Aaron Bernstein, 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

Faster Fully-Dynamic Minimum Spanning Forest

Christian Wulff-Nilsen, Jacob Holm, Eva Rotenberg, 2014, ESA.

Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles pdf

Christian Wulff-Nilsen, Christian Wulff-Nilsen, 2014, ICALP.

Girth of a Planar Digraph with Real Edge Weights in O(n(log n)^3) Time pdf

Christian Wulff-Nilsen, Christian Wulff-Nilsen, 2009, ArXiv.

Single Source -- All Sinks Max Flows in Planar Digraphs

Piotr Sankowski, Christian Wulff-Nilsen, Yahav Nussbaum, 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time

Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen, 2010, FOCS.

Approximate Distance Oracles with Improved Query Time

Christian Wulff-Nilsen, Christian Wulff-Nilsen, 2012, Encyclopedia of Algorithms.

Greedy spanners are optimal in doubling metrics

Glencora Borradaile, Christian Wulff-Nilsen, Hung Le, 2017, SODA.

Near Optimal Adjacency Labeling Schemes for Power-Law Graphs

Jakob Grue Simonsen, Christian Wulff-Nilsen, Casper Petersen, 2016, ICALP.

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

Christian Wulff-Nilsen, 2013, Comput. Geom..

All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs

David Eppstein, Glencora Borradaile, Amir Nayyeri, 2016, Symposium on Computational Geometry.

Computing the Stretch Factor of Paths, Trees, and Cycles in Weighted Fixed Orientation Metrics

Christian Wulff-Nilsen, 2008, CCCG.

Min st-Cut of a Planar Graph in O(n loglog n) Time pdf

Christian Wulff-Nilsen, 2010, ArXiv.

Approximate Distance Oracles for Planar Graphs with Improved Query Time-Space Tradeoff

Christian Wulff-Nilsen, Christian Wulff-Nilsen, 2016, SODA.

Faster Deterministic Fully-Dynamic Graph Connectivity

Christian Wulff-Nilsen, Christian Wulff-Nilsen, 2012, Encyclopedia of Algorithms.

Constructing Light Spanners Deterministically in Near-Linear Time pdf

Stephen Alstrup, Christian Wulff-Nilsen, Arnold Filtser, 2017, ESA.

Space-efficient path-reporting approximate distance oracles pdf

Christian Wulff-Nilsen, Michael Elkin, Ofer Neiman, 2014, Theor. Comput. Sci..

A novel approach to phylogenetic trees: d-Dimensional geometric Steiner trees

Christian Wulff-Nilsen, Marcus Brazil, Doreen A. Thomas, 2009, Networks.

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

Christian Wulff-Nilsen, Aaron Bernstein, Maximilian Probst, 2019, STOC.

Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler

Christian Wulff-Nilsen, Maximilian Probst Gutenberg, Christian Wulff-Nilsen, 2020, SODA.

Computing the Maximum Detour of a Plane Graph in Subquadratic Time

Christian Wulff-Nilsen, 2008, ISAAC.

Minor-Free Graphs Have Light Spanners

Glencora Borradaile, Christian Wulff-Nilsen, Hung Le, 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time

Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen, 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

Faster Shortest Path Algorithm for H-Minor Free Graphs with Negative Edge Weights pdf

Christian Wulff-Nilsen, Christian Wulff-Nilsen, 2010, ArXiv.

Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time

Christian Wulff-Nilsen, Thatchaphol Saranurak, Danupon Nanongkai, 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

Computing the Stretch factor and Maximum Detour of Paths, Trees, and cycles in the normed Space

D. T. Lee, Rolf Klein, Christian Wulff-Nilsen, 2012, Int. J. Comput. Geom. Appl..

Improved algorithms for min cut and max flow in undirected planar graphs

Piotr Sankowski, Giuseppe F. Italiano, Christian Wulff-Nilsen, 2011, STOC '11.

Fast and Compact Exact Distance Oracle for Planar Graphs

Christian Wulff-Nilsen, Vincent Cohen-Addad, Søren Dahlgaard, 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

Multiple source, single sink maximum flow in a planar graph pdf

Glencora Borradaile, Christian Wulff-Nilsen, 2010, ArXiv.

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

Christian Wulff-Nilsen, Christian Wulff-Nilsen, 2009, ArXiv.

Brief Announcement: Labeling Schemes for Power-Law Graphs

Jakob Grue Simonsen, Christian Wulff-Nilsen, Casper Petersen, 2016, PODC.

Computing the Maximum Detour of a Plane Geometric Graph in Subquadratic Time

Christian Wulff-Nilsen, Christian Wulff-Nilsen, 2010, J. Comput. Geom..

Connectivity Oracles for Planar Graphs pdf

Glencora Borradaile, Christian Wulff-Nilsen, Seth Pettie, 2012, SWAT.

Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time pdf

Philip N. Klein, Glencora Borradaile, Christian Wulff-Nilsen, 2011, FOCS.

Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time

Glencora Borradaile, Christian Wulff-Nilsen, Yahav Nussbaum, 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

Computing the dilation of edge-augmented graphs in metric spaces

Christian Wulff-Nilsen, 2010, Comput. Geom..

Solving the replacement paths problem for planar directed graphs in O(n log n) time

Christian Wulff-Nilsen, Christian Wulff-Nilsen, 2010, SODA '10.

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

Christian Wulff-Nilsen, Christian Wulff-Nilsen, 2016, STOC.

Steiner hull algorithm for the uniform orientation metrics

Christian Wulff-Nilsen, 2008, Comput. Geom..

Best Laid Plans of Lions and Men

Christian Wulff-Nilsen, Mikkel Abrahamsen, Eva Rotenberg, 2017, SoCG.

Decremental APSP in Unweighted Digraphs Versus an Adaptive Adversary

Christian Wulff-Nilsen, Jacob Evald, Viktor Fredslund-Hansen, 2021, ICALP.

Near-Optimal Distance Oracles for Vertex-Labeled Planar Graphs pdf

Christian Wulff-Nilsen, Jacob Evald, Viktor Fredslund-Hansen, 2021, ISAAC.

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

Christian Wulff-Nilsen, Maximilian Probst Gutenberg, Evangelos Kipouridis, 2022, Symposium on Simplicity in Algorithms (SOSA).

Optimal Approximate Distance Oracle for Planar Graphs pdf

Christian Wulff-Nilsen, Hung Le, 2021, ArXiv.

Faster deterministic fully-dynamic graph connectivity

Christian Wulff-Nilsen, 2013, SODA 2013.