B. Courcelle

发表

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

Bruno Courcelle, B. Courcelle, 2005, Log. Methods Comput. Sci..

Fundamental properties of infinite trees

B. Courcelle, 1983 .

Upper bounds to the clique width of graphs

Bruno Courcelle, Stephan Olariu, S. Olariu, 2000, Discret. Appl. Math..

Linear delay enumeration and monadic second-order logic

Bruno Courcelle, B. Courcelle, 2009, Discret. Appl. Math..

The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs

Bruno Courcelle, B. Courcelle, 1990, Inf. Comput..

On Recognizable Sets and Tree Automata

B. Courcelle, 1989 .

The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues

Bruno Courcelle, B. Courcelle, 1992, RAIRO Theor. Informatics Appl..

The Monadic Second-Order Logic of Graphs IV: Definability Properties of Equational Graphs

Bruno Courcelle, B. Courcelle, 1990, Ann. Pure Appl. Log..

Algebraic families of interpretations

Bruno Courcelle, Maurice Nivat, M. Nivat, 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

Linear Time Solvable Optimization Problems on Certain Structured Graph Families

B. Courcelle, J. A. M. U. Rotics, 1997 .

A characterisation of clique-width through nested partitions

Bruno Courcelle, Udi Rotics, Pinar Heggernes, 2015, Discret. Appl. Math..

Graph Structure and Monadic Second-Order Logic: Monadic second-order logic

J. Engelfriet, B. Courcelle, 2012 .

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

Bruno Courcelle, Christian Delhommé, B. Courcelle, 2008, Theor. Comput. Sci..

Coverings and Minors: Application to Local Computations in Graphs

Bruno Courcelle, Yves Métivier, B. Courcelle, 1994, Eur. J. Comb..

The Monadic Second-Order Logic of Graphs IX: Machines and their Behaviours

Bruno Courcelle, B. Courcelle, 1995, Theor. Comput. Sci..

Infinite trees in normal form and recursive equations having a unique solution

Bruno Courcelle, B. Courcelle, 1979, Mathematical systems theory.

Forbidden-Set Labeling on Graphs

B. Courcelle, C. Gavoille, Andrew Twigg, 2007 .

Optimal Labeling for Connectivity Checking in Planar Networks with Obstacles

B. Courcelle, C. Gavoille, Andrew Twigg, 2009 .

Graph Structure and Monadic Second-Order Logic, chapters 7-10

B. Courcelle, 2009 .

Fundamental Properties of Infinite Trees

Bruno Courcelle, B. Courcelle, 1983, Theoretical Computer Science.

Monadic second-order transductions of terms and words

B. Courcelle, 2009 .

ЯUSSIAN WORKSHOP ON COMPLEXITY AND MODEL THEORY 9–11 JUNE 2019 ABSTRACTS

E. Grädel, B. Courcelle, 2019 .

The atomic decomposition of strongly connected graphs

B. Courcelle, 2013 .

The Common Structure of the Curves Having a Same Gauss Word

B. Courcelle, 2015 .

European School on Graph Transformation Pullback Rewriting Algebraic Approaches the Logical Expression of Graph Properties and Graph Transformations

B. Courcelle, H. Ehrig, R. Heckel, 2007 .

Forbidden-Set Labeling on Graphs B

B. Courcelle, 2007 .

Recognizable sets of graphs: equivalent definitions and closure properties

Bruno Courcelle, B. Courcelle, 1994, Mathematical Structures in Computer Science.

Attribute Grammars and Recursive Program Schemes I

Bruno Courcelle, Paul Franchi-Zannettacci, B. Courcelle, 1982, Theoretical Computer Science.

Graph-Transformations in Computer Science (Dagstuhl Seminar 9301)

Bruno Courcelle, Hartmut Ehrig, Grzegorz Rozenberg, 2021 .

Program Equivalence and Canonical Forms in Stable Discrete Interpretations

Bruno Courcelle, Gérard Berry, G. Berry, 1976, ICALP.

Order-theoretic trees: monadic second-order descriptions and regularity

