Bruno Courcelle
About
In The Last Decade
Bruno Courcelle
100 papers receiving 3.0k citations
Hit Papers
Peers
Comparison fields: 5 of 66
- Computational Theory and Mathematics 2.9k
- Artificial Intelligence 1.3k
- Computer Networks and Communications 550
- Discrete Mathematics and Combinatorics 320
- Geometry and Topology 314
Countries citing papers authored by Bruno Courcelle
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
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 2 | |
| 3 | 13 | |
| 4 | 18 | |
| 5 | 25 | |
| 6 | 11 | |
| 7 | 11 | |
| 8 | 5 | |
| 9 | 21 | |
| 10 | 32 | |
| 11 | 20 | |
| 12 | 20 | |
| 13 | 90 | |
| 14 | 117 | |
| 15 | Monadic Second-Order Graph Transductions | 7 |
| 16 | On Constructing Obstruction Sets of Words. | 14 |
| 17 | 12 | |
| 18 | The monadic second-order logic of graphs. I. Recognizable sets of finite graphs breakdown → | 590 |
| 19 | 57 | |
| 20 | 11 |
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.