Every strong digraph has a spanning strong subgraph with at most n+2 alpha-2 arcs. - Stéphane Bessy; Stéphan Thomassé (J. Comb. Theory B, 2003)

Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs. - Stéphane Bessy; Stéphan Thomassé (IPCO, 2004)

The categorical product of two 5-chromatic digraphs can be 3-chromatic. - Stéphane Bessy; Stéphan Thomassé (Discret. Math., 2005)

Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree. - Stéphane Bessy; Frédéric Havet; Etienne Birmelé (J. Graph Theory, 2006)

Spanning a strong digraph by alpha circuits: A proof of Gallai's conjecture. - Stéphane Bessy; Stéphan Thomassé (Comb., 2007)

Two proofs of Bermond-Thomassen conjecture for regular tournaments. - Stéphane Bessy; Nicolas Lichiardopol; Jean-Sébastien Sereni (Electron. Notes Discret. Math., 2007)

Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdös condition approach. - Stéphane Bessy (Discret. Math., 2008)

Polynomial kernels for 3-leaf power graph modification problems. - Stéphane Bessy; Christophe Paul; Anthony Perez 001 (Discret. Appl. Math., 2010)

Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree. - Stéphane Bessy; Nicolas Lichiardopol; Jean-Sébastien Sereni (Discret. Math., 2010)

Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture. - Stéphane Bessy; Stéphan Thomassé (J. Comb. Theory B, 2010)

Optical index of fault tolerant routings in WDM networks. - Stéphane Bessy; Clément Lepelletier (Networks, 2010)

Kernels for feedback arc set in tournaments. - Stéphane Bessy; Fedor V. Fomin; Serge Gaspers; Christophe Paul; Anthony Perez 001; Saket Saurabh 001; Stéphan Thomassé (J. Comput. Syst. Sci., 2011)

Some problems in graph theory and graphs algorithmic theory. - Stéphane Bessy (2012)

Polynomial kernels for Proper Interval Completion and related problems. - Stéphane Bessy; Anthony Perez 001 (Inf. Comput., 2013)

Enumerating the edge-colourings and total colourings of a regular graph. - Stéphane Bessy; Frédéric Havet (J. Comb. Optim., 2013)

Disjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for Tournaments. - Jørgen Bang-Jensen; Stéphane Bessy; Stéphan Thomassé (J. Graph Theory, 2014)

(Arc-)disjoint flows in networks. - Jørgen Bang-Jensen; Stéphane Bessy (Theor. Comput. Sci., 2014)

On Independent Set on B1-EPG Graphs. - Marin Bougeret; Stéphane Bessy; Daniel Gonçalves 001; Christophe Paul (WAOA, 2015)

Two-floor buildings need eight colors. - Stéphane Bessy; Daniel Gonçalves 001; Jean-Sébastien Sereni (J. Graph Algorithms Appl., 2015)

Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles. - Jørgen Bang-Jensen; Stéphane Bessy (J. Graph Theory, 2015)

Exponential Domination in Subcubic Graphs. - Stéphane Bessy; Pascal Ochem; Dieter Rautenbach (Electron. J. Comb., 2016)

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

Burning a graph is hard. - Stéphane Bessy; Anthony Bonato; Jeannette C. M. Janssen; Dieter Rautenbach; Elham Roshanbin (Discret. Appl. Math., 2017)

Colorful paths for 3-chromatic graphs. - Stéphane Bessy; Nicolas Bousquet 001 (Discret. Math., 2017)

Bounds on the exponential domination number. - Stéphane Bessy; Pascal Ochem; Dieter Rautenbach (Discret. Math., 2017)

The Geodetic Hull Number is Hard for Chordal Graphs. - Stéphane Bessy; Mitre Costa Dourado; Lucia Draque Penso; Dieter Rautenbach (Electron. Notes Discret. Math., 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)

Extremal Values of the Chromatic Number for a Given Degree Sequence. - Stéphane Bessy; Dieter Rautenbach (Graphs Comb., 2017)

Antistrong digraphs. - Jørgen Bang-Jensen; Stéphane Bessy; Bill Jackson; Matthias Kriesell (J. Comb. Theory B, 2017)

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

Bounds on the burning number. - Stéphane Bessy; Anthony Bonato; Jeannette C. M. Janssen; Dieter Rautenbach; Elham Roshanbin (Discret. Appl. Math., 2018)

Out-degree reducing partitions of digraphs. - Jørgen Bang-Jensen; Stéphane Bessy; Frédéric Havet; Anders Yeo (Theor. Comput. Sci., 2018)

Width Parameterizations for Knot-Free Vertex Deletion on Digraphs. - Stéphane Bessy; Marin Bougeret; Alan Diêgo A. Carneiro; Fábio Protti; Uéverton S. Souza (IPEC, 2019)

Graphs with the second and third maximum Wiener index over the 2-vertex connected graphs. - Stéphane Bessy; François Dross; Martin Knor; Riste Skrekovski (CoRR, 2019)

Dynamic monopolies for interval graphs with bounded thresholds. - Stéphane Bessy; Stefan Ehard; Lucia Draque Penso; Dieter Rautenbach (Discret. Appl. Math., 2019)

Relating broadcast independence and independence. - Stéphane Bessy; Dieter Rautenbach (Discret. Math., 2019)

Bipartite spanning sub(di)graphs induced by 2-partitions. - Jørgen Bang-Jensen; Stéphane Bessy; Frédéric Havet; Anders Yeo (J. Graph Theory, 2019)

On the Kőnig?Egerváry theorem for k?paths. - Stéphane Bessy; Pascal Ochem; Dieter Rautenbach (J. Graph Theory, 2019)

Parameterized complexity of a coupled-task scheduling problem. - Stéphane Bessy; Rodolphe Giroudeau (J. Sched., 2019)

Degree-constrained 2-partitions of graphs. - Jørgen Bang-Jensen; Stéphane Bessy (Theor. Comput. Sci., 2019)

Maximal Wiener index for graphs with prescribed number of blocks. - Stéphane Bessy; François Dross; Katarína Hrináková; Martin Knor; Riste Skrekovski (Appl. Math. Comput., 2020)

Non-separating spanning trees and out-branchings in digraphsof independence number 2. - Jørgen Bang-Jensen; Stéphane Bessy; Anders Yeo (CoRR, 2020)

On independent set in B1-EPG graphs. - Stéphane Bessy; Marin Bougeret; Steven Chaplick; Daniel Gonçalves 001; Christophe Paul (Discret. Appl. Math., 2020)

Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs. - Stéphane Bessy; François Dross; Martin Knor; Riste Skrekovski (Discret. Appl. Math., 2020)

The structure of graphs with given number of blocks and the maximum Wiener index. - Stéphane Bessy; François Dross; Katarína Hrináková; Martin Knor; Riste Skrekovski (J. Comb. Optim., 2020)

Out-colourings of digraphs. - Noga Alon; Jørgen Bang-Jensen; Stéphane Bessy (J. Graph Theory, 2020)

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)

Exponential independence in subcubic graphs. - Stéphane Bessy; Johannes Pardey; Dieter Rautenbach (Discret. Math., 2021)

Good orientations of unions of edge-disjoint spanning trees. - Jørgen Bang-Jensen; Stéphane Bessy; Jing Huang 007; Matthias Kriesell (J. Graph Theory, 2021)

Factorially Many Maximum Matchings Close to the Erdős-Gallai Bound. - Stéphane Bessy; Johannes Pardey; Lucas Picasarri-Arrieta; Dieter Rautenbach (Electron. J. Comb., 2022)

Algorithmic aspects of broadcast independence. - Stéphane Bessy; Dieter Rautenbach (Discret. Appl. Math., 2022)

Non-separating Spanning Trees and Out-Branchings in Digraphs of Independence Number 2. - Jørgen Bang-Jensen; Stéphane Bessy; Anders Yeo (Graphs Comb., 2022)

Arc-disjoint in- and out-branchings in digraphs of independence number at most 2. - Jørgen Bang-Jensen; Stéphane Bessy; Frédéric Havet; Anders Yeo (J. Graph Theory, 2022)

Complexity of some arc-partition problems for digraphs. - Jørgen Bang-Jensen; Stéphane Bessy; Daniel Gonçalves 001; Lucas Picasarri-Arrieta (Theor. Comput. Sci., 2022)

Kernelization for Graph Packing Problems via Rainbow Matching. - Stéphane Bessy; Marin Bougeret; Dimitrios M. Thilikos; Sebastian Wiederrecht (SODA, 2023)

Unbalanced Spanning Subgraphs in Edge Labeled Complete Graphs. - Stéphane Bessy; Johannes Pardey; Lucas Picasarri-Arrieta; Dieter Rautenbach (Electron. J. Comb., 2023)

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

Temporalizing Digraphs via Linear-Size Balanced Bi-Trees. - Stéphane Bessy; Stéphan Thomassé; Laurent Viennot (STACS, 2024)

Oriented Trees in $O(k sqrt{k})$-Chromatic Digraphs, a Subquadratic Bound for Burr's Conjecture. - Stéphane Bessy; Daniel Gonçalves 001; Amadeus Reinald (WG, 2024)

Oriented trees in O(k √k)-chromatic digraphs, a subquadratic bound for Burr's conjecture. - Stéphane Bessy; Daniel Gonçalves 001; Amadeus Reinald (CoRR, 2024)

FPT algorithms for packing k-safe spanning rooted sub(di)graphs. - Stéphane Bessy; Florian Hörsch; Ana Karolinna Maia; Dieter Rautenbach; Ignasi Sau (Discret. Appl. Math., 2024)

Constrained flows in networks. - Jørgen Bang-Jensen; Stéphane Bessy; Lucas Picasarri-Arrieta (Theor. Comput. Sci., 2024)

Sparse Vertex Cutsets and the Maximum Degree. - Stéphane Bessy; Johannes Rauch; Dieter Rautenbach; Uéverton S. Souza (Electron. J. Comb., 2025)

Dichromatic number of chordal graphs. - Stéphane Bessy; Frédéric Havet; Lucas Picasarri-Arrieta (Graphs Comb., 2025)