Stéphane Bessy

89 papers A* 1A 2B 6C 1Journal 77Unranked 1

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