research
∙
02/15/2022
The treewidth and pathwidth of graph unions
For two graphs G_1 and G_2 on the same vertex set [n]:={1,2, …, n}, and ...
share
research
∙
07/15/2020
Rankwidth meets stability
We study two notions of being well-structured for classes of graphs that...
research
∙
11/15/2019
Linear rankwidth meets stability
Classes with bounded rankwidth are MSO-transductions of trees and classe...
research
∙
09/04/2019
Classes of graphs with low complexity: the case of classes with bounded linear rankwidth
Classes with bounded rankwidth are MSO-transductions of trees and classe...
research
∙
02/04/2019
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs
A connected graph G is called matching covered if every edge of G is con...
research
∙
12/18/2018
Model-Checking on Ordered Structures
We study the model-checking problem for first- and monadic second-order ...
research
∙
02/27/2018
