The SCEAS System
| |||||||

## Search the dblp DataBase
Emmanuelle Lebhar:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
**A Doubling Dimension Threshold**[Citation Graph (0, 0)][DBLP]*Theta*(loglog*n*) for Augmented Graph Navigability. ESA, 2006, pp:376-386 [Conf] - Emmanuelle Lebhar, Nicolas Schabanel
**Almost Optimal Decentralized Routing in Long-Range Contact Networks.**[Citation Graph (0, 0)][DBLP] ICALP, 2004, pp:894-905 [Conf] - Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel
**Towards small world emergence.**[Citation Graph (0, 0)][DBLP] SPAA, 2006, pp:225-232 [Conf] - Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel
**Could any Graph be Turned into a Small-World?.**[Citation Graph (0, 0)][DBLP] DISC, 2005, pp:511-513 [Conf] - Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
**Brief Announcement: On Augmented Graph Navigability.**[Citation Graph (0, 0)][DBLP] DISC, 2006, pp:551-553 [Conf] - Michel Habib, Emmanuelle Lebhar, Christophe Paul
**A note on finding all homogeneous set sandwiches.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:87, n:3, pp:147-151 [Journal] - Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel
**Could any graph be turned into a small-world?**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:355, n:1, pp:96-103 [Journal] - Emmanuelle Lebhar, Nicolas Schabanel
**Close to optimal decentralized routing in long-range contact networks.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:348, n:2-3, pp:294-310 [Journal] - Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker
**Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier.**[Citation Graph (0, 0)][DBLP] SPAA, 2007, pp:1-7 [Conf] - Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar
**Local MST computation with short advice.**[Citation Graph (0, 0)][DBLP] SPAA, 2007, pp:154-160 [Conf] - Michel Habib, David Kelly, Emmanuelle Lebhar, Christophe Paul
**Can transitive orientation make sandwich problems easier?**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:16, pp:2030-2041 [Journal] **Introduction.**[Citation Graph (, )][DBLP]**Networks Become Navigable as Nodes Move and Forget.**[Citation Graph (, )][DBLP]**The Inframetric Model for the Internet.**[Citation Graph (, )][DBLP]**Unit disk graph and physical interference model: Putting pieces together.**[Citation Graph (, )][DBLP]**Graph Augmentation via Metric Embedding.**[Citation Graph (, )][DBLP]**Forget him and keep on moving.**[Citation Graph (, )][DBLP]**Recovering the Long-Range Links in Augmented Graphs.**[Citation Graph (, )][DBLP]**Networks become navigable as nodes move and forget**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |