| Publication | Date of Publication | Type |
|---|
| Single-source shortest \(p\)-disjoint paths: fast computation and sparse preservers | 2024-04-23 | Paper |
| Blackout-tolerant temporal spanners | 2024-01-22 | Paper |
| Finding diameter-reducing shortcuts in trees | 2024-01-16 | Paper |
| Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees | 2024-01-15 | Paper |
| Blackout-tolerant temporal spanners | 2023-08-04 | Paper |
| Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees | 2023-06-05 | Paper |
| Cutting bamboo down to size | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875632 | 2023-02-03 | Paper |
| New approximation algorithms for the heterogeneous weighted delivery problem | 2022-09-16 | Paper |
| Resilient Dictionaries for Randomly Unreliable Memory | 2022-05-11 | Paper |
| Optimal sorting with persistent comparison errors | 2022-05-11 | Paper |
| New approximation algorithms for the heterogeneous weighted delivery problem | 2022-03-22 | Paper |
| Cutting bamboo down to size | 2022-03-01 | Paper |
| Multiple-edge-fault-tolerant approximate shortest-path trees | 2022-02-01 | Paper |
| Approximate minimum selection with unreliable comparisons | 2022-02-01 | Paper |
| Sorting with Recurrent Comparison Errors | 2020-11-25 | Paper |
| An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner | 2020-11-25 | Paper |
| Tracking routes in communication networks | 2020-10-21 | Paper |
| Tracks from hell -- when finding a proof may be easier than checking it | 2020-09-03 | Paper |
| On the complexity of Two Dots for narrow boards and few colors | 2020-08-11 | Paper |
| Tracks from hell -- when finding a proof may be easier than checking it | 2020-08-11 | Paper |
| On the PSPACE-completeness of Peg Duotaire and other peg-jumping games | 2020-08-11 | Paper |
| Efficient oracles and routing schemes for replacement paths | 2020-08-05 | Paper |
| Optimal dislocation with persistent errors in subquadratic time | 2020-08-05 | Paper |
| Optimal dislocation with persistent errors in subquadratic time | 2020-04-15 | Paper |
| An improved algorithm for computing all the best swap edges of a tree spanner | 2020-04-09 | Paper |
| Tracking routes in communication networks | 2020-03-03 | Paper |
| Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem | 2019-06-25 | Paper |
| Trainyard is NP-hard | 2018-11-23 | Paper |
| Fault-tolerant approximate shortest-path trees | 2018-10-18 | Paper |
| No truthful mechanism can be better than \(n\) approximate for two natural problems | 2018-10-12 | Paper |
| Effective edge-fault-tolerant single-source spanners via best (or good) swap edges | 2018-04-12 | Paper |
| Compact and fast sensitivity oracles for single-source distances | 2018-03-02 | Paper |
| Multiple-edge-fault-tolerant approximate shortest-path trees | 2018-01-24 | Paper |
| Large peg-army maneuvers | 2017-07-17 | Paper |
| Trainyard is NP-hard | 2017-07-17 | Paper |
| Exact and approximate algorithms for movement problems on (special classes of) graphs | 2016-11-04 | Paper |
| Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: new algorithms and experiments | 2016-10-24 | Paper |
| A Faster Computation of All the Best Swap Edges of a Tree Spanner | 2016-01-08 | Paper |
| Path-fault-tolerant approximate shortest-path trees | 2016-01-08 | Paper |
| Improved purely additive fault-tolerant spanners | 2015-11-19 | Paper |
| The max-distance network creation game on general host graphs | 2015-02-24 | Paper |
| Specializations and generalizations of the Stackelberg minimum spanning tree game | 2014-12-02 | Paper |
| Fault-tolerant approximate shortest-path trees | 2014-10-08 | Paper |
| Network creation games with traceroute-based strategies | 2014-08-07 | Paper |
| Exact and approximate algorithms for movement problems on (special classes of) graphs | 2013-12-17 | Paper |
| Dynamically maintaining shortest path trees under batches of updates | 2013-12-17 | Paper |
| The max-distance network creation game on general host graphs | 2013-04-11 | Paper |
