I. Abraham and C. Gavoille, On approximate distance labels and routing schemes with affine stretch, ISDC, pp.404-415, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00651833

A. Abrams and R. Ghrist, State complexes for metamorphic robots, Intl. J. Robotics Res, vol.23, pp.811-826, 2004.

S. Alstrup, P. Bille, and T. Rauhe, Labeling schemes for small distances in trees, SODA, pp.689-698, 2003.

S. Alstrup, S. Dahlgaard, M. B. Knudsen, and E. Porat, Sublinear distance labeling, ESA, vol.5, pp.1-5, 2016.

S. Alstrup, C. Gavoille, E. B. Halvorsen, and H. Petersen, Simpler, faster and shorter labels for distances in graphs, SODA, pp.338-350, 2016.

S. Alstrup, I. L. Gørtz, E. B. Halvorsen, and E. Porat, Distance labeling schemes for trees, ICALP, vol.132, p.16, 2016.

S. P. Avann, Metric ternary distributive semi-lattices, Proc. Amer. Math. Soc, vol.12, pp.407-414, 1961.

H. Bandelt, Retracts of hypercubes, J. Graph Theory, vol.8, pp.501-510, 1984.

H. Bandelt and V. Chepoi, Metric graph theory and geometry: a survey, Contemp. Math, vol.453, pp.49-86, 2008.

H. Bandelt, V. Chepoi, and D. Eppstein, Ramified rectilinear polygons: coordinatization by dendrons, Discr. Comput. Geom, vol.54, pp.771-797, 2015.
URL : https://hal.archives-ouvertes.fr/hal-02268742

H. Bandelt and J. Hedlíková, Median algebras, Discr. Math, vol.45, pp.1-30, 1983.

H. Bandelt, M. Van-de, and . Vel, Embedding topological median algebras in products of dendrons, Proc. London Math. Soc, 1989.

J. Barthélemy and J. Constantin, Median graphs, parallelism and posets, Discr. Math, vol.111, pp.49-63, 1993.

F. Bazzaro and C. Gavoille, Localized and compact data-structure for comparability graphs, Discr. Math, vol.309, pp.3465-3484, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00400499

L. J. Billera, S. P. Holmes, and K. Vogtmann, Geometry of the space of phylogenetic trees, Adv. Appl. Math, vol.27, pp.733-767, 2001.

G. Birkhoff and S. A. Kiss, A ternary operation in distributive lattices, Bull. Amer. Math. Soc, vol.53, pp.745-752, 1947.

B. Bollobás, D. Coppersmith, and M. Elkin, Sparse distance preservers and additive spanners, SIAM J. Discr. Math, vol.19, pp.1029-1055, 2005.

M. A. Breuer and J. Folkman, An unexpected result in coding the vertices of a graph, J. Math. Anal. Appl, vol.20, pp.583-600, 1967.

M. R. Bridson and A. Haefliger, Metric Spaces of Non-Positive Curvature, volume 319 of Grundlehren der mathematischen Wissenschaften, 1999.

J. Chalopin and V. Chepoi, A counterexample to Thiagarajan's conjecture on regular event structures, ICALP, vol.101, p.14, 2017.

J. Chalopin, V. Chepoi, H. Hirai, and D. Osajda, Weakly modular graphs and nonpositive curvature, Memoirs of AMS
URL : https://hal.archives-ouvertes.fr/hal-01787197

M. Chastand, Fiber-complemented graphs. I. Structure and invariant subgraphs, Discr. Math, vol.226, pp.107-141, 2001.

V. Chepoi, Classification of graphs by means of metric triangles, Metody Diskret. Analiz, vol.96, pp.75-93, 1989.

V. Chepoi, Graphs of some CAT(0) complexes, Adv. Appl. Math, vol.24, pp.125-179, 2000.

V. Chepoi, F. F. Dragan, B. Estellon, M. Habib, Y. Vaxès et al., 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

V. Chepoi, F. F. Dragan, and Y. Vaxès, Distance and routing labeling schemes for non-positively curved plane graphs, J. Algorithms, vol.61, pp.60-88, 2006.

V. Chepoi and M. F. Hagen, 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

V. Chepoi, A. Labourel, and S. Ratel, On density of subgraphs of Cartesian products. CoRR, abs/1711.11485, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01772593

V. Chepoi and D. Maftuleac, 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

B. Courcelle and R. Vanicat, Query efficient implementation of graphs of bounded clique-width, Discr. Appl. Math, vol.131, pp.129-150, 2003.

