Arnaud Labourel

According to our database, Arnaud Labourel authored at least 41 papers between 2005 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs.

Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc

ACM Trans. Algorithms, July, 2023

2022

Impact of knowledge on the cost of treasure hunt in trees.

Sébastien Bouchard, Arnaud Labourel, Andrzej Pelc

Networks, 2022

Distance labeling schemes for <i>K</i>₄-free bridged graphs.

Victor Chepoi, Arnaud Labourel, Sébastien Ratel

Inf. Comput., 2022

Robustness of Distances and Diameter in a Fragile Network.

Arnaud Casteigts, Timothée Corsini, Hervé Hocquard, Arnaud Labourel

Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022

2021

Collaborative delivery on a fixed path with homogeneous energy-constrained agents.

Jérémie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, Matús Mihalák

Theor. Comput. Sci., 2021

Distance and Routing Labeling Schemes for Cube-Free Median Graphs.

Victor Chepoi, Arnaud Labourel, Sébastien Ratel

Algorithmica, 2021

Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs.

Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Collaborative delivery with energy-constrained mobile robots.

Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák

Theor. Comput. Sci., 2020

On density of subgraphs of Cartesian products.

Victor Chepoi, Arnaud Labourel, Sébastien Ratel

J. Graph Theory, 2020

Distance Labeling Schemes for K₄-Free Bridged Graphs.

Victor Chepoi, Arnaud Labourel, Sébastien Ratel

Proceedings of the Structural Information and Communication Complexity, 2020

2019

Group search of the plane with faulty robots.

Jurek Czyzowicz, Maxime Godon, Evangelos Kranakis, Arnaud Labourel

Theor. Comput. Sci., 2019

On asynchronous rendezvous in general graphs.

Evangelos Bampas, Lélia Blin, Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Maria Potop-Butucaru, Sébastien Tixeuil

Theor. Comput. Sci., 2019

On density of subgraphs of halved cubes.

Victor Chepoi, Arnaud Labourel, Sébastien Ratel

Eur. J. Comb., 2019

Distance Labeling Schemes for Cube-Free Median Graphs.

Victor Chepoi, Arnaud Labourel, Sébastien Ratel

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018

Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots.

Jurek Czyzowicz, Maxime Godon, Evangelos Kranakis, Arnaud Labourel, Euripides Markou

Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

2016

Rendezvous in networks in spite of delay faults.

Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc

Distributed Comput., 2016

Coloring Non-Crossing Strings.

Louis Esperet, Daniel Gonçalves, Arnaud Labourel

Electron. J. Comb., 2016

Convergecast and Broadcast by Power-Aware Mobile Agents.

Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès

Algorithmica, 2016

2015

Limit Behavior of the Multi-agent Rotor-Router System.

Jérémie Chalopin, Shantanu Das, Pawel Gawrychowski, Adrian Kosowski, Arnaud Labourel, Przemyslaw Uznanski

Proceedings of the Distributed Computing - 29th International Symposium, 2015

2014

Lock-in Problem for Parallel Rotor-router Walks.

Jérémie Chalopin, Shantanu Das, Pawel Gawrychowski, Adrian Kosowski, Arnaud Labourel, Przemyslaw Uznanski

CoRR, 2014

Fault-Tolerant Rendezvous in Networks.

Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

Tight bounds for black hole search with scattered agents in synchronous rings.

Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou

Theor. Comput. Sci., 2013

Retracts of Products of Chordal Graphs.

Bostjan Bresar, Jérémie Chalopin, Victor Chepoi, Matjaz Kovse, Arnaud Labourel, Yann Vaxès

J. Graph Theory, 2013

Worst-case optimal exploration of terrains with obstacles.

Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc

Inf. Comput., 2013

2012

How to meet asynchronously (almost) everywhere.

Jurek Czyzowicz, Andrzej Pelc, Arnaud Labourel

ACM Trans. Algorithms, 2012

Collecting Information by Power-Aware Mobile Agents.

Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès

Proceedings of the Distributed Computing - 26th International Symposium, 2012

2011

Asynchronous deterministic rendezvous in bounded terrains.

Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc

Theor. Comput. Sci., 2011

Optimality and competitiveness of exploring polygons by mobile robots.

Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc

Inf. Comput., 2011

Black Hole Search with Finite Automata Scattered in a Synchronous Torus.

Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou

Proceedings of the Distributed Computing - 25th International Symposium, 2011

Tight Bounds for Scattered Black Hole Search in a Ring.

Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou

Proceedings of the Structural Information and Communication Complexity, 2011

2010

Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids.

Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Arnaud Labourel

Proceedings of the Distributed Computing, 24th International Symposium, 2010

Optimal Exploration of Terrains with Obstacles.

Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc

Proceedings of the Algorithm Theory, 2010

Tell Me Where I Am So I Can Meet You Sooner.

Andrew Collins, Jurek Czyzowicz, Leszek Gasieniec, Arnaud Labourel

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

Coloring a set of touching strings.

Louis Esperet, Daniel Gonçalves, Arnaud Labourel

Electron. Notes Discret. Math., 2009

2008

On induced-universal graphs for the class of bounded-degree graphs.

Louis Esperet, Arnaud Labourel, Pascal Ochem

Inf. Process. Lett., 2008

On Universal Graphs of Minor Closed Families.

Arnaud Labourel

Electron. Notes Discret. Math., 2008

2007

Short Labels by Traversal and Jumping.

Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel

Electron. Notes Discret. Math., 2007

On local representation of distances in trees.

Cyril Gavoille, Arnaud Labourel

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Distributed Relationship Schemes for Trees.

Cyril Gavoille, Arnaud Labourel

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs.

Cyril Gavoille, Arnaud Labourel

Proceedings of the Algorithms, 2007

2005

Edge Partition of Toroidal Graphs into Forests in Linear Time.

Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel

Electron. Notes Discret. Math., 2005