Arnaud Labourel

From MaRDI portal


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Impact of knowledge on the cost of treasure hunt in trees
Networks
2023-12-12Paper
Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs
ACM Transactions on Algorithms
2023-10-23Paper
Distance labeling schemes for \(K_4\)-free bridged graphs
Information and Computation
2022-12-08Paper
Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs
Structural Information and Communication Complexity
2022-09-01Paper
scientific article; zbMATH DE number 7561659 (Why is no real title available?)
 
2022-07-21Paper
Collaborative delivery on a fixed path with homogeneous energy-constrained agents
Theoretical Computer Science
2021-05-10Paper
Distance and routing labeling schemes for cube-free median graphs
Algorithmica
2021-02-01Paper
Exploring graphs with time constraints by unreliable collections of mobile robots
SOFSEM 2018: Theory and Practice of Computer Science
2020-10-21Paper
Distance labeling schemes for $K_4$-free bridged graphs
 
2020-07-28Paper
On density of subgraphs of Cartesian products
Journal of Graph Theory
2020-05-21Paper
Collaborative delivery on a fixed path with homogeneous energy-constrained agents
Structural Information and Communication Complexity
2020-03-03Paper
Collaborative delivery with energy-constrained mobile robots
Theoretical Computer Science
2020-02-06Paper
Group search of the plane with faulty robots
Theoretical Computer Science
2019-10-07Paper
On density of subgraphs of halved cubes
European Journal of Combinatorics
2019-07-10Paper
On asynchronous rendezvous in general graphs
Theoretical Computer Science
2018-11-29Paper
Limit behavior of the multi-agent rotor-router system
 
2018-08-24Paper
Coloring non-crossing strings
The Electronic Journal of Combinatorics
2016-12-06Paper
Collaborative delivery with energy-constrained mobile robots
Lecture Notes in Computer Science
2016-12-01Paper
Rendezvous in networks in spite of delay faults
Distributed Computing
2016-07-05Paper
Convergecast and broadcast by power-aware mobile agents
Algorithmica
2016-03-23Paper
How to meet asynchronously (almost) everywhere
ACM Transactions on Algorithms
2014-09-09Paper
Fault-tolerant rendezvous in networks
Automata, Languages, and Programming
2014-07-01Paper
How to meet asynchronously (almost) everywhere
 
2014-05-22Paper
On local representation of distances in trees
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
2014-03-13Paper
Tight bounds for black hole search with scattered agents in synchronous rings
Theoretical Computer Science
2014-01-13Paper
Worst-case optimal exploration of terrains with obstacles
Information and Computation
2013-11-29Paper
Coloring a set of touching strings
Electronic Notes in Discrete Mathematics
2013-10-10Paper
On universal graphs of minor closed families
Electronic Notes in Discrete Mathematics
2013-06-28Paper
Retracts of products of chordal graphs
Journal of Graph Theory
2013-05-21Paper
Collecting information by power-aware mobile agents
Lecture Notes in Computer Science
2013-03-13Paper
Asynchronous deterministic rendezvous in bounded terrains
Theoretical Computer Science
2011-12-07Paper
Black hole search with finite automata scattered in a synchronous torus
Lecture Notes in Computer Science
2011-10-28Paper
Optimality and competitiveness of exploring polygons by mobile robots
Information and Computation
2011-01-13Paper
Almost optimal asynchronous rendezvous in infinite multidimensional grids
Lecture Notes in Computer Science
2010-09-10Paper
Tell Me Where I Am So I Can Meet You Sooner
Automata, Languages and Programming
2010-09-07Paper
Optimal Exploration of Terrains with Obstacles
Lecture Notes in Computer Science
2010-06-22Paper
Asynchronous deterministic rendezvous in bounded terrains
Structural Information and Communication Complexity
2010-06-17Paper
On induced-universal graphs for the class of bounded-degree graphs
Information Processing Letters
2010-06-09Paper
Optimality and Competitiveness of Exploring Polygons by Mobile Robots
Lecture Notes in Computer Science
2009-10-29Paper
Short Labels by Traversal and Jumping
Structural Information and Communication Complexity
2009-03-12Paper
Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs
Algorithms – ESA 2007
2008-09-25Paper
Distributed Relationship Schemes for Trees
Algorithms and Computation
2008-05-27Paper
Edge Partition of Toroidal Graphs into Forests in Linear Time
Electronic Notes in Discrete Mathematics
2007-05-29Paper
Short Labels by Traversal and Jumping
Electronic Notes in Discrete Mathematics
2007-05-29Paper


Research outcomes over time


This page was built for person: Arnaud Labourel