Bruno Courcelle

8.8k total citations · 1 hit paper
105 papers, 3.3k citations indexed

About

Bruno Courcelle is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Geometry and Topology. According to data from OpenAlex, Bruno Courcelle has authored 105 papers receiving a total of 3.3k indexed citations (citations by other indexed papers that have themselves been cited), including 92 papers in Computational Theory and Mathematics, 44 papers in Artificial Intelligence and 11 papers in Geometry and Topology. Recurrent topics in Bruno Courcelle's work include semigroups and automata theory (58 papers), Advanced Graph Theory Research (55 papers) and Logic, programming, and type systems (33 papers). Bruno Courcelle is often cited by papers focused on semigroups and automata theory (58 papers), Advanced Graph Theory Research (55 papers) and Logic, programming, and type systems (33 papers). Bruno Courcelle collaborates with scholars based in France, United States and Germany. Bruno Courcelle's co-authors include Stephan Olariu, Joost Engelfriet, Mohamed Mosbah, Grzegorz Rozenberg, Michel Bauderon, Johann A. Makowsky, Udi Rotics, Maurice Nivat, Sang‐il Oum and Andrzej Proskurowski and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Bruno Courcelle

100 papers receiving 3.0k citations

Hit Papers

align trajectories sort by overperformance

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

The monadic second-order logic of graphs. I. Recognizable sets of finite graphs

1990 590 citations Bruno Courcelle Information and Computation profile →

Author Peers

Peers are selected by citation overlap in the author's most active subfields. citations · hero ref

Author						Papers	Cites
Bruno Courcelle	2.9k	1.3k	550	320	314	105	3.3k
Larry J. Stockmeyer	2.3k 0.8×	1.8k 1.4×	582 1.1×	73 0.2×	78 0.2×	37	3.1k
Albert R. Meyer	2.3k 0.8×	2.1k 1.6×	402 0.7×	42 0.1×	138 0.4×	93	3.0k
Eugene M. Luks	792 0.3×	792 0.6×	256 0.5×	534 1.7×	312 1.0×	58	1.7k
Andrzej Proskurowski	1.4k 0.5×	406 0.3×	704 1.3×	214 0.7×	181 0.6×	63	1.9k
Jörg Flum	1.5k 0.5×	739 0.6×	545 1.0×	156 0.5×	111 0.4×	46	1.9k
Maurice Nivat	1.8k 0.6×	1.6k 1.2×	127 0.2×	68 0.2×	117 0.4×	101	2.3k
Frank Ruskey	681 0.2×	643 0.5×	231 0.4×	378 1.2×	85 0.3×	84	1.3k
Joost Engelfriet	1.9k 0.7×	1.5k 1.2×	220 0.4×	70 0.2×	79 0.3×	111	2.3k
Venkatesh Raman	1.0k 0.4×	970 0.7×	639 1.2×	99 0.3×	31 0.1×	111	1.9k
Ross M. McConnell	928 0.3×	345 0.3×	269 0.5×	154 0.5×	108 0.3×	43	1.2k

Countries citing papers authored by Bruno Courcelle

Since Specialization

Citations

This map shows the geographic impact of Bruno Courcelle's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Bruno Courcelle with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bruno Courcelle more than expected).

Fields of papers citing papers by Bruno Courcelle

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Bruno Courcelle. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Bruno Courcelle. The network helps show where Bruno Courcelle may publish in the future.

Co-authorship network of co-authors of Bruno Courcelle

This figure shows the co-authorship network connecting the top 25 collaborators of Bruno Courcelle. A scholar is included among the top collaborators of Bruno Courcelle based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Bruno Courcelle. Bruno Courcelle is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Courcelle, Bruno. (2016). Fly-automata for checking MSO2 graph properties. Discrete Applied Mathematics. 245. 236–252. 1 indexed citations

Courcelle, Bruno. (2011). On the model-checking of monadic second-order formulas with edge set quantifications. Discrete Applied Mathematics. 160(6). 866–887. 18 indexed citations

Courcelle, Bruno. (2007). Circle graphs and monadic second-order logic. Journal of Applied Logic. 6(3). 416–442. 11 indexed citations

Blumensath, Achim & Bruno Courcelle. (2006). Recognizability, hypergraph operations, and logical types. Information and Computation. 204(6). 853–919. 7 indexed citations

Courcelle, Bruno. (2002). A Monadic Second-Order Definition of the Structure of Convex Hypergraphs. Information and Computation. 178(2). 391–411. 3 indexed citations

Courcelle, Bruno & Igor Walukiewicz. (1998). Monadic second-order logic, graph coverings and unfoldings of transition systems. Annals of Pure and Applied Logic. 92(1). 35–62. 20 indexed citations

Courcelle, Bruno. (1996). Basic notions of universal algebra for language theory and graph grammars. Theoretical Computer Science. 163(1-2). 1–54. 21 indexed citations

Courcelle, Bruno. (1996). The monadic second-order logic of graphs X: Linear orderings. Theoretical Computer Science. 160(1-2). 87–143. 32 indexed citations

Courcelle, Bruno. (1995). Structural Properties of Context-Free Sets of Graphs Generated by Vertex Replacement. Information and Computation. 116(2). 275–293. 20 indexed citations

10.

Courcelle, Bruno & Yves Métivier. (1994). Coverings and Minors: Application to Local Computations in Graphs. European Journal of Combinatorics. 15(2). 127–138. 12 indexed citations

11.

Courcelle, Bruno, Joost Engelfriet, & Grzegorz Rozenberg. (1993). Handle-rewriting hypergraph grammars. Journal of Computer and System Sciences. 46(2). 218–270. 172 indexed citations

12.

Courcelle, Bruno. (1992). Monadic Second-Order Graph Transductions. 124–144. 7 indexed citations

13.

Courcelle, Bruno. (1992). Recognizable sets of unrooted trees.. 72(4). 141–158. 2 indexed citations

14.

Courcelle, Bruno. (1992). The monadic second-order logic of graphs VII: graphs as relational structures. Theoretical Computer Science. 101(1). 3–33. 41 indexed citations

15.

Courcelle, Bruno. (1991). On Constructing Obstruction Sets of Words.. Bulletin of the European Association for Theoretical Computer Science. 44. 178–186. 14 indexed citations

16.

Courcelle, Bruno. (1984). Attribute grammars : definitions, analysis of dependencies, proof methods. 81–102. 11 indexed citations

17.

Courcelle, Bruno, et al.. (1984). The solutions of two star-height problems for regular trees. Theoretical Computer Science. 30(2). 205–239. 5 indexed citations

18.

Courcelle, Bruno. (1983). Fundamental properties of infinite trees. Theoretical Computer Science. 25(2). 95–169. 194 indexed citations

19.

Courcelle, Bruno. (1978). A representation of trees by languages II. Theoretical Computer Science. 7(1). 25–55. 44 indexed citations

20.

Courcelle, Bruno & Jean Vuillemin. (1976). Completeness results for the equivalence of recursive schemas. Journal of Computer and System Sciences. 12(2). 179–197. 18 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact