I am a third-year Ph.D. student at IRIF, Universite Paris Cite, working with Pierre Fraigniaud and Mikael Rabie. Before, I got my Master from the Parisian master program of research in computer science MPRI, and my Bachelor in Mathematics from Hanoi National University of Education. This is my CV.

Research Interest

My current research interest is on distributed network computing and dynamic graphs. Specifically, I work on complexity of distributed agreement tasks using tools from combinatorial topology. I am also working on dynamic graphs including forbidden patterns, coloring, and Cannadian Traveller Problem.

Publications

1. Canadian Traveler Problems in temporal graphs, WG2025. Arxiv
2. Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structure, STACS2025. Arxiv
3. A Simple Lower Bound for Set Agreement in Dynamic Networks, SOSA2025. Arxiv
4. Forbidden Patterns in temporal graphs resulting from encounters in a corridor, SSS2023. Arxiv