Emmanuelle Lebhar

25 papers A* 3A 4B 5Journal 9Unranked 3
YearRankTypeTitle / Venue / Authors
2010 J jnl
A Lower Bound for Network Navigability.
SIAM J. Discret. Math.
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
2010 J jnl
Local MST Computation with Short Advice.
Theory Comput. Syst.
Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar
2010 J jnl
Recovering the long-range links in augmented graphs.
Theor. Comput. Sci.
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
2009 — conf
Introduction.
Euro-Par
Andrea Pietracaprina, Rob H. Bisseling, Emmanuelle Lebhar, Alexander Tiskin
2009 A conf
Unit disk graph and physical interference model: Putting pieces together.
IPDPS
Emmanuelle Lebhar, Zvi Lotker
2009 J jnl
Universal augmentation schemes for network navigability.
Theor. Comput. Sci.
Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker
2008 A* conf
Forget him and keep on moving.
PODC
Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar
2008 B conf
Graph Augmentation via Metric Embedding.
OPODIS
Emmanuelle Lebhar, Nicolas Schabanel
2008 — conf
Networks Become Navigable as Nodes Move and Forget.
ICALP (1)
Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar
2008 J jnl
Networks become navigable as nodes move and forget
CoRR
Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar
2008 — conf
Opportunistic spatial gossip over mobile social networks.
WOSN
Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar
2008 B conf
Recovering the Long-Range Links in Augmented Graphs.
SIROCCO
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
2008 A* conf
The Inframetric Model for the Internet.
INFOCOM
Pierre Fraigniaud, Emmanuelle Lebhar, Laurent Viennot
2007 J jnl
Can transitive orientation make sandwich problems easier?
Discret. Math.
Michel Habib, David Kelly, Emmanuelle Lebhar, Christophe Paul
2007 B conf
Local MST computation with short advice.
SPAA
Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar
2007 B conf
Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier.
SPAA
Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker
2006 A conf
A Doubling Dimension Threshold
ESA
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
2006 A conf
Brief Announcement: On Augmented Graph Navigability.
DISC
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
2006 J jnl
Could any graph be turned into a small-world?
Theor. Comput. Sci.
Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel
2006 B conf
Towards small world emergence.
SPAA
Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel
2005 — —
Algorithmes de routage et modèles aléatoires pour les graphes petits mondes. (Routing algorithms and random models for small world graphs).
Emmanuelle Lebhar
2005 J jnl
Close to optimal decentralized routing in long-range contact networks.
Theor. Comput. Sci.
Emmanuelle Lebhar, Nicolas Schabanel
2005 A conf
Could any Graph be Turned into a Small-World?.
DISC
Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel
2004 A* conf
Almost Optimal Decentralized Routing in Long-Range Contact Networks.
ICALP
Emmanuelle Lebhar, Nicolas Schabanel
2003 J jnl
A note on finding all homogeneous set sandwiches.
Inf. Process. Lett.
Michel Habib, Emmanuelle Lebhar, Christophe Paul