Triangle Packing in (Sparse) Tournaments: Approximation and Kernelization. - Stéphane Bessy; Marin Bougeret; Jocelyn Thiebaut (ESA, 2017)

Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang Conjecture. - Stéphane Bessy; Jocelyn Thiebaut (Electron. Notes Discret. Math., 2017)

(Arc-disjoint) cycle packing in tournament: classical and parameterized complexity. - Stéphane Bessy; Marin Bougeret; Jocelyn Thiebaut (CoRR, 2018)

Algorithmic and structural results on directed cycles in dense digraphs. (Résultats algorithmiques et structurels sur les cycles orientés dans les digraphes denses). - Jocelyn Thiebaut (2019)

On the Distance Identifying Set Meta-problem and Applications to the Complexity of Identifying Problems on Graphs. - Florian Barbero; Lucas Isenmann; Jocelyn Thiebaut (Algorithmica, 2020)

Avoidable Paths in Graphs. - Marthe Bonamy; Oscar Defrain; Meike Hatzel; Jocelyn Thiebaut (Electron. J. Comb., 2020)

On the Approximation Hardness of Geodetic Set and Its Variants. - Tom Davot; Lucas Isenmann; Jocelyn Thiebaut (COCOON, 2021)

Packing Arc-Disjoint Cycles in Tournaments. - Stéphane Bessy; Marin Bougeret; R. Krithika 001; Abhishek Sahu; Saket Saurabh 001; Jocelyn Thiebaut; Meirav Zehavi (Algorithmica, 2021)

Degreewidth: A New Parameter for Solving Problems on Tournaments. - Tom Davot; Lucas Isenmann; Sanjukta Roy 001; Jocelyn Thiebaut (WG, 2023)

Complementary cycles of any length in regular bipartite tournaments. - Stéphane Bessy; Jocelyn Thiebaut (J. Graph Theory, 2023)