Yann Vaxès

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 27

Top Topics

Compression Scheme

Exact Computation

Top Venues

Publications

Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès
ABC(T)-graphs: An axiomatic characterization of the median procedure in graphs with connected and G2-connected medians. Discret. Appl. Math. 359 (2024)
Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès
-connected medians. Math. Program. 203 (1) (2024)
Dibyayan Chakraborty, Yann Vaxès
Additive approximation algorithm for geodesic centers in δ-hyperbolic graphs. CoRR (2024)
Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, Yann Vaxès
Sample Compression Schemes for Balls in Graphs. SIAM J. Discret. Math. 37 (4) (2023)
François Hamonic, Cécile Albert, Basile Couëtoux, Yann Vaxès
Optimizing the ecological connectivity of landscapes. Networks 81 (2) (2023)
Dibyayan Chakraborty, Jérémie Chalopin, Florent Foucaud, Yann Vaxès
Isometric Path Complexity of Graphs. MFCS (2023)
Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès
-connected medians. CoRR (2022)
Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, Yann Vaxès
Sample Compression Schemes for Balls in Graphs. MFCS (2022)
Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, Yann Vaxès
Sample compression schemes for balls in graphs. CoRR (2022)
Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès
-connected medians. CoRR (2022)
Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès
Medians in median graphs and their cube complexes in linear time. J. Comput. Syst. Sci. 126 (2022)
Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, Yann Vaxès
Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs. Discret. Comput. Geom. 65 (3) (2021)
François Hamonic, Cécile Albert, Basile Couëtoux, Yann Vaxès
Optimizing the ecological connectivity of landscapes with generalized flow models and preprocessing. CoRR (2021)
Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès
Medians in Median Graphs and Their Cube Complexes in Linear Time. ICALP (2020)
Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès
Medians in median graphs in linear time. CoRR (2019)
Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxès, Hend Alrasheed
Fast approximation of eccentricities and distances in hyperbolic graphs. J. Graph Algorithms Appl. 23 (2) (2019)
Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, Yann Vaxès
Fast approximation and exact computation of negative curvature parameters of graphs. CoRR (2018)
Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, Yann Vaxès
Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs. SoCG (2018)
Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxès, Hend Al-Rasheed
Fast approximation of centrality and distances in hyperbolic graphs. CoRR (2018)
Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxès, Hend Alrasheed
Fast Approximation of Centrality and Distances in Hyperbolic Graphs. COCOA (2018)
Basile Couëtoux, Elie Nakache, Yann Vaxès
The Maximum Labeled Path Problem. Algorithmica 78 (1) (2017)
Victor Chepoi, Feodor F. Dragan, Yann Vaxès
Core congestion is inherent in hyperbolic networks. SODA (2017)
Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès
Bidirected minimum Manhattan network problem. Networks 69 (2) (2017)
Pierre Bonami, Dorian Mazauric, Yann Vaxès
Maximum flow under proportional delay constraint. Theor. Comput. Sci. 689 (2017)
Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès
Convergecast and Broadcast by Power-Aware Mobile Agents. CoRR (2016)
Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès
Convergecast and Broadcast by Power-Aware Mobile Agents. Algorithmica 74 (1) (2016)
Victor Chepoi, Feodor F. Dragan, Yann Vaxès
Core congestion is inherent in hyperbolic networks. CoRR (2016)
Basile Couëtoux, Elie Nakache, Yann Vaxès
The Maximum Labeled Path Problem. WG (2014)
Bostjan Bresar, Jérémie Chalopin, Victor Chepoi, Matjaz Kovse, Arnaud Labourel, Yann Vaxès
Retracts of Products of Chordal Graphs. J. Graph Theory 73 (2) (2013)
Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès
Collecting Information by Power-Aware Mobile Agents. DISC (2012)
Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès
Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm. Algorithmica 63 (1-2) (2012)
Victor Chepoi, Tristan Fevat, Emmanuel Godard, Yann Vaxès
A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives. Algorithmica 62 (1-2) (2012)
Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, Yann Vaxès
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs. Discret. Comput. Geom. 47 (1) (2012)
Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès, Yang Xiang
Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs. Algorithmica 62 (3-4) (2012)
Jérémie Chalopin, Victor Chepoi, Nicolas Nisse, Yann Vaxès
Cop and Robber Games When the Robber Can Hide and Ride. SIAM J. Discret. Math. 25 (1) (2011)
Nicolas Catusse, Victor Chepoi, Yann Vaxès
) time. Theor. Comput. Sci. 412 (22) (2011)
Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès
Bidirected minimum Manhattan network problem CoRR (2011)
Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès
Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm. CoRR (2010)
Jérémie Chalopin, Victor Chepoi, Nicolas Nisse, Yann Vaxès
Cop and robber games when the robber can hide and ride CoRR (2010)
Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, Yann Vaxès
Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs CoRR (2010)
Nicolas Catusse, Victor Chepoi, Yann Vaxès
Planar Hop Spanners for Unit Disk Graphs. ALGOSENSORS (2010)
Victor Chepoi, Karim Nouioua, Edouard Thiel, Yann Vaxès
Pareto Envelopes in Simple Polygons. Int. J. Comput. Geom. Appl. 20 (6) (2010)
Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, Yann Vaxès
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs. APPROX-RANDOM (2010)
Nicolas Catusse, Victor Chepoi, Yann Vaxès
Embedding into the rectilinear plane in optimal O*(n^2) CoRR (2009)
Victor Chepoi, Karim Nouioua, Yann Vaxès
A rounding algorithm for approximating minimum Manhattan networks. Theor. Comput. Sci. 390 (1) (2008)
Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès
Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs. Electron. Notes Discret. Math. 31 (2008)
Victor Chepoi, Bertrand Estellon, Yann Vaxès
Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length. Theor. Comput. Sci. 401 (1-3) (2008)
Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs. SCG (2008)
Victor Chepoi, Bertrand Estellon, Yann Vaxès
Covering Planar Graphs with a Fixed Number of Balls. Discret. Comput. Geom. 37 (2) (2007)
Victor Chepoi, Tristan Fevat, Emmanuel Godard, Yann Vaxès
A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives. SIROCCO (2007)
Victor Chepoi, Feodor F. Dragan, Yann Vaxès
Distance and routing labeling schemes for non-positively curved plane graphs. J. Algorithms 61 (2) (2006)
Victor Chepoi, Bertrand Estellon, Karim Nouioua, Yann Vaxès
Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints. Algorithmica 45 (2) (2006)
Victor Chepoi, Feodor F. Dragan, Yann Vaxès
Addressing, distances and routing in triangular systems with applications in cellular networks. Wirel. Networks 12 (6) (2006)
Victor Chepoi, Bertrand Estellon, Yann Vaxès
Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length. WADS (2005)
Victor Chepoi, Feodor F. Dragan, Yann Vaxès
Distance-Based Location Update and Routing in Irregular Cellular Networks. SNPD (2005)
Victor Chepoi, Bertrand Estellon, Karim Nouioua, Yann Vaxès
Mixed covering of trees and the augmentation problem with odd diameter constraints. Electron. Notes Discret. Math. 22 (2005)
Victor Chepoi, Karim Nouioua, Yann Vaxès
A Rounding Algorithm for Approximating Minimum Manhattan Networks. APPROX-RANDOM (2005)
Toshihide Ibaraki, Yann Vaxès, Xiao Guang Yang
Lowering eccentricity of a tree by node upgrading. Networks 45 (4) (2005)
Victor Chepoi, Feodor F. Dragan, Yann Vaxès
Addressing, Distances and Routing in Triangular Systems with Applications in Cellular and Sensor Networks. IPDPS (2004)
Victor Chepoi, Clémentine Fanciullini, Yann Vaxès
Median problem in some plane triangulations and quadrangulations. Comput. Geom. 27 (3) (2004)
Victor Chepoi, Yann Vaxès
On covering bridged plane triangulations with balls. J. Graph Theory 44 (1) (2003)
Victor Chepoi, Hartmut Noltemeier, Yann Vaxès
Upgrading trees under diameter and budget constraints. Networks 41 (1) (2003)
Victor Chepoi, Feodor F. Dragan, Yann Vaxès
Center and diameter problems in plane triangulations and quadrangulations. SODA (2002)
Victor Chepoi, Yann Vaxès
Augmenting Trees to Meet Biconnectivity and Diameter Constraints. Algorithmica 33 (2) (2002)
Malika Hadjiat, Jean François Maurras, Yann Vaxès
A primal partitioning approach for single and non-simultaneous multicommodity flow problems. Eur. J. Oper. Res. 123 (2) (2000)
Jean François Maurras, Yann Vaxès
Multicommodity network flow with jump constraints. Discret. Math. (1997)