
Solving InfiniteDomain CSPs Using the Patchwork Property
The constraint satisfaction problem (CSP) has important applications in ...
read it

Tree pivotminors and linear rankwidth
Treewidth and its linear variant pathwidth play a central role for the...
read it

CliqueWidth: Harnessing the Power of Atoms
Many NPcomplete graph problems are polynomially solvable on graph class...
read it

On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal
Let vc(G), fvs(G) and oct(G), respectively, denote the size of a minimum...
read it

On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest
A graph is Hfree if it contains no induced subgraph isomorphic to H. We...
read it

CliqueWidth for Hereditary Graph Classes
Cliquewidth is a wellstudied graph parameter owing to its use in under...
read it

Graph Isomorphism for (H_1,H_2)free Graphs: An Almost Complete Dichotomy
We consider the Graph Isomorphism problem for classes of graphs characte...
read it

Finding a Small Number of Colourful Components
A partition (V_1,...,V_k) of the vertex set of a graph G with a (not nec...
read it

Cliquewidth and WellQuasiOrdering of TriangleFree Graph Classes
Daligault, Rao and Thomassé asked whether every hereditary graph class t...
read it

Hereditary Graph Classes: When the Complexities of Colouring and Clique Cover Coincide
A graph is (H_1,H_2)free for a pair of graphs H_1,H_2 if it contains no...
read it

Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs
We consider a natural restriction of the List Colouring problem: kRegul...
read it
Konrad K. Dabrowski
is this you? claim profile