We present a fixed-parameter tractable algorithm for first-order model
c...
Matching minors are a specialisation of minors fit for the study of grap...
The canonical tree-decomposition theorem, given by Robertson and Seymour...
We introduce differential games for FO logic of graphs, a variant of
Ehr...
We study the model-checking problem for first- and monadic second-order ...
The notion of bounded expansion captures uniform sparsity of graph class...