É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 59
- Graph Labeling and Dimension Problems 46
-
- Limits and Structures in Graph Theory 29
- Co-authors
- André Raspaud (14 shared papers)Alexandr V. Kostochka (8 shared papers)Xuding Zhu (3 shared papers)Jaroslav Nešetřil (3 shared papers)Yves Métivier (7 shared papers)Oleg Veniaminovich Borodin (6 shared papers)Alexandre Pinlou (5 shared papers)Julien Bensmail (11 shared papers)
In The Last Decade
Éric Sopena
76 papers receiving 1.1k citations
Peers
Comparison fields: 5 of 53
- Discrete Mathematics and Combinatorics 530
- Computational Theory and Mathematics 1.1k
- Computer Graphics and Computer-Aided Design 96
- Geometry and Topology 123
- Computer Networks and Communications 150
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 83 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1994 | 103 | |
| 2 | 1997 | 76 | |
| 3 | 1997 | 76 | |
| 4 | 1997 | 72 | |
| 5 | 1999 | 68 | |
| 6 | 2001 | 67 | |
| 7 | 1999 | 64 | |
| 8 | 1997 | 62 | |
| 9 | 2001 | 54 | |
| 10 | 2002 | 52 | |
| 11 | 1997 | 51 | |
| 12 | 2000 | 41 | |
| 13 | 2015 | 33 | |
| 14 | 1995 | 27 | |
| 15 | 2009 | 19 | |
| 16 | 1990 | 18 | |
| 17 | 2014 | 18 | |
| 18 | 2001 | 16 | |
| 19 | 2006 | 16 | |
| 20 | 2017 | 15 |
About Éric Sopena
Éric Sopena is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Computer Graphics and Computer-Aided Design, Geometry and Topology and Computer Networks and Communications, having authored 83 papers that have together received 1.2k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (59 papers), Graph Labeling and Dimension Problems (46 papers), Limits and Structures in Graph Theory (29 papers), graph theory and CDMA systems (10 papers), Graph theory and applications (6 papers), Computational Geometry and Mesh Generation (5 papers), Artificial Intelligence in Games (4 papers) and DNA and Biological Computing (4 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (530 citations), Computational Theory and Mathematics (1.1k citations), Computer Graphics and Computer-Aided Design (96 citations), Geometry and Topology (123 citations) and Computer Networks and Communications (150 citations). Éric Sopena has collaborated with scholars based in France, Russia and Poland. Frequent co-authors include André Raspaud, Alexandr V. Kostochka, Xuding Zhu, Jaroslav Nešetřil, Yves Métivier, Oleg Veniaminovich Borodin, Alexandre Pinlou, Julien Bensmail, Pascal Ochem and Robert Cori. Their work appears in journals such as Discrete Applied Mathematics, Discrete Mathematics, Journal of Graph Theory, Discrete Mathematics & Theoretical Computer Science and 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.