Filtrer vos résultats
- 68
- 53
- 50
- 46
- 8
- 7
- 6
- 3
- 1
- 7
- 120
- 5
- 1
- 1
- 2
- 4
- 2
- 6
- 3
- 5
- 11
- 3
- 7
- 7
- 4
- 4
- 4
- 5
- 10
- 11
- 7
- 11
- 4
- 7
- 1
- 2
- 119
- 2
- 112
- 58
- 14
- 14
- 12
- 12
- 11
- 9
- 7
- 5
- 5
- 5
- 5
- 4
- 4
- 3
- 3
- 3
- 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
- 121
- 18
- 18
- 14
- 13
- 11
- 10
- 9
- 8
- 8
- 7
- 7
- 7
- 7
- 7
- 6
- 6
- 6
- 6
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 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
- 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
- 1
- 1
- 1
- 1
121 résultats
|
|
Algorithms for Sensor Systems - 12th International Symposium, ALGOSENSORS 2016, Aarhus, Denmark, August 25-26, 2016, ProceedingsSpringer, 10050, 2017, Lecture Notes in Computer Science, ⟨10.1007/978-3-319-53058-1⟩
Ouvrages
hal-01871359v1
|
||
|
|
Approximation algorithms for the p-hub center routing problem in parameterized metric graphsTheoretical Computer Science, 2020, 806, pp.271-280. ⟨10.1016/j.tcs.2019.05.008⟩
Article dans une revue
hal-02397392v1
|
||
Lower Bounds and Algorithms for Dominating Sets in Web GraphsInternet Mathematics, 2005, 2 (3), pp.275--300
Article dans une revue
hal-00307026v1
|
|||
Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-ToleranceSpringer-Verlag, pp.361, 2005
Ouvrages
hal-00307029v1
|
|||
Approximation bounds for Black Hole Search problemsProceedings of the 9th International Conference on Principles of Distributed Systems (OPODIS 2005), Dec 2005, Italy. pp.261--274
Communication dans un congrès
hal-00307228v1
|
|||
|
|
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration StrategiesICALP 2009, Jul 2009, Greece. pp.411-422, ⟨10.1007/978-3-642-02930-1_34⟩
Communication dans un congrès
hal-00374071v1
|
||
Algorithmic Methods for Large Communication Networks2009
Autre publication scientifique
hal-00720766v1
|
|||
|
|
Exploration of Constantly Connected Dynamic Graphs Based on Cactuses21th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2014), Jul 2014, Hida Takayama, Japan. pp.250--262, ⟨10.1007/978-3-319-09620-9_20⟩
Communication dans un congrès
hal-01068904v1
|
||
|
|
On the Complexity of Bandwidth Allocation in Radio Networks with Steady Traffic Demands[Research Report] RR-5432, INRIA. 2004, pp.27
Rapport
inria-00070575v1
|
||
|
|
The RED-BLUE SEPARATION problem on graphsTheoretical Computer Science, 2023, 970, pp.114061. ⟨10.1016/j.tcs.2023.114061⟩
Article dans une revue
hal-03854400v1
|
||
Computing parameters of sequence-based dynamic graphsICALP 2018 workshop on Algorithmic Aspects of Temporal Graphs, Jul 2018, Prague, Czech Republic
Communication dans un congrès
hal-01872599v1
|
|||
|
|
Rendezvous of heterogeneous mobile agents in edge-weighted networksTheoretical Computer Science, 2015, 608 (3), pp.219-230. ⟨10.1016/j.tcs.2015.05.055⟩
Article dans une revue
hal-01251835v1
|
||
Dominating Sets in Web GraphsProceedings of the Third Workshop on Algorithms and Models for the Web-Graph (WAW 2004), 2004, India. pp.31--43
Communication dans un congrès
hal-00307024v1
|
|||
Brief Announcement: On the Complexity of Distributed Greedy Coloring21rst International Symposium on Distributed Computing (DISC), septembre 2007, Lemesos, Chypre, Sep 2007, Lemesos, Cyprus. pp.482-484
Communication dans un congrès
hal-00369655v1
|
|||
Data Gathering in Wireless NetworksArie Koster and Xavier Munoz. Graphs and Algorithms in Communication Networks, Springer-Verlag, pp.357--377, 2010, Springer Monograph
Chapitre d'ouvrage
hal-00342958v1
|
|||
Tutoriel : "Mobile Agent ComputingROADEF - 15ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Société française de recherche opérationnelle et d'aide à la décision, Feb 2014, Bordeaux, France
Communication dans un congrès
hal-00946263v1
|
|||
|
|
Derandomizing random walks in undirected graphs using locally fair exploration strategiesDistributed Computing, 2011, 24 (2), pp.91-99. ⟨10.1007/s00446-011-0138-4⟩
Article dans une revue
hal-00638229v1
|
||
Gathering of Robots on Anonymous Grids without Multiplicity DetectionTheoretical Computer Science, 2016, 610, pp.158-168. ⟨10.1016/j.tcs.2014.06.045⟩
Article dans une revue
hal-01068897v1
|
|||
|
|
Perpetual maintenance of machines with different urgency requirements2022
Pré-publication, Document de travail
hal-03036807v2
|
||
|
|
Fast Periodic Graph Exploration with Constant MemoryJournal of Computer and System Sciences, 2008, 74 (5), pp.808--822. ⟨10.1016/j.jcss.2007.09.004⟩
Article dans une revue
hal-00306995v1
|
||
|
|
The Multi-Agent Rotor-Router on the Ring: A Deterministic Alternative to Parallel Random WalksPODC 2013 - ACM Symposium on Principles of Distributed Computing, Jul 2013, Montreal, Canada. pp.365-374, ⟨10.1145/2484239.2484260⟩
Communication dans un congrès
hal-00735113v2
|
||
Efficient Exploration of Anonymous Undirected GraphsProceedings of the 24th International Workshop on Combinatorial Algorithms (IWOCA 2013), Jul 2013, Rouen, France. pp.7-13, ⟨10.1007/978-3-642-45278-9_2⟩
Communication dans un congrès
istex
hal-00927154v1
|
|||
The Multi-Agent Rotor-Router on the Ring: A Deterministic Alternative to Parallel Random WalksMAC - Workshop on Distributed Computing by Mobile Robots, Jul 2013, Ischia, Italy
Communication dans un congrès
hal-00988035v1
|
|||
|
|
Monitoring the edges of a graph using distancesProceedings of the 6th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2020), Feb 2020, Hyderabad, India. pp.28-40, ⟨10.1007/978-3-030-39219-2_3⟩
Communication dans un congrès
hal-02500423v1
|
||
Robustness of the rotor-router mechanismOPODIS 2009, Dec 2009, France. pp.345--358
Communication dans un congrès
hal-00417639v1
|
|||
|
|
Approximability and inapproximability of the star p -hub center problem with parameterized triangle inequalityJournal of Computer and System Sciences, 2018, 92, pp.92 - 112. ⟨10.1016/j.jcss.2017.09.012⟩
Article dans une revue
hal-01871133v1
|
||
|
|
Approximation algorithms for the p-hub center routing problem in parameterized metric graphsProceedings of the 29th International Workshop on Combinatorial Algorithms (IWOCA 2018), Jul 2018, Singapore, Singapore. pp.115-127, ⟨10.1007/978-3-319-94667-2_10⟩
Communication dans un congrès
hal-01871330v1
|
||
|
|
Fundamentals of Computation Theory - 21st International Symposium, FCT 2017, Bordeaux, France, September 11-13, 2017, ProceedingsSpringer, 10472, 2017, Lecture Notes in Computer Science, ⟨10.1007/978-3-662-55751-8⟩
Ouvrages
hal-01871368v1
|
||
On the Approximabilty of Hub Allocation Problems23rd International Symposium on Mathematical Programming (ISMP 2018), Jul 2018, Bordeaux, France
Communication dans un congrès
hal-01872587v1
|
|||
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequalityTheoretical Computer Science, 2004, 326 (1--3), pp.137--153
Article dans une revue
hal-00307017v1
|