Access content directly

Bruno Courcelle

59
Documents

Publications

Image document

Induced betweenness in order-theoretic trees

Bruno Courcelle
Discrete Mathematics and Theoretical Computer Science, 2022, vol. 23 no. 2, special issue in honour of Maurice Pouzet, ⟨10.46298/dmtcs.7288⟩
Journal articles hal-03175157v5
Image document

Betweenness of partial orders

Bruno Courcelle
RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2020, 54, pp.7. ⟨10.1051/ita/2020007⟩
Journal articles hal-03078856v1
Image document

Grammars and clique-width bounds from split decompositions

Bruno Courcelle
Discrete Applied Mathematics, In press, ⟨10.1016/j.dam.2019.07.001⟩
Journal articles hal-02093211v2
Image document

From tree-decompositions to clique-width terms

Bruno Courcelle
Discrete Applied Mathematics, 2018
Journal articles hal-01398972v1
Image document

On quasi-planar graphs : clique-width and logical description

Bruno Courcelle
Discrete Applied Mathematics, 2018, ⟨10.1016/j.dam.2018.07.022⟩
Journal articles hal-01735820v2
Image document

Algebraic and logical descriptions of generalized trees

Bruno Courcelle
Logical Methods in Computer Science, 2017, 13 (3), pp.Article 7
Journal articles hal-01299077v3
Image document

Several notions of rank-width for countable graphs

Bruno Courcelle
Journal of Combinatorial Theory, Series B, 2017, 123, pp.186-214
Journal articles hal-00957618v1
Image document

Computations by fly-automata beyond monadic second-order logic

Bruno Courcelle , Irène Durand
Theoretical Computer Science, 2016, 619, pp.32-67
Journal articles hal-00828211v2
Image document

A characterisation of clique-width through nested partitions

Bruno Courcelle , Pinar Heggernes , Daniel Meister , Charis Papadopoulos , Udi Rotics et al.
Discrete Applied Mathematics, 2015, 187, pp.70-81
Journal articles hal-01022109v1
Image document

Clique-width and edge contraction

Bruno Courcelle
Information Processing Letters, 2014, 114 (1-2), pp.42-44
Journal articles hal-00838630v2
Image document

Monadic second-order definable graph orderings

Achim Blumensath , Bruno Courcelle
Logical Methods in Computer Science, 2014, 10 (1-2), pp.1-36
Journal articles hal-00649990v1
Image document

Automata for the verification of monadic second-order graph properties

Bruno Courcelle , Irène A. Durand
Journal of Applied Logic, 2012, 10, pp.368-409
Journal articles hal-00611853v2
Image document

On the model-checking of monadic second-order formulas with edge set quantifications.

Bruno Courcelle
Discrete Applied Mathematics, 2012, 160, pp.866-887. ⟨10.1016/j.dam.2010.12.017⟩
Journal articles hal-00481735v2

Compact labelings for efficient first-order model-checking

Bruno Courcelle , Cyril Gavoille , Mamadou Moustapha Kanté
J. Comb. Optim., 2011, 21, pp.19--46. ⟨10.1007/s10878-009-9260-7⟩
Journal articles hal-02083537v1
Image document

Compact Labelings For Efficient First-Order Model-Checking

Bruno Courcelle , Cyril Gavoille , Mamadou Moustapha Kanté
Journal of Combinatorial Optimization, 2011, 21 (1), pp.19--46
Journal articles hal-00342668v1

Constrained-path labellings on graphs of bounded clique-width

Bruno Courcelle , Andrew Twigg
Theory of Computing Systems, 2010, 47, pp.531-567
Journal articles hal-00512618v1
Image document

On the monadic second-order transduction hierarchy

Achim Blumensath , Bruno Courcelle
Logical Methods in Computer Science, 2010, 6 (2), pp.1-28
Journal articles hal-00287223v3

Graph operations characterizing rank-width

Bruno Courcelle , Mamadou Moustapha Kanté
Discrete Applied Mathematics, 2009, 157, pp.627-640. ⟨10.1016/j.dam.2008.08.026⟩
Journal articles hal-00334159v1

Linear delay enumeration and monadic second-order logic

Bruno Courcelle
Discrete Applied Mathematics, 2009, 157, pp.2675-2700. ⟨10.1016/j.dam.2008.08.021⟩
Journal articles hal-00333846v1

The modular decomposition of countable graphs. Definition and construction in monadic second-order logic

Bruno Courcelle , Christian Delhommé
Theoretical Computer Science, 2008, 394 (1-2), pp.1-38. ⟨10.1016/j.tcs.2007.10.046⟩
Journal articles hal-01186190v1

Circle graphs and monadic second-order logic

