| 2026 | ICALP | Plane Strong Connectivity Augmentation. | Stphane Bessy, Daniel Gonalves, Amadeus Reinald, Dimitrios M. Thilikos |
| 2024 | STACS | Temporalizing Digraphs via Linear-Size Balanced Bi-Trees. | Stphane Bessy, Stphan Thomass, Laurent Viennot |
| 2024 | WG | Oriented Trees in $O(k \sqrt{k})$-Chromatic Digraphs, a Subquadratic Bound for Burr's Conjecture. | Stphane Bessy, Daniel Gonalves, Amadeus Reinald |
| 2023 | SODA | Kernelization for Graph Packing Problems via Rainbow Matching. | Stphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht |
| 2019 | MFCS | Packing Arc-Disjoint Cycles in Tournaments. | Stphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi |
| 2017 | ESA | Triangle Packing in (Sparse) Tournaments: Approximation and Kernelization. | Stphane Bessy, Marin Bougeret, Jocelyn Thiebaut |
| 2015 | WAOA | On Independent Set on B1-EPG Graphs. | Marin Bougeret, Stphane Bessy, Daniel Gonalves, Christophe Paul |
| 2011 | FCT | Polynomial Kernels for Proper Interval Completion and Related Problems. | Stphane Bessy, Anthony Perez |
| 2009 | IWOCA | Polynomial Kernels for 3-Leaf Power Graph Modification Problems. | Stphane Bessy, Christophe Paul, Anthony Perez |
| 2004 | IPCO | Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs. | Stphane Bessy, Stphan Thomass |