Yann Vaxès

652 total citations
36 papers, 271 citations indexed

About

Yann Vaxès is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Computer Networks and Communications. According to data from OpenAlex, Yann Vaxès has authored 36 papers receiving a total of 271 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Computational Theory and Mathematics, 10 papers in Computer Graphics and Computer-Aided Design and 9 papers in Computer Networks and Communications. Recurrent topics in Yann Vaxès's work include Advanced Graph Theory Research (19 papers), Computational Geometry and Mesh Generation (10 papers) and Complexity and Algorithms in Graphs (9 papers). Yann Vaxès is often cited by papers focused on Advanced Graph Theory Research (19 papers), Computational Geometry and Mesh Generation (10 papers) and Complexity and Algorithms in Graphs (9 papers). Yann Vaxès collaborates with scholars based in France, United States and Austria. Yann Vaxès's co-authors include Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Jérémie Chalopin, Nicolas Nisse, Yang Xiang, Hartmut Noltemeier, Xiaoguang Yang and Ilan Newman and has published in prestigious journals such as European Journal of Operational Research, Biological Conservation and Theoretical Computer Science.

In The Last Decade

Yann Vaxès

33 papers receiving 258 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Yann Vaxès France 9 171 71 69 41 33 36 271
Phyllis Zweig Chinn United States 4 227 1.3× 91 1.3× 58 0.8× 18 0.4× 59 1.8× 11 286
Eyal Ackerman Israel 9 89 0.5× 27 0.4× 25 0.4× 92 2.2× 30 0.9× 26 229
Petr Hliněný Czechia 13 507 3.0× 132 1.9× 78 1.1× 131 3.2× 37 1.1× 79 576
Clemens Huemer Spain 10 172 1.0× 31 0.4× 44 0.6× 208 5.1× 49 1.5× 67 296
Pierre Rosenstiehl France 10 155 0.9× 44 0.6× 53 0.8× 206 5.0× 40 1.2× 24 356
Stephen G. Hartke United States 9 153 0.9× 29 0.4× 46 0.7× 20 0.5× 40 1.2× 41 222
Torsten Ueckerdt Germany 8 129 0.8× 42 0.6× 16 0.2× 70 1.7× 50 1.5× 32 237
Zsolt Tuza Hungary 13 313 1.8× 97 1.4× 77 1.1× 20 0.5× 68 2.1× 27 372
Richard D. Ringeisen United States 9 206 1.2× 41 0.6× 52 0.8× 130 3.2× 76 2.3× 21 286
Luděk Kučera Czechia 8 177 1.0× 75 1.1× 29 0.4× 12 0.3× 29 0.9× 35 303

Countries citing papers authored by Yann Vaxès

Since Specialization
Citations

This map shows the geographic impact of Yann Vaxès'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 Yann Vaxès with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Yann Vaxès more than expected).

Fields of papers citing papers by Yann Vaxès

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Yann Vaxès. 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 Yann Vaxès. The network helps show where Yann Vaxès may publish in the future.

Co-authorship network of co-authors of Yann Vaxès

This figure shows the co-authorship network connecting the top 25 collaborators of Yann Vaxès. A scholar is included among the top collaborators of Yann Vaxès 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 Yann Vaxès. Yann Vaxès is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Chalopin, Jérémie, et al.. (2024). ABC(T)-graphs: An axiomatic characterization of the median procedure in graphs with connected and G2-connected medians. Discrete Applied Mathematics. 359. 55–74.
2.
Vaxès, Yann, et al.. (2023). Cumulative effects on habitat networks: How greedy should we be?. Biological Conservation. 282. 110066–110066. 2 indexed citations
3.
Albert, Cécile H., et al.. (2022). Optimizing the ecological connectivity of landscapes. Networks. 81(2). 278–293. 3 indexed citations
4.
Chalopin, Jérémie, et al.. (2022). Medians in median graphs and their cube complexes in linear time. Journal of Computer and System Sciences. 126. 80–105. 5 indexed citations
5.
Chalopin, Jérémie, et al.. (2019). Medians in median graphs in linear time.. arXiv (Cornell University). 1 indexed citations
6.
Bonami, Pierre, Dorian Mazauric, & Yann Vaxès. (2017). Maximum flow under proportional delay constraint. Theoretical Computer Science. 689. 58–66. 2 indexed citations
7.
Chepoi, Victor, et al.. (2011). Embedding into the rectilinear plane in optimal O(n2) time. Theoretical Computer Science. 412(22). 2425–2433. 2 indexed citations
8.
Chepoi, Victor, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, & Yann Vaxès. (2010). Constant approximation algorithms for embedding graph metrics into trees\n and outerplanar graphs. arXiv (Cornell University). 8 indexed citations
9.
Chepoi, Victor, Feodor F. Dragan, Bertrand Estellon, et al.. (2010). Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs. Algorithmica. 62(3-4). 713–732. 19 indexed citations
10.
Chepoi, Victor, Bertrand Estellon, & Yann Vaxès. (2008). Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length. Theoretical Computer Science. 401(1-3). 131–143. 3 indexed citations
11.
Chepoi, Victor, Feodor F. Dragan, Bertrand Estellon, Michel Habib, & Yann Vaxès. (2008). Notes on diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs. Electronic Notes in Discrete Mathematics. 31. 231–234. 30 indexed citations
12.
Chepoi, Victor, et al.. (2007). A rounding algorithm for approximating minimum Manhattan networks. Theoretical Computer Science. 390(1). 56–69. 16 indexed citations
13.
Chepoi, Victor, Bertrand Estellon, & Yann Vaxès. (2007). Covering Planar Graphs with a Fixed Number of Balls. Discrete & Computational Geometry. 37(2). 237–244. 11 indexed citations
14.
Chepoi, Victor, et al.. (2006). Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints. Algorithmica. 45(2). 209–226. 8 indexed citations
15.
Ibaraki, Toshihide, Yann Vaxès, & Xiaoguang Yang. (2005). Lowering eccentricity of a tree by node upgrading. Networks. 45(4). 232–239. 5 indexed citations
16.
Chepoi, Victor, Feodor F. Dragan, & Yann Vaxès. (2004). Distance and routing labeling schemes for non-positively curved plane graphs. Journal of Algorithms. 61(2). 60–88. 13 indexed citations
17.
Chepoi, Victor, Feodor F. Dragan, & Yann Vaxès. (2004). Addressing, distances and routing in triangular systems with applications in cellular and sensor networks. 1665. 216–223. 2 indexed citations
18.
Vaxès, Yann, et al.. (2003). On the convex hull of 3-cycles of the complete graph. Pesquisa Operacional. 23(1). 99–109. 3 indexed citations
19.
Chepoi, Victor, Feodor F. Dragan, & Yann Vaxès. (2002). Center and diameter problems in plane triangulations and quadrangulations. Symposium on Discrete Algorithms. 346–355. 19 indexed citations
20.
Vaxès, Yann, et al.. (1997). Multicommodity network flow with jump constraints. Discrete Mathematics. 165-166. 481–486. 6 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

Rankless by CCL
2026