Arnaud Labourel

From MaRDI portal
Person:261350

Available identifiers

zbMath Open labourel.arnaudMaRDI QIDQ261350

List of research outcomes





PublicationDate of PublicationType
Impact of knowledge on the cost of treasure hunt in trees2023-12-12Paper
Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs2023-10-23Paper
Distance labeling schemes for \(K_4\)-free bridged graphs2022-12-08Paper
Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs2022-09-01Paper
https://portal.mardi4nfdi.de/entity/Q50923732022-07-21Paper
Collaborative delivery on a fixed path with homogeneous energy-constrained agents2021-05-10Paper
Distance and routing labeling schemes for cube-free median graphs2021-02-01Paper
Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots2020-10-21Paper
Distance labeling schemes for $K_4$-free bridged graphs2020-07-28Paper
On density of subgraphs of Cartesian products2020-05-21Paper
Collaborative delivery on a fixed path with homogeneous energy-constrained agents2020-03-03Paper
Collaborative delivery with energy-constrained mobile robots2020-02-06Paper
Group search of the plane with faulty robots2019-10-07Paper
On density of subgraphs of halved cubes2019-07-10Paper
On asynchronous rendezvous in general graphs2018-11-29Paper
Limit behavior of the multi-agent rotor-router system2018-08-24Paper
Coloring non-crossing strings2016-12-06Paper
Collaborative delivery with energy-constrained mobile robots2016-12-01Paper
Rendezvous in networks in spite of delay faults2016-07-05Paper
Convergecast and broadcast by power-aware mobile agents2016-03-23Paper
How to meet asynchronously (almost) everywhere2014-09-09Paper
Fault-Tolerant Rendezvous in Networks2014-07-01Paper
https://portal.mardi4nfdi.de/entity/Q54176022014-05-22Paper
On local representation of distances in trees2014-03-13Paper
Tight bounds for black hole search with scattered agents in synchronous rings2014-01-13Paper
Worst-case optimal exploration of terrains with obstacles2013-11-29Paper
Coloring a set of touching strings2013-10-10Paper
On Universal Graphs of Minor Closed Families2013-06-28Paper
Retracts of Products of Chordal Graphs2013-05-21Paper
Collecting Information by Power-Aware Mobile Agents2013-03-13Paper
Asynchronous deterministic rendezvous in bounded terrains2011-12-07Paper
Black Hole Search with Finite Automata Scattered in a Synchronous Torus2011-10-28Paper
Optimality and competitiveness of exploring polygons by mobile robots2011-01-13Paper
Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids2010-09-10Paper
Tell Me Where I Am So I Can Meet You Sooner2010-09-07Paper
Optimal Exploration of Terrains with Obstacles2010-06-22Paper
Asynchronous Deterministic Rendezvous in Bounded Terrains2010-06-17Paper
On induced-universal graphs for the class of bounded-degree graphs2010-06-09Paper
Optimality and Competitiveness of Exploring Polygons by Mobile Robots2009-10-29Paper
Short Labels by Traversal and Jumping2009-03-12Paper
Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs2008-09-25Paper
Distributed Relationship Schemes for Trees2008-05-27Paper
Edge Partition of Toroidal Graphs into Forests in Linear Time2007-05-29Paper
Short Labels by Traversal and Jumping2007-05-29Paper

Research outcomes over time

This page was built for person: Arnaud Labourel