Bruno Courcelle

ORCID

Publication Activity (10 Years)

Years Active: 1974-2022
Publications (10 Years): 20

Top Venues

CoRR

Discret. Appl. Math.

Log. Methods Comput. Sci.

Fundam. Informaticae

Publications

Bruno Courcelle, Yves Métivier
Unfoldings and coverings of weighted graphs. CoRR (2022)
Bruno Courcelle
Unfoldings and Coverings of Weighted Graphs. Fundam. Informaticae 189 (1) (2022)
Bruno Courcelle
Order-theoretic Trees: Monadic Second-order Descriptions and Regularity. Fundam. Informaticae 186 (1-4) (2022)
Bruno Courcelle
Order-theoretic trees: monadic second-order descriptions and regularity. CoRR (2021)
Bruno Courcelle
Induced betweenness in order-theoretic trees. Discret. Math. Theor. Comput. Sci. 23 (2) (2021)
Bruno Courcelle
Induced betweenness in order-theoretic trees. CoRR (2021)
Bruno Courcelle
Axiomatization of betweenness in order-theoretic trees. Log. Methods Comput. Sci. 17 (1) (2021)
Bruno Courcelle
Axiomatization of betweenness in order-theoretic trees. CoRR (2020)
Bruno Courcelle
Betweenness of partial orders. RAIRO Theor. Informatics Appl. 54 (2020)
Bruno Courcelle
Betweenness in Order-Theoretic Trees. Fields of Logic and Computation III (2020)
Bruno Courcelle
On quasi-planar graphs: Clique-width and logical description. Discret. Appl. Math. 278 (2020)
Bruno Courcelle
Betweenness of partial orders. CoRR (2020)
Bruno Courcelle
Grammars and clique-width bounds from split decompositions. Discret. Appl. Math. 278 (2020)
Bruno Courcelle, Irène Durand, Michael Raskin
A unified algorithm for colouring graphs of bounded clique-width. CoRR (2020)
Bruno Courcelle
Fly-automata for checking MSO2 graph properties. Discret. Appl. Math. 245 (2018)
Bruno Courcelle
From tree-decompositions to clique-width terms. Discret. Appl. Math. 248 (2018)
Bruno Courcelle
Algebraic and logical descriptions of generalized trees. Log. Methods Comput. Sci. 13 (3) (2017)
Bruno Courcelle
Several notions of rank-width for countable graphs. J. Comb. Theory, Ser. B 123 (2017)
Bruno Courcelle
Algebraic and logical descriptions of generalized trees. CoRR (2016)
Bruno Courcelle, Irène Durand
Computations by fly-automata beyond monadic second-order logic. Theor. Comput. Sci. 619 (2016)
Bruno Courcelle
Fly-automata for checking MSO 2 graph properties. CoRR (2015)
Bruno Courcelle
Fly-automata for checking monadic second-order properties of graphs of bounded tree-width. Electron. Notes Discret. Math. 50 (2015)
Bruno Courcelle, Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics
A characterisation of clique-width through nested partitions. Discret. Appl. Math. 187 (2015)
Bruno Courcelle
Regularity Equals Monadic Second-Order Definability for Quasi-trees. Fields of Logic and Computation II (2015)
Bruno Courcelle
Clique-width and edge contraction. Inf. Process. Lett. 114 (1-2) (2014)
Achim Blumensath, Bruno Courcelle
Monadic second-order definable graph orderings. Log. Methods Comput. Sci. 10 (1) (2014)
Bruno Courcelle, Irène Durand
Fly-automata, model-checking and recognizability. CoRR (2014)
Irène Durand, Bruno Courcelle
Infinite Transducers on Terms Denoting Graphs. ELS (2013)
Bruno Courcelle, Irène Durand
Model-Checking by Infinite Fly-Automata. CAI (2013)
Bruno Courcelle
Clique-width and edge contraction. CoRR (2013)
Bruno Courcelle, Irène Durand
Computations by fly-automata beyond monadic second-order logic CoRR (2013)
Bruno Courcelle, Irène Durand
Automata for the verification of monadic second-order graph properties. J. Appl. Log. 10 (4) (2012)
Bruno Courcelle, Joost Engelfriet
Book: Graph Structure and Monadic Second-Order Logic. A Language-Theoretic Approach. Bull. EATCS 108 (2012)
Bruno Courcelle
On the model-checking of monadic second-order formulas with edge set quantifications. Discret. Appl. Math. 160 (6) (2012)
Bruno Courcelle, Irène Durand
Fly-Automata, Their Properties and Applications. CIAA (2011)
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté
Compact labelings for efficient first-order model-checking. J. Comb. Optim. 21 (1) (2011)
Bruno Courcelle
Automata for Monadic Second-Order Model-Checking. RP (2011)
Bruno Courcelle
Special tree-width and the verification of monadic second-order graph pr operties. FSTTCS (2010)
Achim Blumensath, Bruno Courcelle
On the Monadic Second-Order Transduction Hierarchy Log. Methods Comput. Sci. 6 (2) (2010)
Bruno Courcelle, Andrew Twigg
Constrained-Path Labellings on Graphs of Bounded Clique-Width. Theory Comput. Syst. 47 (2) (2010)
Bruno Courcelle, Irène Durand
Verifying Monadic Second Order Graph Properties with Tree Automata. ELS (2010)
Bruno Courcelle, Mamadou Moustapha Kanté
Graph operations characterizing rank-width. Discret. Appl. Math. 157 (4) (2009)
Bruno Courcelle
Linear delay enumeration and monadic second-order logic. Discret. Appl. Math. 157 (12) (2009)
Bruno Courcelle
On Several Proofs of the Recognizability Theorem. CAI (2009)
Bruno Courcelle
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications. LATA (2009)
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté
Compact Labelings For Efficient First-Order Model-Checking CoRR (2008)
Bruno Courcelle
A Multivariate Interlace Polynomial and its Computation for Graphs of Bounded Clique-Width. Electron. J. Comb. 15 (1) (2008)
Bruno Courcelle
Quantifier-free definable graph operations preserving recognizability. Logic and Automata (2008)
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté
Efficient First-Order Model-Checking Using Short Labels. FAW (2008)
Bruno Courcelle
Circle graphs and monadic second-order logic. J. Appl. Log. 6 (3) (2008)
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté, Andrew Twigg
Connectivity check in 3-connected planar graphs with obstacles. Electron. Notes Discret. Math. 31 (2008)
Bruno Courcelle
Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects. ICALP (1) (2008)
Bruno Courcelle, Christian Delhommé
The modular decomposition of countable graphs. Definition and construction in monadic second-order logic. Theor. Comput. Sci. 394 (1-2) (2008)
Bruno Courcelle, Andrew Twigg
Compact Forbidden-Set Routing. STACS (2007)
Bruno Courcelle, Sang-il Oum
Vertex-minors, monadic second-order logic, and a conjecture by Seese. J. Comb. Theory, Ser. B 97 (1) (2007)
Bruno Courcelle, Mamadou Moustapha Kanté
Graph Operations Characterizing Rank-Width and Balanced Graph Expressions. WG (2007)
Bruno Courcelle
A multivariate interlace polynomial CoRR (2007)
Bruno Courcelle
The monadic second-order logic of graphs XVI : Canonical graph decompositions. Log. Methods Comput. Sci. 2 (2) (2006)
Bruno Courcelle, Pascal Weil
The recognizability of sets of graphs is a robust property CoRR (2006)
Achim Blumensath, Bruno Courcelle
Recognizability, hypergraph operations, and logical types. Inf. Comput. 204 (6) (2006)
Bruno Courcelle
The monadic second-order logic of graphs XV: On a conjecture by D. Seese. J. Appl. Log. 4 (1) (2006)
Bruno Courcelle
Graph decompositions definable in monadic second-order logic. Electron. Notes Discret. Math. 22 (2005)
Bruno Courcelle
The monadic second-order logic of graphs XVI : Canonical graph decompositions CoRR (2005)
Bruno Courcelle, Pascal Weil
The recognizability of sets of graphs is a robust property. Theor. Comput. Sci. 342 (2-3) (2005)
Bruno Courcelle, Christian Delhommé
The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic. CSL (2005)
Bruno Courcelle
Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey. Developments in Language Theory (2004)
Bruno Courcelle, David Janin
Workshop on Logic, Graph Transformations, Finite and Infinite Structures. ICGT (2004)
Bruno Courcelle
Clique-width of countable graphs: a compactness property. Discret. Math. 276 (1-3) (2004)
Bruno Courcelle
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications. Theor. Comput. Sci. 299 (1-3) (2003)
Bruno Courcelle, R. Vanicat
Query efficient implementation of graphs of bounded clique-width. Discret. Appl. Math. 131 (1) (2003)
Bruno Courcelle, Pascal Weil
Workshop on Logic, Graph Transformations and Discrete Structures. ICGT (2002)
Bruno Courcelle, Johann A. Makowsky
Fusion in Relational Structures and the Verification of Monadic Second-Order Properties. Math. Struct. Comput. Sci. 12 (2) (2002)
Bruno Courcelle
A Monadic Second-Order Definition of the Structure of Convex Hypergraphs. Inf. Comput. 178 (2) (2002)
Bruno Courcelle, Teodor Knapik
The evaluation of first-order substitution is monadic second-order compatible. Theor. Comput. Sci. 281 (1-2) (2002)
Bruno Courcelle, V. Dussaux
Map Genus, Forbidden Maps, and Monadic Second-Order Logic. Electron. J. Comb. 9 (1) (2002)
Bruno Courcelle
Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations. FoSSaCS (2002)
Bruno Courcelle
Graph Operations, Graph Transformations and Monadic Second-Order Logic: a survey. Electron. Notes Theor. Comput. Sci. 51 (2001)
Bruno Courcelle, Johann A. Makowsky, Udi Rotics
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discret. Appl. Math. 108 (1-2) (2001)
Bruno Courcelle, Stephan Olariu
Upper bounds to the clique width of graphs. Discret. Appl. Math. 101 (1-3) (2000)
Bruno Courcelle
The monadic second-order logic of graphs XIII: Graph drawings with edge crossings. Theor. Comput. Sci. 244 (1-2) (2000)
Bruno Courcelle
Graph Operations and Monadic Second-Order Logic: A Survey. LPAR (2000)
Bruno Courcelle
Clique-width of countable graphs: a compactness property. Electron. Notes Discret. Math. 5 (2000)
Bruno Courcelle, Johann A. Makowsky, Udi Rotics
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width. Theory Comput. Syst. 33 (2) (2000)
Bruno Courcelle
The monadic second-order logic of graphs XII: planar graphs and planar maps. Theor. Comput. Sci. 237 (1-2) (2000)
Bruno Courcelle
Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas. RTA (1999)
Bruno Courcelle
The Monadic Second-Order Logic of Graphs XI: Hierarchical Decompositions of Connected Graphs. Theor. Comput. Sci. 224 (1-2) (1999)
Bruno Courcelle, Igor Walukiewicz
Monadic Second-Order Logic, Graph Coverings and Unfoldings of Transition Systems. Ann. Pure Appl. Log. 92 (1) (1998)
Bruno Courcelle, Denis Lapoire
Facial Circuits of Planar Graphs and Context-Free Languages. MFCS (1998)
Bruno Courcelle, Géraud Sénizergues
The obstructions of a minor-closed set of graphs defined by a context-free grammar. Discret. Math. 182 (1-3) (1998)
Bruno Courcelle, Johann A. Makowsky, Udi Rotics
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width. WG (1998)
Bruno Courcelle, Rodney G. Downey, Michael R. Fellows
A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals. J. Univers. Comput. Sci. 3 (11) (1997)
Bruno Courcelle
Finite Model Theory, Universal Algebra and Graph Grammars. LFCS (1997)
Bruno Courcelle
Basic Notions of Universal Algebra for Language Theory and Graph Grammars. Theor. Comput. Sci. 163 (1&2) (1996)
Bruno Courcelle
On the Expression of Graph Properties in some Fragments of Monadic Second-Order Logic. Descriptive Complexity and Finite Models (1996)
Bruno Courcelle
The Monadic Second-Order Logic of Graphs X: Linear Orderings. Theor. Comput. Sci. 160 (1&2) (1996)
Bruno Courcelle, Jens Lagergren
Equivalent Definitions of Recognizability for Sets of Graphs of Bounded Tree-Width. Math. Struct. Comput. Sci. 6 (2) (1996)
Bruno Courcelle
Structural Properties of Context-Free Sets of Graphs Generated by Vertex Replacement Inf. Comput. 116 (2) (1995)
Bruno Courcelle, Joost Engelfriet
A Logical Characterization of the Sets of Hypergraphs Defined by Hyperedge Replacement Grammars. Math. Syst. Theory 28 (6) (1995)
Bruno Courcelle
Logic and graphs. Electron. Notes Theor. Comput. Sci. 2 (1995)
Bruno Courcelle
The Monadic Second-Order Logic of Graphs VIII: Orientations. Ann. Pure Appl. Log. 72 (2) (1995)

Bruno Courcelle.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Bruno Courcelle