The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Bruno Courcelle: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Bruno Courcelle
    Fundamental Properties of Infinite Trees. [Citation Graph (7, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:25, n:, pp:95-169 [Journal]
  2. Bruno Courcelle
    Recursive Queries and Context-free Graph Grammars. [Citation Graph (5, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:78, n:1, pp:217-244 [Journal]
  3. Bruno Courcelle
    The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs [Citation Graph (2, 0)][DBLP]
    Inf. Comput., 1990, v:85, n:1, pp:12-75 [Journal]
  4. Bruno Courcelle, Gilles Kahn, Jean Vuillemin
    Algorithmes d'equivalence et de reduction a des expressions minimales dans une classe d'equations recursives simples. [Citation Graph (1, 0)][DBLP]
    ICALP, 1974, pp:200-213 [Conf]
  5. Bruno Courcelle, Pierre Deransart
    Proofs of Partial Correctness for Attribute Grammars with Applications to Recursive Procedures and Logic Programming [Citation Graph (1, 0)][DBLP]
    Inf. Comput., 1988, v:78, n:1, pp:1-55 [Journal]
  6. Bruno Courcelle
    An Axiomatic Definition of Context-Free Rewriting and its Application to NLC Graph Grammars. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:55, n:2-3, pp:141-181 [Journal]
  7. Bruno Courcelle
    Monadic Second-Order Definable Graph Transductions: A Survey. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:126, n:1, pp:53-75 [Journal]
  8. Bruno Courcelle, Mohamed Mosbah
    Monadic Second-Order Evaluations on Tree-Decomposable Graphs. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:109, n:1&2, pp:49-82 [Journal]
  9. Bruno Courcelle
    Attribute Grammars: Definitions, Analysis of Dependencies, Proof Methods. [Citation Graph (0, 0)][DBLP]
    Method and tools for compiler construction, 1983, pp:81-102 [Conf]
  10. Bruno Courcelle
    Graph Rewriting: A Bibliographical Guide. [Citation Graph (0, 0)][DBLP]
    Term Rewriting, 1993, pp:74- [Conf]
  11. Michel Bauderon, Bruno Courcelle
    An Algebraic Formalism for Graphs. [Citation Graph (0, 0)][DBLP]
    CAAP, 1986, pp:74-84 [Conf]
  12. Bruno Courcelle
    Monadic Second-Order Graph Transductions. [Citation Graph (0, 0)][DBLP]
    CAAP, 1992, pp:124-144 [Conf]
  13. Bruno Courcelle, F. Lavandier
    A Class of Program Schemes Based on Tree Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    CAAP, 1983, pp:191-204 [Conf]
  14. Bruno Courcelle
    Monadic Second-Order Logic and Linear Orderings of Finite Structures. [Citation Graph (0, 0)][DBLP]
    CSL, 1994, pp:163-176 [Conf]
  15. Bruno Courcelle, Christian Delhommé
    The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic. [Citation Graph (0, 0)][DBLP]
    CSL, 2005, pp:325-338 [Conf]
  16. Bruno Courcelle, Jens Lagergren
    Recognizable Sets of Graphs of Bounded Tree-Width. [Citation Graph (0, 0)][DBLP]
    Dagstuhl Seminar on Graph Transformations in Computer Science, 1993, pp:138-152 [Conf]
  17. Bruno Courcelle
    On the Expression of Graph Properties in some Fragments of Monadic Second-Order Logic. [Citation Graph (0, 0)][DBLP]
    Descriptive Complexity and Finite Models, 1996, pp:33-62 [Conf]
  18. Bruno Courcelle
    Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2004, pp:1-11 [Conf]
  19. Bruno Courcelle
    Context-Free Graph Grammars: Separating Vertex Replacement from Hyperedge Replacement. [Citation Graph (0, 0)][DBLP]
    FCT, 1993, pp:181-193 [Conf]
  20. Bruno Courcelle
    Recursive Schemes, Algebraic Trees and Deterministic Languages [Citation Graph (0, 0)][DBLP]
    FOCS, 1974, pp:52-62 [Conf]
  21. Bruno Courcelle
    On Recursive Equations Having a Unique Solution [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:201-213 [Conf]
  22. Bruno Courcelle
    Equivalences and Transformations of Recursive Definitions [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:354-359 [Conf]
  23. Bruno Courcelle, Paul Franchi-Zannettacci
    On the Expressive Power of Attribute Grammars [Citation Graph (0, 0)][DBLP]
    FOCS, 1980, pp:161-172 [Conf]
  24. Bruno Courcelle, Maurice Nivat
    Algebraic Families of Interpretations [Citation Graph (0, 0)][DBLP]
    FOCS, 1976, pp:137-146 [Conf]
  25. Bruno Courcelle
    Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:1-4 [Conf]
  26. Bruno Courcelle
    The Logical Exprssion of Graph Properties (Abstract). [Citation Graph (0, 0)][DBLP]
    Graph-Grammars and Their Application to Computer Science, 1990, pp:38-40 [Conf]
  27. Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese
    An Algebraic Theory of Graph Reduction. [Citation Graph (0, 0)][DBLP]
    Graph-Grammars and Their Application to Computer Science, 1990, pp:70-83 [Conf]
  28. Bruno Courcelle
    The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic. [Citation Graph (0, 0)][DBLP]
    Handbook of Graph Grammars, 1997, pp:313-400 [Conf]
  29. Bruno Courcelle
    Graphs as Relational Structures: An Algebraic an Logical Approach. [Citation Graph (0, 0)][DBLP]
    Graph-Grammars and Their Application to Computer Science, 1990, pp:238-252 [Conf]
  30. Bruno Courcelle, Joost Engelfriet, Grzegorz Rozenberg
    Context-free Handle-rewriting Hypergraph Grammars. [Citation Graph (0, 0)][DBLP]
    Graph-Grammars and Their Application to Computer Science, 1990, pp:253-268 [Conf]
  31. Bruno Courcelle, David Janin
    Workshop on Logic, Graph Transformations, Finite and Infinite Structures. [Citation Graph (0, 0)][DBLP]
    ICGT, 2004, pp:448-450 [Conf]
  32. Bruno Courcelle, Pascal Weil
    Workshop on Logic, Graph Transformations and Discrete Structures. [Citation Graph (0, 0)][DBLP]
    ICGT, 2002, pp:455-458 [Conf]
  33. Bruno Courcelle
    A representation of graphs by algebraic expressions and its use for graph rewriting systems. [Citation Graph (0, 0)][DBLP]
    Graph-Grammars and Their Application to Computer Science, 1986, pp:112-132 [Conf]
  34. Bruno Courcelle
    On context-free sets of graphs and their monadic second-order theory. [Citation Graph (0, 0)][DBLP]
    Graph-Grammars and Their Application to Computer Science, 1986, pp:133-146 [Conf]
  35. Bruno Courcelle
    Graph grammars, monadic second-order logic and the theory of graph minors. [Citation Graph (0, 0)][DBLP]
    Graph Structure Theory, 1991, pp:565-590 [Conf]
  36. Gérard Berry, Bruno Courcelle
    Program Equivalence and Canonical Forms in Stable Discrete Interpretations. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:168-188 [Conf]
  37. Bruno Courcelle
    On the Definition of Classes of Interpretations. [Citation Graph (0, 0)][DBLP]
    ICALP, 1977, pp:554-569 [Conf]
  38. Bruno Courcelle
    An Axiomatic Approach to the Korenjak-Hopcroft Algorithms. [Citation Graph (0, 0)][DBLP]
    ICALP, 1981, pp:393-407 [Conf]
  39. Bruno Courcelle
    The Definability of Equational Graphs in Monadic Second-Order Logic. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:207-221 [Conf]
  40. Bruno Courcelle
    Attribute Grammars: Theory and Applications. [Citation Graph (0, 0)][DBLP]
    ICFPC, 1981, pp:75-95 [Conf]
  41. Bruno Courcelle
    Finite Model Theory, Universal Algebra and Graph Grammars. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:53-55 [Conf]
  42. Bruno Courcelle
    On the Expression of Monadic Second-Order Graph Properties Without Quantifications Over Sets of Edges (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    LICS, 1990, pp:190-196 [Conf]
  43. Bruno Courcelle
    Monadic Second-Order Logic and Hypergraph Orientation [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:179-190 [Conf]
  44. Jean-Pierre Braquelaire, Bruno Courcelle
    The solution of two star height problems for regular trees. [Citation Graph (0, 0)][DBLP]
    Automata on Infinite Words, 1984, pp:108-117 [Conf]
  45. Bruno Courcelle
    Proofs of partial correctness for iterative and recursive computations. [Citation Graph (0, 0)][DBLP]
    Logic Colloquium, 1985, pp:89-110 [Conf]
  46. Bruno Courcelle
    Graph Operations and Monadic Second-Order Logic: A Survey. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:20-24 [Conf]
  47. Bruno Courcelle
    Monadic Second-Order Logic and Context-Free Graph-Grammars. [Citation Graph (0, 0)][DBLP]
    MFCS, 1989, pp:18-34 [Conf]
  48. Bruno Courcelle, Denis Lapoire
    Facial Circuits of Planar Graphs and Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:616-624 [Conf]
  49. Bruno Courcelle, Maurice Nivat
    The Algebraic Semantics of Recursive Program Schemes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1978, pp:16-30 [Conf]
  50. Bruno Courcelle, Jean Vuillemin
    Complétude d'un système formel pour prouver l'équivalence de certains schémas récursifs monadiques. [Citation Graph (0, 0)][DBLP]
    Symposium on Programming, 1974, pp:234-252 [Conf]
  51. Bruno Courcelle
    Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas. [Citation Graph (0, 0)][DBLP]
    RTA, 1999, pp:90-91 [Conf]
  52. Bruno Courcelle
    An Axiomatic Definition of Context-Free Rewriting and its Application to NLC Graph Grammars. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:237-247 [Conf]
  53. Bruno Courcelle, Andrew Twigg
    Compact Forbidden-Set Routing. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:37-48 [Conf]
  54. Bruno Courcelle, Jean Vuillemin
    Semantics and Axiomatics of a Simple Recursive Language [Citation Graph (0, 0)][DBLP]
    STOC, 1974, pp:13-26 [Conf]
  55. Bruno Courcelle
    The Definition in Monadic Second-Order Logic of Modular Decompositions of Ordered Graphs. [Citation Graph (0, 0)][DBLP]
    TAGT, 1994, pp:487-501 [Conf]
  56. Bruno Courcelle, Géraud Sénizergues
    The Obstructions of a Minor-Closed Set of Graphs Defined by Hyperedge Replacement can be Constructed. [Citation Graph (0, 0)][DBLP]
    TAGT, 1994, pp:351-367 [Conf]
  57. Bruno Courcelle
    On a description of tree-languages by languages. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1977, pp:45-50 [Conf]
  58. Bruno Courcelle
    The Monadic Second-Order Logic of Graphs: Definable Sets of Finite Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1988, pp:30-53 [Conf]
  59. Bruno Courcelle, Mohamed Mosbah
    Monadic Second-Order Evaluations on Tree-Decomposable Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1991, pp:13-24 [Conf]
  60. Bruno Courcelle, Johann A. Makowsky, Udi Rotics
    Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:1-16 [Conf]
  61. Bruno Courcelle
    The Monadic Second-Order Logic of Graphs IV: Definability Properties of Equational Graphs. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1990, v:49, n:3, pp:193-255 [Journal]
  62. Bruno Courcelle
    The Monadic Second-Order Logic of Graphs VIII: Orientations. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1995, v:72, n:2, pp:103-143 [Journal]
  63. Bruno Courcelle, Igor Walukiewicz
    Monadic Second-Order Logic, Graph Coverings and Unfoldings of Transition Systems. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:92, n:1, pp:35-62 [Journal]
  64. Bruno Courcelle, V. Dussaux
    Map Genus, Forbidden Maps, and Monadic Second-Order Logic. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2002, v:9, n:1, pp:- [Journal]
  65. Bruno Courcelle
    The Monadic Second order Logic of Graphs VI: on Several Representations of Graphs By Relational Structures [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:54, n:2-3, pp:117-149 [Journal]
  66. Bruno Courcelle
    The Monadic Second-order Logic of Graphs VI: On Several Representations of Graphs by Relational Structures. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:63, n:2, pp:199-200 [Journal]
  67. Bruno Courcelle, Johann A. Makowsky, Udi Rotics
    On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:1-2, pp:23-52 [Journal]
  68. Bruno Courcelle, Stephan Olariu
    Upper bounds to the clique width of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:101, n:1-3, pp:77-114 [Journal]
  69. Bruno Courcelle, R. Vanicat
    Query efficient implementation of graphs of bounded clique-width. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:1, pp:129-150 [Journal]
  70. Bruno Courcelle
    Clique-width of countable graphs: a compactness property. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:276, n:1-3, pp:127-148 [Journal]
  71. Bruno Courcelle
    On Constructing Obstruction Sets of Words. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1991, v:44, n:, pp:178-186 [Journal]
  72. Bruno Courcelle
    Graphs and Monadic Second-Order Logic: Some Open Problems. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1993, v:49, n:, pp:110-124 [Journal]
  73. Bruno Courcelle, Yves Métivier
    Coverings and Minors: Application to Local Computations in Graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1994, v:15, n:2, pp:127-138 [Journal]
  74. Bruno Courcelle
    Graph Operations, Graph Transformations and Monadic Second-Order Logic: a survey. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:51, n:, pp:- [Journal]
  75. Bruno Courcelle
    Logic and graphs. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  76. Bruno Courcelle, Jean-Claude Raoult
    Completions of ordered magmas. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1980, v:3, n:1, pp:105-0 [Journal]
  77. Bruno Courcelle
    A Monadic Second-Order Definition of the Structure of Convex Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:178, n:2, pp:391-411 [Journal]
  78. Bruno Courcelle
    Structural Properties of Context-Free Sets of Graphs Generated by Vertex Replacement [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:116, n:2, pp:275-293 [Journal]
  79. Bruno Courcelle, Paul Franchi-Zannettacci
    On the Equivalence Problem for Attribute Systems [Citation Graph (0, 0)][DBLP]
    Information and Control, 1982, v:52, n:3, pp:275-305 [Journal]
  80. Blumensath Blumensath, Bruno Courcelle
    Recognizability, hypergraph operations, and logical types. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:6, pp:853-919 [Journal]
  81. Bruno Courcelle
    The Simultaneous Accessibility of Two Configurations of Two Equivalent DPDA's. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:3, pp:111-114 [Journal]
  82. Bruno Courcelle
    Some Negative Results Concerning DPDA's. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:18, n:5, pp:285-289 [Journal]
  83. Bruno Courcelle
    Frontiers of Infinite Trees. [Citation Graph (0, 0)][DBLP]
    ITA, 1978, v:12, n:4, pp:- [Journal]
  84. Bruno Courcelle
    Arbes infinis et systèmes d'équations. [Citation Graph (0, 0)][DBLP]
    ITA, 1979, v:13, n:1, pp:- [Journal]
  85. Bruno Courcelle
    The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:257-286 [Journal]
  86. Bruno Courcelle, Jean H. Gallier
    Decidable Subcases of The Equivalence Problem for Recursive Program Schemes. [Citation Graph (0, 0)][DBLP]
    ITA, 1987, v:21, n:3, pp:245-286 [Journal]
  87. Bruno Courcelle, F. Lavandier
    Définitions Récursives Par Cas. [Citation Graph (0, 0)][DBLP]
    ITA, 1984, v:18, n:2, pp:91-129 [Journal]
  88. Bruno Courcelle, A. Pariès
    Mineurs d'arbres avec racines. [Citation Graph (0, 0)][DBLP]
    ITA, 1995, v:29, n:5, pp:401-422 [Journal]
  89. Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese
    An Algebraic Theory of Graph Reduction. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1993, v:40, n:5, pp:1134-1164 [Journal]
  90. Bruno Courcelle
    The monadic second-order logic of graphs XV: On a conjecture by D. Seese. [Citation Graph (0, 0)][DBLP]
    J. Applied Logic, 2006, v:4, n:1, pp:79-114 [Journal]
  91. Bruno Courcelle, Joost Engelfriet, Grzegorz Rozenberg
    Handle-Rewriting Hypergraph Grammars. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1993, v:46, n:2, pp:218-270 [Journal]
  92. Bruno Courcelle, Irène Guessarian
    On Some Classes of Interpretations. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1978, v:17, n:3, pp:406-431 [Journal]
  93. Bruno Courcelle, Jean Vuillemin
    Completeness Results for the Equivalence of Recursive Schemas. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1976, v:12, n:2, pp:179-197 [Journal]
  94. Bruno Courcelle, Sang-il Oum
    Vertex-minors, monadic second-order logic, and a conjecture by Seese. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2007, v:97, n:1, pp:91-126 [Journal]
  95. Bruno Courcelle, Rodney G. Downey, Michael R. Fellows
    A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1997, v:3, n:11, pp:1194-1198 [Journal]
  96. Bruno Courcelle
    The monadic second-order logic of graphs XVI : Canonical graph decompositions. [Citation Graph (0, 0)][DBLP]
    Logical Methods in Computer Science, 2006, v:2, n:2, pp:- [Journal]
  97. Bruno Courcelle
    Recognizable Sets of Graphs: Equivalent Definitions and Closure Properties. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1994, v:4, n:1, pp:1-32 [Journal]
  98. Bruno Courcelle, Jens Lagergren
    Equivalent Definitions of Recognizability for Sets of Graphs of Bounded Tree-Width. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1996, v:6, n:2, pp:141-165 [Journal]
  99. Bruno Courcelle, Johann A. Makowsky
    Fusion in Relational Structures and the Verification of Monadic Second-Order Properties. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2002, v:12, n:2, pp:203-235 [Journal]
  100. Michel Bauderon, Bruno Courcelle
    Graph Expressions and Graph Rewritings. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1987, v:20, n:2-3, pp:83-127 [Journal]
  101. Bruno Courcelle
    On Jump-Deterministic Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1977, v:11, n:, pp:87-109 [Journal]
  102. Bruno Courcelle
    Infinite Trees in Normal Form and Recursive Equations Having a Unique Solution. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1979, v:13, n:, pp:131-180 [Journal]
  103. Bruno Courcelle
    An Axiomatic Approach to the Korenjak-Hopcroft Algorithms. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1983, v:16, n:3, pp:191-231 [Journal]
  104. Bruno Courcelle
    The Monadic Second-Order Logic of Graphs, II: Infinite Graphs of Bounded Width. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1989, v:21, n:4, pp:187-221 [Journal]
  105. Bruno Courcelle, Joost Engelfriet
    A Logical Characterization of the Sets of Hypergraphs Defined by Hyperedge Replacement Grammars. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1995, v:28, n:6, pp:515-552 [Journal]
  106. Bruno Courcelle, Johann A. Makowsky, Udi Rotics
    Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2000, v:33, n:2, pp:125-150 [Journal]
  107. Bruno Courcelle, Damian Niwinski, Andreas Podelski
    A Geometrical View of the Determinization and Minimization of Finite-State Automata. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1991, v:24, n:2, pp:117-146 [Journal]
  108. Luc Boasson, Bruno Courcelle, Maurice Nivat
    The Rational Index: A Complexity Measure for Languages. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:2, pp:284-296 [Journal]
  109. Jean-Pierre Braquelaire, Bruno Courcelle
    The Solutions of Two Star-Height Problems for Regular Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:30, n:, pp:205-239 [Journal]
  110. Bruno Courcelle
    The Monadic Second-Order Logic of Graphs V: On Closing the Gap Between Definability and Recognizability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:80, n:2, pp:153-202 [Journal]
  111. Bruno Courcelle
    The Monadic Second-Order Logic of Graphs VII: Graphs as Relational Structures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:101, n:1, pp:3-33 [Journal]
  112. Bruno Courcelle
    The Monadic Second-Order Logic of Graphs IX: Machines and their Behaviours. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:151, n:1, pp:125-162 [Journal]
  113. Bruno Courcelle
    The Monadic Second-Order Logic of Graphs X: Linear Orderings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:160, n:1&2, pp:87-143 [Journal]
  114. Bruno Courcelle
    Basic Notions of Universal Algebra for Language Theory and Graph Grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:163, n:1&2, pp:1-54 [Journal]
  115. Bruno Courcelle
    The Monadic Second-Order Logic of Graphs XI: Hierarchical Decompositions of Connected Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:224, n:1-2, pp:35-58 [Journal]
  116. Bruno Courcelle, Paul Franchi-Zannettacci
    Attribute Grammars and Recursive Program Schemes I. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:163-191 [Journal]
  117. Bruno Courcelle, Paul Franchi-Zannettacci
    Attribute Grammars and Recursive Program Schemes II. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:235-257 [Journal]
  118. Bruno Courcelle, Teodor Knapik
    The evaluation of first-order substitution is monadic second-order compatible. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:177-206 [Journal]
  119. Bruno Courcelle, Pascal Weil
    The recognizability of sets of graphs is a robust property. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:342, n:2-3, pp:173-228 [Journal]
  120. Bruno Courcelle
    A Representation of Trees by Languages I. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1978, v:6, n:, pp:255-279 [Journal]
  121. Bruno Courcelle
    A Representation of Trees by Languages II. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1978, v:7, n:, pp:25-55 [Journal]
  122. Bruno Courcelle
    The monadic second-order logic of graphs XII: planar graphs and planar maps. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:1-32 [Journal]
  123. Bruno Courcelle
    The monadic second-order logic of graphs XIII: Graph drawings with edge crossings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:244, n:1-2, pp:63-94 [Journal]
  124. Bruno Courcelle
    The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:1-36 [Journal]
  125. Bruno Courcelle
    Equivalences and Transformations of Regular Systems-Applications to Recursive Program Schemes and Grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:42, n:, pp:1-122 [Journal]
  126. Bruno Courcelle
    A multivariate interlace polynomial [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  127. Bruno Courcelle, Pascal Weil
    The recognizability of sets of graphs is a robust property [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  128. Bruno Courcelle, Géraud Sénizergues
    The obstructions of a minor-closed set of graphs defined by a context-free grammar. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:182, n:1-3, pp:29-51 [Journal]

  129. Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects. [Citation Graph (, )][DBLP]


  130. Graph Operations Characterizing Rank-Width and Balanced Graph Expressions. [Citation Graph (, )][DBLP]


  131. Efficient First-Order Model-Checking Using Short Labels. [Citation Graph (, )][DBLP]


  132. On Several Proofs of the Recognizability Theorem. [Citation Graph (, )][DBLP]


  133. Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications. [Citation Graph (, )][DBLP]


  134. The monadic second-order logic of graphs XVI : Canonical graph<br> decompositions [Citation Graph (, )][DBLP]


  135. Compact Labelings For Efficient First-Order Model-Checking [Citation Graph (, )][DBLP]


  136. Linear delay enumeration and monadic second-order logic. [Citation Graph (, )][DBLP]


  137. Graph operations characterizing rank-width. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.607secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002