Arnaud Labourel

Publication Activity (10 Years)

Years Active: 2005-2023
Publications (10 Years): 28

Top Topics

Black Hole Search

Geographically Dispersed

Top Venues

Theor. Comput. Sci.

J. Graph Theory

Publications

Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc
Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs. ACM Trans. Algorithms 19 (3) (2023)
Sébastien Bouchard, Arnaud Labourel, Andrzej Pelc
Impact of knowledge on the cost of treasure hunt in trees. Networks 80 (1) (2022)
Arnaud Casteigts, Timothée Corsini, Hervé Hocquard, Arnaud Labourel
Robustness of Distances and Diameter in a Fragile Network. SAND (2022)
Victor Chepoi, Arnaud Labourel, Sébastien Ratel
-free bridged graphs. Inf. Comput. 289 (Part) (2022)
Jérémie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, Matús Mihalák
Collaborative delivery on a fixed path with homogeneous energy-constrained agents. Theor. Comput. Sci. 868 (2021)
Victor Chepoi, Arnaud Labourel, Sébastien Ratel
Distance and Routing Labeling Schemes for Cube-Free Median Graphs. Algorithmica 83 (1) (2021)
Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc
Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs. ICALP (2021)
Victor Chepoi, Arnaud Labourel, Sébastien Ratel
-free bridged graphs. CoRR (2020)
Victor Chepoi, Arnaud Labourel, Sébastien Ratel
-Free Bridged Graphs. SIROCCO (2020)
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák
Collaborative delivery with energy-constrained mobile robots. Theor. Comput. Sci. 810 (2020)
Victor Chepoi, Arnaud Labourel, Sébastien Ratel
On density of subgraphs of Cartesian products. J. Graph Theory 93 (1) (2020)
Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc
Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs. CoRR (2020)
Victor Chepoi, Arnaud Labourel, Sébastien Ratel
On density of subgraphs of halved cubes. Eur. J. Comb. 80 (2019)
Jurek Czyzowicz, Maxime Godon, Evangelos Kranakis, Arnaud Labourel
Group search of the plane with faulty robots. Theor. Comput. Sci. 792 (2019)
Evangelos Bampas, Lélia Blin, Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Maria Potop-Butucaru, Sébastien Tixeuil
On asynchronous rendezvous in general graphs. Theor. Comput. Sci. 753 (2019)
Victor Chepoi, Arnaud Labourel, Sébastien Ratel
Distance Labeling Schemes for Cube-Free Median Graphs. MFCS (2019)
Jérémie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, Matús Mihalák
Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents. SIROCCO (2019)
Jurek Czyzowicz, Maxime Godon, Evangelos Kranakis, Arnaud Labourel, Euripides Markou
Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots. SOFSEM (2018)
Victor Chepoi, Arnaud Labourel, Sébastien Ratel
Distance and routing labeling schemes for cube-free median graphs. CoRR (2018)
Victor Chepoi, Arnaud Labourel, Sébastien Ratel
On density of subgraphs of Cartesian products. CoRR (2017)
Victor Chepoi, Arnaud Labourel, Sébastien Ratel
On density of subgraphs of halved cubes. CoRR (2017)
Jurek Czyzowicz, Maxime Godon, Evangelos Kranakis, Arnaud Labourel, Euripides Markou
Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots. CoRR (2017)
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák
Collaborative Delivery with Energy-Constrained Mobile Robots. SIROCCO (2016)
Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès
Convergecast and Broadcast by Power-Aware Mobile Agents. CoRR (2016)
Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès
Convergecast and Broadcast by Power-Aware Mobile Agents. Algorithmica 74 (1) (2016)
Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc
Rendezvous in networks in spite of delay faults. Distributed Comput. 29 (3) (2016)
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák
Collaborative Delivery with Energy-Constrained Mobile Robots. CoRR (2016)
Louis Esperet, Daniel Gonçalves, Arnaud Labourel
Coloring Non-Crossing Strings. Electron. J. Comb. 23 (4) (2016)
Jérémie Chalopin, Shantanu Das, Pawel Gawrychowski, Adrian Kosowski, Arnaud Labourel, Przemyslaw Uznanski
Limit Behavior of the Multi-agent Rotor-Router System. DISC (2015)
Louis Esperet, Daniel Gonçalves, Arnaud Labourel
Coloring non-crossing strings. CoRR (2015)
Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc
Fault-Tolerant Rendezvous in Networks. CoRR (2014)
Jérémie Chalopin, Shantanu Das, Pawel Gawrychowski, Adrian Kosowski, Arnaud Labourel, Przemyslaw Uznanski
Lock-in Problem for Parallel Rotor-router Walks. CoRR (2014)
Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc
Fault-Tolerant Rendezvous in Networks. ICALP (2) (2014)
Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou
Tight bounds for black hole search with scattered agents in synchronous rings. Theor. Comput. Sci. 509 (2013)
Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
Worst-case optimal exploration of terrains with obstacles. Inf. Comput. 225 (2013)
Bostjan Bresar, Jérémie Chalopin, Victor Chepoi, Matjaz Kovse, Arnaud Labourel, Yann Vaxès
Retracts of Products of Chordal Graphs. J. Graph Theory 73 (2) (2013)
Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès
Collecting Information by Power-Aware Mobile Agents. DISC (2012)
Jurek Czyzowicz, Andrzej Pelc, Arnaud Labourel
How to meet asynchronously (almost) everywhere. ACM Trans. Algorithms 8 (4) (2012)
Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou
Tight Bounds for Black Hole Search with Scattered Agents in Synchronous Rings CoRR (2011)
Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
Asynchronous deterministic rendezvous in bounded terrains. Theor. Comput. Sci. 412 (50) (2011)
Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou
Tight Bounds for Scattered Black Hole Search in a Ring. SIROCCO (2011)
Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou
Black Hole Search with Finite Automata Scattered in a Synchronous Torus. DISC (2011)
Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc
Optimality and competitiveness of exploring polygons by mobile robots. Inf. Comput. 209 (1) (2011)
Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou
Black Hole Search with Finite Automata Scattered in a Synchronous Torus CoRR (2011)
Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc
How to Meet Asynchronously (Almost) Everywhere. SODA (2010)
Andrew Collins, Jurek Czyzowicz, Leszek Gasieniec, Arnaud Labourel
Tell Me Where I Am So I Can Meet You Sooner. ICALP (2) (2010)
Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Arnaud Labourel
Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids. DISC (2010)
Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
Optimal Exploration of Terrains with Obstacles. SWAT (2010)
Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
Optimal Exploration of Terrains with Obstacles CoRR (2010)
Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
Asynchronous deterministic rendezvous in bounded terrains CoRR (2010)
Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
Asynchronous Deterministic Rendezvous in Bounded Terrains. SIROCCO (2010)
Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc
How to meet asynchronously (almost) everywhere CoRR (2010)
Louis Esperet, Daniel Gonçalves, Arnaud Labourel
Coloring a set of touching strings. Electron. Notes Discret. Math. 34 (2009)
Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc
Optimality and Competitiveness of Exploring Polygons by Mobile Robots. ESA (2009)
Louis Esperet, Arnaud Labourel, Pascal Ochem
On induced-universal graphs for the class of bounded-degree graphs. Inf. Process. Lett. 108 (5) (2008)
Arnaud Labourel
On Universal Graphs of Minor Closed Families. Electron. Notes Discret. Math. 31 (2008)
Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel
Short Labels by Traversal and Jumping. Electron. Notes Discret. Math. 28 (2007)
Cyril Gavoille, Arnaud Labourel
Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs. ESA (2007)
Cyril Gavoille, Arnaud Labourel
On local representation of distances in trees. PODC (2007)
Cyril Gavoille, Arnaud Labourel
Distributed Relationship Schemes for Trees. ISAAC (2007)
Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel
Short Labels by Traversal and Jumping. SIROCCO (2006)
Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel
Edge Partition of Toroidal Graphs into Forests in Linear Time. Electron. Notes Discret. Math. 22 (2005)