Emmanuelle Lebhar

Publication Activity (10 Years)

Years Active: 2003-2010
Publications (10 Years): 0

École normale supérieure de Lyon, France (PHD)

Education History

École normale supérieure de Lyon, France

PHD

Publications

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

Emmanuelle Lebhar.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Emmanuelle Lebhar