A LOWER BOUND FOR NETWORK NAVIGABILITYFRAIGNIAUD, Pierre; LEBHAR, Emmanuelle; LOTKER, Zvi et al.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 1, pp 72-81, issn 0895-4801, 10 p.Article

Universal augmentation schemes for network navigabilityFRAIGNIAUD, Pierre; GAVOILLE, Cyril; KOSOWSKI, Adrian et al.Theoretical computer science. 2009, Vol 410, Num 21-23, pp 1970-1981, issn 0304-3975, 12 p.Article

Almost optimal decentralized routing in long-range contact networksLEBHAR, Emmanuelle; SCHABANEL, Nicolas.Lecture notes in computer science. 2004, pp 894-905, issn 0302-9743, isbn 3-540-22849-7, 12 p.Conference Paper

Could any graph be turned into a small-world?DUCHON, Philippe; HANUSSE, Nicolas; LEBHAR, Emmanuelle et al.Theoretical computer science. 2006, Vol 355, Num 1, pp 96-103, issn 0304-3975, 8 p.Article