Name
Affiliation
Papers
BRUNO COURCELLE
LaBRI (CNRS, URA 1304) Bordeaux–1 University 33405-Talence, FRANCE
145
Collaborators
Citations 
PageRank 
49
3418
388.00
Referers 
Referees 
References 
2189
720
1576
Search Limit
1001000
Title
Citations
PageRank
Year
Order-theoretic Trees: Monadic Second-order Descriptions and Regularity00.342022
On quasi-planar graphs: Clique-width and logical description00.342020
Grammars and clique-width bounds from split decompositions00.342020
Fly-automata for checking MSO2 graph properties.00.342018
From tree-decompositions to clique-width terms.20.352018
Algebraic and logical descriptions of generalized trees.00.342017
Several notions of rank-width for countable graphs00.342017
Computations by fly-automata beyond monadic second-order logic.70.532016
Fly-automata for checking monadic second-order properties of graphs of bounded tree-width20.362015
Fly-automata for checking MSO 2 graph properties.00.342015
Regularity Equals Monadic Second-Order Definability for Quasi-trees.10.352015
Clique-width and edge contraction80.452014
Model-Checking by Infinite Fly-Automata.30.412013
On the model-checking of monadic second-order formulas with edge set quantifications150.762012
Book: Graph Structure and Monadic Second-Order Logic. A Language-Theoretic Approach.321.092012
Automata for the verification of monadic second-order graph properties.130.812012
Automata for monadic second-order model-checking00.342011
On the Monadic Second-Order Transduction Hierarchy40.462010
Constrained-Path Labellings on Graphs of Bounded Clique-Width50.402010
Graph operations characterizing rank-width100.532009
Linear delay enumeration and monadic second-order logic250.972009
Compact labelings for efficient first-order model-checking00.342008
Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects40.462008
Quantifier-free definable graph operations preserving recognizability00.342008
Compact forbidden-set routing160.712007
Graph operations characterizing rank-width and balanced graph expressions120.632007
Vertex-minors, monadic second-order logic, and a conjecture by Seese371.472007
A multivariate interlace polynomial60.572007
The monadic second-order logic of graphs XV: On a conjecture by D. Seese150.712006
The monadic second-order logic of graphs XVI : Canonical graph decompositions70.452005
The recognizability of sets of graphs is a robust property180.842005
The modular decomposition of countable graphs: constructions in monadic second-order logic30.432005
Recognizable sets of graphs, hypergraphs and relational structures: a survey60.452004
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications241.112003
A Monadic Second-Order Definition of the Structure of Convex Hypergraphs20.362002
The evaluation of first-order substitution is monadic second-order compatible40.862002
Workshop on Logic, Graph Transformations and Discrete Structures00.342002
Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations00.342002
Upper bounds to the clique width of graphs29610.662000
Graph operations and monadic second-order logic: a survey30.442000
The monadic second-order logic of graphs XII: planar graphs and planar maps130.772000
Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas00.341999
Facial Circuits of Planar Graphs and Context-Free Languages20.351998
Monadic second-order logic, graph coverings and unfoldings of transition systems261.711998
Finite Model Theory, Universal Algebra and Graph Grammars00.341997
The monadic second-order logic of graphs X: linear orderings331.921996
Equivalent Definitions of Recognizability for Sets of Graphs of Bounded Tree-Width50.491996
On the Expression of Graph Properties in some Fragments of Monadic Second-Order Logic120.981996
Mineurs d'arbres avec racines10.371995
Logic and Graphs00.341995
  • 1
  • 2