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
- 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
|
Report on GRASTA 2017, 6th Workshop on GRAph Searching, Theory and Applications, Anogia, Crete, Greece, April 10 – April 13, 2017[Research Report] LIP6, CNRS, Universit ́e Pierre et Marie Curie Paris, France; Department of Informatics, University of Bergen, Bergen, Norway; CNRS and Université Paris Diderot, France; Inria & Université Nice Sophia Antipolis, CNRS, I3S, Sophia Antipolis, France; AlGCo project team, CNRS, LIRMM, Montpellier, France. 2017
Rapport
lirmm-01645614v1
|
||
|
Distributed Chasing of Network Intruders13th International Colloquium on Structural Information and Communication Complexity, 2006, Chester, United Kingdom. pp.70-84, ⟨10.1007/11780823_7⟩
Communication dans un congrès
hal-01311355v1
|
||
|
Size-Constrained Tree Decompositions[Research Report] INRIA Sophia-Antipolis. 2014
Rapport
hal-01074177v1
|
||
|
On paths in grids with forbidden transitionsALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France
Communication dans un congrès
hal-01142745v1
|
||
|
On improving matchings in trees, via bounded-length augmentations[Research Report] Université Côte d'Azur. 2017
Rapport
hal-01555465v1
|
||
|
Comment battre la marche aléatoire en comptant ?12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France
Communication dans un congrès
inria-00475863v1
|
||
Fast Robber in Planar GraphsInternational Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2008, Durham, United Kingdom
Communication dans un congrès
inria-00423451v1
|
|||
|
The Cost of Monotonicity in Distributed Graph SearchingDistributed Computing, 2009, 22 (2), pp.117-127. ⟨10.1007/s00446-009-0089-1⟩
Article dans une revue
hal-00412063v1
|
||
|
An Unified FPT Algorithm for Width of Partition Functions[Research Report] RR-8372, INRIA. 2013
Rapport
hal-00865575v2
|
||
|
Network DecontaminationDistributed Computing by Mobile Entities, 11340, Springer, pp.516-548, 2019, LNCS
Chapitre d'ouvrage
hal-02098917v1
|
||
|
A unified approach for Gathering and Exclusive Searching on rings under weak assumptionsDistributed Computing, 2017, 30 (1), pp.17-48
Article dans une revue
hal-01326473v1
|
||
|
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
|
||
|
Posters de médiation scientifique IV : Jeux dans les Graphes2017
Autre publication scientifique
hal-01645165v1
|
||
|
Posters de médiation scientifique III : Réseaux de Tri2017
Autre publication scientifique
hal-01645164v1
|
||
|
Connexions ! Le jeu du plus grand sous-graphe connexeALGOTEL 2021 - 23èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Sep 2021, La Rochelle, France
Communication dans un congrès
hal-03211446v2
|
||
|
Preferential attachment hypergraph with high modularity[Research Report] Université Cote d'Azur. 2021
Rapport
hal-03154836v1
|
||
|
Treelength of Series-parallel graphsLAGOS 2021 - XI Latin and American Algorithms, Graphs and Optimization Symposium, May 2021, São Paulo / Virtual, Brazil. ⟨10.1016/j.procs.2021.11.008⟩
Communication dans un congrès
hal-03175837v1
|
||
|
On Proper Labellings of Graphs with Minimum Label SumAlgorithmica, 2022, 84 (4), pp.1030-1063. ⟨10.1007/s00453-021-00903-x⟩
Article dans une revue
hal-03455908v1
|
||
|
Deciding the Erdős-Pósa property in 3-connected digraphsWG 2023 - 49th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2023, Fribourg (CH), Switzerland
Communication dans un congrès
hal-04084227v1
|
||
|
Semi-proper orientations of dense graphsInria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France. 2022
Rapport
hal-03907202v2
|
||
|
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
|
||
|
On the hull number of some graph classesTheoretical Computer Science, 2013, 475, pp.1-12. ⟨10.1016/j.tcs.2012.12.035⟩
Article dans une revue
hal-00770650v1
|
||
|
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
|
||
Monotonicity of non-deterministic graph searchingTheoretical Computer Science, 2008, 399, pp.169--178
Article dans une revue
hal-00306321v1
|
|||
Connected Treewidth and Connected Graph SearchingLatin American Theoretical Informatics Symposium (LATIN), 2006, Valdivia, Chile
Communication dans un congrès
inria-00423448v1
|
|||
|
Fast Data Gathering in Radio Grid Networks[Research Report] RR-6851, INRIA. 2009
Rapport
inria-00363908v4
|
||
|
Tradeoffs when optimizing Lightpaths Reconfiguration in WDM networks[Research Report] RR-7047, INRIA. 2009
Rapport
inria-00421140v4
|
||
|
Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth13th International Symposium on Experimental Algorithms, 2014, Copenhagen, Denmark. pp.46-58
Communication dans un congrès
hal-00966851v1
|
||
|
Algorithmic complexity: Between Structure and Knowledge How Pursuit-evasion Games help.Data Structures and Algorithms [cs.DS]. Université Nice Sophia Antipolis, 2014
HDR
tel-00998854v1
|