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 noncrossing 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 5chromatic tournament, accepted in Mathematics of Computation.
 Q. Deschamps, C. Feghali, F. Kardoš, C. LegrandDuchesne, 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 minorfree 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 Brookslike 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 edgecoloured 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 4Cycles, 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

