The following pages link to Arnaud Labourel (Q261350):
Displaying 41 items.
- Convergecast and broadcast by power-aware mobile agents (Q261352) (← links)
- Worst-case optimal exploration of terrains with obstacles (Q384930) (← links)
- Tight bounds for black hole search with scattered agents in synchronous rings (Q392196) (← links)
- Optimality and competitiveness of exploring polygons by mobile robots (Q617716) (← links)
- Asynchronous deterministic rendezvous in bounded terrains (Q650932) (← links)
- Coloring non-crossing strings (Q727171) (← links)
- On induced-universal graphs for the class of bounded-degree graphs (Q975466) (← links)
- On asynchronous rendezvous in general graphs (Q1625604) (← links)
- Limit behavior of the multi-agent rotor-router system (Q1664136) (← links)
- Distance labeling schemes for \(K_4\)-free bridged graphs (Q2105446) (← links)
- Distance and routing labeling schemes for cube-free median graphs (Q2223698) (← links)
- Collaborative delivery with energy-constrained mobile robots (Q2292912) (← links)
- On density of subgraphs of halved cubes (Q2311351) (← links)
- Group search of the plane with faulty robots (Q2326387) (← links)
- Rendezvous in networks in spite of delay faults (Q2629214) (← links)
- Coloring a set of touching strings (Q2851465) (← links)
- Black Hole Search with Finite Automata Scattered in a Synchronous Torus (Q3095347) (← links)
- How to meet asynchronously (almost) everywhere (Q3189080) (← links)
- Edge Partition of Toroidal Graphs into Forests in Linear Time (Q3439375) (← links)
- Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs (Q3527249) (← links)
- Asynchronous Deterministic Rendezvous in Bounded Terrains (Q3569117) (← links)
- Optimal Exploration of Terrains with Obstacles (Q3569874) (← links)
- Tell Me Where I Am So I Can Meet You Sooner (Q3587463) (← links)
- Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids (Q3588310) (← links)
- Optimality and Competitiveness of Exploring Polygons by Mobile Robots (Q3639251) (← links)
- Collecting Information by Power-Aware Mobile Agents (Q4909401) (← links)
- Retracts of Products of Chordal Graphs (Q4920657) (← links)
- (Q5092373) (← links)
- Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs (Q5100967) (← links)
- On density of subgraphs of Cartesian products (Q5110645) (← links)
- Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots (Q5127187) (← links)
- Fault-Tolerant Rendezvous in Networks (Q5167856) (← links)
- On Universal Graphs of Minor Closed Families (Q5300987) (← links)
- Distributed Relationship Schemes for Trees (Q5387807) (← links)
- On local representation of distances in trees (Q5401458) (← links)
- (Q5417602) (← links)
- Collaborative delivery on a fixed path with homogeneous energy-constrained agents (Q5896883) (← links)
- Short Labels by Traversal and Jumping (Q5899392) (← links)
- Short Labels by Traversal and Jumping (Q5901482) (← links)
- Collaborative delivery on a fixed path with homogeneous energy-constrained agents (Q5919486) (← links)
- Impact of knowledge on the cost of treasure hunt in trees (Q6087562) (← links)
