Yoann Dieudonné

Orcid: 0000-0002-9593-7802

According to our database1, Yoann Dieudonné authored at least 46 papers between 2006 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Can Like Attract Like? A Study of Homonymous Gathering in Networks.
CoRR, October, 2025

Graph Exploration: The Impact of a Distance Constraint.
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2023
Almost Universal Anonymous Rendezvous in the Plane.
Algorithmica, October, 2023

Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs.
ACM Trans. Algorithms, July, 2023

Meeting in Harsh Conditions.
, 2023

2021
Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
Almost Universal Anonymous Rendezvous in the Plane.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Want to Gather? No Need to Chatter!
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

2019
Explicit Communication Among Stigmergic Robots.
Int. J. Found. Comput. Sci., 2019

2018
On deterministic rendezvous at a node of agents with arbitrary velocities.
Inf. Process. Lett., 2018

Deterministic Treasure Hunt in the Plane with Angular Hints.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Byzantine Gathering in Polynomial Time.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Asynchronous Approach in the Plane: A Deterministic Polynomial Algorithm.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Impact of Knowledge on Election Time in Anonymous Networks.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

2016
Rendezvous in networks in spite of delay faults.
Distributed Comput., 2016

2015
Byzantine Gathering in Networks.
Proceedings of the Structural Information and Communication Complexity, 2015

2014
Price of asynchrony in mobile agents computing.
Theor. Comput. Sci., 2014

Fault-Tolerant Rendezvous in Networks.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
Deterministic geoleader election in disoriented anonymous systems.
Theor. Comput. Sci., 2013

Anonymous Meeting in Networks.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

How to meet asynchronously at polynomial cost.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Deterministic Polynomial Approach in the Plane.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
Self-stabilizing gathering with strong multiplicity detection.
Theor. Comput. Sci., 2012

Deterministic network exploration by a single agent with Byzantine tokens.
Inf. Process. Lett., 2012

Deterministic Leader Election Among Disoriented Anonymous Sensors
CoRR, 2012

Gathering despite mischief.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

COL: A data collection protocol for VANET.
Proceedings of the 2012 IEEE Intelligent Vehicles Symposium, 2012

Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Deterministic gathering of anonymous agents in arbitrary networks
CoRR, 2011

2010
Deterministic Robot-Network Localization is Hard.
IEEE Trans. Robotics, 2010

Leader Election Problem versus Pattern Formation Problem.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Brief announcement: leader election vs pattern formation.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2009
Scatter of Robots.
Parallel Process. Lett., 2009

Self-stabilizing Determinsitic Gathering
CoRR, 2009

Deaf, Dumb, and Chatting Robots, Enabling Distributed Computation and Fault-Tolerance Among Stigmergic Robot
CoRR, 2009

Brief announcement: deaf, dumb, and chatting robots.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Deaf, Dumb, and Chatting Asynchronous Robots.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

Self-stabilizing Deterministic Gathering.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

2008
Squaring the Circle with Weak Mobile Robots.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

On the solvability of the localization problem in robot networks.
Proceedings of the 2008 IEEE International Conference on Robotics and Automation, 2008

2007
Circle formation of weak robots and Lyndon words.
Inf. Process. Lett., 2007

Scatter of Weak Robots
CoRR, 2007

Swing Words to Make Circle Formation Quiescent.
Proceedings of the Structural Information and Communication Complexity, 2007

Deterministic Leader Election in Anonymous Sensor Networks Without Common Coordinated System.
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

Robots and Demons (The Code of the Origins).
Proceedings of the Fun with Algorithms, 4th International Conference, 2007

2006
Circle Formation of Weak Mobile Robots.
Proceedings of the Stabilization, 2006


  Loading...