|
||
---|---|---|
hal-00984933v1
Conference papers
Spanners additifs de taille sous-quadratique pour les graphes orientés 12e Journées Graphes et Algorithmes, Oct 2010, Marseille, France. pp.9 |
||
hal-00307381v1
Journal articles
Distance Labeling in Graphs Journal of Algorithms in Cognition, Informatics and Logic, Elsevier, 2004, 53, pp.85-112 |
||
|
||
hal-01956087v1
Reports
Rapport de Prospective du Conseil Scientifique de l’Institut des Sciences de l’Information et leurs Interactions (INS2I) [Autre] CNRS. 2018, pp.1-87 |
||
hal-00998529v1
Journal articles
Universal Augmentation Schemes for Network Navigability: Overcoming the $\sqrtn$-Barrier Theoretical Computer Science, Elsevier, 2009, 410 (21-23), pp.1970-1981. ⟨10.1016/j.tcs.2008.12.061⟩ |
||
hal-00725844v1
Conference papers
The Stretch Factor of ${L}_1$- and ${L}_\infty$-{D}elaunay Triangulations 20th Annual European Symposium on Algorithms (ESA), Sep 2012, Ljubljana, Slovenia. pp.205-216 |
||
|
||
hal-00454565v1
Preprints, Working Papers, ...
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces 2010 |
||
|
||
inria-00547869v1
Conference papers
Multipath Spanners Structural Information and Communication Complexity, 17th International Colloquium (SIROCCO), Jun 2010, Sirince, Turkey. pp.211-223, ⟨10.1007/978-3-642-13284-1_17⟩ |
||
hal-00408481v1
Conference papers
On the Tree-Width of Planar Graphs EuroComb 2009, Bordeaux, France, Sep 2009, Bordeaux, France. pp.593-596, ⟨10.1016/j.endm.2009.07.099⟩ |
||
hal-00366615v1
Conference papers
Routage dans les réseaux cellulaires 10ièmes Journées Doctorales en Informatique et Réseaux, Belfort, UTMB, France, février 2009, Feb 2009, Belfort, France. pp.7-12 |
||
hal-00366618v1
Journal articles
Optimal Distance Labeling for Interval Graphs and Related Graphs Families SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2008, 22 (3), pp.1239-1258. ⟨10.1137/050635006⟩ ![]() |
||
inria-00588312v1
Conference papers
Sur la difficulté de séparer un graphe par des plus courts chemins 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France |
||
hal-00656916v1
Conference papers
Dynamic Algorithms via Forbidden-Set Labeling First International Workshop on Dynamic Systems (DYNAM), Dec 2011, Toulouse, France |
||
hal-00851217v1
Conference papers
On the Communication Complexity of Distributed Name-Independent Routing Schemes DISC 2013, Oct 2013, Jérusalem, Israel. pp.418-432 |
||
inria-00475970v1
Conference papers
Graphes de recouvrement multichemins 12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Maria Gradinariu Potop-Butucaru and Hervé Rivano, 2010, Belle Dune, France |
||
inria-00476151v1
Conference papers
Comment résumer le plan 12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France |
||
hal-00725842v1
Other publications
The Stretch Factor of ${L}_1$- and ${L}_\infty$-{D}elaunay Triangulations 2012 |
||
inria-00383276v1
Conference papers
Spanner et routage compact : similarités et différences AlgoTel, 2009, Carry-Le-Rouet, France |
||
hal-00342898v1
Journal articles
On the Complexity of Distributed Graph Coloring with Local Minimality Constraints Networks, Wiley, 2009, 54 (1), pp.12--19. ⟨10.1002/net.20293⟩ ![]() |
||
hal-00651825v1
Conference papers
Node-Disjoint Multipath Spanners and their Relationship with Fault-Tolerant Spanners OPODIS'11 - 15th International Conference on Principles of Distributed Systems, Dec 2011, Toulouse, France. pp.143-158, ⟨10.1007/978-3-642-25873-2_11⟩ ![]() |
||
hal-00649898v1
Book sections
An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps Dehmer, Matthias and Emmert-Streib, Frank and Mehler, Alexander. Towards an Information Theory of Complex Networks, Birkhäuser Boston, pp.17-46, 2011, 978-0-8176-4904-3 |
||
hal-00534212v1
Conference papers
Plane Spanners of Maximum Degree Six ICALP, 2010, France. pp.19-30, ⟨10.1007/978-3-642-14165-2_3⟩ ![]() |
||
hal-00368040v1
Journal articles
Localized and Compact Data-Structure for Comparability Graphs Discrete Mathematics, Elsevier, 2009, 309 (11), pp.3465-3484. ⟨10.1016/j.disc.2007.12.091⟩ |
||
hal-00536710v1
Conference papers
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces WG 2010, Jun 2010, Greece. pp.266--278, ⟨10.1007/978-3-642-16926-7_25⟩ |
||
hal-00651845v1
Conference papers
Oracles pour les arbres et les graphes 10 ans du séminaire MaMux - Mathématiques, musique et relations avec d'autres disciplines, May 2011, Paris, France |
||
hal-00402218v1
Journal articles
On Compact Encoding of Pagenumber $k$ Graphs Discrete Mathematics and Theoretical Computer Science, DMTCS, 2008, 10 (3), pp.23-34 |
||
|
||
hal-00725839v1
Conference papers
Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels 44th Annual ACM Symposium on Theory of Computing (STOC), May 2012, New-York, United States. pp.1199-1217, ⟨10.1145/2213977.2214084⟩ |
||
|