| 2024 | SODA | VC Set Systems in Minor-free (Di)Graphs and Applications. | Hung Le, Christian Wulff-Nilsen |
| 2023 | SODA | Fully Dynamic Exact Edge Connectivity in Sublinear Time. | Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen |
| 2022 | FOCS | Negative-Weight Single-Source Shortest Paths in Near-linear Time. | Aaron Bernstein, Danupon Nanongkai, Christian Wulff-Nilsen |
| 2022 | SODA | A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs. | Debarati Das, Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
| 2021 | FOCS | Optimal Approximate Distance Oracle for Planar Graphs. | Hung Le, Christian Wulff-Nilsen |
| 2021 | ICALP | Decremental APSP in Unweighted Digraphs Versus an Adaptive Adversary. | Jacob Evald, Viktor Fredslund-Hansen, Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
| 2021 | ISAAC | Near-Optimal Distance Oracles for Vertex-Labeled Planar Graphs. | Jacob Evald, Viktor Fredslund-Hansen, Christian Wulff-Nilsen |
| 2021 | ISAAC | Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs. | Viktor Fredslund-Hansen, Shay Mozes, Christian Wulff-Nilsen |
| 2020 | FOCS | Near-Optimal Decremental SSSP in Dense Weighted Digraphs. | Aaron Bernstein, Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
| 2020 | SODA | Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler. | Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
| 2020 | SODA | Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary. | Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
| 2020 | SODA | Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds. | Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
| 2019 | ESA | Constructing Light Spanners Deterministically in Near-Linear Time. | Stephen Alstrup, Sren Dahlgaard, Arnold Filtser, Morten Stckel, Christian Wulff-Nilsen |
| 2019 | SODA | Greedy spanners are optimal in doubling metrics. | Glencora Borradaile, Hung Le, Christian Wulff-Nilsen |
| 2019 | STOC | Decremental strongly-connected components and single-source reachability in near-linear time. | Aaron Bernstein, Maximilian Probst, Christian Wulff-Nilsen |
| 2018 | SODA | Better Tradeoffs for Exact Distance Oracles in Planar Graphs. | Pawel Gawrychowski, Shay Mozes, Oren Weimann, Christian Wulff-Nilsen |
| 2017 | FOCS | Minor-Free Graphs Have Light Spanners. | Glencora Borradaile, Hung Le, Christian Wulff-Nilsen |
| 2017 | FOCS | Fast and Compact Exact Distance Oracle for Planar Graphs. | Vincent Cohen-Addad, Sren Dahlgaard, Christian Wulff-Nilsen |
| 2017 | FOCS | Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time. | Danupon Nanongkai, Thatchaphol Saranurak, Christian Wulff-Nilsen |
| 2017 | STOC | Fully-dynamic minimum spanning forest with improved worst-case update time. | Christian Wulff-Nilsen |
| 2016 | ICALP | Near Optimal Adjacency Labeling Schemes for Power-Law Graphs. | Casper Petersen, Noy Rotbart, Jakob Grue Simonsen, Christian Wulff-Nilsen |
| 2016 | PODC | Brief Announcement: Labeling Schemes for Power-Law Graphs. | Casper Petersen, Noy Rotbart, Jakob Grue Simonsen, Christian Wulff-Nilsen |
| 2016 | SODA | Near-Optimal Light Spanners. | Shiri Chechik, Christian Wulff-Nilsen |
| 2016 | SODA | Approximate Distance Oracles for Planar Graphs with Improved Query Time-Space Tradeoff. | Christian Wulff-Nilsen |
| 2015 | ESA | Faster Fully-Dynamic Minimum Spanning Forest. | Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen |
| 2014 | ICALP | Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles. | Christian Wulff-Nilsen |
| 2013 | SODA | Approximate Distance Oracles with Improved Query Time. | Christian Wulff-Nilsen |
| 2013 | SODA | Faster Deterministic Fully-Dynamic Graph Connectivity. | Christian Wulff-Nilsen |
| 2012 | FOCS | Single Source - All Sinks Max Flows in Planar Digraphs. | Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen |
| 2012 | SODA | Approximate distance oracles with improved preprocessing time. | Christian Wulff-Nilsen |
| 2011 | FOCS | Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time. | Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen |
| 2011 | FOCS | Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications. | Christian Wulff-Nilsen |
| 2011 | STOC | Improved algorithms for min cut and max flow in undirected planar graphs. | Giuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen |
| 2010 | ESA | Shortest Paths in Planar Graphs with Real Lengths in | Shay Mozes, Christian Wulff-Nilsen |
| 2010 | FOCS | Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. | Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen |
| 2010 | SODA | Solving the Replacement Paths Problem for Planar Directed Graphs in O(n log n) Time. | Christian Wulff-Nilsen |
| 2008 | ISAAC | Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces. | Jun Luo, Christian Wulff-Nilsen |
| 2008 | ISAAC | Computing the Maximum Detour of a Plane Graph in Subquadratic Time. | Christian Wulff-Nilsen |