Jocelyn Thiebaut

According to our database, Jocelyn Thiebaut authored at least 10 papers between 2017 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Complementary cycles of any length in regular bipartite tournaments.

Stéphane Bessy, Jocelyn Thiebaut

J. Graph Theory, June, 2023

Degreewidth: A New Parameter for Solving Problems on Tournaments.

Tom Davot, Lucas Isenmann, Sanjukta Roy, Jocelyn Thiebaut

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

2021

Packing Arc-Disjoint Cycles in Tournaments.

Stéphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi

Algorithmica, 2021

On the Approximation Hardness of Geodetic Set and Its Variants.

Tom Davot, Lucas Isenmann, Jocelyn Thiebaut

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020

Avoidable Paths in Graphs.

Marthe Bonamy, Oscar Defrain, Meike Hatzel, Jocelyn Thiebaut

Electron. J. Comb., 2020

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

2019

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

PhD thesis, 2019

2018

(Arc-disjoint) cycle packing in tournament: classical and parameterized complexity.

Stéphane Bessy, Marin Bougeret, Jocelyn Thiebaut

CoRR, 2018

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

Triangle Packing in (Sparse) Tournaments: Approximation and Kernelization.

Stéphane Bessy, Marin Bougeret, Jocelyn Thiebaut

Proceedings of the 25th Annual European Symposium on Algorithms, 2017