Stéphane Bessy

Generating author description...

All published works

Action	Title	Year	Authors
+	Oriented Trees in $$O(k \sqrt{k})$$-Chromatic Digraphs, a Subquadratic Bound for Burr’s Conjecture	2025	Stéphane Bessy Daniel Gonçalves Amadeus Reinald
+ PDF Chat	Constrained flows in networks	2024	Jørgen Bang‐Jensen Stéphane Bessy Lucas Picasarri‐Arrieta
+ PDF Chat	Unbalanced Spanning Subgraphs in Edge Labeled Complete Graphs	2023	Stéphane Bessy Johannes Pardey Lucas Picasarri‐Arrieta Dieter Rautenbach
+	Kernelization for Graph Packing Problems via Rainbow Matching	2023	Stéphane Bessy Marin Bougeret Dimitrios M. Thilikos Sebastian Wiederrecht
+	Temporalizing digraphs via linear-size balanced bi-trees	2023	Stéphane Bessy Stéphan Thomassé Laurent Viennot
+	Sparse vertex cutsets and the maximum degree	2023	Stéphane Bessy J. Rauch Dieter Rautenbach Uéverton S. Souza
+	Dichromatic number of chordal graphs	2023	Stéphane Bessy Frédéric Havet Lucas Picasarri‐Arrieta
+	Constrained Flows in Networks	2023	Stéphane Bessy Jørgen Bang‐Jensen Lucas Picasarri‐Arrieta
+ PDF Chat	Complementary cycles of any length in regular bipartite tournaments	2022	Stéphane Bessy Jocelyn Thiebaut
+	Non-separating Spanning Trees and Out-Branchings in Digraphs of Independence Number 2	2022	Jørgen Bang‐Jensen Stéphane Bessy Anders Yeo
+ PDF Chat	Factorially Many Maximum Matchings Close to the Erdős-Gallai Bound	2022	Stéphane Bessy Johannes Pardey Lucas Picasarri‐Arrieta Dieter Rautenbach
+	Complexity of some arc-partition problems for digraphs	2022	Jørgen Bang‐Jensen Stéphane Bessy Daniel Gonçalves L. Picasarri-Arrieta
+	Algorithmic aspects of broadcast independence	2022	Stéphane Bessy Dieter Rautenbach
+	Kernelization for Graph Packing Problems via Rainbow Matching	2022	Stéphane Bessy Marin Bougeret Dimitrios M. Thilikos Sebastian Wiederrecht
+	Factorially many maximum matchings close to the Erd\H{o}s-Gallai bound	2021	Stéphane Bessy Johannes Pardey Lucas Picasarri‐Arrieta Dieter Rautenbach
+	FPT algorithms for packing $k$-safe spanning rooted sub(di)graphs	2021	Stéphane Bessy Florian Hörsch Ana Karolinna Maia Dieter Rautenbach Ignasi Sau
+ PDF Chat	Exponential independence in subcubic graphs	2021	Stéphane Bessy Johannes Pardey Dieter Rautenbach
+ PDF Chat	Packing Arc-Disjoint Cycles in Tournaments	2021	Stéphane Bessy Marin Bougeret R. Krithika Abhishek Sahu Saket Saurabh Jocelyn Thiebaut Meirav Zehavi
+	Unbalanced spanning subgraphs in edge labeled complete graphs	2021	Stéphane Bessy Johannes Pardey Lucas Picasarri‐Arrieta Dieter Rautenbach
+	FPT algorithms for packing $k$-safe spanning rooted sub(di)graphs	2021	Stéphane Bessy Florian Hörsch Ana Karolinna Maia Dieter Rautenbach Ignasi Sau
+	Complementary cycles of any length in regular bipartite tournaments	2021	Stéphane Bessy Jocelyn Thiebaut
+	Factorially many maximum matchings close to the Erdős-Gallai bound	2021	Stéphane Bessy Johannes Pardey Lucas Picasarri‐Arrieta Dieter Rautenbach
+	Exponential Independence in Subcubic Graphs	2020	Stéphane Bessy Johannes Pardey Dieter Rautenbach
+	Maximal Wiener index for graphs with prescribed number of blocks	2020	Stéphane Bessy François Dross Katarína Hriňáková Martin Knor Riste Škrekovski
+	Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs	2020	Stéphane Bessy François Dross Martin Knor Riste Škrekovski
+	Arc-disjoint in- and out-branchings in digraphs of independence number at most 2	2020	Joergen Bang-Jensen Stéphane Bessy Frédéric Havet Anders Yeo
+	Non-separating spanning trees and out-branchings in digraphsof independence number 2	2020	Jørgen Bang‐Jensen Stéphane Bessy Anders Yeo
+	Exponential Independence in Subcubic Graphs	2020	Stéphane Bessy Johannes Pardey Dieter Rautenbach
+	Girth, minimum degree, independence, and broadcast independence	2019	Stéphane Bessy Dieter Rautenbach
+ PDF Chat	The structure of graphs with given number of blocks and the maximum Wiener index	2019	Stéphane Bessy François Dross Katarína Hriňáková Martin Knor Riste Škrekovski
+	Relating broadcast independence and independence	2019	Stéphane Bessy Dieter Rautenbach
+ PDF Chat	Out‐colourings of digraphs	2019	Noga Alon Jørgen Bang‐Jensen Stéphane Bessy
+	The structure of graphs with given number of blocks and the maximum Wiener index	2019	Stéphane Bessy François Dross Katarína Hriňáková Martin Knor Riste Škrekovski
+	Good orientations of 2T-graphs	2019	Jørgen Bang‐Jensen Stéphane Bessy Jing Huang Matthias Kriesell
+	Dynamic monopolies for interval graphs with bounded thresholds	2019	Stéphane Bessy Stefan Ehard Lúcia Draque Penso Dieter Rautenbach
+	Degree-constrained 2-partitions of graphs	2019	Jørgen Bang‐Jensen Stéphane Bessy
+	Graphs with the second and third maximum Wiener index over the 2-vertex connected graphs	2019	Stéphane Bessy François Dross Martin Knor Riste Škrekovski
+	Width Parameterizations for Knot-free Vertex Deletion on Digraphs	2019	Stéphane Bessy Marin Bougeret Alan Diêgo Aurélio Carneiro Fábio Protti Uéverton S. Souza
+	Width Parameterizations for Knot-Free Vertex Deletion on Digraphs.	2019	Stéphane Bessy Marin Bougeret Alan Diêgo Aurélio Carneiro Fábio Protti Uéverton S. Souza
+	The structure of graphs with given number of blocks and the maximum Wiener index	2019	Stéphane Bessy François Dross Katarína Hriňáková Martin Knor Riste Škrekovski
+ PDF Chat	Bipartite spanning sub(di)graphs induced by 2‐partitions	2018	Jørgen Bang‐Jensen Stéphane Bessy Frédéric Havet Anders Yeo
+ PDF Chat	On the Kőnig‐Egerváry theorem for ‐paths	2018	Stéphane Bessy Pascal Ochem Dieter Rautenbach
+	Relating broadcast independence and independence	2018	Stéphane Bessy Dieter Rautenbach
+	Dynamic monopolies for interval graphs with bounded thresholds	2018	Stéphane Bessy Stefan Ehard Lúcia Draque Penso Dieter Rautenbach
+	Degree-constrained 2-partitions of graphs	2018	Joergen Bang-Jensen Stéphane Bessy
+	(Arc-disjoint) cycle packing in tournament: classical and parameterized complexity	2018	Stéphane Bessy Marin Bougeret Jocelyn Thiebaut
+ PDF Chat	The Geodetic Hull Number is Hard for Chordal Graphs	2018	Stéphane Bessy Mitre C. Dourado Lúcia Draque Penso Dieter Rautenbach
+	Girth, minimum degree, independence, and broadcast independence	2018	Stéphane Bessy Dieter Rautenbach
+	Relating broadcast independence and independence	2018	Stéphane Bessy Dieter Rautenbach
+	Algorithmic aspects of broadcast independence	2018	Stéphane Bessy Dieter Rautenbach
+	Dynamic monopolies for interval graphs with bounded thresholds	2018	Stéphane Bessy Stefan Ehard Lúcia Draque Penso Dieter Rautenbach
+	Degree-constrained 2-partitions of graphs	2018	Joergen Bang-Jensen Stéphane Bessy
+	Out-degree reducing partitions of digraphs	2017	Jørgen Bang‐Jensen Stéphane Bessy Frédéric Havet Anders Yeo
+	Bounds on the burning number	2017	Stéphane Bessy Anthony Bonato Jeannette Janssen Dieter Rautenbach Elham Roshanbin
+ PDF Chat	The Geodetic Hull Number is Hard for Chordal Graphs	2017	Stéphane Bessy Mitre C. Dourado Lúcia Draque Penso Dieter Rautenbach
+	On the K\H{o}nig-Egerv\'ary Theorem for $k$-Paths	2017	Stéphane Bessy Pascal Ochem Dieter Rautenbach
+	Triangle packing in (sparse) tournaments: approximation and kernelization	2017	Stéphane Bessy Marin Bougeret Jocelyn Thiebaut
+	Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang Conjecture	2017	Stéphane Bessy Jocelyn Thiebaut
+ PDF Chat	Extremal Values of the Chromatic Number for a Given Degree Sequence	2017	Stéphane Bessy Dieter Rautenbach
+	The Geodetic Hull Number is Hard for Chordal Graphs	2017	Stéphane Bessy Mitre C. Dourado Lúcia Draque Penso Dieter Rautenbach
+	Out-colourings of Digraphs	2017	Noga Alon Joergen Bang-Jensen Stéphane Bessy
+	Triangle packing in (sparse) tournaments: approximation and kernelization	2017	Stéphane Bessy Marin Bougeret Jocelyn Thiebaut
+	Bipartite spanning sub(di)graphs induced by 2-partitions	2017	Jørgen Bang‐Jensen Stéphane Bessy Frédéric Havet Anders Yeo
+	On the Kőnig-Egerváry Theorem for $k$-Paths	2017	Stéphane Bessy Pascal Ochem Dieter Rautenbach
+	Out-degree reducing partitions of digraphs	2017	Joergen Bang-Jensen Stéphane Bessy Frédéric Havet Anders Yeo
+	The Geodetic Hull Number is Hard for Chordal Graphs	2017	Stéphane Bessy Mitre C. Dourado Lúcia Draque Penso Dieter Rautenbach
+	Exponential Domination in Subcubic Graphs	2016	Stéphane Bessy Pascal Ochem Dieter Rautenbach
+	Bounds on the exponential domination number	2016	Stéphane Bessy Pascal Ochem Dieter Rautenbach
+	Extremal Values of the Chromatic Number for a Given Degree Sequence	2016	Stéphane Bessy Dieter Rautenbach
+	Antistrong digraphs	2016	Jørgen Bang‐Jensen Stéphane Bessy Bill Jackson Matthias Kriesell
+	Antistrong digraphs	2016	Jørgen Bang‐Jensen Stéphane Bessy Bill Jackson Matthias Kriesell
+	Extremal Values of the Chromatic Number for a Given Degree Sequence	2016	Stéphane Bessy Dieter Rautenbach
+	Antistrong digraphs	2016	Jørgen Bang‐Jensen Stéphane Bessy Bill Jackson Matthias Kriesell
+	Bounds, Approximation, and Hardness for the Burning Number	2015	Stéphane Bessy Dieter Rautenbach
+	Bounds on the Burning Number	2015	Stéphane Bessy Anthony Bonato Jeannette Janssen Dieter Rautenbach
+	Exponential Domination in Subcubic Graphs	2015	Stéphane Bessy Pascal Ochem Dieter Rautenbach
+	Bounds on the Exponential Domination Number	2015	Stéphane Bessy Pascal Ochem Dieter Rautenbach
+	On independent set on B1-EPG graphs	2015	Marin Bougeret Stéphane Bessy Daniel Gonçalves Cristophe Paul
+ PDF Chat	Two floor building needing eight colors	2015	Stéphane Bessy Daniel Gonçalves Jean‐Sébastien Sereni
+ PDF Chat	On Independent Set on B1-EPG Graphs	2015	Marin Bougeret Stéphane Bessy Daniel Gonçalves Christophe Paul
+	On independent set on B1-EPG graphs	2015	Marin Bougeret Stéphane Bessy Daniel Gonçalves Cristophe Paul
+	Bounds on the Exponential Domination Number	2015	Stéphane Bessy Pascal Ochem Dieter Rautenbach
+	Exponential Domination in Subcubic Graphs	2015	Stéphane Bessy Pascal Ochem Dieter Rautenbach
+	Bounds on the Burning Number	2015	Stéphane Bessy Anthony Bonato Jeannette Janssen Dieter Rautenbach
+	Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles	2014	Jørgen Bang‐Jensen Stéphane Bessy
+	Two floor building needing eight colors	2014	Stéphane Bessy Daniel Gonçalves Jean‐Sébastien Sereni
+	Polynomial kernels for Proper Interval Completion and related problems	2013	Stéphane Bessy Anthony Perez
+	Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments	2013	Jørgen Bang‐Jensen Stéphane Bessy Stéphan Thomassé
+	Some problems in graph theory and graphs algorithmic theory	2012	Stéphane Bessy
+ PDF Chat	Enumerating the edge-colourings and total colourings of a regular graph	2012	Stéphane Bessy Frédéric Havet
+	Polynomial kernels for Proper Interval Completion and related problems	2011	Stéphane Bessy Anthony Perez
+ PDF Chat	Polynomial Kernels for Proper Interval Completion and Related Problems	2011	Stéphane Bessy Anthony Perez
+	Polynomial kernels for Proper Interval Completion and related problems	2011	Stéphane Bessy Anthony Perez
+	Kernels for feedback arc set in tournaments	2010	Stéphane Bessy Fedor V. Fomin Serge Gaspers Christophe Paul Anthony Perez Saket Saurabh Stéphan Thomassé
+ PDF Chat	Polynomial kernels for 3-leaf power graph modification problems	2010	Stéphane Bessy Christophe Paul Anthony Perez
+	Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture	2009	Stéphane Bessy Stéphan Thomassé
+	Two proofs of the Bermond–Thomassen conjecture for tournaments with bounded minimum in-degree	2009	Stéphane Bessy Nicolas Lichiardopol Jean‐Sébastien Sereni
+	Kernels for Feedback Arc Set In Tournaments	2009	Stéphane Bessy Fedor V. Fomin Serge Gaspers Christophe Paul Anthony Perez Saket Saurabh Stéphan Thomassé
+ PDF Chat	Polynomial Kernels for 3-Leaf Power Graph Modification Problems	2009	Stéphane Bessy Christophe Paul Anthony Perez
+	Paths partition with prescribed beginnings in digraphs: A Chvátal–Erdős condition approach	2007	Stéphane Bessy
+	Two proofs of Bermond-Thomassen conjecture for regular tournaments	2007	Stéphane Bessy Nicolas Lichiardopol Jean‐Sébastien Sereni
+	Two proofs of the Bermond-Thomassen conjecture for almost regular tournaments	2007	Stéphane Bessy Nicolas Lichiardopol Sophia Antipolis Jean‐Sébastien Sereni
+	Arc‐chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree	2006	Stéphane Bessy Frédéric Havet Étienne Birmelé
+	Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs	2004	Stéphane Bessy Stéphan Thomassé
+	Every strong digraph has a spanning strong subgraph with at most n+2α−2 arcs	2003	Stéphane Bessy Stéphan Thomassé
+	Stabilité et décomposition en circuits d'un digraphe	2003	Stéphane Bessy