B. Courcelle, 2021, Fundam. Informaticae.

Algebraic and Regular Trees

B. Courcelle, 1985 .

On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic

Bruno Courcelle, Johann A. Makowsky, Udi Rotics, 2001, Discret. Appl. Math..

Equational Theories and Equivalences of Programs

J. W. de Bakker, T. Gergely, B. Domolki, 1984 .

Finite Model Theory, Universal Algebra and Graph Grammars

Bruno Courcelle, B. Courcelle, 1997, LFCS.

Mémoire d’habilitation à diriger des recherches Studying Graphs: Structure via Rank-Width, and Listing of Minimal Dominating Sets

M. Habib, B. Courcelle, F. Fomin, 2016 .

Unfoldings and coverings of weighted graphs

B. Courcelle, Yves M'etivier, 2022, 2212.07205.

Graph Structure and Monadic Second-Order Logic: Frontmatter

Bruno Courcelle, Joost Engelfriet, J. Engelfriet, 2012 .

Monadic Second-Order Evaluations on Tree-Decomposable Graphs

Bruno Courcelle, Mohamed Mosbah, B. Courcelle, 1991, Theor. Comput. Sci..

An Axiomatic Definition of Context-Free Rewriting and its Application to NLC Graph Grammars

Bruno Courcelle, B. Courcelle, 1987, Theor. Comput. Sci..

A Monadic Second-Order Definition of the Structure of Convex Hypergraphs

Bruno Courcelle, B. Courcelle, 2002, Inf. Comput..

The Monadic Second-Order Logic of Graphs XI: Hierarchical Decompositions of Connected Graphs

Bruno Courcelle, B. Courcelle, 1999, Theor. Comput. Sci..

The Monadic Second-Order Logic of Graphs V: On Closing the Gap Between Definability and Recognizability

Bruno Courcelle, B. Courcelle, 1991, Theor. Comput. Sci..

Graph expressions and graph rewritings

Bruno Courcelle, Michel Bauderon, B. Courcelle, 1987, Mathematical systems theory.

Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach

Bruno Courcelle, Joost Engelfriet, J. Engelfriet, 2012, Encyclopedia of mathematics and its applications.

on recursive equations having a unique solution

Bruno Courcelle, B. Courcelle, 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

Automata for Monadic Second-Order Model-Checking

Bruno Courcelle, B. Courcelle, 2011, RP.

Compact Forbidden-Set Routing

Bruno Courcelle, Andrew Twigg, B. Courcelle, 2007, STACS.

Graph Rewriting: An Algebraic and Logic Approach

Bruno Courcelle, B. Courcelle, 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

The Monadic Second-Order Logic of Graphs: Definable Sets of Finite Graphs

Bruno Courcelle, B. Courcelle, 1988, WG.

Unfoldings and coverings of weighted graphs

B. Courcelle, Yves M'etivier, 2022, ArXiv.

Program semantics and infinite regular terms

Bruno Courcelle, Jean-Jacques Lévy, Yves Bertot, 2009 .

From Semantics to Computer Science: Algorithms for equivalence and reduction to minimal form for a class of simple recursive equations

Bruno Courcelle, Jean Vuillemin, Gilles Kahn, 1974 .

The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic

Bruno Courcelle, B. Courcelle, 1997, Handbook of Graph Grammars.

Monadic Second-Order Logic, Graphs and Unfoldings of Transition Systems

Bruno Courcelle, Igor Walukiewicz, B. Courcelle, 1995 .

The Monadic Second-order Logic of Graphs VI: On Several Representations of Graphs by Relational Structures

Bruno Courcelle, B. Courcelle, 1995, Discret. Appl. Math..

The Monadic Second order Logic of Graphs VI: on Several Representations of Graphs By Relational Structures

Bruno Courcelle, B. Courcelle, 1994, Discret. Appl. Math..

Semantics and axiomatics of a simple recursive language.

Bruno Courcelle, Jean Vuillemin, J. Vuillemin, 1974, STOC '74.

Circle graphs and monadic second-order logic

