Christian Wulff-Nilsen

Christian Wulff-Nilsen: Approximate Distance Oracles with Improved Query Time. SODA 2013: 539-549

Christian Wulff-Nilsen: Faster Deterministic Fully-Dynamic Graph Connectivity. SODA 2013: 1757-1769

Christian Wulff-Nilsen, Ansgar Grüne, Rolf Klein, Elmar Langetepe, D. T. Lee, Tien-Ching Lin, Sheung-Hung Poon, Teng-Kai Yu: Computing the Stretch factor and Maximum Detour of Paths, Trees, and cycles in the normed Space. Int. J. Comput. Geometry Appl. 22(1): 45-60 (2012)

Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen: Single Source - All Sinks Max Flows in Planar Digraphs. FOCS 2012: 599-608

Christian Wulff-Nilsen: Approximate distance oracles with improved preprocessing time. SODA 2012: 202-208

Glencora Borradaile, Seth Pettie, Christian Wulff-Nilsen: Connectivity Oracles for Planar Graphs. SWAT 2012: 316-327

Christian Wulff-Nilsen: Approximate Distance Oracles with Improved Query Time. CoRR abs/1202.2336 (2012)

Glencora Borradaile, Seth Pettie, Christian Wulff-Nilsen: Connectivity Oracles for Planar Graphs. CoRR abs/1204.4159 (2012)

Christian Wulff-Nilsen: Faster Deterministic Fully-Dynamic Graph Connectivity. CoRR abs/1209.5608 (2012)

Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen: Single Source - All Sinks Max Flows in Planar Digraphs. CoRR abs/1210.4811 (2012)

Christian Wulff-Nilsen: Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications. FOCS 2011: 37-46

Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen: Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time. FOCS 2011: 170-179

Giuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen: Improved algorithms for min cut and max flow in undirected planar graphs. STOC 2011: 313-322

Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen: Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time. CoRR abs/1105.2228 (2011)

Christian Wulff-Nilsen: Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications. CoRR abs/1107.1292 (2011)

Christian Wulff-Nilsen: Approximate Distance Oracles with Improved Preprocessing Time. CoRR abs/1109.4156 (2011)

Christian Wulff-Nilsen: Computing the dilation of edge-augmented graphs in metric spaces. Comput. Geom. 43(2): 68-72 (2010)

Christian Wulff-Nilsen: Computing the Maximum Detour of a Plane Geometric Graph in Subquadratic Time. JoCG 1(1): 101-122 (2010)

Christian Wulff-Nilsen: Bounding the expected number of rectilinear full Steiner trees. Networks 56(1): 1-10 (2010)

Shay Mozes, Christian Wulff-Nilsen: Shortest Paths in Planar Graphs with Real Lengths in O(nlog²n/loglogn) Time. ESA (2) 2010: 206-217

Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen: Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. FOCS 2010: 601-610

Christian Wulff-Nilsen: Solving the Replacement Paths Problem for Planar Directed Graphs in O(n log n) Time. SODA 2010: 756-765

Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen: Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. CoRR abs/1003.1320 (2010)

Christian Wulff-Nilsen: Min st-Cut of a Planar Graph in O(n loglog n) Time. CoRR abs/1007.3609 (2010)

Christian Wulff-Nilsen: Faster Shortest Path Algorithm for H-Minor Free Graphs with Negative Edge Weights. CoRR abs/1008.1048 (2010)

Glencora Borradaile, Christian Wulff-Nilsen: Multiple source, single sink maximum flow in a planar graph. CoRR abs/1008.4966 (2010)

Marcus Brazil, Doreen A. Thomas, Benny K. Nielsen, Pawel Winter, Christian Wulff-Nilsen, Martin Zachariasen: A novel approach to phylogenetic trees: d-Dimensional geometric Steiner trees. Networks 53(2): 104-111 (2009)

Christian Wulff-Nilsen: Girth of a Planar Digraph with Real Edge Weights in O(n(log n)^3) Time. CoRR abs/0908.0697 (2009)

Shay Mozes, Christian Wulff-Nilsen: Shortest Paths in Planar Graphs with Real Lengths in $O(n\log^2n/\log\log n)$ Time. CoRR abs/0911.4963 (2009)

Christian Wulff-Nilsen: Minimum Cycle Basis and All-Pairs Min Cut of a Planar Graph in Subquadratic Time. CoRR abs/0912.1208 (2009)

Christian Wulff-Nilsen: Steiner hull algorithm for the uniform orientation metrics. Comput. Geom. 40(1): 1-13 (2008)

Christian Wulff-Nilsen: Computing the Stretch Factor of Paths, Trees, and Cycles in Weighted Fixed Orientation Metrics. CCCG 2008

Christian Wulff-Nilsen: Computing the Maximum Detour of a Plane Graph in Subquadratic Time. ISAAC 2008: 740-751

Jun Luo, Christian Wulff-Nilsen: Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces. ISAAC 2008: 764-775