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
|
||
|
|
Algorithmes distribués d'ordonnancement dans les réseaux sans-fil.JDIR 2009, Feb 2009, Belfort, France
Communication dans un congrès
inria-00505521v1
|
||
|
|
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
|
||
|
|
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
|
||
|
|
Complexity Dichotomies for the Minimum F-Overlay Problem[Research Report] RR-9045, Inria Sophia Antipolis. 2013, pp.16
Rapport
hal-01490535v1
|
||
|
|
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
|
||
|
|
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
|
||
|
|
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
|
||
|
|
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
|
||
|
|
Maximum flow under proportional delay constraint2014
Pré-publication, Document de travail
hal-00947049v1
|
||
Computing the Dynamic Diameter of Non-Deterministic Dynamic Networks is HardAlgorithms for Sensor Systems - 10th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2014, Wroclaw, Poland, September 12, 2014, Revised Selected Papers, 2015, Wrocław, Poland. pp.88--102, ⟨10.1007/978-3-662-46018-4_6⟩
Communication dans un congrès
hal-01199319v1
|
|||
|
|
Overlaying a hypergraph with a graph with bounded maximum degreeALGOTEL 2020 – 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Sep 2020, Lyon, France
Communication dans un congrès
hal-02796730v1
|
||
|
|
Routing Reconfiguration/Process Number: Networks with Shared Bandwidth.[Research Report] RR-6790, INRIA. 2009, pp.12
Rapport
inria-00350025v1
|
||
|
|
Well Balanced Designs for Data PlacementJournal of Combinatorial Designs, 2016, 24 (2), pp.55-76. ⟨10.1002/jcd.21506⟩
Article dans une revue
hal-01223288v1
|
||
|
|
Reconfiguration avec contraintes physiques dans les réseaux WDM13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France
Communication dans un congrès
inria-00583829v2
|
||
Source-Target Proximity Analysis in Protein Networks Using Random Walks with Restart; Applications to Cancer Drug Resistance Prediction from Single-Cell DataSophI.A 2019 - Springboard for Artificial Intelligence, Université Côte d'Azur, Nov 2019, Sophia-Antipolis, France
Communication dans un congrès
hal-02432552v1
|
|||
|
|
Gene prioritization based on random walks with restarts and absorbing states, to define gene sets regulating drug pharmacodynamics from single-cell analyses2021
Pré-publication, Document de travail
hal-03438430v1
|
||
|
|
Well Balanced Designs for Data Placement[Research Report] RR-7725, Inria. 2011
Rapport
inria-00618656v3
|
||
|
|
To satisfy impatient Web surfers is hardTheoretical Computer Science, 2014, 526, pp.1-17. ⟨10.1016/j.tcs.2014.01.009⟩
Article dans une revue
hal-00966985v1
|
||
|
|
Connected Surveillance GameTheoretical Computer Science, 2015, 584, pp.131-143
Article dans une revue
hal-01163170v1
|