Filtrer vos résultats
- 84
- 6
- 1
- 37
- 22
- 19
- 4
- 3
- 2
- 1
- 1
- 1
- 1
- 22
- 89
- 6
- 4
- 1
- 1
- 1
- 5
- 3
- 4
- 2
- 6
- 5
- 9
- 3
- 9
- 5
- 6
- 9
- 11
- 6
- 7
- 74
- 17
- 88
- 63
- 10
- 9
- 8
- 6
- 6
- 3
- 3
- 3
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 91
- 25
- 21
- 19
- 12
- 12
- 12
- 9
- 8
- 8
- 7
- 6
- 4
- 4
- 4
- 4
- 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
- 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
91 résultats
|
|
On the complexity of the representation of simplicial complexes by trees[Research Report] RR-8647, Inria Sophia Antipolis; INRIA. 2014
Rapport
hal-01089846v2
|
||
|
|
Extracting the Core Structural Connectivity Network: Guaranteeing Network Connectedness Through a Graph-Theoretical ApproachMICCAI 2016, Sep 2016, Athens, Greece
Communication dans un congrès
hal-01333301v2
|
||
|
|
Overlaying a hypergraph with a graph with bounded maximum degreeDiscrete Applied Mathematics, In press, 319, pp.394-406. ⟨10.1007/978-3-030-39219-2_32⟩
Article dans une revue
hal-02025469v3
|
||
|
|
Weighted improper colouringJournal of Discrete Algorithms, 2012, 16, pp.53-66. ⟨10.1016/j.jda.2012.07.001⟩
Article dans une revue
hal-00747755v1
|
||
11emes Journées Doctorales en Informatique et Réseaux (JDIR 2010)Frédéric Giroire and Dorain Mazauric. Mascotte, INRIA, I3S(CNRS / Univ. of Nice-Sophia, 2010, Journées Doctorales en Informatique et Réseaux
Ouvrages
hal-00794827v1
|
|||
|
|
A Distributed Scheduling Algorithm for Wireless Networks with Constant Overhead and Arbitrary Binary Interference.Sigmetrics 2010, Columbia University, Jun 2010, New York, United States
Communication dans un congrès
inria-00505519v1
|
||
|
|
Comparing two clusterings using matchings between clusters of clusters[Research Report] RR-9063, INRIA Sophia Antipolis - Méditerranée; Universite Cote d'Azur. 2017, pp.1-45
Rapport
hal-01514872v4
|
||
|
|
Complexity Dichotomies for the Minimum F-Overlay Problem[Research Report] RR-9045, Inria Sophia Antipolis. 2013, pp.16
Rapport
hal-01490535v1
|
||
|
|
Minimizing Routing Energy Consumption: from Theoretical to Practical Results[Research Report] RR-7234, INRIA. 2010, pp.34
Rapport
inria-00464318v3
|
||
|
|
Distributed Call Scheduling in Wireless Networks[Research Report] RR-6763, INRIA. 2008
Rapport
inria-00345669v3
|
||
|
|
P2P Storage Systems: Data Life Time for Different Placement Policies12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France
Communication dans un congrès
inria-00479537v1
|
||
|
|
Energy Efficient Routing by Switching-Off Network InterfacesNaima Kaabouch and Wen-Chen Hu. Energy-Aware Systems and Networking for Sustainable Initiatives, IGI Global, pp.207-236, 2012, 978-1466618428. ⟨10.4018/978-1-4666-1842-8.ch010⟩
Chapitre d'ouvrage
hal-01070684v1
|
||
|
|
On the average path length of deterministic and stochastics recursive networks2nd workshop on Complex networks (CompletNet), Communications in Computer and Information sciences, CCIS, Vol 116, Springer Verlag, 2010, Rio de Janeiro, Brazil. pp.1-12
Communication dans un congrès
inria-00532890v1
|
||
|
|
Algorithmes distribués d'ordonnancement dans les réseaux sans-fil.JDIR 2009, Feb 2009, Belfort, France
Communication dans un congrès
inria-00505521v1
|
||
|
|
On the complexity of overlaying a hypergraph with a graph with bounded maximum degree[Research Report] Inria; CNRS; I3S; Université Côte d'Azur. 2021
Rapport
hal-03368214v2
|
||
|
|
Reconfiguration dans les réseaux optiques11èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), 2009, Carry-Le-Rouet, France
Communication dans un congrès
inria-00383206v1
|
||
|
|
Graphes et Algorithmes – Jeux grandeur natureInria, pp.1-401, 2016
Ouvrages
hal-01366804v3
|
||
|
|
On the complexity of the representation of simplicial complexes by treesTheoretical Computer Science, 2016, 617, pp.17. ⟨10.1016/j.tcs.2015.12.034⟩
Article dans une revue
hal-01259806v1
|
||
|
|
Sequential Metric Dimension16th Workshop on Approximation and Online Algorithms (WAOA 2018), Aug 2018, Helsinki, Finland. pp.36-50
Communication dans un congrès
hal-01883712v2
|
||
|
|
Graphes et Algorithmes - Diffusion de l'information scientifique2016, pp.403
Autre publication scientifique
hal-01383665v1
|
||
|
|
Mass Transportation Problems with Connectivity Constraints, with Applications to Energy Landscape Comparison[Research Report] RR-8611, Inria Sophia Antipolis; INRIA. 2014
Rapport
hal-01090705v1
|
||
|
|
Optimal transportation problems with connectivity constraints[Research Report] RR-8991, Inria Sophia Antipolis; Université Côte d'Azur. 2016, pp.24
Rapport
hal-01411117v1
|
||
|
|
To Satisfy Impatient Web surfers is Hard[Research Report] RR-7740, LIRMM; INRIA. 2011, pp.20
Rapport
inria-00625703v2
|
||
|
|
Tradeoffs in routing reconfiguration problems12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France. pp.0
Communication dans un congrès
inria-00477413v1
|
||
|
|
Routage efficace en énergie13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France
Communication dans un congrès
inria-00587944v1
|
||
|
|
Weighted Improper Colouring[Research Report] RR-7590, INRIA. 2011, pp.57
Rapport
inria-00583036v4
|
||
|
|
Connected Surveillance Game[Research Report] RR-8297, INRIA. 2013, pp.22
Rapport
hal-00820271v1
|
||
|
|
Un Palais de la Découverte des Sciences du numérique2022
Article de blog scientifique
hal-04116482v1
|
||
|
|
Reconfiguration of the Routing in WDM Networks with Two Classes of ServicesConference on Optical Network Design and Modeling (ONDM), 2009, Braunschweig, Germany
Communication dans un congrès
inria-00423453v1
|
||
|
|
Distributed Link Scheduling in Wireless NetworksDiscrete Mathematics, Algorithms and Applications, 2020, 12 (5), pp.1-38. ⟨10.1142/S1793830920500585⟩
Article dans une revue
hal-01977266v2
|