Stéphan Thomassé
Impact in
- Computational Theory and Mathematics top 0.2%
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
-
- Limits and Structures in Graph Theory
- Advanced Combinatorial Mathematics
Papers in
-
- Advanced Graph Theory Research 101
- Complexity and Algorithms in Graphs 13
- Polynomial and algebraic computation 3
- Graph Labeling and Dimension Problems 2
-
- Limits and Structures in Graph Theory 35
- Advanced Combinatorial Mathematics 6
- Co-authors
- Anders Yeo (8 shared papers)Hans L. Bodlaender (2 shared papers)Nicolás Bousquet (18 shared papers)Frédéric Havet (10 shared papers)Pierre Charbit (8 shared papers)Stéphane Bessy (8 shared papers)Édouard Bonnet (19 shared papers)Eun Jung Kim (10 shared papers)
- Journals
- Journal of Combinatorial Theory Series B (17 papers)Discrete Mathematics (8 papers)European Journal of Combinatorics (7 papers)SIAM Journal on Discrete Mathematics (7 papers)Journal of Graph Theory (5 papers)
- Partner nations
- FranceUnited KingdomUnited States
In The Last Decade
Stéphan Thomassé
121 papers receiving 1.8k citations
Peers
Comparison fields: 5 of 33
- Computational Theory and Mathematics 1.6k
- Discrete Mathematics and Combinatorics 378
- Geometry and Topology 33
- Computer Graphics and Computer-Aided Design 11
- Economics and Econometrics 55
Countries citing papers authored by Stéphan Thomassé
This map shows the geographic impact of Stéphan Thomassé'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 Stéphan Thomassé with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Stéphan Thomassé more than expected).
Fields of papers citing papers by Stéphan Thomassé
This network shows the impact of papers produced by Stéphan Thomassé. 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 Stéphan Thomassé. The network helps show where Stéphan Thomassé may publish in the future.
Co-authors
The 25 scholars most cited alongside Stéphan Thomassé, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 129 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2011 | 155 | |
| 2 | 2010 | 131 | |
| 3 | 2006 | 110 | |
| 4 | 2007 | 90 | |
| 5 | 2011 | 68 | |
| 6 | 2009 | 59 | |
| 7 | 2011 | 56 | |
| 8 | 2009 | 54 | |
| 9 | 2020 | 51 | |
| 10 | 2000 | 46 | |
| 11 | 2009 | 45 | |
| 12 | 2021 | 40 | |
| 13 | 2010 | 38 | |
| 14 | 2012 | 38 | |
| 15 | 2000 | 34 | |
| 16 | 2012 | 34 | |
| 17 | 2009 | 27 | |
| 18 | 2015 | 25 | |
| 19 | 2009 | 24 | |
| 20 | 2013 | 24 |
About Stéphan Thomassé
Stéphan Thomassé is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Computer Graphics and Computer-Aided Design and Mathematical Physics, having authored 129 papers that have together received 1.9k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (101 papers), Limits and Structures in Graph Theory (35 papers), Complexity and Algorithms in Graphs (13 papers), Advanced Topology and Set Theory (7 papers), Advanced Combinatorial Mathematics (6 papers), Polynomial and algebraic computation (3 papers), Computational Geometry and Mesh Generation (2 papers) and Graph Labeling and Dimension Problems (2 papers). The work is most often cited by research in Computational Theory and Mathematics (1.6k citations), Discrete Mathematics and Combinatorics (378 citations), Geometry and Topology (33 citations), Computer Graphics and Computer-Aided Design (11 citations) and Economics and Econometrics (55 citations). Stéphan Thomassé has collaborated with scholars based in France, United Kingdom and United States. Frequent co-authors include Anders Yeo, Hans L. Bodlaender, Nicolás Bousquet, Frédéric Havet, Pierre Charbit, Stéphane Bessy, Édouard Bonnet, Eun Jung Kim, Michaël Rao and Saket Saurabh. Their work appears in journals such as Journal of Combinatorial Theory Series B, Discrete Mathematics, European Journal of Combinatorics, SIAM Journal on Discrete Mathematics and Journal of Graph Theory.
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.