| Publication | Date of Publication | Type |
|---|
| Finding d-cuts in probe H-free graphs | 2026-02-26 | Paper |
| Atoms versus avoiding simplicial vertices | 2025-11-11 | Paper |
Almost consistent systems of linear equations
ACM Transactions on Algorithms | 2025-11-03 | Paper |
| Parameterized complexity classification for interval constraints | 2025-09-24 | Paper |
Tree pivot-minors and linear rank-width
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
Independent transversals versus transversals
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
| Almost consistent systems of linear equations | 2024-05-14 | Paper |
An algorithmic framework for locally constrained homomorphisms
SIAM Journal on Discrete Mathematics | 2024-05-08 | Paper |
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal
European Journal of Combinatorics | 2024-01-23 | Paper |
| Computing pivot-minors | 2023-11-08 | Paper |
Clique‐width: Harnessing the power of atoms
Journal of Graph Theory | 2023-11-06 | Paper |
Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration
Journal of Graph Theory | 2023-10-04 | Paper |
Solving infinite-domain CSPs using the patchwork property
Artificial Intelligence | 2023-06-19 | Paper |
An algorithmic framework for locally constrained homomorphisms
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
An algorithmic framework for locally constrained homomorphisms
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
Clique-width: harnessing the power of atoms
(available as arXiv preprint) | 2022-12-21 | Paper |
Finding a small number of colourful components
(available as arXiv preprint) | 2022-07-18 | Paper |
Tree pivot-minors and linear rank-width
SIAM Journal on Discrete Mathematics | 2022-01-07 | Paper |
scientific article; zbMATH DE number 7378380 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-04 | Paper |
Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy
Algorithmica | 2021-04-08 | Paper |
Clique-width for hereditary graph classes
Surveys in Combinatorics 2019 | 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
Algorithmica | 2020-10-12 | Paper |
Filling the complexity gaps for colouring planar and bounded degree graphs
Journal of Graph Theory | 2020-07-17 | Paper |
Clique-width for graph classes closed under complementation
SIAM Journal on Discrete Mathematics | 2020-06-09 | Paper |
Clique-Width: Harnessing the Power of Atoms
(available as arXiv preprint) | 2020-06-05 | Paper |
| Recognizing Graphs Close to Bipartite Graphs | 2020-05-26 | Paper |
| scientific article; zbMATH DE number 7204407 (Why is no real title available?) | 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
Journal of Computer and System Sciences | 2019-11-29 | Paper |
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal
(available as arXiv preprint) | 2019-10-11 | Paper |
Hereditary graph classes: When the complexities of <scp>coloring</scp> and <scp>clique cover</scp> coincide
Journal of Graph Theory | 2019-08-15 | Paper |
Hereditary graph classes: When the complexities of <scp>coloring</scp> and <scp>clique cover</scp> coincide
Journal of Graph Theory | 2019-08-15 | Paper |
Bounding clique-width via perfect graphs
Journal of Computer and System Sciences | 2019-06-25 | Paper |
Bounding clique-width via perfect graphs
Journal of Computer and System Sciences | 2019-06-25 | Paper |
Independent feedback vertex set for P₅-free graphs
Algorithmica | 2019-04-25 | Paper |
Graph Isomorphism for $(H_1,H_2)$-free Graphs: An Almost Complete Dichotomy
(available as arXiv preprint) | 2018-11-29 | Paper |
| Computing small pivot-minors | 2018-11-22 | Paper |
On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
Theoretical Computer Science | 2018-09-27 | Paper |
Well-quasi-ordering versus clique-width: new results on bigenic classes
Order | 2018-07-27 | Paper |
On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs
Information Processing Letters | 2018-04-04 | Paper |
Contracting bipartite graphs to paths and cycles
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
Contracting bipartite graphs to paths and cycles
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
Clique-width and well-quasi-ordering of triangle-free graph classes
Graph-Theoretic Concepts in Computer Science | 2018-01-04 | Paper |
Clique-width and well-quasi-ordering of triangle-free graph classes
Graph-Theoretic Concepts in Computer Science | 2018-01-04 | Paper |
Independent feedback vertex sets for graphs of bounded diameter
Information Processing Letters | 2017-12-13 | Paper |
| Colouring diamond-free graphs | 2017-10-17 | Paper |
Bounding the Clique‐Width of <i>H</i>‐Free Chordal Graphs
Journal of Graph Theory | 2017-09-26 | Paper |
Colouring diamond-free graphs
Journal of Computer and System Sciences | 2017-09-07 | Paper |
Contracting bipartite graphs to paths and cycles
Information Processing Letters | 2017-08-16 | Paper |
| Editing to Eulerian graphs | 2017-04-25 | Paper |
On the (parameterized) complexity of recognizing well-covered (r,)-graphs
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
On the (parameterized) complexity of recognizing well-covered (r,)-graphs
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
Editing to a planar graph of given degrees
Journal of Computer and System Sciences | 2016-12-28 | Paper |
Bounding the clique-width of \(H\)-free split graphs
Discrete Applied Mathematics | 2016-11-02 | Paper |
Bounding the clique-width of \(H\)-free split graphs
Electronic Notes in Discrete Mathematics | 2016-10-14 | Paper |
Well-quasi-ordering versus clique-width: new results on bigenic classes
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Combinatorics and algorithms for augmenting graphs
Graphs and Combinatorics | 2016-07-28 | Paper |
Bounding clique-width via perfect graphs
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Filling the complexity gaps for colouring planar and bounded degree graphs
Lecture Notes in Computer Science | 2016-04-04 | Paper |
Filling the complexity gaps for colouring planar and bounded degree graphs
Lecture Notes in Computer Science | 2016-04-04 | Paper |
Classifying the clique-width of \(H\)-free bipartite graphs
Discrete Applied Mathematics | 2016-01-21 | Paper |
Editing to Eulerian graphs
Journal of Computer and System Sciences | 2015-12-11 | Paper |
Editing to a planar graph of given degrees
Lecture Notes in Computer Science | 2015-10-20 | Paper |
Editing to a planar graph of given degrees
Lecture Notes in Computer Science | 2015-10-20 | Paper |
Clique-width of graph classes defined by two forbidden induced subgraphs
Lecture Notes in Computer Science | 2015-09-21 | Paper |
Clique-width of graph classes defined by two forbidden induced subgraphs
Lecture Notes in Computer Science | 2015-09-21 | Paper |
Bounding the clique-width of \(H\)-free chordal graphs
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Stable-\(\Pi\) partitions of graphs
Discrete Applied Mathematics | 2015-02-06 | Paper |
Classifying the clique-width of \(H\)-free bipartite graphs
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Colouring of graphs with Ramsey-type forbidden subgraphs
Theoretical Computer Science | 2014-01-24 | Paper |
Colouring of graphs with Ramsey-type forbidden subgraphs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
New results on maximum induced matchings in bipartite graphs and beyond
Theoretical Computer Science | 2013-06-06 | Paper |
Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
Journal of Discrete Algorithms | 2012-09-13 | Paper |
On factorial properties of chordal bipartite graphs
Discrete Mathematics | 2012-08-10 | Paper |
Colouring vertices of triangle-free graphs without forests
Discrete Mathematics | 2012-03-16 | Paper |
Parameterized algorithms for the independent set problem in some hereditary graph classes
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Colouring vertices of triangle-free graphs
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
