Yann Vaxès

CoRR, 2024

2023

Sample Compression Schemes for Balls in Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., December, 2023

Optimizing the ecological connectivity of landscapes.

[BibT_eX]

[DOI]

Networks, March, 2023

Isometric Path Complexity of Graphs.

[BibT_eX]

[DOI]

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022

Medians in median graphs and their cube complexes in linear time.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2022

ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G2-connected medians.

[BibT_eX]

[DOI]

CoRR, 2022

2021

Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2021

Optimizing the ecological connectivity of landscapes with generalized flow models and preprocessing.

[BibT_eX]

[DOI]

CoRR, 2021

2019

Fast approximation of eccentricities and distances in hyperbolic graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2019

Medians in median graphs in linear time.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Fast Approximation of Centrality and Distances in Hyperbolic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2018

2017

Maximum flow under proportional delay constraint.

[BibT_eX]

[DOI]

Pierre Bonami

Dorian Mazauric

Theor. Comput. Sci., 2017

Bidirected minimum Manhattan network problem.

[BibT_eX]

[DOI]

Networks, 2017

The Maximum Labeled Path Problem.

[BibT_eX]

[DOI]

Basile Couëtoux

Elie Nakache

Algorithmica, 2017

Core congestion is inherent in hyperbolic networks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Convergecast and Broadcast by Power-Aware Mobile Agents.

[BibT_eX]

[DOI]

Algorithmica, 2016

2013

Retracts of Products of Chordal Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

2012

Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2012

A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives.

[BibT_eX]

[DOI]

Algorithmica, 2012

Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2012

Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm.

[BibT_eX]

[DOI]

Algorithmica, 2012

Collecting Information by Power-Aware Mobile Agents.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 26th International Symposium, 2012

2011

Embedding into the rectilinear plane in optimal O(n2) time.

[BibT_eX]

[DOI]

Nicolas Catusse

Theor. Comput. Sci., 2011

Cop and Robber Games When the Robber Can Hide and Ride.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

2010

Pareto Envelopes in Simple Polygons.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2010

Planar Hop Spanners for Unit Disk Graphs.

[BibT_eX]

[DOI]

Nicolas Catusse

Proceedings of the Algorithms for Sensor Systems, 2010

2009

Embedding into the rectilinear plane in optimal O*(n^2)

[BibT_eX]

[DOI]

Nicolas Catusse

CoRR, 2009

2008

A rounding algorithm for approximating minimum Manhattan networks.

[BibT_eX]

[DOI]

Karim Nouioua

Theor. Comput. Sci., 2008

Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length.

[BibT_eX]

[DOI]

Bertrand Estellon

Theor. Comput. Sci., 2008

Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007

Covering Planar Graphs with a Fixed Number of Balls.

[BibT_eX]

[DOI]

Bertrand Estellon

Discret. Comput. Geom., 2007

2006

Addressing, distances and routing in triangular systems with applications in cellular networks.

[BibT_eX]

[DOI]

Wirel. Networks, 2006

Distance and routing labeling schemes for non-positively curved plane graphs.

[BibT_eX]

[DOI]

J. Algorithms, 2006

Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints.

[BibT_eX]

[DOI]

Algorithmica, 2006

2005

Lowering eccentricity of a tree by node upgrading.

[BibT_eX]

[DOI]

Toshihide Ibaraki

Xiao Guang Yang

Networks, 2005

Distance-Based Location Update and Routing in Irregular Cellular Networks.

[BibT_eX]

[DOI]

Proceedings of the 6th ACIS International Conference on Software Engineering, 2005

2004

Median problem in some plane triangulations and quadrangulations.

[BibT_eX]

[DOI]

Clémentine Fanciullini

Comput. Geom., 2004

Addressing, Distances and Routing in Triangular Systems with Applications in Cellular and Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2003

Upgrading trees under diameter and budget constraints.

[BibT_eX]

[DOI]

Hartmut Noltemeier

Networks, 2003

On covering bridged plane triangulations with balls.

[BibT_eX]

[DOI]

J. Graph Theory, 2003

2002

Augmenting Trees to Meet Biconnectivity and Diameter Constraints.

[BibT_eX]

[DOI]

Algorithmica, 2002

Center and diameter problems in plane triangulations and quadrangulations.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2000

A primal partitioning approach for single and non-simultaneous multicommodity flow problems.

[BibT_eX]

[DOI]

Malika Hadjiat

Jean François Maurras

Eur. J. Oper. Res., 2000

1997

Multicommodity network flow with jump constraints.

[BibT_eX]

[DOI]

Jean François Maurras