Suivre
Bruno Courcelle
Bruno Courcelle
Professeur émérite , Bordeaux, Informatique
Adresse e-mail validée de labri.fr - Page d'accueil
Titre
Citée par
Citée par
Année
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
2783*1997
The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
B Courcelle
Information and computation 85 (1), 12-75, 1990
19371990
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
9492000
Graph rewriting: An algebraic and logic approach
B Courcelle
Formal models and semantics, 193-242, 1990
7961990
Upper bounds to the clique width of graphs
B Courcelle, S Olariu
Discrete Applied Mathematics 101 (1-3), 77-114, 2000
7922000
Fundamental properties of infinite trees
B Courcelle
Theoretical computer science 25 (2), 95-169, 1983
7711983
Graph structure and monadic second-order logic
B Courcelle, J Engelfriet
Cambridge University Press 138, 730, 2011
757*2011
Handle-rewriting hypergraph grammars
B Courcelle, J Engelfriet, G Rozenberg
Journal of computer and system sciences 46 (2), 218-270, 1993
4491993
Recursive applicative program schemes
B Courcelle
Formal Models and Semantics, 459-492, 1990
375*1990
Graph expressions and graph rewritings
M Bauderon, B Courcelle
Mathematical systems theory 20 (1), 83-127, 1987
3281987
Monadic second-order evaluations on tree-decomposable graphs
B Courcelle, M Mosbah
Theoretical Computer Science 109 (1-2), 49-82, 1993
3241993
Monadic second-order definable graph transductions: a survey
B Courcelle
Theoretical Computer Science 126 (1), 53-75, 1994
2901994
The monadic second-order logic of graphs III: Tree-decompositions, minors and complexity issues
B Courcelle
RAIRO-Theoretical Informatics and Applications 26 (3), 257-286, 1992
2781992
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
2662001
An algebraic theory of graph reduction
S Arnborg, B Courcelle, A Proskurowski, D Seese
Journal of the ACM (JACM) 40 (5), 1134-1164, 1993
2491993
Attribute grammars and recursive program schemes I
B Courcelle, P Franchi-Zannettacci
Theoretical Computer Science 17 (2), 163-191, 1982
2371982
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
2211994
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
1771987
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
1581991
Equivalences and transformations of regular systems—applications to recursive program schemes and grammars
B Courcelle
Theoretical Computer Science 42, 1-122, 1986
1541986
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20