Théo Pierron

ORCID

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 50

Top Venues

CoRR

Discret. Math.

IPEC

SIAM J. Discret. Math.

University of Bordeaux, France (PHD)

Education History

University of Bordeaux, France

PHD

Publications

Nicolas Bousquet, Quentin Deschamps, Lucas de Meyer, Théo Pierron
Square Coloring Planar Graphs with Automatic Discharging. SIAM J. Discret. Math. 38 (1) (2024)
Nicolas Bousquet, Théo Pierron, Alexandra Wesolek
A note on highly connected K2,-minor free graphs. Discret. Math. 347 (7) (2024)
Nicolas Bousquet, Linda Cook, Laurent Feuilloley, Théo Pierron, Sébastien Zeitoun
Local certification of forbidden subgraphs. CoRR (2024)
Théo Pierron
A Brooks-like result for graph powers. Eur. J. Comb. 117 (2024)
Julien Bensmail, Sandip Das, Soumen Nandi, Ayan Nandy, Théo Pierron, Swathy Prabhu, Sagnik Sen
Oriented total-coloring of oriented graphs. Discret. Math. 347 (12) (2024)
Guillaume Bagan, Nicolas Bousquet, Nacim Oijid, Théo Pierron
Fast winning strategies for the attacker in eternal domination. CoRR (2024)
Nicolas Bousquet, Lucas de Meyer, Théo Pierron, Alexandra Wesolek
Reconfiguration of Plane Trees in Convex Geometric Graphs. SoCG (2024)
Marthe Bonamy, Théo Pierron, Éric Sopena
Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$-choosable. J. Graph Theory 104 (1) (2023)
Nicolas Bousquet, Théo Pierron, Alexandra Wesolek
-minor free graphs. CoRR (2023)
Thomas Bellitto, Nicolas Bousquet, Adam Kabela, Théo Pierron
The smallest 5-chromatic tournament. Math. Comput. 93 (345) (2023)
Nicolas Bousquet, Lucas de Meyer, Théo Pierron, Alexandra Wesolek
Reconfiguration of plane trees in convex geometric graphs. CoRR (2023)
Nicolas Bousquet, Bastien Durain, Théo Pierron, Stéphan Thomassé
Extremal Independent Set Reconfiguration. CoRR (2023)
Nicolas Bousquet, Quentin Deschamps, Lucas de Meyer, Théo Pierron
Improved square coloring of planar graphs. Discret. Math. 346 (4) (2023)
Nicolas Bousquet, Valentin Gledel, Jonathan Narboni, Théo Pierron
A note on the flip distance between non-crossing spanning trees. CoRR (2023)
Quentin Deschamps, Carl Feghali, Frantisek Kardos, Clément Legrand-Duchesne, Théo Pierron
Strengthening a Theorem of Meyniel. SIAM J. Discret. Math. 37 (2) (2023)
Paul Bastide, Marthe Bonamy, Anthony Bonato, Pierre Charbit, Shahin Kamali, Théo Pierron, Mikaël Rabie
Improved Pyrotechnics: Closer to the Burning Number Conjecture. Electron. J. Comb. 30 (4) (2023)
Valentin Bartier, Nicolas Bousquet, Carl Feghali, Marc Heinrich, Benjamin Moore, Théo Pierron
Recoloring Planar Graphs of Girth at Least Five. SIAM J. Discret. Math. 37 (1) (2023)
Nicolas Bousquet, Valentin Gledel, Jonathan Narboni, Théo Pierron
A Note on the Flip Distance between Non-crossing Spanning Trees. Comput. Geom. Topol. 2 (1) (2023)
Nicolas Bousquet, Bastien Durain, Théo Pierron, Stéphan Thomassé
Extremal Independent Set Reconfiguration. Electron. J. Comb. 30 (3) (2023)
Adam Kabela, Daniel Král', Jonathan A. Noel, Théo Pierron
Density Maximizers of Layered Permutations. Electron. J. Comb. 29 (3) (2022)
Quentin Deschamps, Carl Feghali, Frantisek Kardos, Clément Legrand-Duchesne, Théo Pierron
Strengthening a theorem of Meyniel. CoRR (2022)
Gabriel Bathie, Nicolas Bousquet, Yixin Cao, Yuping Ke, Théo Pierron
(Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes. Algorithmica 84 (11) (2022)
Thomas Bellitto, Nicolas Bousquet, Adam Kabela, Théo Pierron
The smallest 5-chromatic tournament. CoRR (2022)
Laurent Feuilloley, Nicolas Bousquet, Théo Pierron
What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs. PODC (2022)
Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron
Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity. Algorithmica 84 (5) (2022)
Nicolas Bousquet, Lucas de Meyer, Quentin Deschamps, Théo Pierron
Square coloring planar graphs with automatic discharging. CoRR (2022)
Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Sagnik Sen, Éric Sopena
On the signed chromatic number of some classes of graphs. Discret. Math. 345 (2) (2022)
Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
What can be certified compactly? CoRR (2022)
Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
Local certification of MSO properties for bounded treedepth graphs. CoRR (2021)
Marthe Bonamy, Nicolas Bousquet, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma, Théo Pierron
-Free Graphs: An Almost Complete Dichotomy. Algorithmica 83 (3) (2021)
Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
Local Certification of Graph Decompositions and Applications to Minor-Free Classes. OPODIS (2021)
Gabriel Bathie, Nicolas Bousquet, Théo Pierron
(Sub)linear kernels for edge modification problems towards structured graph classes. CoRR (2021)
Julien Bensmail, Sandip Das, Soumen Nandi, Soumyajit Paul, Théo Pierron, Sagnik Sen, Éric Sopena
Pushable chromatic number of graphs with degree constraints. Discret. Math. 344 (1) (2021)
Valentin Bartier, Gabriel Bathie, Nicolas Bousquet, Marc Heinrich, Théo Pierron, Ulysse Prieto
PACE Solver Description: PaSTEC - PAths, Stars and Twins to Edit Towards Clusters. IPEC (2021)
Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
Local certification of graph decompositions and applications to minor-free classes. CoRR (2021)
Paul Bastide, Marthe Bonamy, Pierre Charbit, Théo Pierron, Mikaël Rabie
Improved pyrotechnics : Closer to the burning graph conjecture. CoRR (2021)
Valentin Bartier, Gabriel Bathie, Nicolas Bousquet, Marc Heinrich, Théo Pierron, Ulysse Prieto
PACE Solver Description: μSolver - Heuristic Track. IPEC (2021)
Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
Brief Announcement: Local Certification of Graph Decompositions and Applications to Minor-Free Classes. DISC (2021)
Gabriel Bathie, Nicolas Bousquet, Théo Pierron
(Sub)linear Kernels for Edge Modification Problems Towards Structured Graph Classes. IPEC (2021)
Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Sagnik Sen, Éric Sopena
On the signed chromatic number of some classes of graphs. CoRR (2020)
Ilkyoo Choi, Daniel W. Cranston, Théo Pierron
Degeneracy and Colorings of Squares of Planar Graphs without 4-Cycles. Comb. 40 (5) (2020)
François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron
Complexity of planar signed graph homomorphisms to cycles. Discret. Appl. Math. 284 (2020)
Marthe Bonamy, Théo Pierron, Éric Sopena
Every planar graph with Δ≥8 is totally (Δ+2)-choosable. CoRR (2019)
Hervé Hocquard, Seog-Jin Kim, Théo Pierron
Coloring squares of graphs with mad constraints. Discret. Appl. Math. 271 (2019)
Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron
Parameterized complexity of edge-coloured and signed graph homomorphism problems. CoRR (2019)
Julien Bensmail, Sandip Das, Soumen Nandi, Théo Pierron, Soumyajit Paul, Sagnik Sen, Éric Sopena
Pushable chromatic number of graphs with degree constraints. CoRR (2019)
François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron
Complexity of planar signed graph homomorphisms to cycles. CoRR (2019)
Théo Pierron
A Brooks-like result for graph powers. CoRR (2019)
Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron
Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems. IPEC (2019)
Théo Pierron, Thomas Place, Marc Zeitoun
Quantifier Alternation for Infinite Words. FoSSaCS (2016)
Théo Pierron, Thomas Place, Marc Zeitoun
Quantifier Alternation for Infinite Words. CoRR (2015)

Théo Pierron.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Théo Pierron