Filtrer vos résultats
- 127
- 33
- 89
- 33
- 16
- 11
- 5
- 3
- 3
- 4
- 156
- 3
- 2
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 4
- 2
- 4
- 7
- 13
- 13
- 12
- 12
- 18
- 16
- 12
- 15
- 16
- 4
- 1
- 1
- 1
- 1
- 1
- 140
- 20
- 151
- 45
- 38
- 19
- 18
- 12
- 11
- 8
- 8
- 6
- 6
- 5
- 5
- 4
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 160
- 21
- 20
- 18
- 15
- 11
- 11
- 10
- 10
- 9
- 9
- 9
- 8
- 7
- 7
- 6
- 6
- 5
- 5
- 5
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
160 résultats
Recognizing Bipartite Incident-Graphs of Circulant DigraphsInternational Workshop on Graph Theoretic Concepts in Computer Science - WG'99, 1999, Ascona, Switzerland, pp.215-227
Communication dans un congrès
inria-00098892v1
|
|||
|
Proceedings of the 30th International Symposium on Distributed Computing (DISC 2016)Springer, 9888, 2016, Lecture Notes in Computer Science (ARCoSS), ⟨10.1007/978-3-662-53426-7⟩
Ouvrages
hal-01385496v1
|
||
|
A propos des schémas d'augmentation universels pour la navigation dans les réseaux9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2007, Ile d'Oléron, France. pp.23-26
Communication dans un congrès
inria-00176942v1
|
||
Localized Data Structures (Keynote Talk)2nd Workshop on Locality Preserving Distributed Computing Methods (LOCALITY), PODC, Portland, Oregon, Etats-Unis, août 2007, Aug 2007, Portland, United States
Communication dans un congrès
hal-00371154v1
|
|||
Brief Announcement: On Local Representation of Distances in Trees26th Annual ACM Symposium on Principles of Distributed Computing (PODC), août 2007, Portland, WA, Etats-Unis, Aug 2007, Portland, United States. pp.246-247, ⟨10.1145/1281100.1281169⟩
Communication dans un congrès
hal-00369644v1
|
|||
On the Locality of Distributed Sparse Spanner Construction27th Annual ACM Symposium on Principles of Distributed Computing (PODC), Aug 2008, Toronto, Canada. pp.273-282, ⟨10.1145/1400751.1400788⟩
Communication dans un congrès
hal-00343001v1
|
|||
|
Distributed Computing with Advice: Information Sensitivity of Graph ColoringICALP 2007, Jul 2007, Wrocław, Poland. pp.231-242, ⟨10.1007/978-3-540-73420-8_22⟩
Communication dans un congrès
hal-00339878v1
|
||
Construction locale de sous-graphes couvrants peu denses10ièmes Rencontres francophones sur les aspects algorithmiques des télécommunications (AlgoTel), Saint-Malo, France, 2008, May 2008, France. pp.105-108
Communication dans un congrès
hal-00368035v1
|
|||
|
Distributed computing with advice: information sensitivity of graph coloringDistributed Computing, 2009, 21 (6), pp.395-403. ⟨10.1007/s00446-008-0076-y⟩
Article dans une revue
hal-00395775v1
|
||
Small Diameter Bag Tree-Decompositions2004
Autre publication scientifique
hal-00400512v1
|
|||
Localized and Compact Data-Structure for Comparability Graphs2005
Autre publication scientifique
hal-00400499v1
|
|||
Routing in Networks with Low Doubling Dimension2005
Autre publication scientifique
hal-00400501v1
|
|||
|
Isometric universal graphsSIAM Journal on Discrete Mathematics, 2021, 35 (2), pp.1224-1237. ⟨10.1137/21M1406155⟩
Article dans une revue
hal-03172653v1
|
||
Dynamic Algorithms via Forbidden-Set LabelingFirst International Workshop on Dynamic Systems (DYNAM), Dec 2011, Toulouse, France
Communication dans un congrès
hal-00656916v1
|
|||
|
Connectivity check in 3-connected planar graphs with obstaclesElectronic Notes in Discrete Mathematics, 2008, 31, pp.151-155. ⟨10.1016/j.endm.2008.06.030⟩
Article dans une revue
hal-00333863v1
|
||
Compact Routing for Graphs Excluding a Fixed Minor19th International Symposium on Distributed Computing (DISC), Cracovie, Pologne, septembre 2005, Sep 2005, Cracovie, Poland. pp.442-456, ⟨10.1007/11561927_32⟩
Communication dans un congrès
istex
hal-00378466v1
|
|||
|
Router dans Internet avec quinze entréesALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France
Communication dans un congrès
hal-01149335v2
|
||
What Can be Observed Locally? Round-based Models for Quantum Distributed ComputingDISC, Sep 2009, Elche/Elx, Spain. pp.243-257
Communication dans un congrès
hal-00408727v1
|
|||
Brief Announcement: On the Complexity of Distributed Greedy Coloring21rst International Symposium on Distributed Computing (DISC), septembre 2007, Lemesos, Chypre, Sep 2007, Lemesos, Cyprus. pp.482-484
Communication dans un congrès
hal-00369655v1
|
|||
Using Absorption Areas to Improve {ATFM}ERC Innovative Research Workshop, 2003, France. pp.2.A.3- 2.1-6
Communication dans un congrès
hal-00307792v1
|
|||
Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed EnvironmentTheory of Computing Systems, 2004, 37, pp.441-456
Article dans une revue
hal-00307618v1
|
|||
|
Distance Labeling Scheme and Split Decomposition01222, 2001
Rapport
lirmm-00090364v1
|
||
Localisation-Resistant Random Words with Small AlphabetsCombinatorics on Words, pp.193-206, 2019, ⟨10.1007/978-3-030-28796-2_15⟩
Chapitre d'ouvrage
hal-02480563v1
|
|||
|
Rapport de Prospective du Conseil Scientifique de l’Institut des Sciences de l’Information et leurs Interactions (INS2I)[0] CNRS. 2018, pp.1-87
Rapport
hal-01956087v1
|
||
Tight Stretch Factors for $L_1$- and $L_\infty$-Delaunay TriangulationsComputational Geometry, 2015, 48, pp.237-250
Article dans une revue
hal-00964470v1
|
|||
|
Compact Labelings For Efficient First-Order Model-CheckingJournal of Combinatorial Optimization, 2011, 21 (1), pp.19--46
Article dans une revue
hal-00342668v1
|
||
|
Node-Disjoint Multipath Spanners and their Relationship with Fault-Tolerant Spanners2011
Rapport
hal-00622915v2
|
||
Planar Graphs, via Well-Orderly Maps and Trees2004
Autre publication scientifique
hal-00400503v1
|
|||
Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs46th Annual ACM Symposium on Theory of Computing (STOC), May 2014, New York, United States. pp.79-88, ⟨10.1145/2591796.2591849⟩
Communication dans un congrès
hal-00993294v1
|
|||
Plane Spanners of Maximum Degree SixICALP, 2010, France. pp.19-30, ⟨10.1007/978-3-642-14165-2_3⟩
Communication dans un congrès
istex
hal-00534212v1
|