Filtrer vos résultats
- 243
- 7
- 122
- 81
- 33
- 6
- 5
- 1
- 1
- 1
- 28
- 246
- 7
- 3
- 2
- 2
- 2
- 4
- 2
- 2
- 3
- 3
- 1
- 6
- 6
- 8
- 8
- 16
- 6
- 8
- 12
- 3
- 2
- 9
- 3
- 5
- 5
- 4
- 6
- 6
- 8
- 6
- 2
- 4
- 7
- 3
- 2
- 8
- 4
- 4
- 3
- 1
- 4
- 3
- 3
- 4
- 6
- 6
- 11
- 4
- 5
- 6
- 4
- 2
- 2
- 1
- 221
- 29
- 171
- 140
- 49
- 26
- 9
- 7
- 6
- 6
- 6
- 6
- 5
- 5
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 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
- 250
- 41
- 32
- 15
- 14
- 13
- 12
- 10
- 9
- 9
- 8
- 8
- 8
- 8
- 8
- 7
- 7
- 7
- 7
- 7
- 6
- 6
- 6
- 6
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 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
- 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
250 résultats
|
Induced broadcasting algorithms in iterated line digraphsProc. Conference EUROPAR96, Aug 1996, Lyon, France. pp.313-324
Communication dans un congrès
hal-03838874v1
|
||
|
Optimal gathering algorithms in multi-hop radio tree networks with interferences.AD-HocNow 08, Sep 2008, Nice, France. pp.204-217
Communication dans un congrès
hal-00512281v1
|
||
|
On DRC-Covering of K_n by Cycles[Research Report] RR-4299, INRIA. 2001
Rapport
inria-00072288v1
|
||
Optimal Gathering Protocols on Paths under Interference Constraints[Research Report] 2007, pp.23
Rapport
inria-00168162v1
|
|||
|
Bus interconnection networksDiscrete Applied Mathematics, 1996, 68 (1-2), pp.1-15. ⟨10.1016/0166-218X(95)00046-T⟩
Article dans une revue
istex
hal-03216209v1
|
||
|
Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks[Research Report] RR-6645, INRIA. 2008
Rapport
inria-00321641v3
|
||
|
Diverse Routing in Networks with Star SRLGsACM CoNEXT Student Workshop, Dec 2012, Nice, France. pp.1-2
Communication dans un congrès
hal-00747757v1
|
||
|
Broadcasting and NP-completenessProceedings Graph Theory Day 22, Nov 1991, New-York, United States. pp.8-14
Communication dans un congrès
hal-03210114v1
|
||
|
Bin Packing with Colocations14th International Workshop on Approximation and Online Algorithms (WAOA), Aug 2016, Aarhus, Denmark. pp.40-51, ⟨10.1007/978-3-319-51741-4_4⟩
Communication dans un congrès
hal-01435614v1
|
||
|
Data Gathering and Personalized Broadcasting in Radio Grids with Interferences[Research Report] RR-8218, INRIA. 2013
Rapport
hal-00783198v2
|
||
|
Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation[Research Report] Université Côte d'Azur. 2021
Rapport
hal-03161419v4
|
||
|
How long does it take for all users in a social network to choose their communities?Discrete Applied Mathematics, 2019, 270, pp.37-57. ⟨10.1016/j.dam.2019.07.023⟩
Article dans une revue
hal-02264327v1
|
||
|
Grabbing Olives on Linear Pizzas and PissaladièresThe Eleventh International Conference on Fun with Algorithms (FUN 2022), May 2022, Island of Favignana, Italy. ⟨10.4230/LIPIcs.FUN.2022.12⟩
Communication dans un congrès
hal-03675756v1
|
||
|
Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolationEuropean Journal of Combinatorics, 2023, pp.18. ⟨10.1016/j.ejc.2023.103801⟩
Article dans une revue
hal-04368240v1
|
||
|
Line graphs of hypergraphs IDiscrete Mathematics, 1977, 18 (3), pp.235-241. ⟨10.1016/0012-365X(77)90127-3⟩
Article dans une revue
hal-02360671v1
|
||
|
Hypergraphes hamiltoniensProblèmes combinatoires et théorie des graphes, Colloque International CNRS, 260, 1978, Orsay, Juillet 1976, France. pp.39-43
Communication dans un congrès
hal-02321860v1
|
||
|
On the maximum number of edges in a hypergraph whose linegraph contains no cycleDiscrete Mathematics, 1980, 30, pp.295-298. ⟨10.1016/0012-365X(80)90237-X⟩
Article dans une revue
hal-02379954v1
|
||
|
Large hypergraphs of diameter oneGraph theory and Combinatorics, Academic Press, 1984, Cambridge, United Kingdom. pp.19-28
Communication dans un congrès
hal-02447161v1
|
||
|
Pancyclisme du carré du graphe aux arêtes d'un grapheCahier du C.E.R.O., 1973, 15 (3), pp.285-286
Article dans une revue
hal-00259599v1
|
||
|
De Bruijn and Kautz Bus networksNetworks, 1997, 30 (3), pp.205-218. ⟨10.1002/(SICI)1097-0037(199710)30:3<205::AID-NET5>3.0.CO;2-P⟩
Article dans une revue
istex
hal-03210219v1
|
||
|
Fault tolerant on board networks with prioritiesNetworks, 2006, 47 (1), pp.9-25
Article dans une revue
inria-00430156v1
|
||
ProblemsRecent advances in graph theory, Proc Second Czecoslovak Symposium Prague 1974, Academia Prague, 1975, Prague, Czech Republic. pp.541-544
Communication dans un congrès
hal-02450423v1
|
|||
|
Graphes orientés fortement k-connexes et graphes "k arc hamiltoniensComptes Rendus de l''Académie des Sciences, Paris, 1970, 271, pp.141-144
Article dans une revue
hal-02373335v1
|
||
|
Mean eccentricities of de Bruijn networksNetworks, 1997, 30 (3), pp.187-203. ⟨10.1002/(SICI)1097-0037(199710)30:3<187::AID-NET4>3.0.CO;2-H⟩
Article dans une revue
hal-03220046v1
|
||
Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio 3Networks, 2003, 41 (2), pp.83-86
Article dans une revue
lirmm-00269767v1
|
|||
|
Hamilton circuits in the directed wrapped Butterfly networkDiscrete Applied Mathematics, 1998, 84 (1-3), pp.21-42. ⟨10.1016/S0166-218X(97)00095-4⟩
Article dans une revue
hal-00407356v1
|
||
|
Directed virtual path layouts in ATM networksTheoretical Computer Science, 2003, 291 (1), pp.3-28. ⟨10.1016/S0304-3975(01)00394-2⟩
Article dans une revue
hal-03764856v1
|
||
|
Fast Data Gathering in Radio Grid NetworksAlgoTel, 2009, Carry-Le-Rouet, France
Communication dans un congrès
inria-00376040v1
|
||
|
How long does it take for all users in a social network to choose their communities?FUN 2018 - 9th International Conference on Fun with Algorithms, 2018, La Maddalena, Italy
Communication dans un congrès
hal-01780627v1
|
||
|
Groupage sur le chemin pour borner la largeur de coupeAlgoTel 2023 - 25èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2023, Cargese, France. pp.4
Communication dans un congrès
hal-04076999v2
|