Théo Pierron

tpierron@liris.cnrs.fr
Office 12.016

LIRIS, Université Claude Bernard Lyon 1
Bâtiment Nautibus
43, bd du 11 novembre 1918
69622 VILLEURBANNE CEDEX

I am associate professor (Maître de conférences) at LIRIS. My work involves graph theory, especially graph coloring and algorithmics. I am also interested in most areas of discrete mathematics.

I did my Ph.D. at University of Bordeaux and LaBRI under the supervision of Marthe Bonamy, Éric Sopena and Marc Zeitoun. I was part of the LaBRI team “Formal Methods” and the group “Graphs and Optimisation” of the “Combinatorics and Algorithmics” team. The manuscript and slides are available here and there. I defended on July 8th, 2019. Then, I was postdoc with Dan Král' at DIMEA (Masaryk University) in Brno.

Publications

Articles

• N. Bousquet, L. de Meyer, T. Pierron, A. Wesolek, Reconfiguration of plane trees in convex geometric graphs.
• N. Bousquet, T. Pierron, A. Wesolek, A note on highly connected K_2,l-minor free graphs.
• P. Bastide, M. Bonamy, A. Bonato, P. Charbit, S. Kamali, T. Pierron, M. Rabie, Improved pyrotechnics: Closer to the burning graph conjecture.
• N. Bousquet, L. Feuilloley, T. Pierron, What can be certified compactly?, accepted at PODC'22.
• N. Bousquet, V. Gledel, J. Narboni, T. Pierron A Note on the flip distance between non-crossing spanning trees, accepted in Computing in Geometry and Topology.
• N. Bousquet, B. Durain, T. Pierron, S. Thomassé Extremal Independent Set Reconfiguration, accepted in Electronic Journal of Combinatorics.
• L. de Meyer, Q. Deschamps, N. Bousquet, T. Pierron, Square coloring planar graphs with automatic discharging, accepted in SIAM Journal on Discrete Mathematics.
• T. Bellitto, N. Bousquet, A. Kabela, T. Pierron The smallest 5-chromatic tournament, accepted in Mathematics of Computation.
• Q. Deschamps, C. Feghali, F. Kardoš, C. Legrand-Duchesne, T. Pierron, A strengthening of a theorem of Meyniel, accepted in SIAM Journal of Discrete Mathematics.
• V. Bartier, N. Bousquet, C. Feghali, M. Heinrich, B. Moore, T. Pierron, Recolouring planar graphs of girth at least five, accepted in SIAM Journal of Discrete Mathematics.
• N. Bousquet, Q. Deschamps, L. de Meyer, T. Pierron, Improved square coloring of planar graphs, accepted in Discrete Mathematics.
• A. Kabela, D. Král', J. Noel, T. Pierron, Density maximizers of layered permutations, accepted in Electronic Journal of Combinatorics.
• G. Bathie, N. Bousquet, Y. Cao, Y. Ke, T. Pierron, (Sub)linear kernels for edge modification problems towards structured graph classes, accepted in Algorithmica.
• N. Bousquet, L. Feuilloley, T. Pierron, Local certification of graph decompositions and applications to minor-free classes, OPODIS'21 and « brief announcement » at DISC'21.
• M. Bonamy, T. Pierron, É. Sopena, Every planar graph is totally max(Delta+2,10)-choosable, accepted in Journal of Graph Theory.
• J. Bensmail, S. Das, S. Nandi, T. Pierron, S. Sen, É. Sopena, On the signed chromatic number of some classes of graphs, accepted in Discrete Mathematics.
• J. W. Cooper, A. Kabela, D. Král, T. Pierron, Hadwiger meets Cayley accepted at CSGT'20.
• T. Pierron, A Brooks-like result for graph powers, accepted at Eurocomb'19 and in European Journal of Combinatorics.
• J. Bensmail, S. Das, S. Nandi, S. Paul, T. Pierron, S. Sen, É. Sopena, Pushable chromatic number of graphs with degree constraints, accepted in Discrete Mathematics.
• M. Bonamy, N. Bousquet, K. K. Dabrowski, M. Johnson, D. Paulusma, T. Pierron, Graph Isomorphism for (H1,H2)-free Graphs: An Almost Complete Dichotomy, accepted in Algorithmica.
• F. Dross, F. Foucaud, V. Mitsou, P. Ochem, T. Pierron, Complexity of planar signed graph homomorphisms to cycles, accepted in Discrete Applied Mathematics.
• F. Foucaud, H. Hocquard, D. Lajou, V. Mitsou, T. Pierron, Parameterized complexity of edge-coloured and signed graph homomorphism problems, accepted at IPEC'19.
• H. Hocquard, S. Kim, T. Pierron, Coloring squares of graphs with mad constraints, accepted in Discrete Applied Mathematics.
• I. Choi, D. Cranston, T. Pierron, Degeneracy and Colorings of Squares of Planar Graphs without 4-Cycles, accepted in Combinatorica.
• T. Pierron, T. Place, M. Zeitoun, Quantifier Alternation for Infinite Words, accepted at FoSSaCS'16.
• T. Pierron, R.J. Shank, Rings of invariants for the three dimensional modular representations of elementary abelian $p$-groups of rank four, published in Involve.

Books

• P. Le Barbenchon, D. Lesesvre, P. Montagnon, T. Pierron, 131 développements pour l'oral, Dunod, 2020.

Attended events

• Journées Graphes et Algorithmes, Paris, November 2022.
• ICGT'22, Montpellier, July 2022.
• Meeting of ANR GrR, Lyon, June 2022.
• Meeting of ANR Hosigra, Fréjus, France, June 2022.
• School on Graph Theory, Murol, France, June 2022.
• Banff Workshop on Combinatorial Reconfiguration, Banff, Canada, May 2022.
• Meeting of ANR P-GASE, Lyon, February 2022.
• OPODIS'21, Strasbourg, December 13-15, 2021.
• Metric Graph Theory, Marseille, December 6-10, 2021.
• Journées Graphes et Algorithmes, online, November 2021.
• Journées Graphes et Algorithmes, online, November 2020.
• Czech-Slovak conference on Graph Theory, Brno, Czech Republic, August 17-20, 2020.
• Journées Graphes et Algorithmes, Brussels, Belgium, November 13-15, 2019.
• Bordeaux Graph Workshop, Bordeaux, France, October 28-31, 2019.
• Eurocomb'19, Bratislava, Slovakia, August 26-30, 2019.
• Meeting of ANR Hosigra, Sète, France, April 1-5, 2019.
• JGA 2018, Grenoble, France, November 14-16, 2018.
• C&C 2018, High Tatras, Slovakia, September 3-7, 2018.
• ICGT 2018, Lyon, France, July 9-13, 2018.
• SGT 2018, Sète, France, June 11-15, 2018.
• SIAM DM'18, Denver, USA, June 4-8, 2018.
• Meeting of ANR Hosigra, Bordeaux, France, March 28-30, 2018.
• JGA 2017, Bordeaux, France, November 15-17, 2017.
• Meeting of ANR Delta, Porquerolles, France, October 17-20, 2017
• EJCIM 2017, Lyon, France, January 23-27, 2017.
• Meeting of ANR Delta, Bordeaux, France, February 9-10, 2017.
• FoSSaCS 2016, Eindhoven, The Netherlands, April 2-8, 2016.