Bruno Courcelle
Bruno Courcelle
Professeur émérite , Bordeaux, Informatique
Verified email at labri.fr - Homepage
Title
Cited by
Cited by
Year
The expression of graph properties and graph transformations in monadic second-order logic
B Courcelle
Handbook Of Graph Grammars And Computing By Graph Transformation: Volume 1 …, 1997
2485*1997
The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
B Courcelle
Information and computation 85 (1), 12-75, 1990
14551990
Graph rewriting: An algebraic and logic approach
B Courcelle
Formal Models and Semantics, 193-242, 1990
7541990
Linear time solvable optimization problems on graphs of bounded clique-width
B Courcelle, JA Makowsky, U Rotics
Theory of Computing Systems 33 (2), 125-150, 2000
7242000
Fundamental properties of infinite trees
B Courcelle
Theoretical computer science 25 (2), 95-169, 1983
6931983
Upper bounds to the clique width of graphs
B Courcelle, S Olariu
Discrete Applied Mathematics 101 (1-3), 77-114, 2000
6412000
Graph structure and monadic second-order logic
B Courcelle, J Engelfriet
Cambridge University Press 138, 730, 2011
489*2011
Handle-rewriting hypergraph grammars
B Courcelle, J Engelfriet, G Rozenberg
Journal of computer and system sciences 46 (2), 218-270, 1993
3691993
Recursive applicative program schemes
B Courcelle
Formal Models and Semantics, 459-492, 1990
347*1990
Monadic second-order evaluations on tree-decomposable graphs
B Courcelle, M Mosbah
Theoretical Computer Science 109 (1-2), 49-82, 1993
2951993
Graph expressions and graph rewritings
M Bauderon, B Courcelle
Mathematical Systems Theory 20 (1), 83-127, 1987
2951987
The monadic second-order logic of graphs III: Tree-decompositions, minors and complexity issues
B Courcelle
RAIRO-Theoretical Informatics and Applications-Informatique Théorique et …, 1992
2461992
Monadic second-order definable graph transductions: a survey
B Courcelle
Theoretical Computer Science 126 (1), 53-75, 1994
2401994
An algebraic theory of graph reduction
S Arnborg, B Courcelle, A Proskurowski, D Seese
Journal of the ACM (JACM) 40 (5), 1134-1164, 1993
2401993
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
B Courcelle, JA Makowsky, U Rotics
Discrete applied mathematics 108 (1-2), 23-52, 2001
2352001
Attribute grammars and recursive program schemes I
B Courcelle, P Franchi-Zannettacci
Theoretical Computer Science 17 (2), 163-191, 1982
2241982
The monadic second order logic of graphs VI: On several representations of graphs by relational structures
B Courcelle
Discrete Applied Mathematics 54 (2-3), 117-149, 1994
1781994
An axiomatic definition of context-free rewriting and its application to NLC graph grammars
B Courcelle
Theoretical Computer Science 55 (2-3), 141-181, 1987
1691987
Equivalences and transformations of regular systems—applications to recursive program schemes and grammars
B Courcelle
Theoretical Computer Science 42, 1-122, 1986
1511986
The monadic second-order logic of graphs V: On closing the gap between definability and recognizability
B Courcelle
Theoretical Computer Science 80 (2), 153-202, 1991
1451991
The system can't perform the operation now. Try again later.
Articles 1–20