| 2009 | LATA | Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications. | Bruno Courcelle |
| 2008 | FAW | Efficient First-Order Model-Checking Using Short Labels. | Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kant |
| 2008 | ICALP | Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects. | Bruno Courcelle |
| 2007 | STACS | Compact Forbidden-Set Routing. | Bruno Courcelle, Andrew Twigg |
| 2007 | WG | Graph Operations Characterizing Rank-Width and Balanced Graph Expressions. | Bruno Courcelle, Mamadou Moustapha Kant |
| 2005 | CSL | The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic. | Bruno Courcelle, Christian Delhomm |
| 2004 | DLT | Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey. | Bruno Courcelle |
| 2002 | FOSSACS | Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations. | Bruno Courcelle |
| 2000 | LPAR | Graph Operations and Monadic Second-Order Logic: A Survey. | Bruno Courcelle |
| 1998 | MFCS | Facial Circuits of Planar Graphs and Context-Free Languages. | Bruno Courcelle, Denis Lapoire |
| 1998 | WG | Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width. | Bruno Courcelle, Johann A. Makowsky, Udi Rotics |
| 1997 | LFCS | Finite Model Theory, Universal Algebra and Graph Grammars. | Bruno Courcelle |
| 1994 | CSL | Monadic Second-Order Logic and Linear Orderings of Finite Structures. | Bruno Courcelle |
| 1993 | FCT | Context-Free Graph Grammars: Separating Vertex Replacement from Hyperedge Replacement. | Bruno Courcelle |
| 1993 | LICS | Monadic Second-Order Logic and Hypergraph Orientation | Bruno Courcelle |
| 1991 | WG | Monadic Second-Order Evaluations on Tree-Decomposable Graphs. | Bruno Courcelle, Mohamed Mosbah |
| 1990 | LICS | On the Expression of Monadic Second-Order Graph Properties Without Quantifications Over Sets of Edges (Extended Abstract) | Bruno Courcelle |
| 1989 | ICALP | The Definability of Equational Graphs in Monadic Second-Order Logic. | Bruno Courcelle |
| 1989 | MFCS | Monadic Second-Order Logic and Context-Free Graph-Grammars. | Bruno Courcelle |
| 1988 | STACS | An Axiomatic Definition of Context-Free Rewriting and its Application to NLC Graph Grammars. | Bruno Courcelle |
| 1988 | WG | The Monadic Second-Order Logic of Graphs: Definable Sets of Finite Graphs. | Bruno Courcelle |
| 1985 | FOCS | Equivalences and Transformations of Recursive Definitions | Bruno Courcelle |
| 1981 | ICALP | An Axiomatic Approach to the Korenjak-Hopcroft Algorithms. | Bruno Courcelle |
| 1980 | FOCS | On the Expressive Power of Attribute Grammars | Bruno Courcelle, Paul Franchi-Zannettacci |
| 1978 | FOCS | On Recursive Equations Having a Unique Solution | Bruno Courcelle |
| 1978 | MFCS | The Algebraic Semantics of Recursive Program Schemes. | Bruno Courcelle, Maurice Nivat |
| 1977 | ICALP | On the Definition of Classes of Interpretations. | Bruno Courcelle |
| 1976 | FOCS | Algebraic Families of Interpretations | Bruno Courcelle, Maurice Nivat |
| 1976 | ICALP | Program Equivalence and Canonical Forms in Stable Discrete Interpretations. | Grard Berry, Bruno Courcelle |
| 1974 | FOCS | Recursive Schemes, Algebraic Trees and Deterministic Languages | Bruno Courcelle |
| 1974 | ICALP | Algorithmes d'equivalence et de reduction a des expressions minimales dans une classe d'equations recursives simples. | Bruno Courcelle, Gilles Kahn, Jean Vuillemin |
| 1974 | STOC | Semantics and Axiomatics of a Simple Recursive Language | Bruno Courcelle, Jean Vuillemin |