L. J. Cowen, Compact routing with minimum stretch, J. Algorithms, vol.38, pp.170-183, 2001.

D. ?. Djokovi?, Distance-preserving subgraphs of hypercubes, J. Comb. Theory, Ser. B, vol.14, pp.263-267, 1973.

F. F. Dragan and Y. Chenyu, Collective tree spanners in graphs with bounded parameters, Algorithmica, vol.57, pp.22-43, 2010.

T. Eilam, C. Gavoille, and D. Peleg, Compact routing schemes with low stretch factor, J. Algorithms, vol.46, pp.97-114, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00307506

P. Fraigniaud and C. Gavoille, Routing in trees, ICALP, pp.757-772, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00307398

C. Gavoille and A. Labourel, Distributed relationship schemes for trees, ISAAC, pp.728-738, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00369633

C. Gavoille and C. Paul, Approximate distance labeling schemes, Electr. Notes in Discr. Math, vol.5, pp.134-137, 2000.

C. Gavoille and C. Paul, Distance labeling scheme and split decomposition, Discr. Math, vol.273, pp.115-130, 2003.
URL : https://hal.archives-ouvertes.fr/lirmm-00090364

C. Gavoille and C. Paul, Optimal distance labeling for interval graphs and related graph families, SIAM J. Discr. Math, vol.22, pp.1239-1258, 2008.

C. Gavoille, D. Peleg, S. Pérennes, and R. Raz, Distance labeling in graphs, J. Algorithms, vol.53, pp.85-112, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00307381

C. Gavoille and S. Pérennès, Memory requirement for routing in distributed networks, PODC, pp.125-133, 1996.

P. Gawrychowski and P. Uznanski, A note on distance labeling in planar graphs, 2016.

R. Ghirst and V. Peterson, The geometry and topology of reconfiguration, Adv. Appl. Math, vol.38, pp.302-323, 2007.

M. Gromov, Hyperbolic groups, Essays in group theory, vol.8, pp.75-263, 1987.

K. Hayashi, A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes, ICALP, vol.78, pp.1-78, 2018.

S. Kannan, M. Naor, and S. Rudich, Implicit representation of graphs, SIAM J. Discr. Math, vol.5, pp.596-603, 1992.

H. Kaplan and T. Milo, Short and simple labels for small distances and other functions, WADS, pp.246-257, 2001.

S. Klav?ar and H. M. Mulder, Median graphs: characterizations, location theory and related structures, J. Combin. Math. Combin. Comput, vol.30, pp.103-127, 1999.

D. E. Knuth, Fascicle 0, Introduction to combinatorial algorithms and Boolean functions, The Art of Computer Programming, vol.4, 2008.

H. M. Mulder, The Interval Function of a Graph, Mathematical Centre Tracts. Mathematisch Centrum, vol.132, 1980.

H. M. Mulder and A. Schrijver, Median graphs and Helly hypergraphs, Discr. Math, vol.25, pp.41-50, 1979.

L. Nebesk?, Median graphs, Comm. Math. Univ. Carolinae, vol.12, pp.317-325, 1971.

M. Owen and J. S. Provan, A fast algorithm for computing geodesic distances in tree space, IEEE/ACM Trans. Comput. Biol. Bioinform, vol.8, pp.2-13, 2011.

D. Peleg, Distributed Computing: A Locality-Sensitive Approach. SIAM, 2000.

D. Peleg, Proximity-preserving labeling schemes, J. Graph Theory, vol.33, pp.167-176, 2000.

D. Peleg, Informative labeling schemes for graphs, Theor. Comput. Sci, vol.340, pp.577-593, 2005.

M. Roller, Poc sets, median algebras and group actions, 1998.

M. Sageev, CAT(0) cube complexes and groups, Geometric Group Theory, vol.21, pp.6-53, 2012.

T. J. Schaefer, The complexity of satisfiability problems, STOC, pp.216-226, 1978.

M. Thorup and U. Zwick, Compact routing schemes, SPAA, pp.1-10, 2001.

M. Thorup and U. Zwick, Approximate distance oracles, Journal of ACM, vol.52, pp.1-24, 2005.

P. M. Winkler, Proof of the squashed cube conjecture, Combinatorica, vol.3, pp.135-139, 1983.

P. M. Winkler, Isometric embedding in products of complete graphs, Discr. Appl. Math, vol.7, pp.221-225, 1984.

G. Winskel and M. Nielsen, Models for concurrency, Handbook of Logic in Computer Science, vol.4, pp.1-148, 1995.