We use model-theoretic tools originating from stability theory to derive...
We define new graph parameters, called flip-width, that generalize treew...
A class of graphs 𝒞 is monadically stable if for any unary
expansion 𝒞 o...
An indiscernible sequence (a̅_i)_1≤ i≤ n in a structure is an
ordered se...
We study problems connected to first-order logic in graphs of bounded
tw...
We present a fixed-parameter tractable algorithm for first-order model
c...
We give new decomposition theorems for classes of graphs that can be
tra...
We introduce a new data structure for answering connectivity queries in
...
We prove that every class of graphs 𝒞 that is monadically stable
and has...
We consider hereditary classes of graphs equipped with a total order. We...
We introduce a model of register automata over infinite trees with extre...
We propose an algebraic framework for studying efficient algorithms for ...
We consider a generic algorithmic paradigm that we call progressive
expl...
The notion of bounded expansion captures uniform sparsity of graph class...
We prove that for every class C of graphs with effectively bounded
expan...
We investigate the isomorphism problem in the setting of definable sets
...