Bruno Courcelle

From MaRDI portal
Person:248922

Available identifiers

zbMath Open courcelle.brunoWikidataQ17305808 ScholiaQ17305808MaRDI QIDQ248922

List of research outcomes

PublicationDate of PublicationType
The monadic second-order logic of graphs : Definable sets of finite graphs2024-02-28Paper
Unfoldings and Coverings of Weighted Graphs2023-09-14Paper
Betweenness in Order-Theoretic Trees2022-11-09Paper
Order-theoretic Trees: Monadic Second-order Descriptions and Regularity2022-10-07Paper
Induced betweenness in order-theoretic trees2022-09-30Paper
Recognizable sets of graphs of bounded tree-width2022-08-16Paper
Betweenness of partial orders2022-01-12Paper
https://portal.mardi4nfdi.de/entity/Q58564152021-03-26Paper
On defining linear orders by automata2020-11-10Paper
Axiomatization of betweenness in order-theoretic trees2020-04-21Paper
Grammars and clique-width bounds from split decompositions2020-04-21Paper
On quasi-planar graphs: clique-width and logical description2020-04-21Paper
The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed2019-01-10Paper
The definition in monadic second-order logic of modular decompositions of ordered graphs2019-01-10Paper
From tree-decompositions to clique-width terms2018-09-17Paper
Fly-automata for checking \(\mathrm{MSO}_2\) graph properties2018-05-24Paper
https://portal.mardi4nfdi.de/entity/Q53670452017-10-12Paper
Several notions of rank-width for countable graphs2017-01-26Paper
Fly-automata for checking monadic second-order properties of graphs of bounded tree-width2016-10-17Paper
https://portal.mardi4nfdi.de/entity/Q28160722016-07-01Paper
Computations by fly-automata beyond monadic second-order logic2016-02-26Paper
Regularity Equals Monadic Second-Order Definability for Quasi-trees2015-09-22Paper
Clique-width and edge contraction2015-06-25Paper
A characterisation of clique-width through nested partitions2015-06-10Paper
The Common Structure of the Curves Having a Same Gauss Word2015-04-14Paper
Monadic second-order definable graph orderings2014-01-22Paper
Model-Checking by Infinite Fly-Automata2013-09-20Paper
Connectivity check in 3-connected planar graphs with obstacles2013-06-28Paper
Graph Operations, Graph Transformations and Monadic Second-Order Logic:2013-05-24Paper
Automata for the verification of monadic second-order graph properties2013-05-02Paper
https://portal.mardi4nfdi.de/entity/Q29088342012-08-29Paper
On the model-checking of monadic second-order formulas with edge set quantifications2012-05-11Paper
Fly-Automata, Their Properties and Applications2011-07-29Paper
https://portal.mardi4nfdi.de/entity/Q30869242011-03-30Paper
Compact labelings for efficient first-order model-checking2011-02-18Paper
https://portal.mardi4nfdi.de/entity/Q30779552011-02-18Paper
Constrained-path labellings on graphs of bounded clique-width2010-10-06Paper
On the Monadic Second-Order Transduction Hierarchy2010-07-27Paper
Linear delay enumeration and monadic second-order logic2010-04-28Paper
https://portal.mardi4nfdi.de/entity/Q34006282010-02-05Paper
https://portal.mardi4nfdi.de/entity/Q34006292010-02-05Paper
On Several Proofs of the Recognizability Theorem2009-11-05Paper
Graph operations characterizing rank-width2009-06-30Paper
A multivariate interlace polynomial and its computation for graphs of bounded clique-width2009-04-07Paper
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications2009-04-02Paper
https://portal.mardi4nfdi.de/entity/Q36158122009-03-24Paper
Circle graphs and monadic second-order logic2008-09-23Paper
Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects2008-08-28Paper
Graph Operations Characterizing Rank-Width and Balanced Graph Expressions2008-07-01Paper
Efficient First-Order Model-Checking Using Short Labels2008-06-19Paper
The modular decomposition of countable graphs. Definition and construction in monadic second-order logic2008-04-15Paper
The monadic second-order logic of graphs XVI : Canonical graph decompositions2007-10-11Paper
Compact Forbidden-Set Routing2007-09-03Paper
Graph decompositions definable in monadic second-order logic2007-05-29Paper
Vertex-minors, monadic second-order logic, and a conjecture by Seese2007-01-11Paper
Computer Science Logic2006-11-01Paper
Recognizability, hypergraph operations, and logical types2006-07-12Paper
The monadic second-order logic of graphs. XV: On a conjecture by D. Seese2006-06-30Paper
Developments in Language Theory2005-12-22Paper
The recognizability of sets of graphs is a robust property2005-09-22Paper
https://portal.mardi4nfdi.de/entity/Q47382132004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44748372004-07-21Paper
Clique-width of countable graphs: A compactness property.2004-02-14Paper
https://portal.mardi4nfdi.de/entity/Q44388052003-12-10Paper
https://portal.mardi4nfdi.de/entity/Q44313612003-10-22Paper
https://portal.mardi4nfdi.de/entity/Q44313322003-10-21Paper
Query efficient implementation of graphs of bounded clique-width2003-09-25Paper
The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions.2003-05-25Paper
Map genus, forbidden maps, and monadic second-order logic2003-05-13Paper
Linear time solvable optimization problems on graphs of bounded clique-width2003-03-18Paper
Fusion in relational structures and the verification of monadic second-order properties2002-10-16Paper
https://portal.mardi4nfdi.de/entity/Q27670032002-07-22Paper
The evaluation of first-order substitution is monadic second-order compatible2002-07-15Paper
A monadic second-order definition of the structure of convex hypergraphs.2002-01-01Paper
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic2001-11-09Paper
Upper bounds to the clique width of graphs2001-03-30Paper
https://portal.mardi4nfdi.de/entity/Q45205192001-02-26Paper
The monadic second-order logic of graphs. XIII: Graph drawings with edge crossings2000-08-21Paper
The monadic second-order logic of graphs. XII: Planar graphs and planar maps2000-06-04Paper
The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs2000-01-12Paper
https://portal.mardi4nfdi.de/entity/Q42327731999-12-13Paper
Monadic second-order logic, graph coverings and unfoldings of transition systems1999-11-03Paper
Une axiomatisation au premier ordre des arrangements de pseudodroites euclidiennes. (A first-order axiomatisation of arrangements of Euclidean pseudolines.)1999-07-12Paper
https://portal.mardi4nfdi.de/entity/Q42227891998-12-13Paper
https://portal.mardi4nfdi.de/entity/Q42181371998-11-11Paper
https://portal.mardi4nfdi.de/entity/Q43855311998-05-14Paper
https://portal.mardi4nfdi.de/entity/Q43855351998-05-14Paper
https://portal.mardi4nfdi.de/entity/Q43535581998-03-23Paper
The obstructions of a minor-closed set of graphs defined by a context-free grammar1998-02-25Paper
https://portal.mardi4nfdi.de/entity/Q43479511997-11-09Paper
The monadic second-order logic of graphs. X: Linear orderings1997-09-18Paper
Basic notions of universal algebra for language theory and graph grammars1997-02-27Paper
The monadic second-order logic of graphs. IX: Machines and their behaviours1997-02-27Paper
Equivalent definitions of recognizability for sets of graphs of bounded tree-width1996-09-12Paper
Mineurs d'arbres avec racines1996-05-27Paper
Erratum to ``The monadic second-order logic of graphs. VI: On several representations of graphs by relational structures1996-02-18Paper
The monadic second-order logic of graphs. VIII: Orientations1996-01-30Paper
Structural properties of context-free sets of graphs generated by vertex replacement1996-01-02Paper
https://portal.mardi4nfdi.de/entity/Q48529051995-11-30Paper
Monadic second-order definable graph transductions: a survey1995-01-26Paper
The monadic second order logic of graphs. VI: On several representations of graphs by relational structures1994-11-03Paper
An algebraic theory of graph reduction1994-09-11Paper
Recognizable sets of graphs: equivalent definitions and closure properties1994-04-26Paper
Coverings and minors: Application to local computations in graphs1994-04-21Paper
https://portal.mardi4nfdi.de/entity/Q42842391994-04-17Paper
https://portal.mardi4nfdi.de/entity/Q42736631994-01-13Paper
https://portal.mardi4nfdi.de/entity/Q42738711994-01-06Paper
Handle-rewriting hypergraph grammars1993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40372941993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40372991993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40373121993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40373131993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40295941993-03-28Paper
https://portal.mardi4nfdi.de/entity/Q40051971992-09-27Paper
The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues1992-09-27Paper
The monadic second-order logic of graphs. VII: Graphs as relational structures1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39751331992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q47133681992-06-25Paper
The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability1992-06-25Paper
Recursive queries and context-free graph grammars1991-01-01Paper
A geometrical view of the determinization and minimization of finite-state automata1991-01-01Paper
The monadic second-order logic of graphs. IV: Definability properties of equational graphs1990-01-01Paper
The monadic second-order logic of graphs. I: Recognizable sets of finite graphs1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42050681989-01-01Paper
The monadic second-order logic of graphs, II: Infinite graphs of bounded width1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47293781988-01-01Paper
Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37875061988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38305401988-01-01Paper
An axiomatic definition of context-free rewriting and its application to NLC graph grammars1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37565021987-01-01Paper
Decidable subcases of the equivalence problem for recursive program schemes1987-01-01Paper
Graph expressions and graph rewritings1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37859861987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37859871987-01-01Paper
Equivalences and transformations of regular systems - applications to recursive program schemes and grammars1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37427481986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37766621986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36928801985-01-01Paper
The solutions of two star-height problems for regular trees1984-01-01Paper
Some negative results concerning DPDA's1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36754981984-01-01Paper
Fundamental properties of infinite trees1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36679291983-01-01Paper
An axiomatic approach to the Korenjak-Hopcroft algorithms1983-01-01Paper
Attribute grammars and recursive program schemes. I. II1982-01-01Paper
On the equivalence problem for attribute systems1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36591601982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39071151981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39120071981-01-01Paper
The Rational Index: A Complexity Measure for Languages1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39594061981-01-01Paper
The simultaneous accessibility of two configurations of two equivalent DPDA's1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39126301980-01-01Paper
Infinite trees in normal form and recursive equations having a unique solution1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41929471979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41647871978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41929901978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41980801978-01-01Paper
A representation of trees by languages. II1978-01-01Paper
A representation of trees by languages. I1978-01-01Paper
On some classes of interpretations1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38687891977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41273651977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41404101977-01-01Paper
On jump-deterministic pushdown automata1977-01-01Paper
Completeness results for the equivalence of recursive schemas1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40576341974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41309571974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47727111974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47727201974-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Bruno Courcelle