( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Robustness of Distances and Diameter in a Fragile Network.

, , , и . SAND, том 221 из LIPIcs, стр. 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.

Arnaud Moris

Julien Arnaud

Arnaud Mende

Arnaud Dewalque

Arnaud Casteigts

 

Другие публикации лиц с тем же именем

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