Christian Wulff-Nilsen

According to our database1, Christian Wulff-Nilsen authored at least 51 papers between 2008 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Decremental strongly-connected components and single-source reachability in near-linear time.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Greedy spanners are optimal in doubling metrics.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Constructing Light Spanners Deterministically in Near-Linear Time.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Near-Optimal Light Spanners.
ACM Trans. Algorithms, 2018

Better Tradeoffs for Exact Distance Oracles in Planar Graphs.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time.
SIAM J. Comput., 2017

Fully-dynamic minimum spanning forest with improved worst-case update time.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

Fast and Compact Exact Distance Oracle for Planar Graphs.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

Minor-Free Graphs Have Light Spanners.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

Best Laid Plans of Lions and Men.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016
Faster Deterministic Fully-Dynamic Graph Connectivity.
Encyclopedia of Algorithms, 2016

Approximate Distance Oracles with Improved Query Time.
Encyclopedia of Algorithms, 2016

Space-efficient path-reporting approximate distance oracles.
Theor. Comput. Sci., 2016

Approximate Distance Oracles for Planar Graphs with Improved Query Time-Space Tradeoff.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Brief Announcement: Labeling Schemes for Power-Law Graphs.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Near Optimal Adjacency Labeling Schemes for Power-Law Graphs.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time.
ACM Trans. Algorithms, 2015

Near-optimal adjacency labeling scheme for power-law graphs.
CoRR, 2015

Faster Fully-Dynamic Minimum Spanning Forest.
Proceedings of the Algorithms - ESA 2015, 2015

2014
Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time.
Comput. Geom., 2013

Faster Deterministic Fully-Dynamic Graph Connectivity.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Approximate Distance Oracles with Improved Query Time.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012
Computing the Stretch factor and Maximum Detour of Paths, Trees, and cycles in the normed Space.
Int. J. Comput. Geometry Appl., 2012

Connectivity Oracles for Planar Graphs.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

Approximate distance oracles with improved preprocessing time.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Single Source - All Sinks Max Flows in Planar Digraphs.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011
Improved algorithms for min cut and max flow in undirected planar graphs.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010
Bounding the expected number of rectilinear full Steiner trees.
Networks, 2010

Computing the Maximum Detour of a Plane Geometric Graph in Subquadratic Time.
JoCG, 2010

Multiple source, single sink maximum flow in a planar graph
CoRR, 2010

Faster Shortest Path Algorithm for H-Minor Free Graphs with Negative Edge Weights
CoRR, 2010

Min st-Cut of a Planar Graph in O(n loglog n) Time
CoRR, 2010

Computing the dilation of edge-augmented graphs in metric spaces.
Comput. Geom., 2010

Solving the Replacement Paths Problem for Planar Directed Graphs in O(n log n) Time.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Shortest Paths in Planar Graphs with Real Lengths in O(nlog2n/loglogn) Time.
Proceedings of the Algorithms, 2010

2009
A novel approach to phylogenetic trees: d-Dimensional geometric Steiner trees.
Networks, 2009

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

Shortest Paths in Planar Graphs with Real Lengths in $O(n\log^2n/\log\log n)$ Time
CoRR, 2009

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

2008
Steiner hull algorithm for the uniform orientation metrics.
Comput. Geom., 2008

Computing the Maximum Detour of a Plane Graph in Subquadratic Time.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Computing the Stretch Factor of Paths, Trees, and Cycles in Weighted Fixed Orientation Metrics.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008


  Loading...