( en | de | ru )

 

Disambiguation of "Labourel, Arnaud"

Author of the publication

copydeleteadd this publication to your clipboard
Robustness of Distances and Diameter in a Fragile Network.

, , , and . SAND, volume 221 of LIPIcs, page 9:1-9:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Arnaud Mende

Arnaud Moris

Julien Arnaud

Arnaud Dewalque

Arnaud Casteigts

 

Other publications of authors with the same name

Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs., , , and . ACM Trans. Algorithms, 19 (3): 22:1-22:32 (July 2023)Collecting Information by Power-Aware Mobile Agents., , , , , and . DISC, volume 7611 of Lecture Notes in Computer Science, page 46-60. Springer, (2012)How to Meet Asynchronously (Almost) Everywhere., , and . SODA, page 22-30. SIAM, (2010)Distance and Routing Labeling Schemes for Cube-Free Median Graphs., , and . Algorithmica, 83 (1): 252-296 (2021)Optimality and Competitiveness of Exploring Polygons by Mobile Robots., , and . ESA, volume 5757 of Lecture Notes in Computer Science, page 263-274. Springer, (2009)Black Hole Search with Finite Automata Scattered in a Synchronous Torus., , , and . DISC, volume 6950 of Lecture Notes in Computer Science, page 432-446. Springer, (2011)Distance Labeling Schemes for Cube-Free Median Graphs., , and . MFCS, volume 138 of LIPIcs, page 15:1-15:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On density of subgraphs of halved cubes., , and . Eur. J. Comb., (2019)On induced-universal graphs for the class of bounded-degree graphs., , and . Inf. Process. Lett., 108 (5): 255-260 (2008)Distributed Relationship Schemes for Trees., and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 728-738. Springer, (2007)