Multicommodity network flow with jump constraints. - Jean François Maurras; Yann Vaxès (Discret. Math., 1997)

A primal partitioning approach for single and non-simultaneous multicommodity flow problems. - Malika Hadjiat; Jean François Maurras; Yann Vaxès (Eur. J. Oper. Res., 2000)

Center and diameter problems in plane triangulations and quadrangulations. - Victor Chepoi; Feodor F. Dragan; Yann Vaxès (SODA, 2002)

Augmenting Trees to Meet Biconnectivity and Diameter Constraints. - Victor Chepoi; Yann Vaxès (Algorithmica, 2002)

On covering bridged plane triangulations with balls. - Victor Chepoi; Yann Vaxès (J. Graph Theory, 2003)

Upgrading trees under diameter and budget constraints. - Victor Chepoi; Hartmut Noltemeier; Yann Vaxès (Networks, 2003)

Addressing, Distances and Routing in Triangular Systems with Applications in Cellular and Sensor Networks. - Victor Chepoi; Feodor F. Dragan; Yann Vaxès (IPDPS, 2004)

Median problem in some plane triangulations and quadrangulations. - Victor Chepoi; Clémentine Fanciullini; Yann Vaxès (Comput. Geom., 2004)

Distance-Based Location Update and Routing in Irregular Cellular Networks. - Victor Chepoi; Feodor F. Dragan; Yann Vaxès (SNPD, 2005)

Lowering eccentricity of a tree by node upgrading. - Toshihide Ibaraki; Yann Vaxès; Xiao Guang Yang (Networks, 2005)

Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints. - Victor Chepoi; Bertrand Estellon; Karim Nouioua; Yann Vaxès (Algorithmica, 2006)

Distance and routing labeling schemes for non-positively curved plane graphs. - Victor Chepoi; Feodor F. Dragan; Yann Vaxès (J. Algorithms, 2006)

Addressing, distances and routing in triangular systems with applications in cellular networks. - Victor Chepoi; Feodor F. Dragan; Yann Vaxès (Wirel. Networks, 2006)

Covering Planar Graphs with a Fixed Number of Balls. - Victor Chepoi; Bertrand Estellon; Yann Vaxès (Discret. Comput. Geom., 2007)

Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs. - Victor Chepoi; Feodor F. Dragan; Bertrand Estellon; Michel Habib; Yann Vaxès (SCG, 2008)

Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs. - Victor Chepoi; Feodor F. Dragan; Bertrand Estellon; Michel Habib; Yann Vaxès (Electron. Notes Discret. Math., 2008)

Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length. - Victor Chepoi; Bertrand Estellon; Yann Vaxès (Theor. Comput. Sci., 2008)

A rounding algorithm for approximating minimum Manhattan networks. - Victor Chepoi; Karim Nouioua; Yann Vaxès (Theor. Comput. Sci., 2008)

Embedding into the rectilinear plane in optimal O*(n^2) - Nicolas Catusse; Victor Chepoi; Yann Vaxès (CoRR, 2009)

Planar Hop Spanners for Unit Disk Graphs. - Nicolas Catusse; Victor Chepoi; Yann Vaxès (ALGOSENSORS, 2010)

Pareto Envelopes in Simple Polygons. - Victor Chepoi; Karim Nouioua; Edouard Thiel; Yann Vaxès (Int. J. Comput. Geom. Appl., 2010)

Cop and Robber Games When the Robber Can Hide and Ride. - Jérémie Chalopin; Victor Chepoi; Nicolas Nisse; Yann Vaxès (SIAM J. Discret. Math., 2011)

Embedding into the rectilinear plane in optimal O(n2) time. - Nicolas Catusse; Victor Chepoi; Yann Vaxès (Theor. Comput. Sci., 2011)

Collecting Information by Power-Aware Mobile Agents. - Julian Anaya; Jérémie Chalopin; Jurek Czyzowicz; Arnaud Labourel; Andrzej Pelc; Yann Vaxès (DISC, 2012)

Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm. - Nicolas Catusse; Victor Chepoi; Karim Nouioua; Yann Vaxès (Algorithmica, 2012)

Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs. - Victor Chepoi; Feodor F. Dragan; Bertrand Estellon; Michel Habib; Yann Vaxès; Yang Xiang (Algorithmica, 2012)

