| Publication | Date of Publication | Type |
|---|
| An algorithmic framework for locally constrained homomorphisms | 2024-05-08 | Paper |
| On the price of independence for vertex cover, feedback vertex set and odd cycle transversal | 2024-01-23 | Paper |
| Computing pivot-minors | 2023-11-08 | Paper |
| Clique‐width: Harnessing the power of atoms | 2023-11-06 | Paper |
| Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration | 2023-10-04 | Paper |
| Solving infinite-domain CSPs using the patchwork property | 2023-06-19 | Paper |
| An algorithmic framework for locally constrained homomorphisms | 2023-05-05 | Paper |
| Clique-width: harnessing the power of atoms | 2022-12-21 | Paper |
| Finding a Small Number of Colourful Components | 2022-07-18 | Paper |
| Tree Pivot-Minors and Linear Rank-Width | 2022-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005166 | 2021-08-04 | Paper |
| Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy | 2021-04-08 | Paper |
| Clique-width for hereditary graph classes | 2021-02-06 | Paper |
| Independent Feedback Vertex Set for P_5-free Graphs | 2020-11-25 | Paper |
| On cycle transversals and their connected variants in the absence of a small linear forest | 2020-10-12 | Paper |
| Filling the complexity gaps for colouring planar and bounded degree graphs | 2020-07-17 | Paper |
| Clique-Width for Graph Classes Closed under Complementation | 2020-06-09 | Paper |
| Clique-Width: Harnessing the Power of Atoms | 2020-06-05 | Paper |
| Recognizing Graphs Close to Bipartite Graphs | 2020-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111290 | 2020-05-26 | Paper |
| Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy | 2020-01-16 | Paper |
| Clique-width and well-quasi-ordering of triangle-free graph classes | 2019-11-29 | Paper |
| On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal | 2019-10-11 | Paper |
| Hereditary graph classes: When the complexities of <scp>coloring</scp> and <scp>clique cover</scp> coincide | 2019-08-15 | Paper |
| Bounding clique-width via perfect graphs | 2019-06-25 | Paper |
| Independent feedback vertex set for \(P_5\)-free graphs | 2019-04-25 | Paper |
| Graph Isomorphism for $(H_1,H_2)$-free Graphs: An Almost Complete Dichotomy | 2018-11-29 | Paper |
| Computing small pivot-minors | 2018-11-22 | Paper |
| On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph | 2018-09-27 | Paper |
| Well-quasi-ordering versus clique-width: new results on bigenic classes | 2018-07-27 | Paper |
| On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs | 2018-04-04 | Paper |
| Contracting bipartite graphs to paths and cycles | 2018-01-18 | Paper |
| Clique-width and well-quasi-ordering of triangle-free graph classes | 2018-01-04 | Paper |
| Independent feedback vertex sets for graphs of bounded diameter | 2017-12-13 | Paper |
| Colouring Diamond-free Graphs. | 2017-10-17 | Paper |
| Bounding the Clique‐Width of H‐Free Chordal Graphs | 2017-09-26 | Paper |
| Colouring diamond-free graphs | 2017-09-07 | Paper |
| Contracting bipartite graphs to paths and cycles | 2017-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2978505 | 2017-04-25 | Paper |
| On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs | 2017-02-01 | Paper |
| Editing to a planar graph of given degrees | 2016-12-28 | Paper |
| Bounding the clique-width of \(H\)-free split graphs | 2016-11-02 | Paper |
| Bounding the clique-width of \(H\)-free split graphs | 2016-10-14 | Paper |
| Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes | 2016-09-29 | Paper |
| Combinatorics and algorithms for augmenting graphs | 2016-07-28 | Paper |
| Bounding Clique-Width via Perfect Graphs | 2016-04-08 | Paper |
| Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs | 2016-04-04 | Paper |
| Classifying the clique-width of \(H\)-free bipartite graphs | 2016-01-21 | Paper |
| Editing to Eulerian graphs | 2015-12-11 | Paper |
| Editing to a Planar Graph of Given Degrees | 2015-10-20 | Paper |
| Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs | 2015-09-21 | Paper |
| Bounding the Clique-Width of H-free Chordal Graphs | 2015-09-16 | Paper |
| Stable-\(\Pi\) partitions of graphs | 2015-02-06 | Paper |
| Classifying the Clique-Width of H-Free Bipartite Graphs | 2014-09-26 | Paper |
| Colouring of graphs with Ramsey-type forbidden subgraphs | 2014-01-24 | Paper |
| Colouring of Graphs with Ramsey-Type Forbidden Subgraphs | 2013-12-06 | Paper |
| New results on maximum induced matchings in bipartite graphs and beyond | 2013-06-06 | Paper |
| Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number | 2012-09-13 | Paper |
| On factorial properties of chordal bipartite graphs | 2012-08-10 | Paper |
| Colouring vertices of triangle-free graphs without forests | 2012-03-16 | Paper |
| Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes | 2011-05-19 | Paper |
| Colouring Vertices of Triangle-Free Graphs | 2010-11-16 | Paper |
