| Publication | Date of Publication | Type |
|---|
| Placing green bridges optimally, with a multivariate analysis | 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 | 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 s‐t‐path problem | 2023-11-13 | Paper |
| Multistage \(s-t\) path: confronting similarity with dissimilarity | 2023-06-28 | Paper |
| A multistage view on 2-satisfiability | 2023-03-22 | Paper |
| Polynomial-time data reduction for weighted problems beyond additive goal functions | 2023-02-22 | Paper |
| Multistage Vertex Cover | 2023-02-03 | Paper |
| As Time Goes By: Reflections on Treewidth for Temporal Graphs | 2022-10-19 | Paper |
| Feedback vertex set on Hamiltonian graphs | 2022-06-08 | Paper |
| Multistage vertex cover | 2022-05-09 | Paper |
| Placing Green bridges optimally, with a multivariate analysis | 2022-03-22 | Paper |
| The Complexity of Finding Small Separators in Temporal Graphs | 2021-08-04 | Paper |
| Diminishable parameterized problems and strict polynomial kernelization | 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 | 2020-02-11 | Paper |
| Temporal graph classes: a view through temporal separators | 2020-01-16 | Paper |
| The complexity of finding small separators in temporal graphs | 2019-11-29 | Paper |
| Polynomial-Time Data Reduction for Weighted Problems Beyond Additive Goal Functions | 2019-10-01 | Paper |
| The parameterized complexity of the minimum shared edges problem | 2019-08-30 | Paper |
| Parameterized aspects of triangle enumeration | 2019-06-25 | Paper |
| When can graph hyperbolicity be computed in linear time? | 2019-05-07 | Paper |
| The complexity of routing with collision avoidance | 2019-05-03 | Paper |
| A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths | 2019-03-06 | Paper |
| The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs | 2019-01-14 | Paper |
| Temporal graph classes: a view through temporal separators | 2018-11-22 | Paper |
| Diminishable parameterized problems and strict polynomial kernelization | 2018-09-06 | Paper |
| Kernelization lower bounds for finding constant-size subgraphs | 2018-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4634388 | 2018-04-10 | Paper |
| Fractals for Kernelization Lower Bounds | 2018-03-26 | Paper |
| The minimum shared edges problem on grid-like graphs | 2018-01-04 | Paper |
| Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems | 2017-12-19 | Paper |
| Parameterized aspects of triangle enumeration | 2017-11-22 | Paper |
| The complexity of routing with few collisions | 2017-11-22 | Paper |
| When can graph hyperbolicity be computed in linear time? | 2017-09-22 | Paper |
| The Parameterized Complexity of the Minimum Shared Edges Problem | 2017-07-13 | Paper |
