On approximate distance labels and routing schemes with affine stretch, ISDC, pp.404-415, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00651833
State complexes for metamorphic robots, Intl. J. Robotics Res, vol.23, pp.811-826, 2004. ,
Labeling schemes for small distances in trees, SODA, pp.689-698, 2003. ,
Sublinear distance labeling, ESA, vol.5, pp.1-5, 2016. ,
Simpler, faster and shorter labels for distances in graphs, SODA, pp.338-350, 2016. ,
Distance labeling schemes for trees, ICALP, vol.132, p.16, 2016. ,
Metric ternary distributive semi-lattices, Proc. Amer. Math. Soc, vol.12, pp.407-414, 1961. ,
Retracts of hypercubes, J. Graph Theory, vol.8, pp.501-510, 1984. ,
Metric graph theory and geometry: a survey, Contemp. Math, vol.453, pp.49-86, 2008. ,
Ramified rectilinear polygons: coordinatization by dendrons, Discr. Comput. Geom, vol.54, pp.771-797, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-02268742
Median algebras, Discr. Math, vol.45, pp.1-30, 1983. ,
Embedding topological median algebras in products of dendrons, Proc. London Math. Soc, 1989. ,
Median graphs, parallelism and posets, Discr. Math, vol.111, pp.49-63, 1993. ,
Localized and compact data-structure for comparability graphs, Discr. Math, vol.309, pp.3465-3484, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-00400499
Geometry of the space of phylogenetic trees, Adv. Appl. Math, vol.27, pp.733-767, 2001. ,
A ternary operation in distributive lattices, Bull. Amer. Math. Soc, vol.53, pp.745-752, 1947. ,
Sparse distance preservers and additive spanners, SIAM J. Discr. Math, vol.19, pp.1029-1055, 2005. ,
An unexpected result in coding the vertices of a graph, J. Math. Anal. Appl, vol.20, pp.583-600, 1967. ,
Metric Spaces of Non-Positive Curvature, volume 319 of Grundlehren der mathematischen Wissenschaften, 1999. ,
A counterexample to Thiagarajan's conjecture on regular event structures, ICALP, vol.101, p.14, 2017. ,
Weakly modular graphs and nonpositive curvature, Memoirs of AMS ,
URL : https://hal.archives-ouvertes.fr/hal-01787197
Fiber-complemented graphs. I. Structure and invariant subgraphs, Discr. Math, vol.226, pp.107-141, 2001. ,
Classification of graphs by means of metric triangles, Metody Diskret. Analiz, vol.96, pp.75-93, 1989. ,
Graphs of some CAT(0) complexes, Adv. Appl. Math, vol.24, pp.125-179, 2000. ,
Additive spanners and distance and routing labeling schemes for hyperbolic graphs, Algorithmica, vol.62, pp.713-732, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-01194836
Distance and routing labeling schemes for non-positively curved plane graphs, J. Algorithms, vol.61, pp.60-88, 2006. ,
On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes, J. Comb. Theory, Ser. B, vol.103, pp.428-467, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-01199910
On density of subgraphs of Cartesian products. CoRR, abs/1711.11485, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01772593
Shortest path problem in rectangular complexes of global nonpositive curvature, Comput. Geom, vol.46, pp.51-64, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-01199882
Query efficient implementation of graphs of bounded clique-width, Discr. Appl. Math, vol.131, pp.129-150, 2003. ,
Compact routing with minimum stretch, J. Algorithms, vol.38, pp.170-183, 2001. ,
Distance-preserving subgraphs of hypercubes, J. Comb. Theory, Ser. B, vol.14, pp.263-267, 1973. ,
Collective tree spanners in graphs with bounded parameters, Algorithmica, vol.57, pp.22-43, 2010. ,
Compact routing schemes with low stretch factor, J. Algorithms, vol.46, pp.97-114, 2003. ,
URL : https://hal.archives-ouvertes.fr/hal-00307506
Routing in trees, ICALP, pp.757-772, 2001. ,
URL : https://hal.archives-ouvertes.fr/hal-00307398
Distributed relationship schemes for trees, ISAAC, pp.728-738, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-00369633
Approximate distance labeling schemes, Electr. Notes in Discr. Math, vol.5, pp.134-137, 2000. ,
Distance labeling scheme and split decomposition, Discr. Math, vol.273, pp.115-130, 2003. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00090364
Optimal distance labeling for interval graphs and related graph families, SIAM J. Discr. Math, vol.22, pp.1239-1258, 2008. ,
Distance labeling in graphs, J. Algorithms, vol.53, pp.85-112, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-00307381
Memory requirement for routing in distributed networks, PODC, pp.125-133, 1996. ,
A note on distance labeling in planar graphs, 2016. ,
The geometry and topology of reconfiguration, Adv. Appl. Math, vol.38, pp.302-323, 2007. ,
Hyperbolic groups, Essays in group theory, vol.8, pp.75-263, 1987. ,
A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes, ICALP, vol.78, pp.1-78, 2018. ,
Implicit representation of graphs, SIAM J. Discr. Math, vol.5, pp.596-603, 1992. ,
Short and simple labels for small distances and other functions, WADS, pp.246-257, 2001. ,
Median graphs: characterizations, location theory and related structures, J. Combin. Math. Combin. Comput, vol.30, pp.103-127, 1999. ,
Fascicle 0, Introduction to combinatorial algorithms and Boolean functions, The Art of Computer Programming, vol.4, 2008. ,
The Interval Function of a Graph, Mathematical Centre Tracts. Mathematisch Centrum, vol.132, 1980. ,
Median graphs and Helly hypergraphs, Discr. Math, vol.25, pp.41-50, 1979. ,
Median graphs, Comm. Math. Univ. Carolinae, vol.12, pp.317-325, 1971. ,
A fast algorithm for computing geodesic distances in tree space, IEEE/ACM Trans. Comput. Biol. Bioinform, vol.8, pp.2-13, 2011. ,
, Distributed Computing: A Locality-Sensitive Approach. SIAM, 2000.
Proximity-preserving labeling schemes, J. Graph Theory, vol.33, pp.167-176, 2000. ,
Informative labeling schemes for graphs, Theor. Comput. Sci, vol.340, pp.577-593, 2005. ,
Poc sets, median algebras and group actions, 1998. ,
CAT(0) cube complexes and groups, Geometric Group Theory, vol.21, pp.6-53, 2012. ,
The complexity of satisfiability problems, STOC, pp.216-226, 1978. ,
Compact routing schemes, SPAA, pp.1-10, 2001. ,
Approximate distance oracles, Journal of ACM, vol.52, pp.1-24, 2005. ,
Proof of the squashed cube conjecture, Combinatorica, vol.3, pp.135-139, 1983. ,
Isometric embedding in products of complete graphs, Discr. Appl. Math, vol.7, pp.221-225, 1984. ,
Models for concurrency, Handbook of Logic in Computer Science, vol.4, pp.1-148, 1995. ,