Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time.ĪCM Transactions on Algorithms 11(3): 16, 2015.Īpproximate Distance Oracles with Improved Query Time. Wulff-Nilsen.įaster Fully-Dynamic Minimum Spanning Forest. Space-efficient path-reporting approximate distance oracles. Near Optimal Adjacency Labeling Schemes for Power-Law Graphs.Īpproximate Distance Oracles for Planar Graphs with Improved Query Time-Space Tradeoff. Nayyeri.Īll-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs.Ĭ.
#Christian yu abs update#
Wulff-Nilsen.įast and Compact Exact Distance Oracle for Planar Graphs.įully-Dynamic Minimum Spanning Forest with Improved Worst-Case Update Time. Wulff-Nilsen.ĭynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time. Wulff-Nilsen.īetter Tradeoffs for Exact Distance Oracle in Planar Graphs.ĭ. Greedy spanners are optimal in doubling metrics.ĪCM Trans. Wulff-Nilsen.ĭecremental Strongly-Connected Components and Single-Source Reachability in Near-Linear Time. Wulff-Nilsen.ĭecremental APSP in Directed Graphs Versus an Adaptive Adversary.įully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds.ĭecremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary.ĭeterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler.Ĭonstructing Light Spanners Deterministically in Near-Linear Time.Ī. Near-Optimal Decremental SSSP in Dense Weighted Digraphs.
Wulff-Nilsen.ĭecremental APSP in Unweighted Digraphs Versus an Adaptive Adversary.Ī. Near-Optimal Distance Oracles for Vertex-Labeled Planar Graphs.
Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs. Optimal Approximate Distance Oracles for Planar Graphs. Wulff-Nilsen.Ī Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs.
#Christian yu abs Offline#
Wulff-Nilsen.Ī Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs.ĭ. Wulff-Nilsen.Ĭonstructing light spanners deterministically in near-linear time.ĭ. Mozes, S.Īlmost Optimal Exact Distance Oracles for Planar Graphs. To appear at FOCS 2022 (best paper award). Negative-Weight Single-Source Shortest Paths in Almost-linear Time. Graph problems, mainly the Steiner tree and dilation/stretch factor problems.Ī. I have previously been working on metric space and geometric (Euclidean and fixed orientations) My current focus is on classical algorithmic graph problems (such as shortest paths, min cut, max flow, and dynamic connectivity) in the static and in dynamic settingsįor general graphs as well as for graphs with a fixed excluded minor, in particular planar graphs. Program comittee member, Highlights of Algorithms (HALG), 2022. Program comittee member, International Colloquium on Automata, Languages and Programming (ICALP), 2022. Program committee member, Symposium on Simplicity in Algorithms (SOSA), 2022. Program committee member, Symposium on Discrete Algorithms (SODA), 2021. Program committee member, Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), 2020. Program committee member, Symposium on Theory of Computing (STOC), 2020. Program committee member, European Symposium on Algorithms (ESA), track A, 2018. Program committee member, Foundations of Computer Science (FOCS), 2018. Program committee member, Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), 2016. Program committee member, Symposium on Discrete Algorithms (SODA), 2014. Program committee member, European Symposium on Algorithms (ESA), track A, 2012. Randomiserede Algoritmer til Dataanalyse, DIKU, block 4, 2020-present (course organizer). Randomized Algorithms, DIKU, block 2, 2014-2018.
Topics in Algorithms and Data Structures, DIKU, 2013-2017.Ĭomputational Geometry, DIKU, block 3, 2014. Work address: Department of Computer ScienceĮ-mail: course on Efficient Graph Algorithms at IMADA from January to March, 2012.Ĭomputability and Complexity, DIKU, 2012-2021 (course organizer).Īlgorithms and Data Structures, DIKU, 2013-present (course organizer).Īdvanced Algorithms and Data Structures, DIKU, 2013-present. I am associate professor at the Department of Computer Science, University of Copenhagen (DIKU).īelow you will find some basic information about my teaching activities, research interests, and publications. Christian Wulff-Nilsen Christian Wulff-Nilsen
0 kommentar(er)
