|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 14 occurrences of 10 keywords
|
|
|
|
|
Results
Found 34 publication records. Showing 34 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | 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  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, Yann Vaxès |
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs. |
Discrete & Computational Geometry |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Catusse, Victor Chepoi, Yann Vaxès |
Embedding into the rectilinear plane in optimal O(n2) time. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès |
Bidirected minimum Manhattan network problem |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Jérémie Chalopin, Victor Chepoi, Nicolas Nisse, Yann Vaxès |
Cop and Robber Games When the Robber Can Hide and Ride. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Jérémie Chalopin, Victor Chepoi, Nicolas Nisse, Yann Vaxès |
Cop and robber games when the robber can hide and ride |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Victor Chepoi, Karim Nouioua, Edouard Thiel, Yann Vaxès |
Pareto Envelopes in Simple Polygons. |
Int. J. Comput. Geometry Appl. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Catusse, Victor Chepoi, Yann Vaxès |
Planar Hop Spanners for Unit Disk Graphs. |
ALGOSENSORS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Catusse, Victor Chepoi, Yann Vaxès |
Embedding into the rectilinear plane in optimal O*(n^2) |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | 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. |
Electronic Notes in Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Chepoi, Bertrand Estellon, Yann Vaxès |
Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Chepoi, Karim Nouioua, Yann Vaxès |
A rounding algorithm for approximating minimum Manhattan networks. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès |
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs. |
Symposium on Computational Geometry |
2008 |
DBLP DOI BibTeX RDF |
delta-hyperbolic space, diameter, center, radius |
| 1 | Victor Chepoi, Bertrand Estellon, Yann Vaxès |
Covering Planar Graphs with a Fixed Number of Balls. |
Discrete & Computational Geometry |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Chepoi, Bertrand Estellon, Karim Nouioua, Yann Vaxès |
Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints. |
Algorithmica |
2006 |
DBLP DOI BibTeX RDF |
Augmentation problem, Approximation algorithms, Dynamical programming, Diameter, Partial covering |
| 1 | Victor Chepoi, Feodor F. Dragan, Yann Vaxès |
Addressing, distances and routing in triangular systems with applications in cellular networks. |
Wireless Networks |
2006 |
DBLP DOI BibTeX RDF |
Triangular systems, Cell identification code, Cell distance, Routing, Cellular networks, Location management |
| 1 | Victor Chepoi, Feodor F. Dragan, Yann Vaxès |
Distance and routing labeling schemes for non-positively curved plane graphs. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Chepoi, Bertrand Estellon, Karim Nouioua, Yann Vaxès |
Mixed covering of trees and the augmentation problem with odd diameter constraints. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshihide Ibaraki, Yann Vaxès, Xiao-guang Yang |
Lowering eccentricity of a tree by node upgrading. |
Networks |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Chepoi, Feodor F. Dragan, Yann Vaxès |
Distance-Based Location Update and Routing in Irregular Cellular Networks. |
SNPD |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Chepoi, Bertrand Estellon, Yann Vaxès |
Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length. |
WADS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Chepoi, Karim Nouioua, Yann Vaxès |
A Rounding Algorithm for Approximating Minimum Manhattan Networks. |
APPROX-RANDOM |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Chepoi, Clémentine Fanciullini, Yann Vaxès |
Median problem in some plane triangulations and quadrangulations. |
Comput. Geom. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Chepoi, Feodor F. Dragan, Yann Vaxès |
Addressing, Distances and Routing in Triangular Systems with Applications in Cellular and Sensor Networks. |
IPDPS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Chepoi, Hartmut Noltemeier, Yann Vaxès |
Upgrading trees under diameter and budget constraints. |
Networks |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Chepoi, Yann Vaxès |
Augmenting Trees to Meet Biconnectivity and Diameter Constraints. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
Biconnectivity augmentation, Approximation algorithms, Trees, Diameter, Radius |
| 1 | Victor Chepoi, Feodor F. Dragan, Yann Vaxès |
Center and diameter problems in plane triangulations and quadrangulations. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Malika Hadjiat, Jean François Maurras, Yann Vaxès |
A primal partitioning approach for single and non-simultaneous multicommodity flow problems. |
European Journal of Operational Research |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean François Maurras, Yann Vaxès |
Multicommodity network flow with jump constraints. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #34 of 34 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")