Christian Wulff-Nilsen
Københavns Universitet
H-index: 25
Europe-Denmark
Top articles of Christian Wulff-Nilsen
VC Set Systems in Minor-free (Di) Graphs and Applications
2024
Hung Le
H-Index: 4
Christian Wulff-Nilsen
H-Index: 16
Almost optimal exact distance oracles for planar graphs
Journal of the ACM
2023/3/25
Paweł Gawrychowski
H-Index: 19
Seth Pettie
H-Index: 26
Oren Weimann
H-Index: 16
Christian Wulff-Nilsen
H-Index: 16
Fully dynamic exact edge connectivity in sublinear time
2023
Negative-weight single-source shortest paths in near-linear time
2022/10/31
Constructing light spanners deterministically in near-linear time
Theoretical Computer Science
2022/3/12
Optimal approximate distance oracle for planar graphs
2022/2/7
Hung Le
H-Index: 4
Christian Wulff-Nilsen
H-Index: 16
Special Section on the Fifty-Second Annual ACM Symposium on the Theory of Computing (STOC 2020)
SIAM Journal on Computing
2022
Arkadev Chattopadhyay
H-Index: 11
Marek Cygan
H-Index: 25
Noga Ron-Zewi
H-Index: 9
Christian Wulff-Nilsen
H-Index: 16
A near-optimal offline algorithm for dynamic all-pairs shortest paths in planar digraphs
2022
Debarati Das
H-Index: 4
Christian Wulff-Nilsen
H-Index: 16
A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs∗
2022
Near-optimal distance oracles for vertex-labeled planar graphs
2021
Jacob Evald
H-Index: 1
Christian Wulff-Nilsen
H-Index: 16
Decremental APSP in unweighted digraphs versus an adaptive adversary
2021
Jacob Evald
H-Index: 1
Christian Wulff-Nilsen
H-Index: 16
Escaping an infinitude of lions
the American Mathematical Monthly
2020/11/23
Mikkel Abrahamsen
H-Index: 7
Jacob Holm
H-Index: 8
Eva Rotenberg
H-Index: 8
Christian Wulff-Nilsen
H-Index: 16
Near-optimal decremental SSSP in dense weighted digraphs
2020/11/16
Aaron Bernstein
H-Index: 17
Christian Wulff-Nilsen
H-Index: 16
Decremental APSP in directed graphs versus an adaptive adversary
arXiv preprint arXiv:2010.00937
2020/10/2
Jacob Evald
H-Index: 1
Christian Wulff-Nilsen
H-Index: 16
Truly subquadratic exact distance oracles with constant query time for planar graphs
arXiv preprint arXiv:2009.14716
2020/9/30
Christian Wulff-Nilsen
H-Index: 16
Fully-dynamic all-pairs shortest paths: Improved worst-case time and space bounds
2020
Christian Wulff-Nilsen
H-Index: 16
Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler
arXiv e-prints
2020/1
Christian Wulff-Nilsen
H-Index: 16
Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary
arXiv e-prints
2020/1
Christian Wulff-Nilsen
H-Index: 16