Bruno Courcelle, B. Courcelle, 2008, J. Appl. Log..

Recursive Applicative Program Schemes

Bruno Courcelle, B. Courcelle, 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

The Algebraic Semantics of Recursive Program Schemes

Bruno Courcelle, Maurice Nivat, M. Nivat, 1978, MFCS.

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

Bruno Courcelle, B. Courcelle, 2010, FSTTCS.

Completeness Results for the Equivalence of Recursive Schemas

Bruno Courcelle, Jean Vuillemin, J. Vuillemin, 1976, J. Comput. Syst. Sci..

Monadic Second-Order Definable Graph Transductions: A Survey

Bruno Courcelle, B. Courcelle, 1994, Theor. Comput. Sci..

Completions of ordered magmas

Bruno Courcelle, Jean-Claude Raoult, B. Courcelle, 1980, Fundam. Informaticae.

Basic Notions of Universal Algebra for Language Theory and Graph Grammars

Bruno Courcelle, B. Courcelle, 1996, Theor. Comput. Sci..

Model-Checking by Infinite Fly-Automata

Bruno Courcelle, Irène Durand, B. Courcelle, 2013, CAI.

On the Monadic Second-Order Transduction Hierarchy

Bruno Courcelle, Achim Blumensath, B. Courcelle, 2010, Log. Methods Comput. Sci..

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

Bruno Courcelle, Sang-il Oum, B. Courcelle, 2007, J. Comb. Theory, Ser. B.

Connectivity check in 3-connected planar graphs with obstacles

Bruno Courcelle, Cyril Gavoille, Andrew Twigg, 2008, Electron. Notes Discret. Math..

Verifying Monadic Second Order Graph Properties with Tree Automata

Bruno Courcelle, Irène Durand, B. Courcelle, 2010, ELS.

Constrained-Path Labellings on Graphs of Bounded Clique-Width

Bruno Courcelle, Andrew Twigg, B. Courcelle, 2010, Theory of Computing Systems.

The monadic second-order logic of graphs, II: Infinite graphs of bounded width

Bruno Courcelle, B. Courcelle, 1988, Mathematical systems theory.

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

Bruno Courcelle, B. Courcelle, 2017, Discret. Appl. Math..

From tree-decompositions to clique-width terms

Bruno Courcelle, B. Courcelle, 2017, Discret. Appl. Math..

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

Bruno Courcelle, B. Courcelle, 2006, J. Appl. Log..

Query efficient implementation of graphs of bounded clique-width

Bruno Courcelle, R. Vanicat, B. Courcelle, 2003, Discret. Appl. Math..

The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications

Bruno Courcelle, B. Courcelle, 2003, Theor. Comput. Sci..

Clique-width of countable graphs: a compactness property

Bruno Courcelle, B. Courcelle, 2000, Electron. Notes Discret. Math..

Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width

Bruno Courcelle, Johann A. Makowsky, Udi Rotics, 2000, Theory of Computing Systems.

Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width

Bruno Courcelle, Johann A. Makowsky, Udi Rotics, 1998, WG.

An algebraic theory of graph reduction

Bruno Courcelle, Andrzej Proskurowski, Detlef Seese, 1990, JACM.

Graph Structure and Monadic Second-Order Logic: Overview

Bruno Courcelle, Joost Engelfriet, J. Engelfriet, 2012 .

The Monadic Second-Order Logic of Graphs X: Linear Orderings

Bruno Courcelle, B. Courcelle, 1996, Theor. Comput. Sci..

Handle-Rewriting Hypergraph Grammars

Bruno Courcelle, Joost Engelfriet, Grzegorz Rozenberg, 1993, J. Comput. Syst. Sci..

The Monadic Second-Order Logic of Graphs VII: Graphs as Relational Structures

Bruno Courcelle, B. Courcelle, 1992, Theor. Comput. Sci..

A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals

Bruno Courcelle, Michael R. Fellows, Rodney G. Downey, 1997, J. Univers. Comput. Sci..

Graph operations characterizing rank-width

