| Publication | Date of Publication | Type |
|---|
Placing green bridges optimally, with a multivariate analysis
Theory of Computing Systems | 2024-11-12 | Paper |
| Elements of efficient data reduction: fractals, diminishers, weights and neighborhoods | 2024-11-01 | Paper |
| Parameterized algorithms and data reduction for safe convoy routing | 2024-08-27 | Paper |
| Most classic problems remain NP-hard on relative neighborhood graphs and their relatives | 2024-05-27 | Paper |
On approximate data reduction for the Rural Postman Problem: Theory and experiments
Networks | 2023-11-23 | Paper |
| Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs | 2023-11-14 | Paper |
Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem
Networks | 2023-11-13 | Paper |
Multistage \(s-t\) path: confronting similarity with dissimilarity
Algorithmica | 2023-06-28 | Paper |
A multistage view on 2-satisfiability
(available as arXiv preprint) | 2023-03-22 | Paper |
Polynomial-time data reduction for weighted problems beyond additive goal functions
Discrete Applied Mathematics | 2023-02-22 | 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 |
Feedback vertex set on Hamiltonian graphs
(available as arXiv preprint) | 2022-06-08 | Paper |
Multistage vertex cover
Theory of Computing Systems | 2022-05-09 | Paper |
Placing Green bridges optimally, with a multivariate analysis
(available as arXiv preprint) | 2022-03-22 | Paper |
The complexity of finding small separators in temporal graphs
(available as arXiv preprint) | 2021-08-04 | Paper |
Diminishable parameterized problems and strict polynomial kernelization
Computability | 2020-09-08 | Paper |
| On \((1+\varepsilon)\)-approximate data reduction for the Rural Postman problem | 2020-05-19 | Paper |
On the computational complexity of length- and neighborhood-constrained path problems
Information Processing Letters | 2020-02-11 | 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 |
Polynomial-Time Data Reduction for Weighted Problems Beyond Additive Goal Functions
(available as arXiv preprint) | 2019-10-01 | Paper |
The parameterized complexity of the minimum shared edges problem
Journal of Computer and System Sciences | 2019-08-30 | Paper |
Parameterized aspects of triangle enumeration
Journal of Computer and System Sciences | 2019-06-25 | Paper |
When can graph hyperbolicity be computed in linear time?
Algorithmica | 2019-05-07 | Paper |
The complexity of routing with collision avoidance
Journal of Computer and System Sciences | 2019-05-03 | Paper |
A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths
Networks | 2019-03-06 | Paper |
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
Discrete Optimization | 2019-01-14 | Paper |
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
Discrete Optimization | 2019-01-14 | Paper |
Temporal graph classes: a view through temporal separators
Lecture Notes in Computer Science | 2018-11-22 | Paper |
Diminishable parameterized problems and strict polynomial kernelization
(available as arXiv preprint) | 2018-09-06 | Paper |
Kernelization lower bounds for finding constant-size subgraphs
(available as arXiv preprint) | 2018-09-06 | Paper |
| Kernelization lower bounds for finding constant-size subgraphs | 2018-09-06 | Paper |
| Finding secluded places of special interest in graphs | 2018-04-10 | Paper |
Fractals for kernelization lower bounds
SIAM Journal on Discrete Mathematics | 2018-03-26 | Paper |
The minimum shared edges problem on grid-like graphs
(available as arXiv preprint) | 2018-01-04 | Paper |
| Fractals for kernelization lower bounds, with an application to length-bounded cut problems | 2017-12-19 | Paper |
The complexity of routing with few collisions
(available as arXiv preprint) | 2017-11-22 | Paper |
Parameterized aspects of triangle enumeration
Lecture Notes in Computer Science | 2017-11-22 | Paper |
When can graph hyperbolicity be computed in linear time?
Lecture Notes in Computer Science | 2017-09-22 | Paper |
When can graph hyperbolicity be computed in linear time?
Lecture Notes in Computer Science | 2017-09-22 | Paper |
The parameterized complexity of the minimum shared edges problem
(available as arXiv preprint) | 2017-07-13 | Paper |
