default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian Wulff-Nilsen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2023
[j15]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): 12:1-12:50 (2023)- 2022
- [j14]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): 20- (2022) - [j13]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: 82-112 (2022) - 2020
- [j12]Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen:
Escaping an Infinitude of Lions. Am. Math. Mon. 127(10): 880-896 (2020) - 2018
- [j11]Shiri Chechik, Christian Wulff-Nilsen:
Near-Optimal Light Spanners. ACM Trans. Algorithms 14(3): 33:1-33:15 (2018) - 2017
- [j10]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): 1280-1303 (2017) - 2016
- [j9]Michael Elkin, Ofer Neiman, Christian Wulff-Nilsen:
Space-efficient path-reporting approximate distance oracles. Theor. Comput. Sci. 651: 1-10 (2016) - 2015
- [j8]Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen:
Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. ACM Trans. Algorithms 11(3): 16:1-16:29 (2015) - 2013
- [j7]Christian Wulff-Nilsen:
Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time. Comput. Geom. 46(7): 831-838 (2013) - 2012
- [j6]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): 45-60 (2012) - 2010
- [j5]Christian Wulff-Nilsen:
Computing the dilation of edge-augmented graphs in metric spaces. Comput. Geom. 43(2): 68-72 (2010) - [j4]Christian Wulff-Nilsen:
Computing the Maximum Detour of a Plane Geometric Graph in Subquadratic Time. J. Comput. Geom. 1(1): 101-122 (2010) - [j3]Christian Wulff-Nilsen:
Bounding the expected number of rectilinear full Steiner trees. Networks 56(1): 1-10 (2010) - 2009
- [j2]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) - 2008
- [j1]Christian Wulff-Nilsen:
Steiner hull algorithm for the uniform orientation metrics. Comput. Geom. 40(1): 1-13 (2008)
Conference and Workshop Papers
- 2024
- [c43]Hung Le, Christian Wulff-Nilsen:
VC Set Systems in Minor-free (Di)Graphs and Applications. SODA 2024: 5332-5360 - 2023
- [c42]Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen:
Fully Dynamic Exact Edge Connectivity in Sublinear Time. SODA 2023: 70-86 - 2022
- [c41]Aaron Bernstein, Danupon Nanongkai, Christian Wulff-Nilsen:
Negative-Weight Single-Source Shortest Paths in Near-linear Time. FOCS 2022: 600-611 - [c40]Debarati Das, Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs. SODA 2022: 3482-3495 - [c39]Debarati Das, Evangelos Kipouridis, Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs. SOSA 2022: 1-11 - 2021
- [c38]Hung Le, Christian Wulff-Nilsen:
Optimal Approximate Distance Oracle for Planar Graphs. FOCS 2021: 363-374 - [c37]Jacob Evald, Viktor Fredslund-Hansen, Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
Decremental APSP in Unweighted Digraphs Versus an Adaptive Adversary. ICALP 2021: 64:1-64:20 - [c36]Jacob Evald, Viktor Fredslund-Hansen, Christian Wulff-Nilsen:
Near-Optimal Distance Oracles for Vertex-Labeled Planar Graphs. ISAAC 2021: 23:1-23:14 - [c35]Viktor Fredslund-Hansen, Shay Mozes, Christian Wulff-Nilsen:
Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs. ISAAC 2021: 25:1-25:12 - 2020
- [c34]Aaron Bernstein, Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
Near-Optimal Decremental SSSP in Dense Weighted Digraphs. FOCS 2020: 1112-1122 - [c33]Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler. SODA 2020: 2522-2541 - [c32]Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary. SODA 2020: 2542-2561 - [c31]Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds. SODA 2020: 2562-2574 - 2019
- [c30]Stephen Alstrup, Søren Dahlgaard, Arnold Filtser, Morten Stöckel, Christian Wulff-Nilsen:
Constructing Light Spanners Deterministically in Near-Linear Time. ESA 2019: 4:1-4:15 - [c29]Glencora Borradaile, Hung Le, Christian Wulff-Nilsen:
Greedy spanners are optimal in doubling metrics. SODA 2019: 2371-2379 - [c28]Aaron Bernstein, Maximilian Probst, Christian Wulff-Nilsen:
Decremental strongly-connected components and single-source reachability in near-linear time. STOC 2019: 365-376 - 2018
- [c27]Pawel Gawrychowski, Shay Mozes, Oren Weimann, Christian Wulff-Nilsen:
Better Tradeoffs for Exact Distance Oracles in Planar Graphs. SODA 2018: 515-529 - 2017
- [c26]Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen:
Best Laid Plans of Lions and Men. SoCG 2017: 6:1-6:16 - [c25]Glencora Borradaile, Hung Le, Christian Wulff-Nilsen:
Minor-Free Graphs Have Light Spanners. FOCS 2017: 767-778 - [c24]Danupon Nanongkai, Thatchaphol Saranurak, Christian Wulff-Nilsen:
Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time. FOCS 2017: 950-961 - [c23]Vincent Cohen-Addad, Søren Dahlgaard, Christian Wulff-Nilsen:
Fast and Compact Exact Distance Oracle for Planar Graphs. FOCS 2017: 962-973 - [c22]Christian Wulff-Nilsen:
Fully-dynamic minimum spanning forest with improved worst-case update time. STOC 2017: 1130-1143 - 2016
- [c21]Glencora Borradaile, David Eppstein, Amir Nayyeri, Christian Wulff-Nilsen:
All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs. SoCG 2016: 22:1-22:16 - [c20]Casper Petersen, Noy Rotbart, Jakob Grue Simonsen, Christian Wulff-Nilsen:
Near Optimal Adjacency Labeling Schemes for Power-Law Graphs. ICALP 2016: 133:1-133:15 - [c19]Casper Petersen, Noy Rotbart, Jakob Grue Simonsen, Christian Wulff-Nilsen:
Brief Announcement: Labeling Schemes for Power-Law Graphs. PODC 2016: 39-41 - [c18]Christian Wulff-Nilsen:
Approximate Distance Oracles for Planar Graphs with Improved Query Time-Space Tradeoff. SODA 2016: 351-362 - [c17]Shiri Chechik, Christian Wulff-Nilsen:
Near-Optimal Light Spanners. SODA 2016: 883-892 - 2015
- [c16]Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen:
Faster Fully-Dynamic Minimum Spanning Forest. ESA 2015: 742-753 - 2014
- [c15]Christian Wulff-Nilsen:
Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles. ICALP (1) 2014: 1063-1074 - 2013
- [c14]Christian Wulff-Nilsen:
Approximate Distance Oracles with Improved Query Time. SODA 2013: 539-549 - [c13]Christian Wulff-Nilsen:
Faster Deterministic Fully-Dynamic Graph Connectivity. SODA 2013: 1757-1769 - 2012
- [c12]Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen:
Single Source - All Sinks Max Flows in Planar Digraphs. FOCS 2012: 599-608 - [c11]Christian Wulff-Nilsen:
Approximate distance oracles with improved preprocessing time. SODA 2012: 202-208 - [c10]Glencora Borradaile, Seth Pettie, Christian Wulff-Nilsen:
Connectivity Oracles for Planar Graphs. SWAT 2012: 316-327 - 2011
- [c9]Christian Wulff-Nilsen:
Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications. FOCS 2011: 37-46 - [c8]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 - [c7]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 - 2010
- [c6]Shay Mozes, Christian Wulff-Nilsen:
Shortest Paths in Planar Graphs with Real Lengths in O(nlog2n/loglogn) Time. ESA (2) 2010: 206-217 - [c5]Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen:
Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. FOCS 2010: 601-610 - [c4]Christian Wulff-Nilsen:
Solving the Replacement Paths Problem for Planar Directed Graphs in O(n log n) Time. SODA 2010: 756-765 - 2008
- [c3]Christian Wulff-Nilsen:
Computing the Stretch Factor of Paths, Trees, and Cycles in Weighted Fixed Orientation Metrics. CCCG 2008 - [c2]Christian Wulff-Nilsen:
Computing the Maximum Detour of a Plane Graph in Subquadratic Time. ISAAC 2008: 740-751 - [c1]Jun Luo, Christian Wulff-Nilsen:
Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces. ISAAC 2008: 764-775
Reference Works
- 2016
- [r2]Christian Wulff-Nilsen:
Approximate Distance Oracles with Improved Query Time. Encyclopedia of Algorithms 2016: 94-97 - [r1]Christian Wulff-Nilsen:
Faster Deterministic Fully-Dynamic Graph Connectivity. Encyclopedia of Algorithms 2016: 738-741
Informal and Other Publications
- 2023
- [i42]Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen:
Fully Dynamic Exact Edge Connectivity in Sublinear Time. CoRR abs/2302.05951 (2023) - [i41]Hung Le, Christian Wulff-Nilsen:
VC Set Systems in Minor-free (Di)Graphs and Applications. CoRR abs/2304.01790 (2023) - 2022
- [i40]Aaron Bernstein, Danupon Nanongkai, Christian Wulff-Nilsen:
Negative-Weight Single-Source Shortest Paths in Almost-linear Time. CoRR abs/2203.03456 (2022) - 2021
- [i39]Jacob Evald, Viktor Fredslund-Hansen, Christian Wulff-Nilsen:
Near-Optimal Distance Oracles for Vertex-Labeled Planar Graphs. CoRR abs/2110.00074 (2021) - [i38]Hung Le, Christian Wulff-Nilsen:
Optimal Approximate Distance Oracle for Planar Graphs. CoRR abs/2111.03560 (2021) - [i37]Debarati Das, Evangelos Kipouridis, Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs. CoRR abs/2111.07360 (2021) - 2020
- [i36]Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds. CoRR abs/2001.10801 (2020) - [i35]Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler. CoRR abs/2001.10809 (2020) - [i34]Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary. CoRR abs/2001.10821 (2020) - [i33]Aaron Bernstein, Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
Near-Optimal Decremental SSSP in Dense Weighted Digraphs. CoRR abs/2004.04496 (2020) - [i32]Viktor Fredslund-Hansen, Shay Mozes, Christian Wulff-Nilsen:
Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs. CoRR abs/2009.14716 (2020) - [i31]Jacob Evald, Viktor Fredslund-Hansen, Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
Decremental APSP in Directed Graphs Versus an Adaptive Adversary. CoRR abs/2010.00937 (2020) - [i30]Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen:
Escaping an Infinitude of Lions. CoRR abs/2012.11181 (2020) - 2019
- [i29]Aaron Bernstein, Maximilian Probst, Christian Wulff-Nilsen:
Decremental Strongly-Connected Components and Single-Source Reachability in Near-Linear Time. CoRR abs/1901.03615 (2019) - 2017
- [i28]Vincent Cohen-Addad, Søren Dahlgaard, Christian Wulff-Nilsen:
Fast and Compact Exact Distance Oracle for Planar Graphs. CoRR abs/1702.03259 (2017) - [i27]Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen:
Best Laid Plans of Lions and Men. CoRR abs/1703.03687 (2017) - [i26]Pawel Gawrychowski, Shay Mozes, Oren Weimann, Christian Wulff-Nilsen:
Better Tradeoffs for Exact Distance Oracles in Planar Graphs. CoRR abs/1708.01386 (2017) - [i25]Danupon Nanongkai, Thatchaphol Saranurak, Christian Wulff-Nilsen:
Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time. CoRR abs/1708.03962 (2017) - [i24]Stephen Alstrup, Søren Dahlgaard, Arnold Filtser, Morten Stöckel, Christian Wulff-Nilsen:
Constructing Light Spanners Deterministically in Near-Linear Time. CoRR abs/1709.01960 (2017) - [i23]Glencora Borradaile, Hung Le, Christian Wulff-Nilsen:
Minor-free graphs have light spanners. CoRR abs/1711.00821 (2017) - [i22]Glencora Borradaile, Hung Le, Christian Wulff-Nilsen:
Greedy spanners are optimal in doubling metrics. CoRR abs/1712.05007 (2017) - 2016
- [i21]Christian Wulff-Nilsen:
Approximate Distance Oracles for Planar Graphs with Improved Query Time-Space Tradeoff. CoRR abs/1601.00839 (2016) - [i20]Christian Wulff-Nilsen:
Fully-Dynamic Minimum Spanning Forest with Improved Worst-Case Update Time. CoRR abs/1611.02864 (2016) - 2015
- [i19]Casper Petersen, Noy Rotbart, Jakob Grue Simonsen, Christian Wulff-Nilsen:
Near-optimal adjacency labeling scheme for power-law graphs. CoRR abs/1502.03971 (2015) - 2014
- [i18]Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen:
Faster Fully-Dynamic Minimum Spanning Forest. CoRR abs/1407.6832 (2014) - [i17]Christian Wulff-Nilsen:
Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles. CoRR abs/1407.6869 (2014) - [i16]Michael Elkin, Ofer Neiman, Christian Wulff-Nilsen:
Space-Efficient Path-Reporting Approximate Distance Oracles. CoRR abs/1410.0768 (2014) - [i15]Glencora Borradaile, David Eppstein, Amir Nayyeri, Christian Wulff-Nilsen:
All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs. CoRR abs/1411.7055 (2014) - 2012
- [i14]Christian Wulff-Nilsen:
Approximate Distance Oracles with Improved Query Time. CoRR abs/1202.2336 (2012) - [i13]Glencora Borradaile, Seth Pettie, Christian Wulff-Nilsen:
Connectivity Oracles for Planar Graphs. CoRR abs/1204.4159 (2012) - [i12]Christian Wulff-Nilsen:
Faster Deterministic Fully-Dynamic Graph Connectivity. CoRR abs/1209.5608 (2012) - [i11]Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen:
Single Source - All Sinks Max Flows in Planar Digraphs. CoRR abs/1210.4811 (2012) - 2011
- [i10]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) - [i9]Christian Wulff-Nilsen:
Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications. CoRR abs/1107.1292 (2011) - [i8]Christian Wulff-Nilsen:
Approximate Distance Oracles with Improved Preprocessing Time. CoRR abs/1109.4156 (2011) - 2010
- [i7]Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen:
Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. CoRR abs/1003.1320 (2010) - [i6]Christian Wulff-Nilsen:
Min st-Cut of a Planar Graph in O(n loglog n) Time. CoRR abs/1007.3609 (2010) - [i5]Christian Wulff-Nilsen:
Faster Shortest Path Algorithm for H-Minor Free Graphs with Negative Edge Weights. CoRR abs/1008.1048 (2010) - [i4]Glencora Borradaile, Christian Wulff-Nilsen:
Multiple source, single sink maximum flow in a planar graph. CoRR abs/1008.4966 (2010) - 2009
- [i3]Christian Wulff-Nilsen:
Girth of a Planar Digraph with Real Edge Weights in O(n(log n)^3) Time. CoRR abs/0908.0697 (2009) - [i2]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) - [i1]Christian Wulff-Nilsen:
Minimum Cycle Basis and All-Pairs Min Cut of a Planar Graph in Subquadratic Time. CoRR abs/0912.1208 (2009)
Coauthor Index
Maximilian Probst Gutenberg
aka: Maximilian Probst
aka: Maximilian Probst
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
