Stéphane Bessy

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 58

Top Topics

Packing Problem

Parameterized Complexity

Algorithmic Aspects

Top Venues

J. Graph Theory

Discret. Appl. Math.

Theor. Comput. Sci.

Publications

Stéphane Bessy, Daniel Gonçalves, Amadeus Reinald
Oriented trees in O(k √k)-chromatic digraphs, a subquadratic bound for Burr's conjecture. CoRR (2024)
Stéphane Bessy, Florian Hörsch, Ana Karolinna Maia, Dieter Rautenbach, Ignasi Sau
FPT algorithms for packing k-safe spanning rooted sub(di)graphs. Discret. Appl. Math. 346 (2024)
Jørgen Bang-Jensen, Stéphane Bessy, Lucas Picasarri-Arrieta
Constrained flows in networks. Theor. Comput. Sci. 1010 (2024)
Stéphane Bessy, Stéphan Thomassé, Laurent Viennot
Temporalizing Digraphs via Linear-Size Balanced Bi-Trees. STACS (2024)
Stéphane Bessy, Johannes Pardey, Lucas Picasarri-Arrieta, Dieter Rautenbach
Unbalanced Spanning Subgraphs in Edge Labeled Complete Graphs. Electron. J. Comb. 30 (1) (2023)
Stéphane Bessy, Jocelyn Thiebaut
Complementary cycles of any length in regular bipartite tournaments. J. Graph Theory 103 (2) (2023)
Stéphane Bessy, Jørgen Bang-Jensen, Lucas Picasarri-Arrieta
Constrained Flows in Networks. CoRR (2023)
Stéphane Bessy, Stéphan Thomassé, Laurent Viennot
Temporalizing digraphs via linear-size balanced bi-trees. CoRR (2023)
Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht
Kernelization for Graph Packing Problems via Rainbow Matching. SODA (2023)
Stéphane Bessy, Frédéric Havet, Lucas Picasarri-Arrieta
Dichromatic number of chordal graphs. CoRR (2023)
Jørgen Bang-Jensen, Stéphane Bessy, Daniel Gonçalves, Lucas Picasarri-Arrieta
Complexity of some arc-partition problems for digraphs. Theor. Comput. Sci. 928 (2022)
Stéphane Bessy, Dieter Rautenbach
Algorithmic aspects of broadcast independence. Discret. Appl. Math. 314 (2022)
Stéphane Bessy, Johannes Pardey, Lucas Picasarri-Arrieta, Dieter Rautenbach
Factorially Many Maximum Matchings Close to the Erdős-Gallai Bound. Electron. J. Comb. 29 (2) (2022)
Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht
Kernelization for Graph Packing Problems via Rainbow Matching. CoRR (2022)
Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
Arc-disjoint in- and out-branchings in digraphs of independence number at most 2. J. Graph Theory 100 (2) (2022)
Jørgen Bang-Jensen, Stéphane Bessy, Anders Yeo
Non-separating Spanning Trees and Out-Branchings in Digraphs of Independence Number 2. Graphs Comb. 38 (6) (2022)
Jørgen Bang-Jensen, Stéphane Bessy, Jing Huang, Matthias Kriesell
Good orientations of unions of edge-disjoint spanning trees. J. Graph Theory 96 (4) (2021)
Stéphane Bessy, Jocelyn Thiebaut
Complementary cycles of any length in regular bipartite tournaments. CoRR (2021)
Stéphane Bessy, Florian Hörsch, Ana Karolinna Maia, Dieter Rautenbach, Ignasi Sau
FPT algorithms for packing k-safe spanning rooted sub(di)graphs. CoRR (2021)
Stéphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi
Packing Arc-Disjoint Cycles in Tournaments. Algorithmica 83 (5) (2021)
Stéphane Bessy, Johannes Pardey, Dieter Rautenbach
Exponential independence in subcubic graphs. Discret. Math. 344 (8) (2021)
Stéphane Bessy, François Dross, Katarína Hrináková, Martin Knor, Riste Skrekovski
Maximal Wiener index for graphs with prescribed number of blocks. Appl. Math. Comput. 380 (2020)
Noga Alon, Jørgen Bang-Jensen, Stéphane Bessy
Out-colourings of digraphs. J. Graph Theory 93 (1) (2020)
Stéphane Bessy, François Dross, Katarína Hrináková, Martin Knor, Riste Skrekovski
The structure of graphs with given number of blocks and the maximum Wiener index. J. Comb. Optim. 39 (1) (2020)
Jørgen Bang-Jensen, Stéphane Bessy, Anders Yeo
Non-separating spanning trees and out-branchings in digraphsof independence number 2. CoRR (2020)
Stéphane Bessy, François Dross, Martin Knor, Riste Skrekovski
Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs. Discret. Appl. Math. 284 (2020)
Stéphane Bessy, Marin Bougeret, Steven Chaplick, Daniel Gonçalves, Christophe Paul
On independent set in B1-EPG graphs. Discret. Appl. Math. 278 (2020)
Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
Bipartite spanning sub(di)graphs induced by 2-partitions. J. Graph Theory 92 (2) (2019)
Stéphane Bessy, Marin Bougeret, Alan Diêgo A. Carneiro, Fábio Protti, Uéverton S. Souza
Width Parameterizations for Knot-free Vertex Deletion on Digraphs. CoRR (2019)
Stéphane Bessy, Stefan Ehard, Lucia Draque Penso, Dieter Rautenbach
Dynamic monopolies for interval graphs with bounded thresholds. Discret. Appl. Math. 260 (2019)
Stéphane Bessy, Marin Bougeret, Alan Diêgo A. Carneiro, Fábio Protti, Uéverton S. Souza
Width Parameterizations for Knot-Free Vertex Deletion on Digraphs. IPEC (2019)
Stéphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi
Packing Arc-Disjoint Cycles in Tournaments. MFCS (2019)
Stéphane Bessy, Rodolphe Giroudeau
Parameterized complexity of a coupled-task scheduling problem. J. Sched. 22 (3) (2019)
Stéphane Bessy, Pascal Ochem, Dieter Rautenbach
On the Kőnig?Egerváry theorem for k?paths. J. Graph Theory 91 (1) (2019)
Jørgen Bang-Jensen, Stéphane Bessy
Degree-constrained 2-partitions of graphs. Theor. Comput. Sci. 776 (2019)
Stéphane Bessy, Dieter Rautenbach
Relating broadcast independence and independence. Discret. Math. 342 (12) (2019)
Stéphane Bessy, François Dross, Katarína Hrináková, Martin Knor, Riste Skrekovski
The structure of graphs with given number of blocks and the maximum Wiener index. CoRR (2019)
Stéphane Bessy, François Dross, Martin Knor, Riste Skrekovski
Graphs with the second and third maximum Wiener index over the 2-vertex connected graphs. CoRR (2019)
Stéphane Bessy, Anthony Bonato, Jeannette C. M. Janssen, Dieter Rautenbach, Elham Roshanbin
Bounds on the burning number. Discret. Appl. Math. 235 (2018)
Stéphane Bessy, Stefan Ehard, Lucia Draque Penso, Dieter Rautenbach
Dynamic monopolies for interval graphs with bounded thresholds. CoRR (2018)
Stéphane Bessy, Marin Bougeret, Jocelyn Thiebaut
(Arc-disjoint) cycle packing in tournament: classical and parameterized complexity. CoRR (2018)
Stéphane Bessy, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach
The Geodetic Hull Number is Hard for Chordal Graphs. SIAM J. Discret. Math. 32 (1) (2018)
Jørgen Bang-Jensen, Stéphane Bessy
Degree-constrained 2-partitions of graphs. CoRR (2018)
Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
Out-degree reducing partitions of digraphs. Theor. Comput. Sci. 719 (2018)
Stéphane Bessy, Marin Bougeret, Jocelyn Thiebaut
Triangle Packing in (Sparse) Tournaments: Approximation and Kernelization. ESA (2017)
Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
Out-degree reducing partitions of digraphs. CoRR (2017)
Noga Alon, Jørgen Bang-Jensen, Stéphane Bessy
Out-colourings of Digraphs. CoRR (2017)
Stéphane Bessy, Dieter Rautenbach
Extremal Values of the Chromatic Number for a Given Degree Sequence. Graphs Comb. 33 (4) (2017)
Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
Bipartite spanning sub(di)graphs induced by 2-partitions. CoRR (2017)
Stéphane Bessy, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach
The Geodetic Hull Number is Hard for Chordal Graphs. CoRR (2017)
Jørgen Bang-Jensen, Stéphane Bessy, Bill Jackson, Matthias Kriesell
Antistrong digraphs. J. Comb. Theory, Ser. B 122 (2017)
Stéphane Bessy, Jocelyn Thiebaut
Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang Conjecture. Electron. Notes Discret. Math. 61 (2017)
Stéphane Bessy, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach
The Geodetic Hull Number is Hard for Chordal Graphs. Electron. Notes Discret. Math. 62 (2017)
Stéphane Bessy, Marin Bougeret, Jocelyn Thiebaut
Triangle packing in (sparse) tournaments: approximation and kernelization. CoRR (2017)
Stéphane Bessy, Nicolas Bousquet
Colorful paths for 3-chromatic graphs. Discret. Math. 340 (5) (2017)
Stéphane Bessy, Pascal Ochem, Dieter Rautenbach
Bounds on the exponential domination number. Discret. Math. 340 (3) (2017)
Stéphane Bessy, Anthony Bonato, Jeannette C. M. Janssen, Dieter Rautenbach, Elham Roshanbin
Burning a graph is hard. Discret. Appl. Math. 232 (2017)
Stéphane Bessy, Pascal Ochem, Dieter Rautenbach
Exponential Domination in Subcubic Graphs. Electron. J. Comb. 23 (4) (2016)
Stéphane Bessy, Daniel Gonçalves, Jean-Sébastien Sereni
Two-floor buildings need eight colors. J. Graph Algorithms Appl. 19 (1) (2015)
Marin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe Paul
On independent set on B1-EPG graphs. CoRR (2015)
Jørgen Bang-Jensen, Stéphane Bessy
Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles. J. Graph Theory 79 (4) (2015)
Marin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe Paul
On Independent Set on B1-EPG Graphs. WAOA (2015)
Jørgen Bang-Jensen, Stéphane Bessy, Stéphan Thomassé
Disjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for Tournaments. J. Graph Theory 75 (3) (2014)
Jørgen Bang-Jensen, Stéphane Bessy
(Arc-)disjoint flows in networks. Theor. Comput. Sci. 526 (2014)
Stéphane Bessy, Frédéric Havet
Enumerating the edge-colourings and total colourings of a regular graph. J. Comb. Optim. 25 (4) (2013)
Stéphane Bessy, Anthony Perez
Polynomial kernels for Proper Interval Completion and related problems. Inf. Comput. 231 (2013)
Stéphane Bessy, Anthony Perez
Polynomial kernels for Proper Interval Completion and related problems CoRR (2011)
Stéphane Bessy, Anthony Perez
Polynomial Kernels for Proper Interval Completion and Related Problems. FCT (2011)
Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé
Kernels for feedback arc set in tournaments. J. Comput. Syst. Sci. 77 (6) (2011)
Stéphane Bessy, Christophe Paul, Anthony Perez
Polynomial kernels for 3-leaf power graph modification problems. Discret. Appl. Math. 158 (16) (2010)
Stéphane Bessy, Nicolas Lichiardopol, Jean-Sébastien Sereni
Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree. Discret. Math. 310 (3) (2010)
Stéphane Bessy, Stéphan Thomassé
Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture. J. Comb. Theory, Ser. B 100 (2) (2010)
Stéphane Bessy, Clément Lepelletier
Optical index of fault tolerant routings in WDM networks. Networks 56 (2) (2010)
Stéphane Bessy, Christophe Paul, Anthony Perez
Polynomial Kernels for 3-Leaf Power Graph Modification Problems. IWOCA (2009)
Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé
Kernels for Feedback Arc Set In Tournaments CoRR (2009)
Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé
Kernels for Feedback Arc Set In Tournaments. FSTTCS (2009)
Stéphane Bessy, Christophe Paul, Anthony Perez
Polynomial kernels for 3-leaf power graph modification problems CoRR (2008)
Stéphane Bessy
Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdös condition approach. Discret. Math. 308 (18) (2008)
Stéphane Bessy, Stéphan Thomassé
circuits: A proof of Gallai's conjecture. Comb. 27 (6) (2007)
Stéphane Bessy, Nicolas Lichiardopol, Jean-Sébastien Sereni
Two proofs of Bermond-Thomassen conjecture for regular tournaments. Electron. Notes Discret. Math. 28 (2007)
Stéphane Bessy, Frédéric Havet, Etienne Birmelé
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree. J. Graph Theory 53 (4) (2006)
Stéphane Bessy, Stéphan Thomassé
The categorical product of two 5-chromatic digraphs can be 3-chromatic. Discret. Math. 305 (1-3) (2005)
Stéphane Bessy, Stéphan Thomassé
Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs. IPCO (2004)
Stéphane Bessy, Stéphan Thomassé
+2 alpha-2 arcs. J. Comb. Theory, Ser. B 87 (2) (2003)