Bruno Courcelle
Journal of Applied Logic, 2008, 6, pp.416-442
Journal articles hal-00333840v1

Connectivity check in 3-connected planar graphs with obstacles

Bruno Courcelle , Cyril Gavoille , Mamadou Moustapha Kanté , Andrew Twigg
Electronic Notes in Discrete Mathematics, 2008, 31, pp.151-155. ⟨10.1016/j.endm.2008.06.030⟩
Journal articles hal-00333863v1
Image document

A multivariate interlace polynomial

Bruno Courcelle
The Electronic Journal of Combinatorics, 2008, 15 (1), pp.R69
Journal articles hal-00128622v2
Image document

The modular decomposition of countable graphs : Definition and construction in monadic second-order logic

Bruno Courcelle , Christian Delhommé
Theoretical Computer Science, 2008, 394, pp.1-38
Journal articles hal-00288222v1

Compact Labelings For Efficient First-Order Model-Checking

Bruno Courcelle , Cyril Gavoille , Mamadou Moustapha Kanté
CoRR, 2008, abs/0811.4713
Journal articles hal-02083559v1

Vertex-minors, monadic second-order logic, and a conjecture by Seese

Bruno Courcelle , Sang-Il Oum
Journal of Combinatorial Theory, Series B, 2007, 97, pp.91-126. ⟨10.1016/j.jctb.2006.04.003⟩
Journal articles hal-00334147v1

Recognizability, hypergraph operations, and logical types

Bruno Courcelle , Achim Blumensath
Information and Computation, 2006, 204, pp.173-228. ⟨10.1016/j.ic.2005.11.006⟩
Journal articles hal-00334149v1

The monadic second-order logic of graphs XV : On a conjecture by D. Seese

Bruno Courcelle
Journal of Applied Logic, 2006, 4, pp.79-114
Journal articles hal-00334050v1

The monadic second-order logic of graphs XVI : Canonical graph decompositions

Bruno Courcelle
Logical Methods in Computer Science, 2006, 2, pp.1-46
Journal articles hal-00334069v1
Image document

The recognizability of sets of graphs is a robust property

Bruno Courcelle , Pascal Weil
Theoretical Computer Science, 2005, 342, pp.173-228
Journal articles hal-00096607v1

Coverings and minors: application to local computations in graphs

Bruno Courcelle , Yves Métivier
European Journal of Combinatorics, 1994, 15, pp.127-138
Journal articles hal-00332773v1

Coverings and minors: application to local computations in graphs

Bruno Courcelle , Yves Métivier
European Journal of Combinatorics, 1994, 15, pp.127-138
Journal articles hal-00307036v1
Image document

Betweenness in order-theoretic trees

Bruno Courcelle
Journées sur les Arithmétiques Faibles, May 2020, Fontainebleau, France
Conference papers hal-02497172v1

Model-checking by infinite fly-automata

Bruno Courcelle , Irène A. Durand
5th Conference on Algebraic Informatics, Sep 2013, Porquerolles, France. pp.211-222
Conference papers hal-00875114v1

Infinite transducers on terms denoting graphs

Bruno Courcelle , Irène Durand
European Lisp Symposium, Jun 2013, Madrid, Spain. pp.47-58
Conference papers hal-00829088v1

Automata for Monadic Second-order model checking

Bruno Courcelle
Reachability Problems, Sep 2011, Genoa, Italy
Conference papers hal-00646520v1

Fly-automata, their properties and applications

Bruno Courcelle , Irène A. Durand
16th International Conference on Implementation and Application of Automata, Jul 2011, Blois, France. pp.264-272
Conference papers hal-00588456v1

Special tree-width and the verification of monadic second-order graph pr operties

Bruno Courcelle
FSTTCS 2010, Dec 2010, Chennai, India
Conference papers hal-00646524v1

Verifying monadic second order graph properties with tree automata

Bruno Courcelle , Irène A. Durand
3rd European Lisp Symposium, May 2010, Lisboa, France. pp.7--21
Conference papers hal-00522586v1

Tractable constructions of finite automata from monadic second-order formula

Bruno Courcelle , Irène A. Durand
Workshop on Logical Approaches to Barriers in Computing and Complexity, Feb 2010, Greifswald, Germany
Conference papers hal-00522591v1

On several proofs of the recognizability theorem

Bruno Courcelle
CAI 2009 : Conference on Algebraic Informatics, May 2009, Thessaloniki, Greece. pp.78-80
Conference papers hal-00401786v1

Monadic second-order logic for graphs : algorithmic and language theoretical applications

Bruno Courcelle
Language Automata Theory and Applications, Apr 2009, Tarragona, Spain. pp.19-22
Conference papers hal-00362832v1

