Stéphan Thomassé

3.0k total citations
94 papers, 990 citations indexed

About

Stéphan Thomassé is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Stéphan Thomassé has authored 94 papers receiving a total of 990 indexed citations (citations by other indexed papers that have themselves been cited), including 87 papers in Computational Theory and Mathematics, 46 papers in Discrete Mathematics and Combinatorics and 18 papers in Geometry and Topology. Recurrent topics in Stéphan Thomassé's work include Advanced Graph Theory Research (80 papers), Limits and Structures in Graph Theory (43 papers) and Complexity and Algorithms in Graphs (37 papers). Stéphan Thomassé is often cited by papers focused on Advanced Graph Theory Research (80 papers), Limits and Structures in Graph Theory (43 papers) and Complexity and Algorithms in Graphs (37 papers). Stéphan Thomassé collaborates with scholars based in France, United Kingdom and United States. Stéphan Thomassé's 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 and has published in prestigious journals such as Journal of the ACM, Transactions of the American Mathematical Society and SIAM Journal on Computing.

In The Last Decade

Stéphan Thomassé

82 papers receiving 925 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Stéphan Thomassé France	16	877	341	177	161	144	94	990
Petr A. Golovach Norway	17	922 1.1×	277 0.8×	296 1.7×	110 0.7×	88 0.6×	149	1.0k
Frédéric Maffray France	16	1.0k 1.2×	480 1.4×	162 0.9×	148 0.9×	186 1.3×	111	1.1k
Douglas F. Rall United States	22	1.2k 1.4×	416 1.2×	213 1.2×	152 0.9×	312 2.2×	80	1.3k
Boštjan Brešar Slovenia	20	1.3k 1.5×	434 1.3×	308 1.7×	145 0.9×	370 2.6×	123	1.5k
Gary MacGillivray Canada	15	566 0.6×	184 0.5×	162 0.9×	97 0.6×	102 0.7×	78	688
Celina M.H. de Figueiredo Brazil	14	589 0.7×	201 0.6×	102 0.6×	146 0.9×	93 0.6×	134	663
Jan Arne Telle Norway	16	720 0.8×	131 0.4×	343 1.9×	71 0.4×	82 0.6×	69	864
Martin Farber Canada	15	1.0k 1.1×	237 0.7×	239 1.4×	180 1.1×	222 1.5×	17	1.1k
Udi Rotics Israel	13	1.0k 1.2×	241 0.7×	292 1.6×	72 0.4×	200 1.4×	26	1.1k
Andreas Björklund Sweden	12	497 0.6×	105 0.3×	187 1.1×	54 0.3×	35 0.2×	35	668

Countries citing papers authored by Stéphan Thomassé

Since Specialization

Citations

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é

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Stéphan Thomassé

This figure shows the co-authorship network connecting the top 25 collaborators of Stéphan Thomassé. A scholar is included among the top collaborators of Stéphan Thomassé 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 Stéphan Thomassé. Stéphan Thomassé 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

Thomassé, Stéphan, et al.. (2025). First order logic and twin-width in tournaments and dense oriented graphs. European Journal of Combinatorics. 132. 104247–104247.

Bonamy, Marthe, et al.. (2024). Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. Journal of Combinatorial Theory Series B. 167. 215–249. 1 indexed citations

Bonnet, Édouard, Jaroslav Nešetřil, Patrice Ossona de Mendez, Sebastian Siebertz, & Stéphan Thomassé. (2024). Twin-width and permutations. Logical Methods in Computer Science. Volume 20, Issue 3.

Scott, Alex, et al.. (2023). Clique covers of H-free graphs. European Journal of Combinatorics. 118. 103909–103909.

Bousquet, Nicolás, et al.. (2023). Extremal Independent Set Reconfiguration. The Electronic Journal of Combinatorics. 30(3).

Lokshtanov, Daniel, et al.. (2018). Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. SPIRE - Sciences Po Institutional REpository. 1 indexed citations

Bousquet, Nicolás, et al.. (2018). A proof of the Erdős–Sands–Sauer–Woodrow conjecture. Journal of Combinatorial Theory Series B. 137. 316–319. 2 indexed citations

Bensmail, Julien, et al.. (2017). A proof of the Barát–Thomassen conjecture. Journal of Combinatorial Theory Series B. 124. 39–55. 2 indexed citations

Bousquet, Nicolás & Stéphan Thomassé. (2015). VC-dimension and Erdős–Pósa property. Discrete Mathematics. 338(12). 2302–2317. 15 indexed citations

10.

Bousquet, Nicolás, et al.. (2014). Clique versus independent set. European Journal of Combinatorics. 40. 73–92. 9 indexed citations

11.

Monteil, Thierry, et al.. (2013). Symmetric Determinantal Representations in characteristic 2. Linear Algebra and its Applications. 439(5). 1364–1381.

12.

Heuvel, Jan van den & Stéphan Thomassé. (2011). Cyclic orderings and cyclic arboricity of matroids. Journal of Combinatorial Theory Series B. 102(3). 638–646. 8 indexed citations

13.

Gonçalves, Daniel, Frédéric Havet, Alexandre Pinlou, & Stéphan Thomassé. (2011). On spanning galaxies in digraphs. Discrete Applied Mathematics. 160(6). 744–754. 2 indexed citations

14.

Thomassé, Stéphan. (2009). A quadratic kernel for feedback vertex set. Symposium on Discrete Algorithms. 115–119. 32 indexed citations

15.

Thomassé, Stéphan. (2007). Cyclic Orderings of Matroids. HAL (Le Centre pour la Communication Scientifique Directe). 1 indexed citations

16.

Havet, Frédéric, Stéphan Thomassé, & Anders Yeo. (2007). Hoàng–Reed conjecture holds for tournaments. Discrete Mathematics. 308(15). 3412–3415. 1 indexed citations

17.

Charbit, Pierre, et al.. (2007). Finding a vector orthogonal to roughly half a collection of vectors. Journal of Complexity. 24(1). 39–53. 3 indexed citations

18.

Addario‐Berry, Louigi, Frédéric Havet, & Stéphan Thomassé. (2006). Paths with two blocks in n-chromatic digraphs. Journal of Combinatorial Theory Series B. 97(4). 620–626. 9 indexed citations

19.

Bessy, Stéphane & Stéphan Thomassé. (2005). The categorical product of two 5-chromatic digraphs can be 3-chromatic. Discrete Mathematics. 305(1-3). 344–346. 1 indexed citations

20.

Thomassé, Stéphan. (1999). On Better-Quasi-Ordering Countable Series-Parallel Orders. Transactions of the American Mathematical Society. 352(6). 2491–2505. 7 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