Éric Sopena
Impact in
-
- Limits and Structures in Graph Theory
- Computational Theory and Mathematics top 0.5%
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
Papers in
-
- Advanced Graph Theory Research 43
- Graph Labeling and Dimension Problems 36
-
- Limits and Structures in Graph Theory 24
- Co-authors
- André Raspaud (12 shared papers)Alexandr Kostochka (7 shared papers)Jaroslav Nešetřil (5 shared papers)Xuding Zhu (3 shared papers)O. V. Borodin (6 shared papers)Alexandre Pinlou (5 shared papers)Julien Bensmail (8 shared papers)Ingo Schiermeyer (1 shared paper)
In The Last Decade
Éric Sopena
53 papers receiving 815 citations
Peers
Comparison fields: 5 of 42
- Discrete Mathematics and Combinatorics 467
- Computational Theory and Mathematics 823
- Computer Graphics and Computer-Aided Design 77
- Geometry and Topology 88
- Electrical and Electronic Engineering 165
Countries citing papers authored by Éric Sopena
This map shows the geographic impact of Éric Sopena'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 Éric Sopena with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Éric Sopena more than expected).
Fields of papers citing papers by Éric Sopena
This network shows the impact of papers produced by Éric Sopena. 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 Éric Sopena. The network helps show where Éric Sopena may publish in the future.
Co-authors
The 25 scholars most cited alongside Éric Sopena, 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 58 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1994 | 89 | |
| 2 | 1997 | 67 | |
| 3 | 1997 | 66 | |
| 4 | 1999 | 63 | |
| 5 | 1997 | 61 | |
| 6 | 2001 | 57 | |
| 7 | 1997 | 50 | |
| 8 | 1997 | 49 | |
| 9 | 2002 | 47 | |
| 10 | 2001 | 46 | |
| 11 | 2000 | 36 | |
| 12 | 2015 | 20 | |
| 13 | 2014 | 18 | |
| 14 | 2006 | 15 | |
| 15 | 2017 | 14 | |
| 16 | 1995 | 14 | |
| 17 | 2005 | 14 | |
| 18 | 2015 | 13 | |
| 19 | 2009 | 13 | |
| 20 | 1998 | 11 |
About Éric Sopena
Éric Sopena is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering, Geometry and Topology and Artificial Intelligence, having authored 58 papers that have together received 882 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (43 papers), Graph Labeling and Dimension Problems (36 papers), Limits and Structures in Graph Theory (24 papers), graph theory and CDMA systems (6 papers), Graph theory and applications (4 papers), Computational Geometry and Mesh Generation (4 papers), Artificial Intelligence in Games (3 papers) and Distributed systems and fault tolerance (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (467 citations), Computational Theory and Mathematics (823 citations), Computer Graphics and Computer-Aided Design (77 citations), Geometry and Topology (88 citations) and Electrical and Electronic Engineering (165 citations). Éric Sopena has collaborated with scholars based in France, Russia and Poland. Frequent co-authors include André Raspaud, Alexandr Kostochka, Jaroslav Nešetřil, Xuding Zhu, O. V. Borodin, Alexandre Pinlou, Julien Bensmail, Ingo Schiermeyer, Paul Dorbec and Robert Cori. Their work appears in journals such as Discrete Applied Mathematics, Discrete Mathematics, Journal of Graph Theory, Theoretical Computer Science and Discrete Mathematics & Theoretical Computer Science.
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.