Stéphan Thomassé
Impact in
-
- Limits and Structures in Graph Theory
- Computational Theory and Mathematics top 0.5%
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
Papers in
-
- Advanced Graph Theory Research 80
- Complexity and Algorithms in Graphs 37
- Graph Labeling and Dimension Problems 24
-
- Limits and Structures in Graph Theory 43
- Co-authors
- Anders Yeo (8 shared papers)Frédéric Havet (10 shared papers)Nicolás Bousquet (15 shared papers)Stéphane Bessy (7 shared papers)Pierre Charbit (7 shared papers)Hans L. Bodlaender (1 shared paper)Jørgen Bang‐Jensen (4 shared papers)Michaël Rao (2 shared papers)
- Journals
- Journal of Combinatorial Theory Series B (15 papers)Discrete Mathematics (8 papers)European Journal of Combinatorics (7 papers)Combinatorics Probability Computing (5 papers)Discrete Applied Mathematics (4 papers)
- Partner nations
- FranceUnited KingdomUnited States
In The Last Decade
Stéphan Thomassé
82 papers receiving 925 citations
Peers
Comparison fields: 5 of 55
- Discrete Mathematics and Combinatorics 341
- Computational Theory and Mathematics 877
- Geometry and Topology 144
- Computer Graphics and Computer-Aided Design 39
- Computer Networks and Communications 177
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 94 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2011 | 88 | |
| 2 | 2006 | 74 | |
| 3 | 2007 | 69 | |
| 4 | 2010 | 67 | |
| 5 | 2011 | 51 | |
| 6 | 2009 | 35 | |
| 7 | 2009 | 32 | |
| 8 | 2012 | 27 | |
| 9 | 2011 | 26 | |
| 10 | 2000 | 25 | |
| 11 | 2010 | 24 | |
| 12 | 2000 | 24 | |
| 13 | 2012 | 19 | |
| 14 | 2006 | 16 | |
| 15 | 2012 | 16 | |
| 16 | 2015 | 15 | |
| 17 | 2013 | 15 | |
| 18 | 2015 | 14 | |
| 19 | 2015 | 14 | |
| 20 | 2013 | 14 |
About Stéphan Thomassé
Stéphan Thomassé is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Electrical and Electronic Engineering and Computer Networks and Communications, having authored 94 papers that have together received 990 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (80 papers), Limits and Structures in Graph Theory (43 papers), Complexity and Algorithms in Graphs (37 papers), Graph Labeling and Dimension Problems (24 papers), graph theory and CDMA systems (14 papers), Graph theory and applications (11 papers), Optimization and Search Problems (8 papers) and Computational Geometry and Mesh Generation (8 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (341 citations), Computational Theory and Mathematics (877 citations), Geometry and Topology (144 citations), Computer Graphics and Computer-Aided Design (39 citations) and Computer Networks and Communications (177 citations). Stéphan Thomassé has collaborated with scholars based in France, United Kingdom and United States. Frequent co-authors include Anders Yeo, Frédéric Havet, Nicolás Bousquet, Stéphane Bessy, Pierre Charbit, Hans L. Bodlaender, Jørgen Bang‐Jensen, Michaël Rao, Daniel Gonçalves and Alexandre Pinlou. Their work appears in journals such as Journal of Combinatorial Theory Series B, Discrete Mathematics, European Journal of Combinatorics, Combinatorics Probability Computing and Discrete Applied Mathematics.
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.