default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYann Vaxès
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j34]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: 55-74 (2024)- [j33]Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès:
Graphs with Gp-connected medians. Math. Program. 203(1): 369-420 (2024) - [i15]Dibyayan Chakraborty, Yann Vaxès:
Additive approximation algorithm for geodesic centers in δ-hyperbolic graphs. CoRR abs/2404.03812 (2024) - 2023
- [j32]François Hamonic, Cécile Albert, Basile Couëtoux, Yann Vaxès:
Optimizing the ecological connectivity of landscapes. Networks 81(2): 278-293 (2023) - [j31]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): 2585-2616 (2023) - [c17]Dibyayan Chakraborty, Jérémie Chalopin, Florent Foucaud, Yann Vaxès:
Isometric Path Complexity of Graphs. MFCS 2023: 32:1-32:14 - 2022
- [j30]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: 80-105 (2022) - [c16]Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, Yann Vaxès:
Sample Compression Schemes for Balls in Graphs. MFCS 2022: 31:1-31:14 - [i14]Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès:
Graphs with Gp-connected medians. CoRR abs/2201.12248 (2022) - [i13]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. CoRR abs/2206.03587 (2022) - [i12]Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, Yann Vaxès:
Sample compression schemes for balls in graphs. CoRR abs/2206.13254 (2022) - 2021
- [j29]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): 856-892 (2021) - [i11]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 abs/2109.06622 (2021) - 2020
- [c15]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: 10:1-10:17
2010 – 2019
- 2019
- [j28]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): 393-433 (2019) - [i10]Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès:
Medians in median graphs in linear time. CoRR abs/1907.10398 (2019) - 2018
- [c14]Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxès, Hend Alrasheed:
Fast Approximation of Centrality and Distances in Hyperbolic Graphs. COCOA 2018: 3-18 - [c13]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: 22:1-22:15 - [i9]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 abs/1803.06324 (2018) - [i8]Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxès, Hend Al-Rasheed:
Fast approximation of centrality and distances in hyperbolic graphs. CoRR abs/1805.07232 (2018) - 2017
- [j27]Basile Couëtoux, Elie Nakache, Yann Vaxès:
The Maximum Labeled Path Problem. Algorithmica 78(1): 298-318 (2017) - [j26]Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès:
Bidirected minimum Manhattan network problem. Networks 69(2): 167-178 (2017) - [j25]Pierre Bonami, Dorian Mazauric, Yann Vaxès:
Maximum flow under proportional delay constraint. Theor. Comput. Sci. 689: 58-66 (2017) - [c12]Victor Chepoi, Feodor F. Dragan, Yann Vaxès:
Core congestion is inherent in hyperbolic networks. SODA 2017: 2264-2279 - 2016
- [j24]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): 117-155 (2016) - [i7]Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès:
Convergecast and Broadcast by Power-Aware Mobile Agents. CoRR abs/1603.04234 (2016) - [i6]Victor Chepoi, Feodor F. Dragan, Yann Vaxès:
Core congestion is inherent in hyperbolic networks. CoRR abs/1605.03059 (2016) - 2014
- [c11]Basile Couëtoux, Elie Nakache, Yann Vaxès:
The Maximum Labeled Path Problem. WG 2014: 152-163 - 2013
- [j23]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): 161-180 (2013) - 2012
- [j22]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): 146-168 (2012) - [j21]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): 713-732 (2012) - [j20]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): 551-567 (2012) - [j19]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): 187-214 (2012) - [c10]Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès:
Collecting Information by Power-Aware Mobile Agents. DISC 2012: 46-60 - 2011
- [j18]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): 333-359 (2011) - [j17]Nicolas Catusse, Victor Chepoi, Yann Vaxès:
Embedding into the rectilinear plane in optimal O(n2) time. Theor. Comput. Sci. 412(22): 2425-2433 (2011) - [i5]Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès:
Bidirected minimum Manhattan network problem. CoRR abs/1107.1359 (2011) - 2010
- [j16]Victor Chepoi, Karim Nouioua, Edouard Thiel, Yann Vaxès:
Pareto Envelopes in Simple Polygons. Int. J. Comput. Geom. Appl. 20(6): 707-721 (2010) - [c9]Nicolas Catusse, Victor Chepoi, Yann Vaxès:
Planar Hop Spanners for Unit Disk Graphs. ALGOSENSORS 2010: 16-30 - [c8]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: 95-109 - [i4]Jérémie Chalopin, Victor Chepoi, Nicolas Nisse, Yann Vaxès:
Cop and robber games when the robber can hide and ride. CoRR abs/1001.4457 (2010) - [i3]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 abs/1004.5517 (2010) - [i2]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 abs/1007.0489 (2010)
2000 – 2009
- 2009
- [i1]Nicolas Catusse, Victor Chepoi, Yann Vaxès:
Embedding into the rectilinear plane in optimal O*(n^2). CoRR abs/0910.1059 (2009) - 2008
- [j15]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: 231-234 (2008) - [j14]Victor Chepoi, Karim Nouioua, Yann Vaxès:
A rounding algorithm for approximating minimum Manhattan networks. Theor. Comput. Sci. 390(1): 56-69 (2008) - [j13]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): 131-143 (2008) - [c7]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: 59-68 - 2007
- [j12]Victor Chepoi, Bertrand Estellon, Yann Vaxès:
Covering Planar Graphs with a Fixed Number of Balls. Discret. Comput. Geom. 37(2): 237-244 (2007) - [c6]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: 81-95 - 2006
- [j11]Victor Chepoi, Bertrand Estellon, Karim Nouioua, Yann Vaxès:
Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints. Algorithmica 45(2): 209-226 (2006) - [j10]Victor Chepoi, Feodor F. Dragan, Yann Vaxès:
Distance and routing labeling schemes for non-positively curved plane graphs. J. Algorithms 61(2): 60-88 (2006) - [j9]Victor Chepoi, Feodor F. Dragan, Yann Vaxès:
Addressing, distances and routing in triangular systems with applications in cellular networks. Wirel. Networks 12(6): 671-679 (2006) - 2005
- [j8]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: 405-408 (2005) - [j7]Toshihide Ibaraki, Yann Vaxès, Xiao Guang Yang:
Lowering eccentricity of a tree by node upgrading. Networks 45(4): 232-239 (2005) - [c5]Victor Chepoi, Karim Nouioua, Yann Vaxès:
A Rounding Algorithm for Approximating Minimum Manhattan Networks. APPROX-RANDOM 2005: 40-51 - [c4]Victor Chepoi, Feodor F. Dragan, Yann Vaxès:
Distance-Based Location Update and Routing in Irregular Cellular Networks. SNPD 2005: 380-387 - [c3]Victor Chepoi, Bertrand Estellon, Yann Vaxès:
Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length. WADS 2005: 282-293 - 2004
- [j6]Victor Chepoi, Clémentine Fanciullini, Yann Vaxès:
Median problem in some plane triangulations and quadrangulations. Comput. Geom. 27(3): 193-210 (2004) - [c2]Victor Chepoi, Feodor F. Dragan, Yann Vaxès:
Addressing, Distances and Routing in Triangular Systems with Applications in Cellular and Sensor Networks. IPDPS 2004 - 2003
- [j5]Victor Chepoi, Yann Vaxès:
On covering bridged plane triangulations with balls. J. Graph Theory 44(1): 65-80 (2003) - [j4]Victor Chepoi, Hartmut Noltemeier, Yann Vaxès:
Upgrading trees under diameter and budget constraints. Networks 41(1): 24-35 (2003) - 2002
- [j3]Victor Chepoi, Yann Vaxès:
Augmenting Trees to Meet Biconnectivity and Diameter Constraints. Algorithmica 33(2): 243-262 (2002) - [c1]Victor Chepoi, Feodor F. Dragan, Yann Vaxès:
Center and diameter problems in plane triangulations and quadrangulations. SODA 2002: 346-355 - 2000
- [j2]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): 382-393 (2000)
1990 – 1999
- 1997
- [j1]Jean François Maurras, Yann Vaxès:
Multicommodity network flow with jump constraints. Discret. Math. 165-166: 481-486 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
