Decomposing 8-regular graphs into paths of length 4. - Fábio Botler; Alexandre Talon (Discret. Math., 2017)

Decomposition of 8-regular graphs into paths of length 4. - Fábio Botler; Alexandre Talon (Electron. Notes Discret. Math., 2017)

Old and new results on packing arborescences in directed hypergraphs. - Quentin Fortier; Csaba Király 001; Marion Léonard; Zoltán Szigeti; Alexandre Talon (Discret. Appl. Math., 2018)

Completion of the mixed unit interval graphs hierarchy. - Alexandre Talon; Jan Kratochvíl (J. Graph Theory, 2018)

The 2-domination and Roman domination numbers of grid graphs. - Michaël Rao; Alexandre Talon (Discret. Math. Theor. Comput. Sci., 2019)

Intensive use of computing resources for dominations in grids and other combinatorial problems. (Utilisation intensive de l'ordinateur : dominations dans les grilles et autres problèmes combinatoires). - Alexandre Talon (2019)

Intensive use of computing resources for dominations in grids and other combinatorial problems. - Alexandre Talon (CoRR, 2020)

Asymptotic growth rate of square grids dominating sets: A symbolic dynamics approach. - Silvère Gangloff; Alexandre Talon (Theor. Comput. Sci., 2020)

At the Bottom of Binary Analysis: Instructions. - Guillaume Bonfante; Alexandre Talon (FPS, 2021)

Partitioning into degenerate graphs in linear time. - Timothée Corsini; Quentin Deschamps; Carl Feghali; Daniel Gonçalves; Hélène Langlois; Alexandre Talon (Eur. J. Comb., 2023)

Partitioning 2-edge-coloured bipartite graphs into monochromatic cycles. - Fabrício Siqueira Benevides; Arthur Lima Quintino; Alexandre Talon (Eur. J. Comb., 2025)

Highly irregular graph decompositions. - Julien Bensmail; Malory Marin; Leandro Montero; Alexandre Talon (Theor. Comput. Sci., 2025)