22 results on '"Labourel, Arnaud"'
Search Results
2. Distance and Routing Labeling Schemes for Cube-Free Median Graphs
3. On density of subgraphs of halved cubes
4. Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs.
5. Tight bounds for black hole search with scattered agents in synchronous rings
6. Rendezvous in networks in spite of delay faults
7. Convergecast and Broadcast by Power-Aware Mobile Agents
8. Worst-case optimal exploration of terrains with obstacles
9. Optimality and competitiveness of exploring polygons by mobile robots
10. Asynchronous deterministic rendezvous in bounded terrains
11. Impact of knowledge on the cost of treasure hunt in trees.
12. On density of subgraphs of Cartesian products.
13. Coloring a set of touching strings
14. On Universal Graphs of Minor Closed Families
15. Short Labels by Traversal and Jumping
16. Edge Partition of Toroidal Graphs into Forests in Linear Time
17. Retracts of Products of Chordal Graphs.
18. How to Meet Asynchronously (Almost) Everywhere.
19. Collaborative delivery on a fixed path with homogeneous energy-constrained agents.
20. Collaborative delivery with energy-constrained mobile robots.
21. Group search of the plane with faulty robots.
22. On asynchronous rendezvous in general graphs.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.