| Publication | Date of Publication | Type |
|---|
| Nibbling at long cycles: dynamic (and static) edge coloring in optimal time | 2024-11-28 | Paper |
| Shortcut partitions in minor-free graphs: Steiner point removal, distance oracles, tree covers, and more | 2024-11-28 | Paper |
| Sparse Euclidean spanners with optimal diameter: a general and robust lower bound via a concave inverse-Ackermann function | 2024-10-16 | Paper |
| Near-optimal spanners for general graphs in (nearly) linear time | 2024-07-19 | Paper |
| Maintaining an EDCS in general graphs: simpler, density-sensitive and with worst-case time bounds | 2024-05-14 | Paper |
| Sparse Euclidean spanners with tiny diameter: a tight lower bound | 2024-05-14 | Paper |
| A unified framework for light spanners | 2024-05-08 | Paper |
| Dynamic \(((1+\epsilon)\ln n)\)-approximation algorithms for minimum set cover and dominating set | 2024-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126229 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126341 | 2024-04-09 | Paper |
| Can't See the Forest for the Trees | 2024-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6083402 | 2023-12-08 | Paper |
| Fully Dynamic (Δ +1)-Coloring in O (1) Update Time | 2023-10-31 | Paper |
| Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach. | 2023-09-20 | Paper |
| Light Euclidean Spanners with Steiner Points | 2023-02-07 | Paper |
| When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time | 2022-07-21 | Paper |
| Truly Optimal Euclidean Spanners | 2022-04-20 | Paper |
| Improved dynamic graph coloring | 2021-08-04 | Paper |
| Fully dynamic almost-maximal matching: breaking the polynomial worst-case time barrier | 2021-07-28 | Paper |
| Fully dynamic MIS in uniformly sparse graphs | 2021-07-28 | Paper |
| Local algorithms for bounded degree sparsifiers in sparse graphs | 2021-06-15 | Paper |
| Improved dynamic graph coloring | 2021-05-03 | Paper |
| Fully dynamic MIS in uniformly sparse graphs | 2021-05-03 | Paper |
| The greedy spanner is existentially optimal | 2020-04-16 | Paper |
| Fully Dynamic Maximal Independent Set with Sublinear in n Update Time | 2019-10-15 | Paper |
| On the average-case complexity of the Bottleneck Tower of Hanoi problem | 2019-09-17 | Paper |
| Fully dynamic maximal independent set with sublinear update time | 2019-08-22 | Paper |
| Fast constructions of light-weight spanners for general graphs | 2019-05-15 | Paper |
| On an infinite family of solvable Hanoi graphs | 2018-11-05 | Paper |
| Optimality of an algorithm solving the bottleneck Tower of Hanoi problem | 2018-11-05 | Paper |
| Fast constructions of lightweight spanners for general graphs | 2018-11-05 | Paper |
| Simple Deterministic Algorithms for Fully Dynamic Maximal Matching | 2018-10-30 | Paper |
| Optimal Euclidean Spanners | 2018-08-02 | Paper |
| Dynamic \((1 + \epsilon)\)-approximate matchings: a density-sensitive approach | 2018-07-16 | Paper |
| Local-on-average distributed tasks | 2018-07-16 | Paper |
| Light spanners for snowflake metrics | 2018-04-23 | Paper |
| Euclidean Steiner shallow-light trees | 2018-04-23 | Paper |
| The greedy spanner is existentially optimal (extended abstract) | 2017-09-29 | Paper |
| An optimal-time construction of sparse Euclidean spanners with tiny diameter | 2017-09-29 | Paper |
| Euclidean Steiner shallow-light trees | 2017-03-30 | Paper |
| New Doubling Spanners: Better and Simpler | 2017-01-13 | Paper |
| Steiner shallow-light trees are exponentially lighter than spanning ones | 2015-08-18 | Paper |
| Light spanners | 2015-07-31 | Paper |
| From hierarchical partitions to hierarchical covers: optimal fault-tolerant spanners for doubling metrics | 2015-06-26 | Paper |
| Balancing degree, diameter and weight in Euclidean spanners | 2014-12-22 | Paper |
| Sparse Euclidean Spanners with Tiny Diameter | 2014-12-05 | Paper |
| Simple Deterministic Algorithms for Fully Dynamic Maximal Matching | 2014-08-07 | Paper |
| Optimal Euclidean spanners, really short, thin and lanky | 2014-08-07 | Paper |
| Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones | 2014-07-30 | Paper |
| Light spanners | 2014-07-01 | Paper |
| Orienting fully dynamic graphs with worst-case time bounds | 2014-07-01 | Paper |
| New Doubling Spanners: Better and Simpler | 2013-08-06 | Paper |
| The MST of symmetric disk graphs (in arbitrary metric spaces) is light | 2012-08-22 | Paper |
| The tower of Hanoi problem on Path\(_h\) graphs | 2012-06-18 | Paper |
| Narrow-Shallow-Low-Light Trees with and without Steiner Points | 2011-10-27 | Paper |
| The MST of symmetric disk graphs (in arbitrary metric spaces) is light | 2011-08-12 | Paper |
| Balancing degree, diameter and weight in Euclidean spanners | 2010-09-06 | Paper |
| Low-light trees, and tight lower bounds for Euclidean spanners | 2010-05-21 | Paper |
| Narrow-Shallow-Low-Light Trees with and without Steiner Points | 2009-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3536764 | 2008-11-21 | Paper |
| Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules | 2008-04-24 | Paper |
| On Optimal Solutions for the Bottleneck Tower of Hanoi Problem | 2008-03-07 | Paper |
