| Publication | Date of Publication | Type |
|---|
| Using a geometric Lens to find k disjoint shortest paths | 2026-05-12 | Paper |
The complexity of transitively orienting temporal graphs
Journal of Computer and System Sciences | 2025-03-26 | Paper |
| Parameterized algorithmics for time-evolving structures: temporalizing and multistaging | 2024-11-01 | Paper |
| Restless temporal path parameterized above lower bounds | 2024-10-08 | Paper |
Temporal reachability minimization: delaying vs. deleting
Journal of Computer and System Sciences | 2024-07-01 | Paper |
| The PACE 2021 parameterized algorithms and computational experiments challenge: cluster editing | 2024-02-12 | Paper |
Disentangling the computational complexity of network untangling
Theory of Computing Systems | 2024-02-09 | Paper |
| Finding Temporal Paths Under Waiting Time Constraints. | 2023-11-14 | Paper |
| Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs | 2023-11-14 | Paper |
Parameterized Algorithms for Diverse Multistage Problems
(available as arXiv preprint) | 2023-09-20 | Paper |
Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths
SIAM Journal on Discrete Mathematics | 2023-08-11 | Paper |
Temporal Reachability Minimization: Delaying vs. Deleting
(available as arXiv preprint) | 2023-08-08 | Paper |
The Complexity of Transitively Orienting Temporal Graphs
(available as arXiv preprint) | 2023-08-08 | Paper |
Computing maximum matchings in temporal graphs
Journal of Computer and System Sciences | 2023-07-10 | Paper |
Multistage \(s-t\) path: confronting similarity with dissimilarity
Algorithmica | 2023-06-28 | Paper |
Computing maximum matchings in temporal graphs.
(available as arXiv preprint) | 2023-02-07 | Paper |
| Multistage Vertex Cover | 2023-02-03 | Paper |
As Time Goes By: Reflections on Treewidth for Temporal Graphs
Treewidth, Kernels, and Algorithms | 2022-10-19 | Paper |
Data Reduction for Maximum Matching on Real-World Graphs
ACM Journal of Experimental Algorithmics | 2022-09-06 | Paper |
Multistage vertex cover
Theory of Computing Systems | 2022-05-09 | Paper |
A faster parameterized algorithm for temporal matching
Information Processing Letters | 2021-12-14 | Paper |
Finding temporal paths under waiting time constraints
Algorithmica | 2021-09-02 | Paper |
The complexity of finding small separators in temporal graphs
(available as arXiv preprint) | 2021-08-04 | Paper |
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
(available as arXiv preprint) | 2021-08-04 | Paper |
Representative families for matroid intersections, with applications to location, packing, and covering problems
Discrete Applied Mathematics | 2021-05-31 | Paper |
| Interference-free Walks in Time: Temporally Disjoint Paths | 2021-05-18 | Paper |
Fixed-parameter algorithms for maximum-profit facility location under matroid constraints
(available as arXiv preprint) | 2020-02-06 | Paper |
Temporal graph classes: a view through temporal separators
Theoretical Computer Science | 2020-01-16 | Paper |
The complexity of finding small separators in temporal graphs
Journal of Computer and System Sciences | 2019-11-29 | Paper |
Temporal graph classes: a view through temporal separators
Lecture Notes in Computer Science | 2018-11-22 | Paper |
On the computational complexity of variants of combinatorial voter control in elections
Lecture Notes in Computer Science | 2017-05-19 | Paper |
