Stéphan Thomassé
Stéphan Thomassé publishes mostly in Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Networks and Communications, on topics such as Advanced Graph Theory Research, Limits and Structures in Graph Theory and Complexity and Algorithms in Graphs.
- World rank
- #767,913 of 7,710,434 ranked researchers
- Rank in France
- #37,549 of 324,115
- Works
- 235
- Citations
- 3.1k
- Citations per work
- 13.0
What does Stéphan Thomassé research?
Stéphan Thomassé's work is mostly in Computer Science (62%), Mathematics (20%), Engineering (5%).
Their six largest subfields, inside their fields and domains; the grey slice is everything else they publish. The interactive view splits every one of their works down to single topics.
The fields and subfields, with their numbers
- Physical Sciences20486.7%
- Computer Science14762.5%
- Mathematics4619.6%
- Engineering114.6%
- Everything else3113.3%
- 1Computational Theory and Mathematics53% of their works
- 2Discrete Mathematics and Combinatorics15% of their works
- 3Computer Networks and Communications6% of their works
- 4Geometry and Topology5% of their works
- 5Electrical and Electronic Engineering5% of their works
- 6Computer Graphics and Computer-Aided Design4% of their works
Research topics
Which keywords describe Stéphan Thomassé's research?
The keywords of their largest research topics: Approximation Algorithms, Algorithmic Applications, Graph Theory, Parameterized Complexity, Graph Limits, Szemerédi's Theorem, Combinatorial Optimization and Complexity Theory.
- Formal Languages
- Topological Indices
- Spectral Amplitude Coding
- Fiber Bragg Grating
- Metric Dimension
- Complexity Theory
- Szemerédi's Theorem
- Parameterized Complexity
- Algorithmic Applications
- Approximation Algorithms
- Graph Theory
- Graph Limits
- Combinatorial Optimization
- Graph Labeling
- Delaunay Triangulations
- Mesh Generation
- Graph Spectra
- Automata
Size is their works in the topics tagged with each word, from their 8 largest topics. Each links to the topic it comes from most. The words come from the keyword list OpenAlex gives each topic, not from the text of the papers, so a word can appear that none of the papers uses.
All 18 words, with their numbers
- Approximation Algorithms2953 topics
- Algorithmic Applications2692 topics
- Graph Theory1841 topic
- Parameterized Complexity1841 topic
- Graph Limits901 topic
- Szemerédi's Theorem901 topic
- Combinatorial Optimization851 topic
- Complexity Theory851 topic
- Graph Labeling521 topic
- Metric Dimension521 topic
- Delaunay Triangulations261 topic
- Fiber Bragg Grating261 topic
- Mesh Generation261 topic
- Spectral Amplitude Coding261 topic
- Graph Spectra231 topic
- Topological Indices231 topic
- Automata191 topic
- Formal Languages191 topic
Where does Stéphan Thomassé work?
Stéphan Thomassé's main affiliation in the publication record is École Normale Supérieure de Lyon, France.
How many publications and citations does Stéphan Thomassé have?
OpenAlex counts 235 works and 3,060 citations for Stéphan Thomassé, an h-index of 27, ranking #767,913 of 7,710,434 researchers worldwide on the quality score.
Ranked on field-normalised citation excellence (50%), output (30%) and citations (20%). Counts come from OpenAlex author records, which occasionally merge different people who share a name or split one person into several.
Papers, co-authors, who cited this work and researchers on the nearest topics have tabs of their own, above. Is this your page? Claim it with your ORCID iD, or request a correction or removal.
Discussion
Ask a question or share a note about Stéphan Thomassé. Keep it to the research: no personal attacks, advertising or links. Any reader can report a post, which collapses it for everyone until it is opened.