| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Bruno Courcelle |
On the model-checking of monadic second-order formulas with edge set quantifications.  |
Discrete Applied Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté |
Compact labelings for efficient first-order model-checking. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
Automata for Monadic Second-Order Model-Checking. |
RP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Irène Durand |
Fly-Automata, Their Properties and Applications. |
CIAA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Achim Blumensath, Bruno Courcelle |
On the Monadic Second-Order Transduction Hierarchy |
Logical Methods in Computer Science |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Andrew Twigg |
Constrained-Path Labellings on Graphs of Bounded Clique-Width. |
Theory Comput. Syst. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Bruno Courcelle |
Special tree-width and the verification of monadic second-order graph pr operties. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
Linear delay enumeration and monadic second-order logic. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Mamadou Moustapha Kanté |
Graph operations characterizing rank-width. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
On Several Proofs of the Recognizability Theorem. |
CAI |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications. |
LATA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté, Andrew Twigg |
Connectivity check in 3-connected planar graphs with obstacles. |
Electronic Notes in Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Christian Delhommé |
The modular decomposition of countable graphs. Definition and construction in monadic second-order logic. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
A Multivariate Interlace Polynomial and its Computation for Graphs of Bounded Clique-Width. |
Electr. J. Comb. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Bruno Courcelle |
Circle graphs and monadic second-order logic. |
J. Applied Logic |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté |
Compact Labelings For Efficient First-Order Model-Checking |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté |
Efficient First-Order Model-Checking Using Short Labels. |
FAW |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
Quantifier-free definable graph operations preserving recognizability. |
Logic and Automata |
2008 |
DBLP BibTeX RDF |
|
| 1 | Bruno Courcelle, Sang-il Oum |
Vertex-minors, monadic second-order logic, and a conjecture by Seese. |
J. Comb. Theory, Ser. B |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
A multivariate interlace polynomial |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Bruno Courcelle, Mamadou Moustapha Kanté |
Graph Operations Characterizing Rank-Width and Balanced Graph Expressions. |
WG |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Andrew Twigg |
Compact Forbidden-Set Routing. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
Algorithms, compact routing, labelling schemes |
| 1 | Achim Blumensath, Bruno Courcelle |
Recognizability, hypergraph operations, and logical types. |
Inf. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
The monadic second-order logic of graphs XVI : Canonical graph decompositions. |
Logical Methods in Computer Science |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
The monadic second-order logic of graphs XV: On a conjecture by D. Seese. |
J. Applied Logic |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Pascal Weil |
The recognizability of sets of graphs is a robust property |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Bruno Courcelle |
Graph decompositions definable in monadic second-order logic. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Pascal Weil |
The recognizability of sets of graphs is a robust property. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
The monadic second-order logic of graphs XVI : Canonical graph decompositions |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Bruno Courcelle, Christian Delhommé |
The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic. |
CSL |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
Clique-width of countable graphs: a compactness property. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, David Janin |
Workshop on Logic, Graph Transformations, Finite and Infinite Structures. |
ICGT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey. |
Developments in Language Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, R. Vanicat |
Query efficient implementation of graphs of bounded clique-width. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Teodor Knapik |
The evaluation of first-order substitution is monadic second-order compatible. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Johann A. Makowsky |
Fusion in Relational Structures and the Verification of Monadic Second-Order Properties. |
Mathematical Structures in Computer Science |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
A Monadic Second-Order Definition of the Structure of Convex Hypergraphs. |
Inf. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, V. Dussaux |
Map Genus, Forbidden Maps, and Monadic Second-Order Logic. |
Electr. J. Comb. |
2002 |
DBLP BibTeX RDF |
|
| 1 | Bruno Courcelle, Pascal Weil |
Workshop on Logic, Graph Transformations and Discrete Structures. |
ICGT |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations. |
FoSSaCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
Graph Operations, Graph Transformations and Monadic Second-Order Logic: a survey. |
Electr. Notes Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Johann A. Makowsky, Udi Rotics |
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. |
Discrete Applied Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
Clique-width of countable graphs: a compactness property. |
Electronic Notes in Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
The monadic second-order logic of graphs XII: planar graphs and planar maps. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
The monadic second-order logic of graphs XIII: Graph drawings with edge crossings. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Johann A. Makowsky, Udi Rotics |
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width. |
Theory Comput. Syst. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Stephan Olariu |
Upper bounds to the clique width of graphs. |
Discrete Applied Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
Graph Operations and Monadic Second-Order Logic: A Survey. |
LPAR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
The Monadic Second-Order Logic of Graphs XI: Hierarchical Decompositions of Connected Graphs. |
Theor. Comput. Sci. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas. |
RTA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Géraud Sénizergues |
The obstructions of a minor-closed set of graphs defined by a context-free grammar. |
Discrete Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Igor Walukiewicz |
Monadic Second-Order Logic, Graph Coverings and Unfoldings of Transition Systems. |
Ann. Pure Appl. Logic |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Johann A. Makowsky, Udi Rotics |
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width. |
WG |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Denis Lapoire |
Facial Circuits of Planar Graphs and Context-Free Languages. |
MFCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Rodney G. Downey, Michael R. Fellows |
A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals. |
J. UCS |
1997 |
DBLP BibTeX RDF |
|
| 1 | Bruno Courcelle |
The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic. |
Handbook of Graph Grammars |
1997 |
DBLP BibTeX RDF |
|
| 1 | Bruno Courcelle |
Finite Model Theory, Universal Algebra and Graph Grammars. |
LFCS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
The Monadic Second-Order Logic of Graphs X: Linear Orderings. |
Theor. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
Basic Notions of Universal Algebra for Language Theory and Graph Grammars. |
Theor. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Jens Lagergren |
Equivalent Definitions of Recognizability for Sets of Graphs of Bounded Tree-Width. |
Mathematical Structures in Computer Science |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
On the Expression of Graph Properties in some Fragments of Monadic Second-Order Logic. |
Descriptive Complexity and Finite Models |
1996 |
DBLP BibTeX RDF |
|
| 1 | Bruno Courcelle |
The Monadic Second-Order Logic of Graphs IX: Machines and their Behaviours. |
Theor. Comput. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, A. Pariès |
Mineurs d'arbres avec racines. |
ITA |
1995 |
DBLP BibTeX RDF |
|
| 1 | Bruno Courcelle |
Structural Properties of Context-Free Sets of Graphs Generated by Vertex Replacement |
Inf. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
Logic and graphs. |
Electr. Notes Theor. Comput. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
The Monadic Second-Order Logic of Graphs VIII: Orientations. |
Ann. Pure Appl. Logic |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Joost Engelfriet |
A Logical Characterization of the Sets of Hypergraphs Defined by Hyperedge Replacement Grammars. |
Mathematical Systems Theory |
1995 |
DBLP BibTeX RDF |
|
| 1 | Bruno Courcelle |
The Monadic Second-order Logic of Graphs VI: On Several Representations of Graphs by Relational Structures. |
Discrete Applied Mathematics |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
Monadic Second-Order Definable Graph Transductions: A Survey. |
Theor. Comput. Sci. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
Recognizable Sets of Graphs: Equivalent Definitions and Closure Properties. |
Mathematical Structures in Computer Science |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Yves Métivier |
Coverings and Minors: Application to Local Computations in Graphs. |
Eur. J. Comb. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
The Monadic Second order Logic of Graphs VI: on Several Representations of Graphs By Relational Structures |
Discrete Applied Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
The Definition in Monadic Second-Order Logic of Modular Decompositions of Ordered Graphs. |
TAGT |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Géraud Sénizergues |
The Obstructions of a Minor-Closed Set of Graphs Defined by Hyperedge Replacement can be Constructed. |
TAGT |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
Monadic Second-Order Logic and Linear Orderings of Finite Structures. |
CSL |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Mohamed Mosbah |
Monadic Second-Order Evaluations on Tree-Decomposable Graphs. |
Theor. Comput. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese |
An Algebraic Theory of Graph Reduction. |
J. ACM |
1993 |
DBLP DOI BibTeX RDF |
graph algebra, regular set of graphs, treewidth, graph rewriting, monadic second-order logic |
| 1 | Bruno Courcelle |
Graphs and Monadic Second-Order Logic: Some Open Problems. |
Bulletin of the EATCS |
1993 |
DBLP BibTeX RDF |
|
| 1 | Bruno Courcelle, Joost Engelfriet, Grzegorz Rozenberg |
Handle-Rewriting Hypergraph Grammars. |
J. Comput. Syst. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Jens Lagergren |
Recognizable Sets of Graphs of Bounded Tree-Width. |
Dagstuhl Seminar on Graph Transformations in Computer Science |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
Context-Free Graph Grammars: Separating Vertex Replacement from Hyperedge Replacement. |
FCT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
Monadic Second-Order Logic and Hypergraph Orientation |
LICS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
Graph Rewriting: A Bibliographical Guide. |
Term Rewriting |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
The Monadic Second-Order Logic of Graphs VII: Graphs as Relational Structures. |
Theor. Comput. Sci. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues. |
ITA |
1992 |
DBLP BibTeX RDF |
|
| 1 | Bruno Courcelle |
Recognizable sets of unrooted trees. |
Tree Automata and Languages |
1992 |
DBLP BibTeX RDF |
|
| 1 | Bruno Courcelle |
Monadic Second-Order Graph Transductions. |
CAAP |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
Recursive Queries and Context-free Graph Grammars. |
Theor. Comput. Sci. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
The Monadic Second-Order Logic of Graphs V: On Closing the Gap Between Definability and Recognizability. |
Theor. Comput. Sci. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
On Constructing Obstruction Sets of Words. |
Bulletin of the EATCS |
1991 |
DBLP BibTeX RDF |
|
| 1 | Bruno Courcelle, Damian Niwinski, Andreas Podelski |
A Geometrical View of the Determinization and Minimization of Finite-State Automata. |
Mathematical Systems Theory |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Mohamed Mosbah |
Monadic Second-Order Evaluations on Tree-Decomposable Graphs. |
WG |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
Graph grammars, monadic second-order logic and the theory of graph minors. |
Graph Structure Theory |
1991 |
DBLP BibTeX RDF |
|
| 1 | Bruno Courcelle |
The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs |
Inf. Comput. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
The Monadic Second-Order Logic of Graphs IV: Definability Properties of Equational Graphs. |
Ann. Pure Appl. Logic |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
Graph Rewriting: An Algebraic and Logic Approach. |
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) |
1990 |
DBLP BibTeX RDF |
|
| 1 | Bruno Courcelle |
Recursive Applicative Program Schemes. |
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) |
1990 |
DBLP BibTeX RDF |
|
| 1 | Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese |
An Algebraic Theory of Graph Reduction. |
Graph-Grammars and Their Application to Computer Science |
1990 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")