Quantifier Alternation for Infinite Words. - Théo Pierron; Thomas Place; Marc Zeitoun (FoSSaCS, 2016)

Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems. - Florent Foucaud; Hervé Hocquard; Dimitri Lajou; Valia Mitsou; Théo Pierron (IPEC, 2019)

Every planar graph with Δ≥8 is totally (Δ+2)-choosable. - Marthe Bonamy; Théo Pierron; Éric Sopena (CoRR, 2019)

Coloring squares of graphs with mad constraints. - Hervé Hocquard; Seog-Jin Kim; Théo Pierron (Discret. Appl. Math., 2019)

Induction Schemes : From Language Separation to Graph Colorings. (Schémas d'induction : from languages separation to graph colorings). - Théo Pierron (2019)

Degeneracy and Colorings of Squares of Planar Graphs without 4-Cycles. - Ilkyoo Choi; Daniel W. Cranston; Théo Pierron (Comb., 2020)

Complexity of planar signed graph homomorphisms to cycles. - François Dross; Florent Foucaud; Valia Mitsou; Pascal Ochem; Théo Pierron (Discret. Appl. Math., 2020)

PACE Solver Description: PaSTEC - PAths, Stars and Twins to Edit Towards Clusters. - Valentin Bartier; Gabriel Bathie; Nicolas Bousquet 001; Marc Heinrich; Théo Pierron; Ulysse Prieto (IPEC, 2021)

PACE Solver Description: μSolver - Heuristic Track. - Valentin Bartier; Gabriel Bathie; Nicolas Bousquet 001; Marc Heinrich; Théo Pierron; Ulysse Prieto (IPEC, 2021)

(Sub)linear Kernels for Edge Modification Problems Towards Structured Graph Classes. - Gabriel Bathie; Nicolas Bousquet 001; Théo Pierron (IPEC, 2021)

Brief Announcement: Local Certification of Graph Decompositions and Applications to Minor-Free Classes. - Nicolas Bousquet 001; Laurent Feuilloley; Théo Pierron (DISC, 2021)

Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy. - Marthe Bonamy; Nicolas Bousquet 001; Konrad K. Dabrowski; Matthew Johnson 002; Daniël Paulusma; Théo Pierron (Algorithmica, 2021)

Local certification of MSO properties for bounded treedepth graphs. - Nicolas Bousquet 001; Laurent Feuilloley; Théo Pierron (CoRR, 2021)

Improved pyrotechnics : Closer to the burning graph conjecture. - Paul Bastide 002; Marthe Bonamy; Pierre Charbit; Théo Pierron; Mikaël Rabie (CoRR, 2021)

Pushable chromatic number of graphs with degree constraints. - Julien Bensmail; Sandip Das 001; Soumen Nandi; Soumyajit Paul; Théo Pierron; Sagnik Sen 001; Éric Sopena (Discret. Math., 2021)

What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs. - Laurent Feuilloley; Nicolas Bousquet 001; Théo Pierron (PODC, 2022)

(Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes. - Gabriel Bathie; Nicolas Bousquet 001; Yixin Cao 001; Yuping Ke; Théo Pierron (Algorithmica, 2022)

Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity. - Florent Foucaud; Hervé Hocquard; Dimitri Lajou; Valia Mitsou; Théo Pierron (Algorithmica, 2022)

Density Maximizers of Layered Permutations. - Adam Kabela; Daniel Král'; Jonathan A. Noel; Théo Pierron (Electron. J. Comb., 2022)

What can be certified compactly? - Nicolas Bousquet 001; Laurent Feuilloley; Théo Pierron (CoRR, 2022)

On the signed chromatic number of some classes of graphs. - Julien Bensmail; Sandip Das 001; Soumen Nandi; Théo Pierron; Sagnik Sen 001; Éric Sopena (Discret. Math., 2022)

A Note on the Flip Distance between Non-crossing Spanning Trees. - Nicolas Bousquet 001; Valentin Gledel; Jonathan Narboni; Théo Pierron (Comput. Geom. Topol., 2023)

Improved Pyrotechnics: Closer to the Burning Number Conjecture. - Paul Bastide 002; Marthe Bonamy; Anthony Bonato; Pierre Charbit; Shahin Kamali; Théo Pierron; Mikaël Rabie (Electron. J. Comb., 2023)

Extremal Independent Set Reconfiguration. - Nicolas Bousquet 001; Bastien Durain; Théo Pierron; Stéphan Thomassé (Electron. J. Comb., 2023)

A note on highly connected K2, 𝓁-minor free graphs. - Nicolas Bousquet 001; Théo Pierron; Alexandra Wesolek (CoRR, 2023)

Recoloring Planar Graphs of Girth at Least Five. - Valentin Bartier; Nicolas Bousquet 001; Carl Feghali; Marc Heinrich; Benjamin Moore; Théo Pierron (SIAM J. Discret. Math., 2023)

Improved square coloring of planar graphs. - Nicolas Bousquet 001; Quentin Deschamps; Lucas de Meyer; Théo Pierron (Discret. Math., 2023)

Strengthening a Theorem of Meyniel. - Quentin Deschamps; Carl Feghali; Frantisek Kardos; Clément Legrand-Duchesne; Théo Pierron (SIAM J. Discret. Math., 2023)

The smallest 5-chromatic tournament. - Thomas Bellitto; Nicolas Bousquet 001; Adam Kabela; Théo Pierron (Math. Comput., 2023)

Every planar graph with Δ ${ rm{ Delta }}$ ⩾ 8 is totally (Δ+2) $({ rm{ Delta }}+2)$-choosable. - Marthe Bonamy; Théo Pierron; Éric Sopena (J. Graph Theory, 2023)

Reconfiguration of Plane Trees in Convex Geometric Graphs. - Nicolas Bousquet 001; Lucas de Meyer; Théo Pierron; Alexandra Wesolek (SoCG, 2024)

How Local Constraints Influence Network Diameter and Applications to LCL Generalizations. - Nicolas Bousquet 001; Laurent Feuilloley; Théo Pierron (OPODIS, 2024)

Fast Winning Strategies for the Attacker in Eternal Domination. - Guillaume Bagan; Nicolas Bousquet 001; Nacim Oijid; Théo Pierron (WG, 2024)

Local certification of forbidden subgraphs. - Nicolas Bousquet 001; Linda Cook; Laurent Feuilloley; Théo Pierron; Sébastien Zeitoun (CoRR, 2024)

Oriented total-coloring of oriented graphs. - Julien Bensmail; Sandip Das 001; Soumen Nandi; Ayan Nandy; Théo Pierron; Swathy Prabhu; Sagnik Sen 001 (Discret. Math., 2024)

A note on highly connected K2,-minor free graphs. - Nicolas Bousquet 001; Théo Pierron; Alexandra Wesolek (Discret. Math., 2024)

Local certification of graph decompositions and applications to minor-free classes. - Nicolas Bousquet 001; Laurent Feuilloley; Théo Pierron (J. Parallel Distributed Comput., 2024)

A Brooks-like result for graph powers. - Théo Pierron (Eur. J. Comb., 2024)

Square Coloring Planar Graphs with Automatic Discharging. - Nicolas Bousquet 001; Quentin Deschamps; Lucas de Meyer; Théo Pierron (SIAM J. Discret. Math., 2024)

4-tangrams are 4-avoidable. - Pascal Ochem; Théo Pierron (Discret. Math. Theor. Comput. Sci., 2025)

Determining a graph from its reconfiguration graph. - Gaétan Berthe; Caroline Brosse; Brian Hearn; Jan van den Heuvel; Pierre Hoppenot; Théo Pierron (CoRR, 2025)

The tape reconfiguration problem and its consequences for dominating set reconfiguration. - Nicolas Bousquet 001; Quentin Deschamps; Arnaud Mary; Amer E. Mouawad; Théo Pierron (CoRR, 2025)