Bruno Courcelle, Mamadou Moustapha Kanté, B. Courcelle, 2009, Discret. Appl. Math..

Graph grammars, monadic second-order logic and the theory of graph minors

Bruno Courcelle, B. Courcelle, 1991, Graph Structure Theory.

The recognizability of sets of graphs is a robust property pdf

Bruno Courcelle, Pascal Weil, B. Courcelle, 2005, Theor. Comput. Sci..

Fundamental Properties of Infinite Trees

Bruno Courcelle, B. Courcelle, 1983, Theor. Comput. Sci..

On Constructing Obstruction Sets of Words

Bruno Courcelle, B. Courcelle, 1991, Bull. EATCS.

Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects

Bruno Courcelle, B. Courcelle, 2008, ICALP.

Graph Operations Characterizing Rank-Width and Balanced Graph Expressions

Bruno Courcelle, Mamadou Moustapha Kanté, B. Courcelle, 2007, WG.

A Representation of Trees by Languages I

Bruno Courcelle, B. Courcelle, 1978, Theor. Comput. Sci..

A Representation of Trees by Languages II

Bruno Courcelle, B. Courcelle, 1978, Theor. Comput. Sci..

A representation of graphs by algebraic expressions and its use for graph rewriting systems

Bruno Courcelle, B. Courcelle, 1986, Graph-Grammars and Their Application to Computer Science.

Fly-automata for checking MSO 2 graph properties

Bruno Courcelle, B. Courcelle, 2015, Discret. Appl. Math..

Automata for the verification of monadic second-order graph properties

Bruno Courcelle, Irène Durand, B. Courcelle, 2012, J. Appl. Log..

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

Bruno Courcelle, B. Courcelle, 2012, Discret. Appl. Math..

Map Genus, Forbidden Maps, and Monadic Second-Order Logic

Bruno Courcelle, V. Dussaux, B. Courcelle, 2002, Electron. J. Comb..

The monadic second-order logic of graphs XII: planar graphs and planar maps

Bruno Courcelle, B. Courcelle, 2000, Theor. Comput. Sci..

Facial Circuits of Planar Graphs and Context-Free Languages

Bruno Courcelle, Denis Lapoire, B. Courcelle, 1998, MFCS.

The obstructions of a minor-closed set of graphs defined by a context-free grammar

Bruno Courcelle, Géraud Sénizergues, B. Courcelle, 1998, Discret. Math..

Equivalent definitions of recognizability for sets of graphs of bounded tree-width

Bruno Courcelle, Jens Lagergren, B. Courcelle, 1996, Mathematical Structures in Computer Science.

A Logical Characterization of the Sets of Hypergraphs Defined by Hyperedge Replacement Grammars

Bruno Courcelle, Joost Engelfriet, J. Engelfriet, 1995, Math. Syst. Theory.

The Monadic Second-Order Logic of Graphs VIII: Orientations

Bruno Courcelle, B. Courcelle, 1995, Ann. Pure Appl. Log..

The Definition in Monadic Second-Order Logic of Modular Decompositions of Ordered Graphs

Bruno Courcelle, B. Courcelle, 1994, TAGT.

The Obstructions of a Minor-Closed Set of Graphs Defined by Hyperedge Replacement can be Constructed

Bruno Courcelle, Géraud Sénizergues, B. Courcelle, 1994, TAGT.

Monadic Second-Order Logic and Linear Orderings of Finite Structures

Bruno Courcelle, B. Courcelle, 1994, CSL.

Context-Free Graph Grammars: Separating Vertex Replacement from Hyperedge Replacement

Bruno Courcelle, B. Courcelle, 1993, FCT.

Monadic Second-Order Graph Transductions

Bruno Courcelle, B. Courcelle, 1992, CAAP.

A geometrical view of the determinization and minimization of finite-state automata

Bruno Courcelle, Andreas Podelski, Damian Niwinski, 1991, Mathematical systems theory.

Recursive Queries and Context-free Graph Grammars

Bruno Courcelle, B. Courcelle, 1991, Theor. Comput. Sci..