A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives. - Victor Chepoi; Tristan Fevat; Emmanuel Godard; Yann Vaxès (Algorithmica, 2012)

Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs. - Victor Chepoi; Feodor F. Dragan; Ilan Newman; Yuri Rabinovich; Yann Vaxès (Discret. Comput. Geom., 2012)

Retracts of Products of Chordal Graphs. - Bostjan Bresar; Jérémie Chalopin; Victor Chepoi; Matjaz Kovse; Arnaud Labourel; Yann Vaxès (J. Graph Theory, 2013)

Convergecast and Broadcast by Power-Aware Mobile Agents. - Julian Anaya; Jérémie Chalopin; Jurek Czyzowicz; Arnaud Labourel; Andrzej Pelc; Yann Vaxès (Algorithmica, 2016)

Core congestion is inherent in hyperbolic networks. - Victor Chepoi; Feodor F. Dragan; Yann Vaxès (SODA, 2017)

The Maximum Labeled Path Problem. - Basile Couëtoux; Elie Nakache; Yann Vaxès (Algorithmica, 2017)

Bidirected minimum Manhattan network problem. - Nicolas Catusse; Victor Chepoi; Karim Nouioua; Yann Vaxès (Networks, 2017)

Maximum flow under proportional delay constraint. - Pierre Bonami; Dorian Mazauric; Yann Vaxès (Theor. Comput. Sci., 2017)

Fast Approximation of Centrality and Distances in Hyperbolic Graphs. - Victor Chepoi; Feodor F. Dragan; Michel Habib; Yann Vaxès; Hend Alrasheed (COCOA, 2018)

Medians in median graphs in linear time. - Laurine Bénéteau; Jérémie Chalopin; Victor Chepoi; Yann Vaxès (CoRR, 2019)

Fast approximation of eccentricities and distances in hyperbolic graphs. - Victor Chepoi; Feodor F. Dragan; Michel Habib; Yann Vaxès; Hend Alrasheed (J. Graph Algorithms Appl., 2019)

Optimizing the ecological connectivity of landscapes with generalized flow models and preprocessing. - François Hamonic; Cécile Albert; Basile Couëtoux; Yann Vaxès (CoRR, 2021)

Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs. - Jérémie Chalopin; Victor Chepoi; Feodor F. Dragan; Guillaume Ducoffe; Abdulhakeem Mohammed; Yann Vaxès (Discret. Comput. Geom., 2021)

ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G2-connected medians. - Laurine Bénéteau; Jérémie Chalopin; Victor Chepoi; Yann Vaxès (CoRR, 2022)

Medians in median graphs and their cube complexes in linear time. - Laurine Bénéteau; Jérémie Chalopin; Victor Chepoi; Yann Vaxès (J. Comput. Syst. Sci., 2022)

Isometric Path Complexity of Graphs. - Dibyayan Chakraborty; Jérémie Chalopin; Florent Foucaud; Yann Vaxès (MFCS, 2023)

Optimizing the ecological connectivity of landscapes. - François Hamonic; Cécile Albert; Basile Couëtoux; Yann Vaxès (Networks, 2023)

Sample Compression Schemes for Balls in Graphs. - Jérémie Chalopin; Victor Chepoi; Fionn Mc Inerney; Sébastien Ratel; Yann Vaxès (SIAM J. Discret. Math., 2023)

ABC(T)-graphs: An axiomatic characterization of the median procedure in graphs with connected and G2-connected medians. - Laurine Bénéteau; Jérémie Chalopin; Victor Chepoi; Yann Vaxès (Discret. Appl. Math., 2024)

Graphs with Gp-connected medians. - Laurine Bénéteau; Jérémie Chalopin; Victor Chepoi; Yann Vaxès (Math. Program., 2024)

Additive approximation algorithm for geodesic centers in δ-hyperbolic graphs. - Dibyayan Chakraborty; Yann Vaxès (Theor. Comput. Sci., 2025)

On Gp-unimodality of radius functions in graphs: structure and algorithms. - Jérémie Chalopin; Victor Chepoi; Feodor F. Dragan; Guillaume Ducoffe; Yann Vaxès (CoRR, 2025)