| Publication | Date of Publication | Type |
|---|
| Brief Announcement: Local Problems in the SUPPORTED Model | 2024-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6152158 | 2024-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6192471 | 2024-02-12 | Paper |
| The parameterized complexity of guarding almost convex polygons | 2024-02-09 | Paper |
| Parameterized complexity of minimum membership dominating set | 2023-11-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6068235 | 2023-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059159 | 2023-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059946 | 2023-11-02 | Paper |
| Polynomial Kernel for Interval Vertex Deletion | 2023-10-23 | Paper |
| Recognizing well-dominated graphs is coNP-complete | 2023-10-12 | Paper |
| Erdős–Pósa property of obstructions to interval graphs | 2023-10-09 | Paper |
| Parameterized complexity of perfectly matched sets | 2023-05-02 | Paper |
| Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems | 2023-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875604 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875640 | 2023-02-03 | Paper |
| Parameterized Analysis of Art Gallery and Terrain Guarding | 2022-10-19 | Paper |
| Parameterized complexity of maximum edge colorable subgraph | 2022-10-06 | Paper |
| Distance from triviality 2.0: hybrid parameterizations | 2022-08-30 | Paper |
| Fast exact algorithms for survivable network design with uniform requirements | 2022-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091159 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092396 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088932 | 2022-07-18 | Paper |
| Parameterized complexity of minimum membership dominating set | 2022-07-13 | Paper |
| A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs | 2022-04-20 | Paper |
| Parameter analysis for guarding terrains | 2022-03-22 | Paper |
| Fine-grained complexity of rainbow coloring and its variants | 2021-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005155 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009476 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009491 | 2021-08-04 | Paper |
| Parameterized complexity of \textsc{maximum edge colorable subgraph} | 2021-04-21 | Paper |
| Simultaneous feedback edge set: a parameterized perspective | 2021-03-26 | Paper |
| Paths to trees and cacti | 2021-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136298 | 2020-11-25 | Paper |
| Parameterized complexity of happy coloring problems | 2020-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3304101 | 2020-08-05 | Paper |
| Quadratic vertex kernel for split vertex deletion | 2020-08-03 | Paper |
| Path Contraction Faster than $2^n$ | 2020-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111860 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111276 | 2020-05-26 | Paper |
| Parameterized complexity of conflict-free matchings and paths | 2020-05-21 | Paper |
| Quadratic vertex kernel for split vertex deletion | 2020-02-06 | Paper |
| Simultaneous Feedback Vertex Set | 2019-12-16 | Paper |
| Split Contraction | 2019-12-16 | Paper |
| Interval Vertex Deletion Admits a Polynomial Kernel | 2019-10-15 | Paper |
| Parameterised algorithms for deletion to classes of DAGs | 2019-09-05 | Paper |
| Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion | 2019-03-28 | Paper |
| Hitting and covering partially | 2018-10-04 | Paper |
| Kernelization of Cycle Packing with Relaxed Disjointness Constraints | 2018-07-18 | Paper |
| Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion | 2018-07-16 | Paper |
| On the parameterized complexity of happy vertex coloring | 2018-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636486 | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636487 | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636602 | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4634385 | 2018-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601856 | 2018-01-24 | Paper |
| Critical node cut parameterized by treewidth and solution size is \(W[1\)-hard] | 2018-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598162 | 2017-12-19 | Paper |
| Kernels for deletion to classes of acyclic digraphs | 2017-11-14 | Paper |
| Fast exact algorithms for survivable network design with uniform requirements | 2017-09-22 | Paper |
| Paths to Trees and Cacti | 2017-07-21 | Paper |
| A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion | 2016-05-03 | Paper |
| Vertex Cover Gets Faster and Harder on Low Degree Graphs | 2014-09-26 | Paper |