On the expression of monadic second-order graph properties without quantifications over sets of edges

Bruno Courcelle, B. Courcelle, 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

The Logical Exprssion of Graph Properties (Abstract)

B. Courcelle, 1990, Graph-Grammars and Their Application to Computer Science.

Context-free Handle-rewriting Hypergraph Grammars

Bruno Courcelle, Joost Engelfriet, Grzegorz Rozenberg, 1990, Graph-Grammars and Their Application to Computer Science.

Graphs as Relational Structures: An Algebraic an Logical Approach

Bruno Courcelle, B. Courcelle, 1990, Graph-Grammars and Their Application to Computer Science.

Monadic Second-Order Logic and Context-Free Graph-Grammars

Bruno Courcelle, B. Courcelle, 1989, MFCS.

The Definability of Equational Graphs in Monadic Second-Order Logic

Bruno Courcelle, B. Courcelle, 1989, ICALP.

The Monadic Second-Order Logic of Graphs XIV : Uniformly sparse graphs and edge set quantifications

B. Courcelle, 1999 .

On the Expression of Graph Properties in some Fragments of Monadic Second-Order Logic

Bruno Courcelle, B. Courcelle, 1996, Descriptive Complexity and Finite Models.

Recognizable Sets of Graphs of Bounded Tree-Width

Bruno Courcelle, Jens Lagergren, B. Courcelle, 1993, Dagstuhl Seminar on Graph Transformations in Computer Science.

On context-free sets of graphs and their monadic second-order theory

Bruno Courcelle, B. Courcelle, 1986, Graph-Grammars and Their Application to Computer Science.

Equivalences and Transformations of Regular Systems-Applications to Recursive Program Schemes and Grammars

Bruno Courcelle, B. Courcelle, 1986, Theor. Comput. Sci..

Graph Structure and Monadic Second-order Logic, a Language Theoretic Approach

J. Engelfriet, B. Courcelle, 2011 .

The monadic second-order logic of graphs, II: Infinite graphs of bounded width

B. Courcelle, 1988, Mathematical systems theory.

The solution of two star height problems for regular trees

Bruno Courcelle, Achille J.-P. Braquelaire, B. Courcelle, 1984, Automata on Infinite Words.

The Solutions of Two Star-Height Problems for Regular Trees

Bruno Courcelle, Achille J.-P. Braquelaire, B. Courcelle, 1984, Theor. Comput. Sci..

Proofs of Partial Correctness for Attribute Grammars with Applications to Recursive Procedures and Logic Programming

Bruno Courcelle, Pierre Deransart, B. Courcelle, 1988, Inf. Comput..

Attribute Grammars and Recursive Program Schemes II

Bruno Courcelle, Paul Franchi-Zannettacci, B. Courcelle, 1982, Theor. Comput. Sci..

Attribute Grammars: Theory and Applications

Bruno Courcelle, B. Courcelle, 1981, ICFPC.

On the expressive power of attribute grammars

Bruno Courcelle, Paul Franchi-Zannettacci, B. Courcelle, 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

Graph Operations, Graph Transformations and Monadic Second-Order Logic: a survey

Bruno Courcelle, B. Courcelle, 2002, GETGRATS Closing Workshop.

Fusion in relational structures and the verification of monadic second-order properties

B. COURCELLE, J. A. MAKOWSKY, B. Courcelle, 2002, Mathematical Structures in Computer Science.

Graph Operations and Monadic Second-Order Logic: A Survey

Bruno Courcelle, B. Courcelle, 2000, LPAR.

A Multivariate Interlace Polynomial and its Computation for Graphs of Bounded Clique-Width

Bruno Courcelle, B. Courcelle, 2008, Electron. J. Comb..

Monadic second-order definable graph orderings

Bruno Courcelle, Achim Blumensath, B. Courcelle, 2013, Log. Methods Comput. Sci..

Computations by fly-automata beyond monadic second-order logic pdf

Bruno Courcelle, Irène Durand, B. Courcelle, 2013, Theor. Comput. Sci..