Labourel, Arnaud

1. On density of subgraphs of Cartesian products
   2017/11/30 by Chepoi, Victor, Labourel, Arnaud, Ratel, Sébastien · 1 citation
   #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #G.2.2
2. How to meet asynchronously (almost) everywhere
   2010/01/06 by Czyzowicz, Jurek, Labourel, Arnaud, Pelc, Andrzej · 1 citation
   #Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)
3. Exploring Graphs with Time Constraints by Unreliable Collections of\n Mobile Robots
   2017/10/02 by Jurek Czyzowicz, Maxime Godon, Czyzowicz, Jurek +7 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems #Robotic Path Planning Algorithms
4. Distance labeling schemes for K₄-free bridged graphs
   2020/07/28 by Victor Chepoi, Arnaud Labourel, Chepoi, Victor +3 · 1 citation
   Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics