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