Christian Wulff-Nilsen

Available identifiers

zbMath Open wulff-nilsen.christianMaRDI QIDQ359742

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6147522	2024-01-15	Paper
https://portal.mardi4nfdi.de/entity/Q6147524	2024-01-15	Paper
VC Set Systems in Minor-free (Di)Graphs and Applications	2023-04-04	Paper
Constructing Light Spanners Deterministically in Near-Linear Time	2022-05-11	Paper
Constructing light spanners deterministically in near-linear time	2022-02-21	Paper
Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time	2022-01-07	Paper
Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler	2021-02-02	Paper
Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary	2021-02-02	Paper
Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds	2021-02-02	Paper
Escaping an Infinitude of Lions	2020-12-17	Paper
Decremental strongly-connected components and single-source reachability in near-linear time	2020-01-30	Paper
Greedy spanners are optimal in doubling metrics	2019-10-15	Paper
Approximate Distance Oracles with Improved Query Time	2019-05-15	Paper
Faster Deterministic Fully-Dynamic Graph Connectivity	2019-05-15	Paper
https://portal.mardi4nfdi.de/entity/Q5743389	2019-05-10	Paper
Near-Optimal Light Spanners	2018-11-13	Paper
Min st -Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time	2018-10-30	Paper
Best Laid Plans of Lions and Men.	2018-08-13	Paper
Approximate Distance Oracles for Planar Graphs with Improved Query Time-Space Tradeoff	2018-07-16	Paper
Near-Optimal Light Spanners	2018-07-16	Paper
https://portal.mardi4nfdi.de/entity/Q4607915	2018-03-15	Paper
All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs	2018-01-30	Paper
Near Optimal Adjacency Labeling Schemes for Power-Law Graphs	2017-12-19	Paper
Brief Announcement	2017-09-29	Paper
Fully-dynamic minimum spanning forest with improved worst-case update time	2017-08-17	Paper
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time	2017-08-16	Paper
Space-efficient path-reporting approximate distance oracles	2017-03-16	Paper
COMPUTING THE MAXIMUM DETOUR OF A PLANE GEOMETRIC GRAPH IN SUBQUADRATIC TIME	2017-03-09	Paper
Faster Fully-Dynamic Minimum Spanning Forest	2015-11-19	Paper
Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications	2014-07-30	Paper
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time	2014-07-30	Paper
Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles	2014-07-01	Paper
Improved algorithms for min cut and max flow in undirected planar graphs	2014-06-05	Paper
https://portal.mardi4nfdi.de/entity/Q5417665	2014-05-22	Paper
Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time	2013-08-22	Paper
COMPUTING THE STRETCH FACTOR AND MAXIMUM DETOUR OF PATHS, TREES, AND CYCLES IN THE NORMED SPACE	2012-11-23	Paper
Single Source - All Sinks Max Flows in Planar Digraphs	2012-10-17	Paper
Connectivity Oracles for Planar Graphs	2012-08-14	Paper
Bounding the expected number of rectilinear full Steiner trees	2010-11-24	Paper
Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time	2010-09-06	Paper
Computing the dilation of edge-augmented graphs in metric spaces	2009-11-16	Paper
A novel approach to phylogenetic trees: d‐Dimensional geometric Steiner trees	2009-07-28	Paper
Computing the Maximum Detour of a Plane Graph in Subquadratic Time	2009-01-29	Paper
Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces	2009-01-29	Paper
Steiner hull algorithm for the uniform orientation metrics	2008-03-26	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Christian Wulff-Nilsen