Filtrer vos résultats
- 190
- 23
- 82
- 61
- 58
- 4
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 53
- 208
- 18
- 1
- 1
- 13
- 10
- 14
- 11
- 7
- 12
- 17
- 12
- 14
- 14
- 17
- 14
- 9
- 12
- 15
- 8
- 5
- 6
- 2
- 189
- 23
- 1
- 205
- 204
- 30
- 18
- 16
- 15
- 14
- 14
- 12
- 11
- 9
- 8
- 7
- 6
- 6
- 5
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 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
- 213
- 30
- 25
- 18
- 18
- 17
- 16
- 15
- 13
- 12
- 12
- 11
- 10
- 9
- 9
- 9
- 9
- 8
- 8
- 7
- 7
- 7
- 7
- 7
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 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
- 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
213 résultats
Non-Deterministic Graph Searching: From Pathwidth to TreewidthProceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS), 2005, Poland. pp.364-375, ⟨10.1007/11549345_32⟩
Communication dans un congrès
istex
hal-00421420v1
|
|||
|
Some Results on Non-deterministic Graph Searching in Trees[Research Report] 2013, pp.27
Rapport
inria-00174965v3
|
||
|
Voleur véloce dans un réseau planaire10ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'08), 2008, Saint-Malo, France. pp.29-32
Communication dans un congrès
inria-00374450v1
|
||
|
Reconstruire un graphe en une ronde13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France
Communication dans un congrès
inria-00587250v1
|
||
|
Stability of a local greedy distributed routing algorithm[Research Report] RR-6871, INRIA. 2009
Rapport
inria-00366441v2
|
||
|
Computing metric hulls in graphsDiscrete Mathematics and Theoretical Computer Science, 2019, vol. 21 no. 1, ICGT 2018, ⟨10.23638/DMTCS-21-1-11⟩
Article dans une revue
hal-01612515v4
|
||
|
Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in BetweenAlgorithmica, 2021, 83 (5), pp.1459-1492. ⟨10.1007/s00453-020-00790-8⟩
Article dans une revue
hal-02801932v3
|
||
Stratégies d'encerclement connexes dans un réseau7èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2005, France. pp.13-16
Communication dans un congrès
hal-00421418v1
|
|||
Strategies d'encerclement non deterministes8èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2006, France. pp.81-84
Communication dans un congrès
hal-00421419v1
|
|||
|
Graph Searching with AdviceTheoretical Computer Science, 2009, 410 (14), pp.1307-1318. ⟨10.1016/j.tcs.2008.08.020⟩
Article dans une revue
hal-00421415v1
|
||
|
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
|
||
Monotony Properties of Connected Visible Graph SearchingInternational Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2006, Bergen, Norway
Communication dans un congrès
inria-00423449v1
|
|||
|
Spy-Game on graphs[Research Report] RR-8869, Inria. 2016
Rapport
hal-01279339v1
|
||
|
Gathering and Exclusive Searching on Rings under Minimal Assumptions15th International Conference on Distributed Computing and Networking (ICDCN), Jan 2014, Coimbatore, India. pp.149-164, ⟨10.1007/978-3-642-45249-9_10⟩
Communication dans un congrès
hal-00931514v1
|
||
|
To Approximate Treewidth, Use Treelength!SIAM Journal on Discrete Mathematics, 2016, 30 (3), pp.13. ⟨10.1137/15M1034039⟩
Article dans une revue
hal-01348965v1
|
||
|
Exclusive Graph Searching21st European Symposium on Algorithms (ESA 2013), Sep 2013, Sophia Antipolis, France. pp.181-192, ⟨10.1007/978-3-642-40450-4_16⟩
Communication dans un congrès
hal-00845530v1
|
||
|
Recovery of disrupted airline operations using k-Maximum Matching in Graphs[Research Report] RR-8679, Inria Sophia Antipolis; INRIA. 2015
Rapport
hal-01116487v1
|
||
|
Connected Surveillance Game[Research Report] RR-8297, INRIA. 2013, pp.22
Rapport
hal-00820271v1
|
||
|
Preferential attachment hypergraph with vertex deactivationMASCOTS 2023 - 31st International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, Oct 2023, New York, United States
Communication dans un congrès
hal-04372316v1
|
||
|
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
|
||
|
Minimum delay Data Gathering in Radio NetworksADHOC-NOW 2009 - 8th international conference on Ad Hoc Networks and Wireless, Sep 2009, Murcia, Spain. pp.69-82, ⟨10.1007/978-3-642-04383-3_6⟩
Communication dans un congrès
inria-00505522v1
|
||
Graph Searching with adviceInternational Colloquium on Structural Information and Communication Complexity (SIROCCO), 2007, Castiglioncello, Italy
Communication dans un congrès
inria-00423450v1
|
|||
|
Cop and robber games when the robber can hide and rideSIAM Journal on Discrete Mathematics, 2011, 25 (1), pp.333-359
Article dans une revue
inria-00622957v1
|
||
|
Space and Time Trade-Off for the k Shortest Simple Paths ProblemSEA 2020 - 18th International Symposium on Experimental Algorithms, Jun 2020, Catania, Italy. pp.13, ⟨10.4230/LIPIcs.SEA.2020.18⟩
Communication dans un congrès
hal-02865918v1
|
||
|
Exclusive Graph Searching vs. Pathwidth[Research Report] RR-8523, INRIA. 2014
Rapport
hal-00980877v1
|
||
|
Space and time trade-off for the k shortest simple paths problem[Research Report] Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France. 2020
Rapport
hal-02465317v1
|
||
|
To Satisfy Impatient Web surfers is Hard[Research Report] RR-7740, LIRMM; INRIA. 2011, pp.20
Rapport
inria-00625703v2
|
||
|
Network DecontaminationDistributed Computing by Mobile Entities, 11340, Springer, pp.516-548, 2019, LNCS
Chapitre d'ouvrage
hal-02098917v1
|
||
|
On the Monotonicity of Process Number7th Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS), Apr 2013, Mexico, Mexico. pp.141-147
Communication dans un congrès
hal-00845539v1
|
||
|
Network Decontamination[Research Report] Inria & Université Nice Sophia Antipolis, CNRS, I3S, Sophia Antipolis, France. 2018, pp.1-30
Rapport
hal-01814161v2
|