Order-theoretic Trees: Monadic Second-order Descriptions and Regularity | 0 | 0.34 | 2022 |
On quasi-planar graphs: Clique-width and logical description | 0 | 0.34 | 2020 |
Grammars and clique-width bounds from split decompositions | 0 | 0.34 | 2020 |
Fly-automata for checking MSO2 graph properties. | 0 | 0.34 | 2018 |
From tree-decompositions to clique-width terms. | 2 | 0.35 | 2018 |
Algebraic and logical descriptions of generalized trees. | 0 | 0.34 | 2017 |
Several notions of rank-width for countable graphs | 0 | 0.34 | 2017 |
Computations by fly-automata beyond monadic second-order logic. | 7 | 0.53 | 2016 |
Fly-automata for checking monadic second-order properties of graphs of bounded tree-width | 2 | 0.36 | 2015 |
Fly-automata for checking MSO 2 graph properties. | 0 | 0.34 | 2015 |
Regularity Equals Monadic Second-Order Definability for Quasi-trees. | 1 | 0.35 | 2015 |
Clique-width and edge contraction | 8 | 0.45 | 2014 |
Model-Checking by Infinite Fly-Automata. | 3 | 0.41 | 2013 |
On the model-checking of monadic second-order formulas with edge set quantifications | 15 | 0.76 | 2012 |
Book: Graph Structure and Monadic Second-Order Logic. A Language-Theoretic Approach. | 32 | 1.09 | 2012 |
Automata for the verification of monadic second-order graph properties. | 13 | 0.81 | 2012 |
Automata for monadic second-order model-checking | 0 | 0.34 | 2011 |
On the Monadic Second-Order Transduction Hierarchy | 4 | 0.46 | 2010 |
Constrained-Path Labellings on Graphs of Bounded Clique-Width | 5 | 0.40 | 2010 |
Graph operations characterizing rank-width | 10 | 0.53 | 2009 |
Linear delay enumeration and monadic second-order logic | 25 | 0.97 | 2009 |
Compact labelings for efficient first-order model-checking | 0 | 0.34 | 2008 |
Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects | 4 | 0.46 | 2008 |
Quantifier-free definable graph operations preserving recognizability | 0 | 0.34 | 2008 |
Compact forbidden-set routing | 16 | 0.71 | 2007 |
Graph operations characterizing rank-width and balanced graph expressions | 12 | 0.63 | 2007 |
Vertex-minors, monadic second-order logic, and a conjecture by Seese | 37 | 1.47 | 2007 |
A multivariate interlace polynomial | 6 | 0.57 | 2007 |
The monadic second-order logic of graphs XV: On a conjecture by D. Seese | 15 | 0.71 | 2006 |
The monadic second-order logic of graphs XVI : Canonical graph decompositions | 7 | 0.45 | 2005 |
The recognizability of sets of graphs is a robust property | 18 | 0.84 | 2005 |
The modular decomposition of countable graphs: constructions in monadic second-order logic | 3 | 0.43 | 2005 |
Recognizable sets of graphs, hypergraphs and relational structures: a survey | 6 | 0.45 | 2004 |
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications | 24 | 1.11 | 2003 |
A Monadic Second-Order Definition of the Structure of Convex Hypergraphs | 2 | 0.36 | 2002 |
The evaluation of first-order substitution is monadic second-order compatible | 4 | 0.86 | 2002 |
Workshop on Logic, Graph Transformations and Discrete Structures | 0 | 0.34 | 2002 |
Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations | 0 | 0.34 | 2002 |
Upper bounds to the clique width of graphs | 296 | 10.66 | 2000 |
Graph operations and monadic second-order logic: a survey | 3 | 0.44 | 2000 |
The monadic second-order logic of graphs XII: planar graphs and planar maps | 13 | 0.77 | 2000 |
Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas | 0 | 0.34 | 1999 |
Facial Circuits of Planar Graphs and Context-Free Languages | 2 | 0.35 | 1998 |
Monadic second-order logic, graph coverings and unfoldings of transition systems | 26 | 1.71 | 1998 |
Finite Model Theory, Universal Algebra and Graph Grammars | 0 | 0.34 | 1997 |
The monadic second-order logic of graphs X: linear orderings | 33 | 1.92 | 1996 |
Equivalent Definitions of Recognizability for Sets of Graphs of Bounded Tree-Width | 5 | 0.49 | 1996 |
On the Expression of Graph Properties in some Fragments of Monadic Second-Order Logic | 12 | 0.98 | 1996 |
Mineurs d'arbres avec racines | 1 | 0.37 | 1995 |
Logic and Graphs | 0 | 0.34 | 1995 |