List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| A lower bound for network navigability SIAM Journal on Discrete Mathematics | 2011-03-15 | Paper |
| Local MST computation with short advice Theory of Computing Systems | 2010-12-17 | Paper |
| Recovering the long-range links in augmented graphs Theoretical Computer Science | 2010-04-06 | Paper |
| Universal augmentation schemes for network navigability Theoretical Computer Science | 2009-05-28 | Paper |
| A note on finding all homogeneous set sandwiches Information Processing Letters | 2009-04-28 | Paper |
| Networks Become Navigable as Nodes Move and Forget Automata, Languages and Programming | 2008-08-28 | Paper |
| Recovering the Long-Range Links in Augmented Graphs Structural Information and Communication Complexity | 2008-07-10 | Paper |
| A Doubling Dimension Threshold Θ(loglogn) for Augmented Graph Navigability Lecture Notes in Computer Science | 2008-03-11 | Paper |
| Could any graph be turned into a small-world? Theoretical Computer Science | 2006-04-28 | Paper |
| Close to optimal decentralized routing in long-range contact networks Theoretical Computer Science | 2006-01-09 | Paper |
| Automata, Languages and Programming Lecture Notes in Computer Science | 2005-08-24 | Paper |
Research outcomes over time
This page was built for person: Emmanuelle Lebhar
