Christian Wulff-Nilsen

ORCID

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 58

Top Venues

Publications

Hung Le, Christian Wulff-Nilsen
VC Set Systems in Minor-free (Di)Graphs and Applications. SODA (2024)
Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen
Fully Dynamic Exact Edge Connectivity in Sublinear Time. SODA (2023)
Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen
Fully Dynamic Exact Edge Connectivity in Sublinear Time. CoRR (2023)
Hung Le, Christian Wulff-Nilsen
VC Set Systems in Minor-free (Di)Graphs and Applications. CoRR (2023)
Panagiotis Charalampopoulos, Pawel Gawrychowski, Yaowei Long, Shay Mozes, Seth Pettie, Oren Weimann, Christian Wulff-Nilsen
Almost Optimal Exact Distance Oracles for Planar Graphs. J. ACM 70 (2) (2023)
Stephen Alstrup, Søren Dahlgaard, Arnold Filtser, Morten Stöckel, Christian Wulff-Nilsen
Constructing light spanners deterministically in near-linear time. Theor. Comput. Sci. 907 (2022)
Debarati Das, Maximilian Probst Gutenberg, Christian Wulff-Nilsen
A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs. SODA (2022)
Hung Le, Christian Wulff-Nilsen
Optimal Approximate Distance Oracle for Planar Graphs. FOCS (2022)
Debarati Das, Evangelos Kipouridis, Maximilian Probst Gutenberg, Christian Wulff-Nilsen
A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs. SOSA (2022)
Arkadev Chattopadhyay, Marek Cygan, Noga Ron-Zewi, Christian Wulff-Nilsen
Special Section on the Fifty-Second Annual ACM Symposium on the Theory of Computing (STOC 2020). SIAM J. Comput. 51 (3) (2022)
Aaron Bernstein, Danupon Nanongkai, Christian Wulff-Nilsen
Negative-Weight Single-Source Shortest Paths in Almost-linear Time. CoRR (2022)
Aaron Bernstein, Danupon Nanongkai, Christian Wulff-Nilsen
Negative-Weight Single-Source Shortest Paths in Near-linear Time. FOCS (2022)
Jacob Evald, Viktor Fredslund-Hansen, Christian Wulff-Nilsen
Near-Optimal Distance Oracles for Vertex-Labeled Planar Graphs. CoRR (2021)
Hung Le, Christian Wulff-Nilsen
Optimal Approximate Distance Oracle for Planar Graphs. FOCS (2021)
Jacob Evald, Viktor Fredslund-Hansen, Christian Wulff-Nilsen
Near-Optimal Distance Oracles for Vertex-Labeled Planar Graphs. ISAAC (2021)
Hung Le, Christian Wulff-Nilsen
Optimal Approximate Distance Oracle for Planar Graphs. CoRR (2021)
Jacob Evald, Viktor Fredslund-Hansen, Maximilian Probst Gutenberg, Christian Wulff-Nilsen
Decremental APSP in Unweighted Digraphs Versus an Adaptive Adversary. ICALP (2021)
Viktor Fredslund-Hansen, Shay Mozes, Christian Wulff-Nilsen
Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs. ISAAC (2021)
Debarati Das, Evangelos Kipouridis, Maximilian Probst Gutenberg, Christian Wulff-Nilsen
A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs. CoRR (2021)
Viktor Fredslund-Hansen, Shay Mozes, Christian Wulff-Nilsen
Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs. CoRR (2020)
Maximilian Probst Gutenberg, Christian Wulff-Nilsen
Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds. SODA (2020)
Jacob Evald, Viktor Fredslund-Hansen, Maximilian Probst Gutenberg, Christian Wulff-Nilsen
Decremental APSP in Directed Graphs Versus an Adaptive Adversary. CoRR (2020)
Maximilian Probst Gutenberg, Christian Wulff-Nilsen
Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds. CoRR (2020)
Aaron Bernstein, Maximilian Probst Gutenberg, Christian Wulff-Nilsen
Near-Optimal Decremental SSSP in Dense Weighted Digraphs. CoRR (2020)
Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen
Escaping an Infinitude of Lions. Am. Math. Mon. 127 (10) (2020)
Maximilian Probst Gutenberg, Christian Wulff-Nilsen
Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary. SODA (2020)
Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen
Escaping an Infinitude of Lions. CoRR (2020)
Maximilian Probst Gutenberg, Christian Wulff-Nilsen
Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler. SODA (2020)
Aaron Bernstein, Maximilian Probst Gutenberg, Christian Wulff-Nilsen
Near-Optimal Decremental SSSP in Dense Weighted Digraphs. FOCS (2020)
Maximilian Probst Gutenberg, Christian Wulff-Nilsen
Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler. CoRR (2020)
Maximilian Probst Gutenberg, Christian Wulff-Nilsen
Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary. CoRR (2020)
Glencora Borradaile, Hung Le, Christian Wulff-Nilsen
Greedy spanners are optimal in doubling metrics. SODA (2019)
Aaron Bernstein, Maximilian Probst, Christian Wulff-Nilsen
Decremental Strongly-Connected Components and Single-Source Reachability in Near-Linear Time. CoRR (2019)
Aaron Bernstein, Maximilian Probst, Christian Wulff-Nilsen
Decremental strongly-connected components and single-source reachability in near-linear time. STOC (2019)
Stephen Alstrup, Søren Dahlgaard, Arnold Filtser, Morten Stöckel, Christian Wulff-Nilsen
Constructing Light Spanners Deterministically in Near-Linear Time. ESA (2019)
Shiri Chechik, Christian Wulff-Nilsen
Near-Optimal Light Spanners. ACM Trans. Algorithms 14 (3) (2018)
Pawel Gawrychowski, Shay Mozes, Oren Weimann, Christian Wulff-Nilsen
Better Tradeoffs for Exact Distance Oracles in Planar Graphs. SODA (2018)
Glencora Borradaile, Hung Le, Christian Wulff-Nilsen
Greedy spanners are optimal in doubling metrics. CoRR (2017)
Glencora Borradaile, Hung Le, Christian Wulff-Nilsen
Minor-free graphs have light spanners. CoRR (2017)
Stephen Alstrup, Søren Dahlgaard, Arnold Filtser, Morten Stöckel, Christian Wulff-Nilsen
Constructing Light Spanners Deterministically in Near-Linear Time. CoRR (2017)
Vincent Cohen-Addad, Søren Dahlgaard, Christian Wulff-Nilsen
Fast and Compact Exact Distance Oracle for Planar Graphs. CoRR (2017)
Danupon Nanongkai, Thatchaphol Saranurak, Christian Wulff-Nilsen
Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time. CoRR (2017)
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. SIAM J. Comput. 46 (4) (2017)
Glencora Borradaile, Hung Le, Christian Wulff-Nilsen
Minor-Free Graphs Have Light Spanners. FOCS (2017)
Pawel Gawrychowski, Shay Mozes, Oren Weimann, Christian Wulff-Nilsen
Better Tradeoffs for Exact Distance Oracles in Planar Graphs. CoRR (2017)
Christian Wulff-Nilsen
Fully-dynamic minimum spanning forest with improved worst-case update time. STOC (2017)
Vincent Cohen-Addad, Søren Dahlgaard, Christian Wulff-Nilsen
Fast and Compact Exact Distance Oracle for Planar Graphs. FOCS (2017)
Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen
Best Laid Plans of Lions and Men. CoRR (2017)
Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen
Best Laid Plans of Lions and Men. SoCG (2017)
Danupon Nanongkai, Thatchaphol Saranurak, Christian Wulff-Nilsen
Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time. FOCS (2017)
Michael Elkin, Ofer Neiman, Christian Wulff-Nilsen
Space-efficient path-reporting approximate distance oracles. Theor. Comput. Sci. 651 (2016)
Christian Wulff-Nilsen
Approximate Distance Oracles for Planar Graphs with Improved Query Time-Space Tradeoff. SODA (2016)
Christian Wulff-Nilsen
Fully-Dynamic Minimum Spanning Forest with Improved Worst-Case Update Time. CoRR (2016)
Casper Petersen, Noy Rotbart, Jakob Grue Simonsen, Christian Wulff-Nilsen
Near Optimal Adjacency Labeling Schemes for Power-Law Graphs. ICALP (2016)
Casper Petersen, Noy Rotbart, Jakob Grue Simonsen, Christian Wulff-Nilsen
Brief Announcement: Labeling Schemes for Power-Law Graphs. PODC (2016)
Glencora Borradaile, David Eppstein, Amir Nayyeri, Christian Wulff-Nilsen
All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs. SoCG (2016)
Shiri Chechik, Christian Wulff-Nilsen
Near-Optimal Light Spanners. SODA (2016)
Christian Wulff-Nilsen
Approximate Distance Oracles for Planar Graphs with Improved Query Time-Space Tradeoff. CoRR (2016)
Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen
-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. ACM Trans. Algorithms 11 (3) (2015)
Casper Petersen, Noy Rotbart, Jakob Grue Simonsen, Christian Wulff-Nilsen
Near-optimal adjacency labeling scheme for power-law graphs. CoRR (2015)
Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen
Faster Fully-Dynamic Minimum Spanning Forest. ESA (2015)
Christian Wulff-Nilsen
Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles. CoRR (2014)
Glencora Borradaile, David Eppstein, Amir Nayyeri, Christian Wulff-Nilsen
All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs. CoRR (2014)
Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen
Faster Fully-Dynamic Minimum Spanning Forest. CoRR (2014)
Christian Wulff-Nilsen
Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles. ICALP (1) (2014)
Michael Elkin, Ofer Neiman, Christian Wulff-Nilsen
Space-Efficient Path-Reporting Approximate Distance Oracles. CoRR (2014)
Christian Wulff-Nilsen
Faster Deterministic Fully-Dynamic Graph Connectivity. SODA (2013)
Christian Wulff-Nilsen
Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time. Comput. Geom. 46 (7) (2013)
Christian Wulff-Nilsen
Approximate Distance Oracles with Improved Query Time. SODA (2013)
Christian Wulff-Nilsen
Approximate Distance Oracles with Improved Query Time CoRR (2012)
Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen
Single Source - All Sinks Max Flows in Planar Digraphs CoRR (2012)
Christian Wulff-Nilsen
Approximate distance oracles with improved preprocessing time. SODA (2012)
Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen
Single Source - All Sinks Max Flows in Planar Digraphs. FOCS (2012)
Glencora Borradaile, Seth Pettie, Christian Wulff-Nilsen
Connectivity Oracles for Planar Graphs. SWAT (2012)
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. Geom. Appl. 22 (1) (2012)
Glencora Borradaile, Seth Pettie, Christian Wulff-Nilsen
Connectivity Oracles for Planar Graphs CoRR (2012)
Christian Wulff-Nilsen
Faster Deterministic Fully-Dynamic Graph Connectivity CoRR (2012)
Christian Wulff-Nilsen
Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications CoRR (2011)
Giuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen
Improved algorithms for min cut and max flow in undirected planar graphs. STOC (2011)
Christian Wulff-Nilsen
Approximate Distance Oracles with Improved Preprocessing Time CoRR (2011)
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 (2011)
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)
Christian Wulff-Nilsen
Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications. FOCS (2011)
Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen
Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. FOCS (2010)
Christian Wulff-Nilsen
Computing the dilation of edge-augmented graphs in metric spaces. Comput. Geom. 43 (2) (2010)
Christian Wulff-Nilsen
Bounding the expected number of rectilinear full Steiner trees. Networks 56 (1) (2010)
Christian Wulff-Nilsen
Solving the Replacement Paths Problem for Planar Directed Graphs in O(n log n) Time. SODA (2010)
Glencora Borradaile, Christian Wulff-Nilsen
Multiple source, single sink maximum flow in a planar graph CoRR (2010)
Christian Wulff-Nilsen
Faster Shortest Path Algorithm for H-Minor Free Graphs with Negative Edge Weights CoRR (2010)
Christian Wulff-Nilsen
Min st-Cut of a Planar Graph in O(n loglog n) Time CoRR (2010)
Christian Wulff-Nilsen
Computing the Maximum Detour of a Plane Geometric Graph in Subquadratic Time. J. Comput. Geom. 1 (1) (2010)
Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen
Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time CoRR (2010)
Shay Mozes, Christian Wulff-Nilsen
) Time. ESA (2) (2010)
Christian Wulff-Nilsen
Girth of a Planar Digraph with Real Edge Weights in O(n(log n)^3) Time CoRR (2009)
Christian Wulff-Nilsen
Minimum Cycle Basis and All-Pairs Min Cut of a Planar Graph in Subquadratic Time CoRR (2009)
Shay Mozes, Christian Wulff-Nilsen
Shortest Paths in Planar Graphs with Real Lengths in $O(n\log^2n/\log\log n)$ Time CoRR (2009)
Marcus Brazil, Doreen A. Thomas, Benny K. Nielsen, Pawel Winter, Christian Wulff-Nilsen, Martin Zachariasen
-Dimensional geometric Steiner trees. Networks 53 (2) (2009)
Christian Wulff-Nilsen
Computing the Stretch Factor of Paths, Trees, and Cycles in Weighted Fixed Orientation Metrics. CCCG (2008)
Christian Wulff-Nilsen
Steiner hull algorithm for the uniform orientation metrics. Comput. Geom. 40 (1) (2008)
Jun Luo, Christian Wulff-Nilsen
Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces. ISAAC (2008)

Christian Wulff-Nilsen.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Christian Wulff-Nilsen