default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBruno Courcelle
Person information
- affiliation: University of Bordeaux 1, LABRI, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j102]Bruno Courcelle:
Order-theoretic Trees: Monadic Second-order Descriptions and Regularity. Fundam. Informaticae 186(1-4): 89-120 (2022)- [j101]Bruno Courcelle:
Unfoldings and Coverings of Weighted Graphs. Fundam. Informaticae 189(1): 1-47 (2022) - [i15]Bruno Courcelle, Yves Métivier:
Unfoldings and coverings of weighted graphs. CoRR abs/2212.07205 (2022) - 2021
- [j100]Bruno Courcelle
:
Induced betweenness in order-theoretic trees. Discret. Math. Theor. Comput. Sci. 23(2) (2021) - [j99]Bruno Courcelle:
Axiomatization of betweenness in order-theoretic trees. Log. Methods Comput. Sci. 17(1) (2021) - [i14]Bruno Courcelle:
Order-theoretic trees: monadic second-order descriptions and regularity. CoRR abs/2111.04083 (2021) - [i13]Bruno Courcelle:
Induced betweenness in order-theoretic trees. CoRR abs/2111.15357 (2021) - 2020
- [j98]Bruno Courcelle:
Grammars and clique-width bounds from split decompositions. Discret. Appl. Math. 278: 93-117 (2020) - [j97]Bruno Courcelle:
On quasi-planar graphs: Clique-width and logical description. Discret. Appl. Math. 278: 118-135 (2020) - [j96]Bruno Courcelle:
Betweenness of partial orders. RAIRO Theor. Informatics Appl. 54: 7 (2020) - [c68]Bruno Courcelle:
Betweenness in Order-Theoretic Trees. Fields of Logic and Computation III 2020: 79-94 - [i12]Bruno Courcelle:
Betweenness of partial orders. CoRR abs/2004.09777 (2020) - [i11]Bruno Courcelle:
Axiomatization of betweenness in order-theoretic trees. CoRR abs/2004.10127 (2020) - [i10]Bruno Courcelle, Irène Durand, Michael Raskin:
A unified algorithm for colouring graphs of bounded clique-width. CoRR abs/2008.07468 (2020)
2010 – 2019
- 2018
- [j95]Bruno Courcelle:
Fly-automata for checking MSO2 graph properties. Discret. Appl. Math. 245: 236-252 (2018) - [j94]Bruno Courcelle:
From tree-decompositions to clique-width terms. Discret. Appl. Math. 248: 125-144 (2018) - 2017
- [j93]Bruno Courcelle:
Several notions of rank-width for countable graphs. J. Comb. Theory B 123: 186-214 (2017) - [j92]Bruno Courcelle:
Algebraic and logical descriptions of generalized trees. Log. Methods Comput. Sci. 13(3) (2017) - 2016
- [j91]Bruno Courcelle, Irène Durand:
Computations by fly-automata beyond monadic second-order logic. Theor. Comput. Sci. 619: 32-67 (2016) - [r1]Bruno Courcelle, Irène Durand:
Model Checking with Fly-Automata. Encyclopedia of Algorithms 2016: 1341-1346 - [i9]Bruno Courcelle:
Algebraic and logical descriptions of generalized trees. CoRR abs/1609.09675 (2016) - 2015
- [j90]Bruno Courcelle, Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics:
A characterisation of clique-width through nested partitions. Discret. Appl. Math. 187: 70-81 (2015) - [j89]Bruno Courcelle:
Fly-automata for checking monadic second-order properties of graphs of bounded tree-width. Electron. Notes Discret. Math. 50: 3-8 (2015) - [c67]Bruno Courcelle:
Regularity Equals Monadic Second-Order Definability for Quasi-trees. Fields of Logic and Computation II 2015: 129-141 - [i8]Bruno Courcelle:
Fly-automata for checking MSO 2 graph properties. CoRR abs/1511.08605 (2015) - 2014
- [j88]Achim Blumensath, Bruno Courcelle:
Monadic second-order definable graph orderings. Log. Methods Comput. Sci. 10(1) (2014) - [j87]Bruno Courcelle:
Clique-width and edge contraction. Inf. Process. Lett. 114(1-2): 42-44 (2014) - [i7]Bruno Courcelle, Irène Durand:
Fly-automata, model-checking and recognizability. CoRR abs/1409.5368 (2014) - 2013
- [c66]Bruno Courcelle, Irène Durand:
Model-Checking by Infinite Fly-Automata. CAI 2013: 211-222 - [c65]Irène Durand, Bruno Courcelle:
Infinite Transducers on Terms Denoting Graphs. ELS 2013: 47-58 - [i6]Bruno Courcelle, Irène Durand:
Computations by fly-automata beyond monadic second-order logic. CoRR abs/1305.7120 (2013) - [i5]Bruno Courcelle:
Clique-width and edge contraction. CoRR abs/1306.6168 (2013) - 2012
- [b1]Bruno Courcelle, Joost Engelfriet:
Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach. Encyclopedia of mathematics and its applications 138, Cambridge University Press 2012, ISBN 978-0-521-89833-1, pp. I-XIV, 1-728 - [j86]Bruno Courcelle:
On the model-checking of monadic second-order formulas with edge set quantifications. Discret. Appl. Math. 160(6): 866-887 (2012) - [j85]Bruno Courcelle, Joost Engelfriet:
Book: Graph Structure and Monadic Second-Order Logic. A Language-Theoretic Approach. Bull. EATCS 108: 179 (2012) - [j84]Bruno Courcelle, Irène Durand:
Automata for the verification of monadic second-order graph properties. J. Appl. Log. 10(4): 368-409 (2012) - 2011
- [j83]Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté:
Compact labelings for efficient first-order model-checking. J. Comb. Optim. 21(1): 19-46 (2011) - [c64]Bruno Courcelle:
Automata for Monadic Second-Order Model-Checking. RP 2011: 26-27 - [c63]Bruno Courcelle, Irène Durand:
Fly-Automata, Their Properties and Applications. CIAA 2011: 264-272 - 2010
- [j82]Achim Blumensath, Bruno Courcelle:
On the Monadic Second-Order Transduction Hierarchy. Log. Methods Comput. Sci. 6(2) (2010) - [j81]Bruno Courcelle, Andrew Twigg:
Constrained-Path Labellings on Graphs of Bounded Clique-Width. Theory Comput. Syst. 47(2): 531-567 (2010) - [c62]Bruno Courcelle, Irène Durand:
Verifying Monadic Second Order Graph Properties with Tree Automata. ELS 2010: 7-21 - [c61]Bruno Courcelle:
Special tree-width and the verification of monadic second-order graph pr operties. FSTTCS 2010: 13-29
2000 – 2009
- 2009
- [j80]Bruno Courcelle, Mamadou Moustapha Kanté:
Graph operations characterizing rank-width. Discret. Appl. Math. 157(4): 627-640 (2009) - [j79]Bruno Courcelle:
Linear delay enumeration and monadic second-order logic. Discret. Appl. Math. 157(12): 2675-2700 (2009) - [c60]Bruno Courcelle:
On Several Proofs of the Recognizability Theorem. CAI 2009: 78-80 - [c59]Bruno Courcelle:
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications. LATA 2009: 19-22 - 2008
- [j78]Bruno Courcelle:
A Multivariate Interlace Polynomial and its Computation for Graphs of Bounded Clique-Width. Electron. J. Comb. 15(1) (2008) - [j77]Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté, Andrew Twigg:
Connectivity check in 3-connected planar graphs with obstacles. Electron. Notes Discret. Math. 31: 151-155 (2008) - [j76]Bruno Courcelle:
Circle graphs and monadic second-order logic. J. Appl. Log. 6(3): 416-442 (2008) - [j75]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) - [c58]Bruno Courcelle:
Quantifier-free definable graph operations preserving recognizability. Logic and Automata 2008: 251-260 - [c57]Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté:
Efficient First-Order Model-Checking Using Short Labels. FAW 2008: 159-170 - [c56]Bruno Courcelle:
Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects. ICALP (1) 2008: 1-13 - [i4]Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté:
Compact Labelings For Efficient First-Order Model-Checking. CoRR abs/0811.4713 (2008) - 2007
- [j74]Bruno Courcelle, Sang-il Oum:
Vertex-minors, monadic second-order logic, and a conjecture by Seese. J. Comb. Theory B 97(1): 91-126 (2007) - [c55]Bruno Courcelle, Andrew Twigg:
Compact Forbidden-Set Routing. STACS 2007: 37-48 - [c54]Bruno Courcelle, Mamadou Moustapha Kanté:
Graph Operations Characterizing Rank-Width and Balanced Graph Expressions. WG 2007: 66-75 - [i3]Bruno Courcelle:
A multivariate interlace polynomial. CoRR abs/cs/0702016 (2007) - 2006
- [j73]Achim Blumensath, Bruno Courcelle:
Recognizability, hypergraph operations, and logical types. Inf. Comput. 204(6): 853-919 (2006) - [j72]Bruno Courcelle:
The monadic second-order logic of graphs XV: On a conjecture by D. Seese. J. Appl. Log. 4(1): 79-114 (2006) - [j71]Bruno Courcelle:
The monadic second-order logic of graphs XVI : Canonical graph decompositions. Log. Methods Comput. Sci. 2(2) (2006) - [i2]Bruno Courcelle, Pascal Weil:
The recognizability of sets of graphs is a robust property. CoRR abs/cs/0609109 (2006) - 2005
- [j70]Bruno Courcelle:
Graph decompositions definable in monadic second-order logic. Electron. Notes Discret. Math. 22: 13-19 (2005) - [j69]Bruno Courcelle, Pascal Weil:
The recognizability of sets of graphs is a robust property. Theor. Comput. Sci. 342(2-3): 173-228 (2005) - [c53]Bruno Courcelle, Christian Delhommé:
The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic. CSL 2005: 325-338 - [i1]Bruno Courcelle:
The monadic second-order logic of graphs XVI : Canonical graph decompositions. CoRR abs/cs/0510066 (2005) - 2004
- [j68]Bruno Courcelle:
Clique-width of countable graphs: a compactness property. Discret. Math. 276(1-3): 127-148 (2004) - [c52]Bruno Courcelle:
Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey. Developments in Language Theory 2004: 1-11 - [c51]Bruno Courcelle, David Janin:
Workshop on Logic, Graph Transformations, Finite and Infinite Structures. ICGT 2004: 448-450 - 2003
- [j67]Bruno Courcelle, R. Vanicat:
Query efficient implementation of graphs of bounded clique-width. Discret. Appl. Math. 131(1): 129-150 (2003) - [j66]Bruno Courcelle:
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications. Theor. Comput. Sci. 299(1-3): 1-36 (2003) - 2002
- [j65]Bruno Courcelle, V. Dussaux:
Map Genus, Forbidden Maps, and Monadic Second-Order Logic. Electron. J. Comb. 9(1) (2002) - [j64]Bruno Courcelle:
A Monadic Second-Order Definition of the Structure of Convex Hypergraphs. Inf. Comput. 178(2): 391-411 (2002) - [j63]Bruno Courcelle, Johann A. Makowsky:
Fusion in Relational Structures and the Verification of Monadic Second-Order Properties. Math. Struct. Comput. Sci. 12(2): 203-235 (2002) - [j62]Bruno Courcelle, Teodor Knapik:
The evaluation of first-order substitution is monadic second-order compatible. Theor. Comput. Sci. 281(1-2): 177-206 (2002) - [c50]Bruno Courcelle:
Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations. FoSSaCS 2002: 1-4 - [c49]Bruno Courcelle, Pascal Weil:
Workshop on Logic, Graph Transformations and Discrete Structures. ICGT 2002: 455-458 - 2001
- [j61]Bruno Courcelle, Johann A. Makowsky, Udi Rotics:
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discret. Appl. Math. 108(1-2): 23-52 (2001) - [c48]Bruno Courcelle:
Graph Operations, Graph Transformations and Monadic Second-Order Logic: a survey. GETGRATS Closing Workshop 2001: 122-126 - 2000
- [j60]Bruno Courcelle, Stephan Olariu:
Upper bounds to the clique width of graphs. Discret. Appl. Math. 101(1-3): 77-114 (2000) - [j59]Bruno Courcelle:
Clique-width of countable graphs: a compactness property. Electron. Notes Discret. Math. 5: 75-76 (2000) - [j58]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) - [j57]Bruno Courcelle:
The monadic second-order logic of graphs XII: planar graphs and planar maps. Theor. Comput. Sci. 237(1-2): 1-32 (2000) - [j56]Bruno Courcelle:
The monadic second-order logic of graphs XIII: Graph drawings with edge crossings. Theor. Comput. Sci. 244(1-2): 63-94 (2000) - [c47]Bruno Courcelle:
Graph Operations and Monadic Second-Order Logic: A Survey. LPAR 2000: 20-24
1990 – 1999
- 1999
- [j55]Bruno Courcelle:
The Monadic Second-Order Logic of Graphs XI: Hierarchical Decompositions of Connected Graphs. Theor. Comput. Sci. 224(1-2): 35-58 (1999) - [c46]Bruno Courcelle:
Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas. RTA 1999: 90-91 - 1998
- [j54]Bruno Courcelle, Igor Walukiewicz:
Monadic Second-Order Logic, Graph Coverings and Unfoldings of Transition Systems. Ann. Pure Appl. Log. 92(1): 35-62 (1998) - [j53]Bruno Courcelle, Géraud Sénizergues:
The obstructions of a minor-closed set of graphs defined by a context-free grammar. Discret. Math. 182(1-3): 29-51 (1998) - [c45]Bruno Courcelle, Denis Lapoire:
Facial Circuits of Planar Graphs and Context-Free Languages. MFCS 1998: 616-624 - [c44]Bruno Courcelle, Johann A. Makowsky, Udi Rotics:
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width. WG 1998: 1-16 - 1997
- [j52]Bruno Courcelle, Rodney G. Downey, Michael R. Fellows:
A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals. J. Univers. Comput. Sci. 3(11): 1194-1198 (1997) - [c43]Bruno Courcelle:
Finite Model Theory, Universal Algebra and Graph Grammars. LFCS 1997: 53-55 - [p4]Bruno Courcelle:
The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic. Handbook of Graph Grammars 1997: 313-400 - 1996
- [j51]Bruno Courcelle, Jens Lagergren:
Equivalent Definitions of Recognizability for Sets of Graphs of Bounded Tree-Width. Math. Struct. Comput. Sci. 6(2): 141-165 (1996) - [j50]Bruno Courcelle:
The Monadic Second-Order Logic of Graphs X: Linear Orderings. Theor. Comput. Sci. 160(1&2): 87-143 (1996) - [j49]Bruno Courcelle:
Basic Notions of Universal Algebra for Language Theory and Graph Grammars. Theor. Comput. Sci. 163(1&2): 1-54 (1996) - [c42]Bruno Courcelle:
On the Expression of Graph Properties in some Fragments of Monadic Second-Order Logic. Descriptive Complexity and Finite Models 1996: 33-62 - 1995
- [j48]Bruno Courcelle:
The Monadic Second-Order Logic of Graphs VIII: Orientations. Ann. Pure Appl. Log. 72(2): 103-143 (1995) - [j47]Bruno Courcelle:
The Monadic Second-order Logic of Graphs VI: On Several Representations of Graphs by Relational Structures. Discret. Appl. Math. 63(2): 199-200 (1995) - [j46]Bruno Courcelle:
Structural Properties of Context-Free Sets of Graphs Generated by Vertex Replacement. Inf. Comput. 116(2): 275-293 (1995) - [j45]Bruno Courcelle, A. Pariès:
Mineurs d'arbres avec racines. RAIRO Theor. Informatics Appl. 29(5): 401-422 (1995) - [j44]Bruno Courcelle, Joost Engelfriet:
A Logical Characterization of the Sets of Hypergraphs Defined by Hyperedge Replacement Grammars. Math. Syst. Theory 28(6): 515-552 (1995) - [j43]Bruno Courcelle:
The Monadic Second-Order Logic of Graphs IX: Machines and their Behaviours. Theor. Comput. Sci. 151(1): 125-162 (1995) - [c41]Bruno Courcelle:
Logic and graphs. SEGRAGRA 1995: 71-72 - 1994
- [j42]Bruno Courcelle:
The Monadic Second order Logic of Graphs VI: on Several Representations of Graphs By Relational Structures. Discret. Appl. Math. 54(2-3): 117-149 (1994) - [j41]Bruno Courcelle, Yves Métivier:
Coverings and Minors: Application to Local Computations in Graphs. Eur. J. Comb. 15(2): 127-138 (1994) - [j40]Bruno Courcelle:
Recognizable Sets of Graphs: Equivalent Definitions and Closure Properties. Math. Struct. Comput. Sci. 4(1): 1-32 (1994) - [j39]Bruno Courcelle:
Monadic Second-Order Definable Graph Transductions: A Survey. Theor. Comput. Sci. 126(1): 53-75 (1994) - [c40]Bruno Courcelle:
Monadic Second-Order Logic and Linear Orderings of Finite Structures. CSL 1994: 163-176 - [c39]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 - [c38]Bruno Courcelle:
The Definition in Monadic Second-Order Logic of Modular Decompositions of Ordered Graphs. TAGT 1994: 487-501 - 1993
- [j38]Bruno Courcelle:
Graphs and Monadic Second-Order Logic: Some Open Problems. Bull. EATCS 49: 110-124 (1993) - [j37]Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese:
An Algebraic Theory of Graph Reduction. J. ACM 40(5): 1134-1164 (1993) - [j36]Bruno Courcelle, Joost Engelfriet, Grzegorz Rozenberg:
Handle-Rewriting Hypergraph Grammars. J. Comput. Syst. Sci. 46(2): 218-270 (1993) - [j35]Bruno Courcelle, Mohamed Mosbah:
Monadic Second-Order Evaluations on Tree-Decomposable Graphs. Theor. Comput. Sci. 109(1&2): 49-82 (1993) - [c37]Bruno Courcelle:
Graph Rewriting: A Bibliographical Guide. Term Rewriting 1993: 74 - [c36]Bruno Courcelle, Jens Lagergren:
Recognizable Sets of Graphs of Bounded Tree-Width. Dagstuhl Seminar on Graph Transformations in Computer Science 1993: 138-152 - [c35]Bruno Courcelle:
Context-Free Graph Grammars: Separating Vertex Replacement from Hyperedge Replacement. FCT 1993: 181-193 - [c34]Bruno Courcelle:
Monadic Second-Order Logic and Hypergraph Orientation. LICS 1993: 179-190 - 1992
- [j34]Bruno Courcelle:
The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues. RAIRO Theor. Informatics Appl. 26: 257-286 (1992) - [j33]Bruno Courcelle:
The Monadic Second-Order Logic of Graphs VII: Graphs as Relational Structures. Theor. Comput. Sci. 101(1): 3-33 (1992) - [c33]Bruno Courcelle:
Monadic Second-Order Graph Transductions. CAAP 1992: 124-144 - [p3]