Common Coauthors

Coauthor	Papers Together
Dieter Rautenbach	41
Jørgen Bang‐Jensen	16
Marin Bougeret	11
Pascal Ochem	9
Anthony Perez	8
Frédéric Havet	8
Johannes Pardey	8
Lucas Picasarri‐Arrieta	8
Anders Yeo	7
Jocelyn Thiebaut	7
Daniel Gonçalves	7
Lúcia Draque Penso	7
Stéphan Thomassé	7
François Dross	6
Riste Škrekovski	6
Martin Knor	6
Jean‐Sébastien Sereni	5
Christophe Paul	5
Joergen Bang-Jensen	5
Matthias Kriesell	4
Katarína Hriňáková	4
Mitre C. Dourado	4
Uéverton S. Souza	3
Saket Saurabh	3
Stefan Ehard	3
Nicolas Lichiardopol	3
Jeannette Janssen	3
Bill Jackson	3
Anthony Bonato	3
Serge Gaspers	2
Cristophe Paul	2
Ana Karolinna Maia	2
Ignasi Sau	2
Sebastian Wiederrecht	2
Fábio Protti	2
Fedor V. Fomin	2
Florian Hörsch	2
Noga Alon	2
Dimitrios M. Thilikos	2
Alan Diêgo Aurélio Carneiro	2
Meirav Zehavi	1
Laurent Viennot	1
Jing Huang	1
Elham Roshanbin	1
Amadeus Reinald	1
R. Krithika	1
Étienne Birmelé	1
J. Rauch	1
Sophia Antipolis	1
L. Picasarri-Arrieta	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Finding good 2-partitions of digraphs I. Hereditary properties	2016	Jørgen Bang‐Jensen Frédéric Havet	9
+ PDF Chat	Cycles in digraphs– a survey	1981	J.-C. Bermond Carsten Thomassen	8
+	Arc-disjoint spanning sub(di)graphs in digraphs	2012	Jørgen Bang‐Jensen Anders Yeo	7
+ PDF Chat	On Subtournaments of a Tournament	1966	J. W. Moon	6
+	Decomposing k-ARc-Strong Tournaments Into Strong Spanning Subdigraphs	2004	Jørgen Bang‐Jensen Anders Yeo	6
+	A 4 <i>k</i> <sup>2</sup> kernel for feedback vertex set	2010	Stéphan Thomassé	5
+ PDF Chat	Mathematical aspects of Wiener index	2016	Martin Knor Riste Škrekovski Aleksandra Tepeh	5
+	None	2001	Andrey A. Dobrynin R. C. Entringer Iván Gutman	5
+	Arc-disjoint paths and trees in 2-regular digraphs	2013	Jørgen Bang‐Jensen Sven Simonsen	5
+	Domination with exponential decay	2008	Peter Dankelmann David P. Day David Erwin Simon Mukwembi Henda C. Swart	4
+	On the broadcast independence number of caterpillars	2018	Messaouda Ahmane Isma Bouchemakh Éric Sopena	4
+	Out-degree reducing partitions of digraphs	2017	Jørgen Bang‐Jensen Stéphane Bessy Frédéric Havet Anders Yeo	4
+	A short proof of the Chen-Manalastas theorem	1995	J. A. Bondy	4
+	Partitioning graphs into generalized dominating sets	1998	Pinar Heggernes Jan Arne Telle	4
+	Transmission in graphs: A bound and vertex removing	1991	Ľubomír Šoltés	4
+	Wiener Index of Line Graphs	2014	Martin Knor Riste Škrekovski	4
+ PDF Chat	Learning to Order Things	1999	William W. Cohen Robert E. Schapire Yaron Singer	4
+	On the Broadcast Independence Number of Grid Graph	2012	Isma Bouchemakh Mohamed Zemir	4
+ PDF Chat	Permanents, Pfaffian Orientations, and Even Directed Circuits	1999	Neil Robertson Paul Seymour Robin Thomas	4
+ PDF Chat	Disjoint Directed Cycles	1996	Noga Alon	4
+	Every finite strongly connected digraph of stability 2 has a Hamiltonian path	1983	C. C. Chen Pablo Manalastas	4
+	Upper bounds on the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-domination number and the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-Roman domination number	2008	Adriana Hansberg Lutz Volkmann	3
+	Bounds on the exponential domination number	2016	Stéphane Bessy Pascal Ochem Dieter Rautenbach	3
+	Mathematics without Numbers	1993	Geoffrey Hellman	3
+ PDF Chat	Smaller Kernels for Hitting Set Problems of Constant Arity	2004	Naomi Nishimura Prabhakar Ragde Dimitrios M. Thilikos	3
+	Wiener index of Eulerian graphs	2013	Iván Gutman Roberto Cruz Juan Rada	3
+	On maximal paths and circuits of graphs	1959	P. Erdős Т. Галлаи	3
+ PDF Chat	A note on the <i>k</i>‐domination number of a graph	1989	Yair Caro Y. Roditty	3
+	On the Problem of Decomposing a Graph into <i>n</i> Connected Factors	1961	W. T. Tutte	3
+	Decomposing locally semicomplete digraphs into strong spanning subdigraphs	2011	Jørgen Bang‐Jensen Jing Huang	3
+	Linear graphs and electrical networks	1961	S. Seshu Myril B. Reed	3
+	Bounds on the connected <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-domination number in graphs	2010	Adriana Hansberg	3
+	None	2008	Nana Arizumi Peter Hamburger Alexandr Kostochka	3
+ PDF Chat	On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems	2010	Sylvain Guillemot Christophe Paul Anthony Perez	3
+	Bounds on the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si3.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-domination number of a graph	2011	Ermelinda DeLaViña Wayne Goddard Michael A. Henning Ryan Pepper Emil R. Vaughan	2
+	The solution of van der Waerden's problem for permanents	1981	Г. П. Егорычев	2
+ PDF Chat	Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth Local Search	2013	Marek Cygan	2
+	Optimal greedy algorithms for indifference graphs	1993	P. Looges Stephan Olariu	2
+	Extremal Graph Theory	1978	Béla Bollobás	2
+	Independence in connected graphs	2010	Jochen Harant Dieter Rautenbach	2
+	Minimum partition of a matroid into independent subsets	1965	Jack Edmonds	2
+	A quadratic kernel for feedback vertex set	2009	Stéphan Thomassé	2
+	Decomposing graphs under degree constraints	1996	Michael Stiebitz	2
+	Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds	2010	Petr A. Golovach Dieter Kratsch Jean-Fraņcois Couturier	2
+ PDF Chat	A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs	2009	Nicolas Lichiardopol Attila Pór Jean‐Sébastien Sereni	2
+	On the complexity of partitioning a graph into a few connected subgraphs	2013	Julien Bensmail	2
+ PDF Chat	Polynomial kernels for 3-leaf power graph modification problems	2010	Stéphane Bessy Christophe Paul Anthony Perez	2
+	None	2010	András Gyárfás Gábor N. Sárközy András Sebő Stanley M. Selkow	2
+	Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments	2013	Jørgen Bang‐Jensen Stéphane Bessy Stéphan Thomassé	2
+	On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I	1962	S. L. Hakimi	2