Byzantine gathering in networks. - Sébastien Bouchard; Yoann Dieudonné; Bertrand Ducourthial (Distributed Comput., 2016)

On deterministic rendezvous at a node of agents with arbitrary velocities. - Sébastien Bouchard; Yoann Dieudonné; Andrzej Pelc; Franck Petit (Inf. Process. Lett., 2018)

Asynchronous approach in the plane: a deterministic polynomial algorithm. - Sébastien Bouchard; Marjorie Bournat; Yoann Dieudonné; Swan Dubois; Franck Petit (Distributed Comput., 2019)

On the Deterministic Gathering of Mobile Agents. (À propos du rassemblement déterministe d'agents mobiles). - Sébastien Bouchard (2019)

Almost Universal Anonymous Rendezvous in the Plane. - Sébastien Bouchard; Yoann Dieudonné; Andrzej Pelc; Franck Petit (SPAA, 2020)

Deterministic Treasure Hunt in the Plane with Angular Hints. - Sébastien Bouchard; Yoann Dieudonné; Andrzej Pelc; Franck Petit (Algorithmica, 2020)

Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs. - Sébastien Bouchard; Yoann Dieudonné; Arnaud Labourel; Andrzej Pelc (ICALP, 2021)

Byzantine gathering in polynomial time. - Sébastien Bouchard; Yoann Dieudonné; Anissa Lamani (Distributed Comput., 2022)

Impact of knowledge on the cost of treasure hunt in trees. - Sébastien Bouchard; Arnaud Labourel; Andrzej Pelc (Networks, 2022)

Want to Gather? No Need to Chatter! - Sébastien Bouchard; Yoann Dieudonné; Andrzej Pelc (SIAM J. Comput., 2023)

Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs. - Sébastien Bouchard; Yoann Dieudonné; Arnaud Labourel; Andrzej Pelc (ACM Trans. Algorithms, 2023)