Følg
Théo Pierron
Théo Pierron
Verifisert e-postadresse på univ-lyon1.fr - Startside
Tittel
Sitert av
Sitert av
År
Local certification of graph decompositions and applications to minor-free classes
N Bousquet, L Feuilloley, T Pierron
arXiv preprint arXiv:2108.00059, 2021
212021
What can be certified compactly? compact local certification of MSO properties in tree-like graphs
L Feuilloley, N Bousquet, T Pierron
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing …, 2022
122022
Improved square coloring of planar graphs
N Bousquet, Q Deschamps, L de Meyer, T Pierron
Discrete Mathematics 346 (4), 113288, 2023
92023
Pushable chromatic number of graphs with degree constraints
J Bensmail, S Das, S Nandi, S Paul, T Pierron, S Sen, E Sopena
Discrete Mathematics 344 (1), 112151, 2021
92021
Square coloring planar graphs with automatic discharging
N Bousquet, Q Deschamps, L De Meyer, T Pierron
SIAM Journal on Discrete Mathematics 38 (1), 504-528, 2024
82024
Recoloring planar graphs of girth at least five
V Bartier, N Bousquet, C Feghali, M Heinrich, B Moore, T Pierron
SIAM Journal on Discrete Mathematics 37 (1), 332-350, 2023
72023
Improved pyrotechnics: Closer to the burning graph conjecture
P Bastide, M Bonamy, A Bonato, P Charbit, S Kamali, T Pierron, M Rabie
arXiv preprint arXiv:2110.10530, 2021
72021
Degeneracy and colorings of squares of planar graphs without 4-cycles
I Choi, DW Cranston, T Pierron
Combinatorica 40 (5), 625-653, 2020
7*2020
Complexity of planar signed graph homomorphisms to cycles
F Dross, F Foucaud, V Mitsou, P Ochem, T Pierron
Discrete Applied Mathematics 284, 166-178, 2020
62020
Graph Isomorphism for -Free Graphs: An Almost Complete Dichotomy
M Bonamy, N Bousquet, KK Dabrowski, M Johnson, D Paulusma, ...
Algorithmica, 1-31, 2020
62020
A Brooks-like result for graph powers
T Pierron
arXiv preprint arXiv:1912.11181, 2019
62019
Every planar graph with is totally -choosable
M Bonamy, T Pierron, É Sopena
arXiv preprint arXiv:1904.12060, 2019
6*2019
Quantifier alternation for infinite words
T Pierron, T Place, M Zeitoun
International Conference on Foundations of Software Science and Computation …, 2016
62016
On the signed chromatic number of some classes of graphs
J Bensmail, S Das, S Nandi, T Pierron, S Sen, E Sopena
Discrete Mathematics 345 (2), 112664, 2022
52022
Coloring squares of graphs with mad constraints
H Hocquard, SJ Kim, T Pierron
Discrete Applied Mathematics 271, 64-73, 2019
52019
What can be certified compactly?
N Bousquet, L Feuilloley, T Pierron
arXiv preprint arXiv:2202.06065, 2022
42022
Local certification of MSO properties for bounded treedepth graphs
N Bousquet, L Feuilloley, T Pierron
arXiv preprint arXiv:2110.01936, 2021
42021
The smallest 5-chromatic tournament
T Bellitto, N Bousquet, A Kabela, T Pierron
Mathematics of Computation 93 (345), 443-458, 2024
32024
Strengthening a theorem of Meyniel
Q Deschamps, C Feghali, F Kardoš, C Legrand-Duchesne, T Pierron
SIAM Journal on Discrete Mathematics 37 (2), 604-611, 2023
32023
PACE solver description: µsolver-heuristic track
V Bartier, G Bathie, N Bousquet, M Heinrich, T Pierron, U Prieto
16th International Symposium on Parameterized and Exact Computation (IPEC 2021), 2021
32021
Systemet kan ikke utføre handlingen. Prøv på nytt senere.
Artikler 1–20