| Publication | Date of Publication | Type |
|---|
| \( \gamma \)-clustering problems: classical and parametrized complexity | 2024-10-08 | Paper |
| Composing dynamic programming tree-decomposition-based algorithms | 2024-09-17 | Paper |
| An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth | 2024-02-20 | Paper |
| Parameterized complexity of finding a spanning tree with minimum reload cost diameter | 2023-11-15 | Paper |
| Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm | 2023-08-10 | Paper |
| Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree | 2023-05-30 | Paper |
| Contraction Bidimensionality of Geometric Intersection Graphs | 2022-07-20 | Paper |
| Acyclic matchings in graphs of bounded maximum degree | 2022-05-17 | Paper |
| Contraction bidimensionality of geometric intersection graphs | 2022-03-25 | Paper |
| Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory | 2022-03-02 | Paper |
| Minimum reload cost graph factors | 2021-08-05 | Paper |
| A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth | 2021-08-04 | Paper |
| Approximating maximum acyclic matchings by greedy and local search strategies | 2021-04-21 | Paper |
| A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary | 2021-02-02 | Paper |
| Bounding and approximating minimum maximal matchings in regular graphs | 2021-01-27 | Paper |
| Linear programming based approximation for unweighted induced matchings -- breaking the \(\varDelta\) barrier | 2021-01-15 | Paper |
| Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds | 2020-10-28 | Paper |
| Minimum reload cost graph factors | 2020-10-22 | Paper |
| Domination versus edge domination | 2020-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111863 | 2020-05-27 | Paper |
| Contraction-Bidimensionality of Geometric Intersection Graphs | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111862 | 2020-05-27 | Paper |
| Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms | 2020-03-12 | Paper |
| Hitting minors on bounded treewidth graphs. III. Lower bounds | 2020-02-24 | Paper |
| Temporal matching | 2020-01-16 | Paper |
| Approximating maximum uniquely restricted matchings in bipartite graphs | 2019-09-05 | Paper |
| Upper bounds on the uniquely restricted chromatic index | 2019-08-15 | Paper |
| On the number of labeled graphs of bounded treewidth | 2018-05-18 | Paper |
| Ruling out FPT algorithms for weighted coloring on forests | 2018-05-17 | Paper |
| Ruling out FPT algorithms for weighted coloring on forests | 2018-04-09 | Paper |
| Degenerate matchings and edge colorings | 2018-03-21 | Paper |
| Uniquely restricted matchings and edge colorings | 2018-01-04 | Paper |
| On the number of labeled graphs of bounded treewidth | 2018-01-04 | Paper |
| Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees | 2017-10-20 | Paper |
| Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion} | 2017-10-12 | Paper |
| On the parameterized complexity of the edge monitoring problem | 2017-02-21 | Paper |
| Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees | 2016-11-09 | Paper |
| The role of planarity in connectivity problems parameterized by treewidth | 2015-09-15 | Paper |
| The role of planarity in connectivity problems parameterized by treewidth | 2015-01-30 | Paper |
