| Publication | Date of Publication | Type |
|---|
| On the (in)approximability of the monitoring edge geodetic set problem | 2026-10-01 | Paper |
| Temporal queries for dynamic temporal forests | 2026-06-08 | Paper |
| Graph spanners for group Steiner distances | 2026-05-26 | Paper |
On the approximability of graph visibility problems
Theoretical Computer Science | 2026-02-27 | Paper |
Uniform-budget solo chess with only rooks or only knights is hard
Theoretical Computer Science | 2025-11-10 | Paper |
| Sparse temporal spanners with low stretch | 2025-06-19 | Paper |
Finding diameter-reducing shortcuts in trees
Journal of Computer and System Sciences | 2025-05-07 | Paper |
| On the approximability of graph visibility problems | 2025-04-15 | Paper |
| Single-source shortest p-disjoint paths: fast computation and sparse preservers | 2024-04-23 | Paper |
Blackout-tolerant temporal spanners
Journal of Computer and System Sciences | 2024-01-22 | Paper |
Finding diameter-reducing shortcuts in trees
Lecture Notes in Computer Science | 2024-01-16 | Paper |
| Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees | 2024-01-15 | Paper |
Blackout-tolerant temporal spanners
Algorithmics of Wireless Networks | 2023-08-04 | Paper |
Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees
Algorithmica | 2023-06-05 | Paper |
| Cutting bamboo down to size | 2023-02-07 | Paper |
| scientific article; zbMATH DE number 7650297 (Why is no real title available?) | 2023-02-03 | Paper |
New approximation algorithms for the heterogeneous weighted delivery problem
Theoretical Computer Science | 2022-09-16 | Paper |
Optimal sorting with persistent comparison errors
(available as arXiv preprint) | 2022-05-11 | Paper |
| Resilient Dictionaries for Randomly Unreliable Memory | 2022-05-11 | Paper |
New approximation algorithms for the heterogeneous weighted delivery problem
Structural Information and Communication Complexity | 2022-03-22 | Paper |
Cutting bamboo down to size
Theoretical Computer Science | 2022-03-01 | Paper |
Multiple-edge-fault-tolerant approximate shortest-path trees
Algorithmica | 2022-02-01 | Paper |
Approximate minimum selection with unreliable comparisons
Algorithmica | 2022-02-01 | Paper |
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
(available as arXiv preprint) | 2020-11-25 | Paper |
Sorting with Recurrent Comparison Errors
(available as arXiv preprint) | 2020-11-25 | Paper |
Tracking routes in communication networks
Theoretical Computer Science | 2020-10-21 | Paper |
Tracks from hell -- when finding a proof may be easier than checking it
Theoretical Computer Science | 2020-09-03 | Paper |
| Tracks from hell -- when finding a proof may be easier than checking it | 2020-08-11 | Paper |
| On the complexity of Two Dots for narrow boards and few colors | 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
Theory of Computing Systems | 2020-04-15 | Paper |
An improved algorithm for computing all the best swap edges of a tree spanner
Algorithmica | 2020-04-09 | Paper |
Tracking routes in communication networks
Structural Information and Communication Complexity | 2020-03-03 | Paper |
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
Trainyard is NP-hard
Theoretical Computer Science | 2018-11-23 | Paper |
Trainyard is NP-hard
Theoretical Computer Science | 2018-11-23 | Paper |
Fault-tolerant approximate shortest-path trees
Algorithmica | 2018-10-18 | Paper |
No truthful mechanism can be better than n approximate for two natural problems
Games and Economic Behavior | 2018-10-12 | Paper |
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges
(available as arXiv preprint) | 2018-04-12 | Paper |
Compact and fast sensitivity oracles for single-source distances
(available as arXiv preprint) | 2018-03-02 | Paper |
Multiple-edge-fault-tolerant approximate shortest-path trees
(available as arXiv preprint) | 2018-01-24 | Paper |
| Trainyard is NP-hard | 2017-07-17 | Paper |
Large peg-army maneuvers
(available as arXiv preprint) | 2017-07-17 | Paper |
Exact and approximate algorithms for movement problems on (special classes of) graphs
Theoretical Computer Science | 2016-11-04 | Paper |
Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: new algorithms and experiments
ACM Journal of Experimental Algorithmics | 2016-10-24 | Paper |
Path-fault-tolerant approximate shortest-path trees
Structural Information and Communication Complexity | 2016-01-08 | Paper |
A Faster Computation of All the Best Swap Edges of a Tree Spanner
Structural Information and Communication Complexity | 2016-01-08 | Paper |
Improved purely additive fault-tolerant spanners
Algorithms - ESA 2015 | 2015-11-19 | Paper |
The max-distance network creation game on general host graphs
Theoretical Computer Science | 2015-02-24 | Paper |
Specializations and generalizations of the Stackelberg minimum spanning tree game
Theoretical Computer Science | 2014-12-02 | Paper |
Fault-tolerant approximate shortest-path trees
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Network creation games with traceroute-based strategies
Structural Information and Communication Complexity | 2014-08-07 | Paper |
Dynamically maintaining shortest path trees under batches of updates
Structural Information and Communication Complexity | 2013-12-17 | Paper |
Exact and approximate algorithms for movement problems on (special classes of) graphs
Structural Information and Communication Complexity | 2013-12-17 | Paper |
The max-distance network creation game on general host graphs
Lecture Notes in Computer Science | 2013-04-11 | Paper |
