Emmanuelle Lebhar

According to our database, Emmanuelle Lebhar authored at least 21 papers between 2003 and 2010.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2010

Recovering the long-range links in augmented graphs.

Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker

Theor. Comput. Sci., 2010

A Lower Bound for Network Navigability.

Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker

SIAM J. Discret. Math., 2010

Local MST Computation with Short Advice.

Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar

Theory Comput. Syst., 2010

2009

Universal augmentation schemes for network navigability.

Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker

Theor. Comput. Sci., 2009

Unit disk graph and physical interference model: Putting pieces together.

Emmanuelle Lebhar, Zvi Lotker

Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

Introduction.

Andrea Pietracaprina, Rob H. Bisseling, Emmanuelle Lebhar, Alexander Tiskin

Proceedings of the Euro-Par 2009 Parallel Processing, 2009

2008

Opportunistic spatial gossip over mobile social networks.

Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar

Proceedings of the first Workshop on Online Social Networks, 2008

Forget him and keep on moving.

Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Graph Augmentation via Metric Embedding.

Emmanuelle Lebhar, Nicolas Schabanel

Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

The Inframetric Model for the Internet.

Pierre Fraigniaud, Emmanuelle Lebhar, Laurent Viennot

Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

Networks Become Navigable as Nodes Move and Forget.

Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

Can transitive orientation make sandwich problems easier?

Michel Habib, David Kelly, Emmanuelle Lebhar, Christophe Paul

Discret. Math., 2007

Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier.

Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker

Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

2006

Could any graph be turned into a small-world?

Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel

Theor. Comput. Sci., 2006

Brief Announcement: On Augmented Graph Navigability.

Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker

Proceedings of the Distributed Computing, 20th International Symposium, 2006

Towards small world emergence.

Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel

Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

A Doubling Dimension Threshold <i>Theta</i>(loglog<i>n</i>) for Augmented Graph Navigability.

Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker

Proceedings of the Algorithms, 2006

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

PhD thesis, 2005

Close to optimal decentralized routing in long-range contact networks.

Emmanuelle Lebhar, Nicolas Schabanel

Theor. Comput. Sci., 2005

2004

Almost Optimal Decentralized Routing in Long-Range Contact Networks.

Emmanuelle Lebhar, Nicolas Schabanel

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003

A note on finding all homogeneous set sandwiches.

Michel Habib, Emmanuelle Lebhar, Christophe Paul

Inf. Process. Lett., 2003