| Publication | Date of Publication | Type |
|---|
| Diverse pairs of matchings | 2024-05-30 | Paper |
| Diverse collections in matroids and graphs | 2024-02-21 | Paper |
| Diverse Pairs of Matchings | 2023-11-14 | Paper |
| On computing the Hamiltonian index of graphs | 2023-04-20 | Paper |
| On Computing the Hamiltonian Index of Graphs | 2022-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089217 | 2022-07-18 | Paper |
| Disjoint stable matchings in linear time | 2022-06-08 | Paper |
| Structural parameterizations of clique coloring | 2022-03-25 | Paper |
| Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory | 2022-03-02 | Paper |
| 2-Approximating Feedback Vertex Set in Tournaments | 2022-02-16 | Paper |
| 2-Approximating Feedback Vertex Set in Tournaments | 2021-02-02 | Paper |
| Structural Parameterizations of Clique Coloring | 2020-05-10 | Paper |
| Subset feedback vertex set in chordal and split graphs | 2020-02-06 | Paper |
| Subset feedback vertex set in chordal and split graphs | 2019-08-20 | Paper |
| Point line cover: the easy kernel is essentially tight | 2019-06-20 | Paper |
| Point line cover: the easy kernel is essentially tight | 2018-11-05 | Paper |
| Finding even subgraphs even faster | 2018-09-07 | Paper |
| Raising the bar for \textsc{Vertex Cover}: fixed-parameter tractability above a higher guarantee | 2018-07-16 | Paper |
| Generalized pseudoforest deletion: algorithms and uniform kernel | 2018-04-18 | Paper |
| B-chromatic number: beyond NP-hardness | 2017-09-29 | Paper |
| Finding even subgraphs even faster | 2017-07-13 | Paper |
| Vertex Exponential Algorithms for Connected f-Factors | 2017-04-25 | Paper |
| Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound | 2017-01-26 | Paper |
| On the parameterized complexity of b-\textsc{chromatic number} | 2016-11-14 | Paper |
| Hitting forbidden minors: approximation and kernelization | 2016-03-04 | Paper |
| Generalized pseudoforest deletion: algorithms and uniform kernel | 2015-09-16 | Paper |
| Using patterns to form homogeneous teams | 2015-05-26 | Paper |
| Minimum fill-in of sparse graphs: kernelization and approximation | 2015-03-02 | Paper |
| On the parameterized complexity of vertex cover and edge cover with connectivity constraints | 2014-12-22 | Paper |
| Polynomial kernels for \textsc{Dominating Set} in graphs of bounded degeneracy and beyond | 2014-12-05 | Paper |
| The kernelization complexity of connected domination in graphs with (no) small cycles | 2014-12-02 | Paper |
| A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem | 2014-09-22 | Paper |
| Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound | 2014-06-10 | Paper |
| The effect of homogeneity on the computational complexity of combinatorial data anonymization | 2014-02-19 | Paper |
| Hardness of \(r\)-dominating set on graphs of diameter \((r + 1)\) | 2013-12-10 | Paper |
| Quadratic upper bounds on the Erdős--Pósa property for a generalization of packing and covering cycles | 2013-11-15 | Paper |
| FPT algorithms for connected feedback vertex set | 2012-12-21 | Paper |
| On parameterized independent feedback vertex set | 2012-11-27 | Paper |
| Minimum fill-in of sparse graphs: kernelization and approximation | 2012-08-31 | Paper |
| The effect of girth on the kernelization complexity of connected dominating set | 2012-08-29 | Paper |
| A single-exponential FPT algorithm for the \(K _{4}\)-minor cover problem | 2012-08-14 | Paper |
| Hitting forbidden minors: approximation and kernelization | 2012-01-23 | Paper |
| Algorithmic aspects of dominator colorings in graphs | 2012-01-13 | Paper |
| Dominating set is fixed parameter tractable in claw-free graphs | 2011-12-07 | Paper |
| The effect of homogeneity on the complexity of \(k\)-anonymity | 2011-08-19 | Paper |
| On parameterized independent feedback vertex set | 2011-08-17 | Paper |
| Pattern-Guided Data Anonymization and Clustering | 2011-08-17 | Paper |
| Ranking and drawing in subexponential time | 2011-05-19 | Paper |
| On the Kernelization Complexity of Colorful Motifs | 2010-12-07 | Paper |
| A quartic kernel for pathwidth-one vertex deletion | 2010-11-16 | Paper |
| The curse of connectivity: \(t\)-total vertex (edge) cover | 2010-07-20 | Paper |
| FPT algorithms for connected feedback vertex set | 2010-02-09 | Paper |
| Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels | 2009-10-29 | Paper |
