Jonas Sénizergues

Current Situation: I'm currently searching for a postdoc (if you happen to search for a postdoc candidate in a field close to my reserach interest, I could be interested !) or a permanent position (Holy grail !). I am interested in graph related topics, distributed computing and game theory, and more broadly about combinatorics. I mainly study, at the moment: Colored graph algorithmic problems (i.e. problems whose input is a graph with colors either on the vertices or the edges, not necessarily a proper coloration) Low-memory Distributed Algorithms robust to both transient and byzantine faults Combinatorial games (more specifically : positional games, which are games played on hypergraphs)

Publications: In Journals: Formalization of Shannon's Theorems, Reynald Affeldt, Manabu Hagiwara, Jonas Sénizergues, Journal of Automated Reasoning, Volume 53, 2014. Conference proceedings: Maker-Maker games of rank 4 are PSPACE-complete, Florian Galliot, Jonas Sénizergues, STACS 2026 (also on HAL). A unified convention for achievement positional games, Florian Galliot, Jonas Sénizergues, EUROCOMB 2025 (slides, original submission on HAL). Making Self-Stabilizing Algorithms for Any Locally Greedy Problem, Johanne Cohen, Laurence Pilard, Mikaël Rabie, Jonas Sénizergues, SAND 2023 (open access here). Self-stabilization and Byzantine Tolerance for Maximal Independent Set, Johanne Cohen, Laurence Pilard, Jonas Sénizergues, SSS 2021 (also on ArXiv). Software library: A Coq formalization of information theory and linear error correcting codes, Reynald Affeldt, Manabu Hagiwara, Jonas Sénizergues, Jacques Garrigue, Kazuhiko Sakaguchi, Taku Asai, Takafumi Saikawa, Naruomi Obata, Alessandro Bruni, 2019, accessible on github). Preprint: A two-player version of the assignment problem, Florian Galliot, Nacim Oijid, Jonas Sénizergues, submitted to IWOCA 2026 (also on HAL). Minimum colored Maximum Matchings in vertex-colored Graphs, Johanne Cohen, Yannis Manoussakis, Jonas Sénizergues, to be submitted (also on HAL). Self-stabilization and Byzantine tolerance for Maximal Independent Set (Journal ver.),Johanne Cohen, Laurence Pillard, François Pirot, Jonas Sénizergues, to be submitted (also on ArXiv). Autostabilizing Minimal Clique Decomposition with Byzantine Faults tolerance, Johanne Cohen, Laurence Pillard, Jonas Sénizergues, to be submitted (also on HAL). You may also be looking for my PhD thesis.