Christian Wulff-Nilsen

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