Efficient First-Order Model-Checking Using Short Labels

Bruno Courcelle , Cyril Gavoille , Mamadou Moustapha Kanté
Frontiers in Algorithmics, Second Annual International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceeedings, Jun 2008, Changsha, China. pp.159-170, ⟨10.1007/978-3-540-69311-6_18⟩
Conference papers hal-00333894v1

Graph structure and monadic second-order logic : Language theoretical aspects

Bruno Courcelle
ICALP 2008, 2008, Reykjavik, Iceland. pp.1-13
Conference papers hal-00333842v1

Graph Operations Characterizing Rank-Width and Balanced Graph Expressions

Bruno Courcelle , Mamadou Moustapha Kanté
Graph-Theoretic Concepts in Computer Science, 2007, Dornburg, Germany. pp.66--75, ⟨10.1007/978-3-540-74839-7_7⟩
Conference papers hal-02083560v1

Forbidden-Set Labeling on Graphs

Bruno Courcelle , Cyril Gavoille , Mamadou Moustapha Kanté , Andrew Twigg
2nd Workshop on Locality Preserving Distributed Computing Methods (LOCALITY), Portland, Etats-Unis, Aug 2007, Portland, United States
Conference papers hal-00369662v1

Compact forbidden-set routing

Bruno Courcelle , Andrew Twigg
Proceedings STACS 2007, 2007, Aachen, Germany. pp.37-48
Conference papers hal-00306341v1

Monadic second-order queries on graphs : Vertex labelling for efficient evaluation and linear delay enumeration

Bruno Courcelle
Algorithms and Complexity in Durham, Third Workshop, Durham, England, 2007, Durham, United Kingdom. pp.3-12
Conference papers hal-00334155v1

Graph operations characterizing rank-width and balanced graph expressions

Bruno Courcelle , Mamadou Moustapha Kanté
Proccedings of the 33rd International Workshop on Graphs (WG07), Jun 2007, Germany. pp.66--75
Conference papers hal-00306343v1

The modular decomposition of countable graphs : Constructions in monadic second-order logic

Bruno Courcelle , Christian Delhommé
Computer Science Logic, 2005, Oxford, United Kingdom. pp.325-338
Conference papers hal-00353765v1
Image document

Graph structure and monadic second-order logic. A language-theoretic approach.

Bruno Courcelle , Joost Engelfriet
Cambridge University Press, pp.728, 2012, Encyclopedia of Mathematics and its applications, Vol. 138, 978-0-521-89833-1
Books hal-00646514v1
Image document

The common structure of the curves having a same Gauss word

Bruno Courcelle
A. Adamatzky. Automata, Computation, Universality, Springer, pp.1-37, 2015, Automata, Computation, Universality
Book sections hal-00879514v1

Model Checking with Fly-Automata

Bruno Courcelle , Irène Durand
Encyclopedia of Algorithms, 2015
Book sections hal-01757763v1
Image document

Model Checking with Fly-Automata

Bruno Courcelle , Irène Durand
Ming-Yang Kao Encyclopedia of Algorithms, second edition., Chapitre 20, 2015, 978-3-642-27848-8. ⟨10.1007/978-3-642-27848-8_692-1⟩
Book sections hal-01299432v1

Structuration des graphes et logique

Bruno Courcelle
F. Bayart et E. Charpentier. Leçons de Mathématiques d'Aujourd'hui, Volume 4, Cassini, pp.167-194, 2010, Le sel et le fer
Book sections hal-00560955v1

Program semantics and infinite regular terms

Bruno Courcelle
Y. Bertot et al. From Semantics to Computer Science, Essays in Honour of Gilles Kahn, Cambridge University Press, pp.160-163, 2009
Book sections hal-00354861v1
Image document

Quantifier-free definable graph operations preserving recognizability

Bruno Courcelle
J. Flum, E. Graedel, T. Wilke. Logic and Automata, History and perspectives, Amsterdam University Press, pp.251-260, 2008, Texts in Logic and Games
Book sections hal-00288471v1

Décompositions arborescentes

Bruno Courcelle
Jean-Claude Fournier. Graphes et applications 2, Lavoisier, pp.195-231, 2007
Book sections hal-00306342v1
Image document

Algorithms for equivalence and reduction to minimal form for a class of simple recursive equations

Bruno Courcelle , Gilles Kahn , Jean Vuillemin
Yves Bertot; Gérard Huet; Jean-Jacques Lévy; Gordon Plotkin. From Semantics to Computer Science Essays in Honour of Gilles Kahn, Cambridge University Press 1974, From Semantics to Computer Science Essays in Honour of Gilles Kahn, 9780521518253. ⟨10.1017/CBO9780511770524.009⟩
Book sections hal-01239749v1