SB

Stéphane Bessy

65
Documents
Identifiants chercheurs

Présentation

Publications

35
9
9
6
2
1
1
1
1
4
4
3
3
3
2
2
2
2
2
2
2
2
2
2
2
2
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
10
8
8
7
7
6
6
6
5
5
5
4
3
3
3
3
3
2
2
2
2
2
2
2
2
2
2
2
2
2
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
9
8
7
5
3
3
3
2
1
1
1
1
1
1
1
1
1
2
3
2
6
3
3
8
3
8
2
2
2
2
2
3
4
2
1
2
1
1
1
1
1
14
5
2
2
2
2
1
1
1
1
1
49
13
2
1
1

Publications

Deposit thumbnail

Dichromatic number of chordal graphs

Stéphane Bessy , Frédéric Havet , Lucas Picasarri-Arrieta

Graphs and Combinatorics, 2025, 41 (4), pp.81. ⟨10.1007/s00373-025-02942-5⟩

Article dans une revue hal-05470633v1

Constrained Flows in Networks

Jørgen Bang-Jensen , Stéphane Bessy , Lucas Picasarri-Arrieta

Theoretical Computer Science, 2024, 1010, pp.114702. ⟨10.1016/j.tcs.2024.114702⟩

Article dans une revue hal-04379871v1
Deposit thumbnail

FPT algorithms for packing k-safe spanning rooted sub(di)graphs

Stéphane Bessy , Florian Hörsch , Ana Karolinna Maia , Dieter Rautenbach , Ignasi Sau

Discrete Applied Mathematics, 2024, 346, pp.80-94. ⟨10.1016/j.dam.2023.11.026⟩

Article dans une revue lirmm-04352990v1
Deposit thumbnail

Unbalanced Spanning Subgraphs in Edge Labeled Complete Graphs

Stéphane Bessy , Johannes Pardey , Lucas Picasarri-Arrieta , Dieter Rautenbach

The Electronic Journal of Combinatorics, 2023, 30 (1), pp.1-35. ⟨10.37236/10866⟩

Article dans une revue hal-04172966v1
Deposit thumbnail

Complexity of some arc-partition problems for digraphs

Jørgen Bang-Jensen , Stéphane Bessy , Daniel Gonçalves , Lucas Picasarri-Arrieta

Theoretical Computer Science, 2022, 928, pp.167-182. ⟨10.1016/j.tcs.2022.06.023⟩

Article dans une revue hal-03699980v1
Deposit thumbnail

Complementary cycles of any length in regular bipartite tournaments

Stéphane Bessy , Jocelyn Thiebaut

Journal of Graph Theory, 2022, 103 (2), pp.186-211. ⟨10.1002/jgt.22914⟩

Article dans une revue hal-05108327v1
Deposit thumbnail

Algorithmic aspects of broadcast independence

Stéphane Bessy , Dieter Rautenbach

Discrete Applied Mathematics, 2022, 314, pp.142-149. ⟨10.1016/j.dam.2022.03.001⟩

Article dans une revue hal-04032277v1
Deposit thumbnail

Factorially Many Maximum Matchings Close to the Erdős-Gallai Bound

Stéphane Bessy , Johannes Pardey , Lucas Picasarri-Arrieta , Dieter Rautenbach

The Electronic Journal of Combinatorics, 2022, 29 (2), ⟨10.37236/10610⟩

Article dans une revue hal-03701284v1
Deposit thumbnail

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

Journal of Graph Theory, 2022, 100 (2), pp.294-314. ⟨10.1002/jgt.22779⟩

Article dans une revue lirmm-04032263v1
Deposit thumbnail

Non-separating Spanning Trees and Out-Branchings in Digraphs of Independence Number 2

Jørgen Bang-Jensen , Stéphane Bessy , Anders Yeo

Graphs and Combinatorics, 2022, 38 (6), ⟨10.1007/s00373-022-02589-6⟩

Article dans une revue hal-04032270v1
Deposit thumbnail

Packing Arc-Disjoint Cycles in Tournaments

Stéphane Bessy , Marin Bougeret , Ramaswamy Krithika , Abhishek Sahu , Saket Saurabh et al.

Algorithmica, 2021, 83 (5), pp.1393-1420. ⟨10.1007/s00453-020-00788-2⟩

Article dans une revue lirmm-03271568v1

Exponential independence in subcubic graphs

Stéphane Bessy , Johannes Pardey , Dieter Rautenbach

Discrete Mathematics, 2021, 344 (8), pp.#112439. ⟨10.1016/j.disc.2021.112439⟩

Article dans une revue lirmm-03476654v1

Good orientations of unions of edge‐disjoint spanning trees

Jørgen Bang-Jensen , Stéphane Bessy , Jing Huang , Matthias Kriesell

Journal of Graph Theory, 2021, 96 (4), pp.594-618. ⟨10.1002/jgt.22633⟩

Article dans une revue lirmm-03271567v1

On independent set in B1-EPG graphs

Stéphane Bessy , Marin Bougeret , Steven Chaplick , Daniel Gonçalves , Christophe Paul

Discrete Applied Mathematics, 2020, 278, pp.62-72. ⟨10.1016/j.dam.2019.10.019⟩

Article dans une revue lirmm-03027587v1

Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs

Stéphane Bessy , François Dross , Martin Knor , Riste Škrekovski

Discrete Applied Mathematics, 2020, 284, pp.195-200. ⟨10.1016/j.dam.2020.03.032⟩

Article dans une revue hal-05086176v1

Out‐colourings of digraphs

Noga Alon , Jørgen Bang‐jensen , Stéphane Bessy

Journal of Graph Theory, 2020, 93 (1), pp.88-112. ⟨10.1002/jgt.22476⟩

Article dans une revue lirmm-03271566v1
Deposit thumbnail

Relating broadcast independence and independence

Stéphane Bessy , Dieter Rautenbach

Discrete Mathematics, 2019, 342 (12), pp.#111589. ⟨10.1016/j.disc.2019.07.005⟩

Article dans une revue lirmm-02947704v1
Deposit thumbnail

Parameterized complexity of a coupled-task scheduling problem

Stéphane Bessy , Rodolphe Giroudeau

Journal of Scheduling, 2019, 22 (3), pp.305-313. ⟨10.1007/s10951-018-0581-1⟩

Article dans une revue lirmm-02133404v1
Deposit thumbnail

Dynamic monopolies for interval graphs with bounded thresholds

Stéphane Bessy , Stefan Ehard , Lucia D. Penso , Dieter Rautenbach

Discrete Applied Mathematics, 2019, 260, pp.256-261. ⟨10.1016/j.dam.2019.01.022⟩

Article dans une revue lirmm-02947680v1
Deposit thumbnail

On the Kőnig-Egerváry theorem for $k$-paths

Stéphane Bessy , Pascal Ochem , Dieter Rautenbach

Journal of Graph Theory, 2019, 91 (1), pp.73-87. ⟨10.1002/jgt.22421⟩

Article dans une revue lirmm-02078255v1
Deposit thumbnail

Bipartite spanning sub(di)graphs induced by 2-partitions

Jørgen Bang-Jensen , Stéphane Bessy , Frédéric Havet , Anders Yeo

Journal of Graph Theory, 2019, 92 (2), pp.130-151. ⟨10.1002/jgt.22444⟩

Article dans une revue hal-02350210v1
Deposit thumbnail

Degree-constrained 2-partitions of graphs

Jørgen Bang-Jensen , Stéphane Bessy

Theoretical Computer Science, 2019, 776, pp.64-74. ⟨10.1016/j.tcs.2018.12.023⟩

Article dans une revue lirmm-02011257v1

The Geodetic Hull Number is Hard for Chordal Graphs

Stéphane Bessy , Mitre Dourado , Lucia Penso , Dieter Rautenbach

SIAM Journal on Discrete Mathematics, 2018, 32 (1), pp.543-547. ⟨10.1137/17M1131726⟩

Article dans une revue lirmm-01997429v1

Bounds on the burning number

Stéphane Bessy , Anthony Bonato , Jeannette Janssen , Dieter Rautenbach , Elham Roshanbin

Discrete Applied Mathematics, 2018, 235, pp.16-22. ⟨10.1016/j.dam.2017.09.012⟩

Article dans une revue lirmm-01713736v1
Deposit thumbnail

Out-degree reducing partitions of digraphs

Jørgen Bang-Jensen , Stéphane Bessy , Frédéric Havet , Anders Yeo

Theoretical Computer Science, 2018, 719, pp.64-72. ⟨10.1016/j.tcs.2017.11.007⟩

Article dans une revue hal-01765642v1

Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang Conjecture

Stéphane Bessy , Jocelyn Thiebaut

Electronic Notes in Discrete Mathematics, 2017, 61, pp.115-121. ⟨10.1016/j.endm.2017.06.028⟩

Article dans une revue lirmm-01713782v1
Deposit thumbnail

Extremal Values of the Chromatic Number for a Given Degree Sequence

Stéphane Bessy , Dieter Rautenbach

Graphs and Combinatorics, 2017, 33 (4), pp.789-799. ⟨10.1007/s00373-017-1814-3⟩

Article dans une revue lirmm-01997424v1
Deposit thumbnail

Colorful paths for 3-chromatic graphs

Nicolas Bousquet , Stéphane Bessy

Discrete Mathematics, 2017, 340 (5), pp.1000-1007. ⟨10.1016/j.disc.2017.01.016⟩

Article dans une revue hal-01592548v1

Burning a graph is hard

Stéphane Bessy , Anthony Bonato , Jeannette Janssen , Dieter Rautenbach , Elham Roshanbin

Discrete Applied Mathematics, 2017, 232, pp.73-87. ⟨10.1016/j.dam.2017.07.016⟩

Article dans une revue lirmm-01692784v1

Bounds on the exponential domination number

Stéphane Bessy , Pascal Ochem , Dieter Rautenbach

Discrete Mathematics, 2017, 340 (3), pp.494-503. ⟨10.1016/j.disc.2016.08.024⟩

Article dans une revue lirmm-01692753v1
Deposit thumbnail

Antistrong digraphs

Jørgen Bang-Jensen , Stéphane Bessy , Bill Jackson , Matthias Kriesell

Journal of Combinatorial Theory, Series B, 2017, 122, pp.68-90. ⟨10.1016/j.jctb.2016.05.004⟩

Article dans une revue lirmm-01348862v1

The Geodetic Hull Number is Hard for Chordal Graphs

Stéphane Bessy , Mitre Dourado , Lucia Penso , Dieter Rautenbach

Electronic Notes in Discrete Mathematics, 2017, 62, pp.291-296. ⟨10.1016/j.endm.2017.10.050⟩

Article dans une revue lirmm-01997425v1
Deposit thumbnail

Exponential Domination in Subcubic Graphs

Stéphane Bessy , Pascal Ochem , Dieter Rautenbach

The Electronic Journal of Combinatorics, 2016, 23 (4), pp.#P4.42. ⟨10.37236/5711⟩

Article dans une revue lirmm-01997215v1
Deposit thumbnail

Two floor building needing eight colors

Stéphane Bessy , Daniel Gonçalves , Jean-Sébastien Sereni

Journal of Graph Algorithms and Applications, 2015, 19 (1), pp.1--9. ⟨10.7155/jgaa.00344⟩

Article dans une revue hal-00996709v2

Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles

Jørgen Bang-Jensen , Stéphane Bessy

Journal of Graph Theory, 2015, 79 (4), pp.249-266. ⟨10.1002/jgt.21830⟩

Article dans une revue istex lirmm-01282883v1

Disjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for Tournaments

Jørgen Bang-Jensen , Stéphane Bessy , Stéphan Thomassé

Journal of Graph Theory, 2014, 75 (3), pp.284-302. ⟨10.1002/jgt.21740⟩

Article dans une revue istex lirmm-01282882v1

(Arc-)disjoint flows in networks

Jørgen Bang-Jensen , Stéphane Bessy

Theoretical Computer Science, 2014, 526, pp.28-40. ⟨10.1016/j.tcs.2014.01.011⟩

Article dans une revue lirmm-01282881v1

Polynomial kernels for Proper Interval Completion and related problems

Stéphane Bessy , Anthony Perez

Information and Computation, 2013, 231, pp.89-108. ⟨10.1016/j.ic.2013.08.006⟩

Article dans une revue hal-00942650v1
Deposit thumbnail

Enumerating the edge-colourings and total colourings of a regular graph

Stéphane Bessy , Frédéric Havet

Journal of Combinatorial Optimization, 2013, 25 (4), pp.523-535. ⟨10.1007/s10878-011-9448-5⟩

Article dans une revue hal-00821598v1
Deposit thumbnail

Kernels for feedback arc set in tournaments

Stéphane Bessy , Fedor V. Fomin , Serge Gaspers , Christophe Paul , Anthony Perez et al.

Journal of Computer and System Sciences, 2011, 77 (6), pp.1071-1078. ⟨10.1016/j.jcss.2010.10.001⟩

Article dans une revue lirmm-00738221v1
Deposit thumbnail

Optical index of fault tolerant routings in WDM networks

Stéphane Bessy , Clément Lepelletier

Networks, 2010, 56 (2), pp.95-102. ⟨10.1002/net.20351⟩

Article dans une revue lirmm-00738222v1

Polynomial Kernels for 3-Leaf Power Graph Modification Problems

Stéphane Bessy , Christophe Paul , Anthony Perez

Discrete Applied Mathematics, 2010, 158 (16), pp.1732-1744. ⟨10.1016/j.dam.2010.07.002⟩

Article dans une revue lirmm-00533517v1
Deposit thumbnail

Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree

Stéphane Bessy , Nicolas Lichiardopol , Jean-Sébastien Sereni

Discrete Mathematics, 2010, 310 (3), pp.557--560. ⟨10.1016/j.disc.2009.03.039⟩

Article dans une revue hal-00487977v1
Deposit thumbnail

Partitioning a Graph into a Cycle and an Anticycle: A Proof of Lehel's Conjecture

Stéphane Bessy , Stéphan Thomassé

Journal of Combinatorial Theory, Series B, 2010, 100 (2), pp.176-180. ⟨10.1016/j.jctb.2009.07.001⟩

Article dans une revue lirmm-00512762v1

Paths partition with prescribed beginnings in digraphs: A Chvátal–Erdős condition approach

Stéphane Bessy

Discrete Mathematics, 2008, 308 (18), pp.4108-4115. ⟨10.1016/j.disc.2007.07.113⟩

Article dans une revue istex lirmm-00324584v1
Deposit thumbnail

Spanning a strong digraph by $\alpha$ circuits: A proof of Gallai's conjecture

Stéphane Bessy , Stéphan Thomassé

Combinatorica, 2007, 27 (6), pp.659-667. ⟨10.1007/s00493-007-2073-3⟩

Article dans une revue lirmm-00256609v1

Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree

Stéphane Bessy , Etienne E. Birmelé , Frédéric Havet

Journal of Graph Theory, 2006, 53 (4), pp.315-332. ⟨10.1002/jgt.20189⟩

Article dans une revue lirmm-00153978v1
Deposit thumbnail

The Categorical Product of Two 5-Chromatic Digraphs can be 3-Chromatic

Stéphane Bessy , Stéphan Thomassé

Discrete Mathematics, 2005, 305, pp.344-346. ⟨10.1016/j.disc.2004.01.023⟩

Article dans une revue lirmm-00140331v1
Deposit thumbnail

Every strong digraph has a spanning strong subgraph with at most n+2α-2 arcs

Stéphane Bessy , Stéphan Thomassé

Journal of Combinatorial Theory, Series B, 2003, 87 (2), pp.289-299. ⟨10.1016/S0095-8956(02)00020-5⟩

Article dans une revue lirmm-00738215v1
Deposit thumbnail

Oriented Trees in $O(k \sqrt{k})$-Chromatic Digraphs, a Subquadratic Bound for Burr’s Conjecture

Stéphane Bessy , Daniel Gonçalves , Amadeus Reinald

WG 2024 - 50th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2024, Gozd Martuljek, Slovenia. pp.79-91, ⟨10.1007/978-3-031-75409-8_6⟩

Communication dans un congrès lirmm-04938265v1
Deposit thumbnail

Temporalizing Digraphs via Linear-Size Balanced Bi-Trees

Stéphane Bessy , Stéphan Thomassé , Laurent Viennot

STACS 2024 - 41st International Symposium on Theoretical Aspects of Computer Science, Mar 2024, Clermont-Ferrand, France. pp.13:1-13:12, ⟨10.4230/LIPIcs.STACS.2024.13⟩

Communication dans un congrès hal-04531675v1

Kernelization for Graph Packing Problems via Rainbow Matching

Stéphane Bessy , Marin Bougeret , Dimitrios M. Thilikos , Sebastian Wiederrecht

SODA 2023 - 34th ACM/SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Jan 2023, Florence, Italy. pp.3654-3663, ⟨10.1137/1.9781611977554.ch139⟩

Communication dans un congrès hal-04042995v1
Deposit thumbnail

Packing Arc-Disjoint Cycles in Tournaments

Stéphane Bessy , Marin Bougeret , Ramaswamy Krithika , Abhishek Sahu , Saket Saurabh et al.

MFCS 2019 - 44th International Symposium on Mathematical Foundations of Computer Science, Aug 2019, Aachen, Germany. pp.27:1-27:14, ⟨10.4230/LIPIcs.MFCS.2019.27⟩

Communication dans un congrès hal-02277436v1

Width Parameterizations for Knot-Free Vertex Deletion on Digraphs

Stéphane Bessy , Marin Bougeret , Alan D.A. Carneiro , Fábio Protti , Uéverton dos Santos Souza

IPEC 2019 - 14th International Symposium on Parameterized and Exact Computation, Sep 2019, Munich, Germany. pp.2:1-2:16, ⟨10.4230/LIPIcs.IPEC.2019.2⟩

Communication dans un congrès lirmm-03526774v1
Deposit thumbnail

Triangle packing in (sparse) tournaments: approximation and kernelization

Stéphane Bessy , Marin Bougeret , Jocelyn Thiebaut

ESA 2017 - 25th Annual European Symposium on Algorithms, Sep 2017, Vienne, Austria. pp.14:1--14:13, ⟨10.4230/LIPIcs.ESA.2017.14⟩

Communication dans un congrès lirmm-01550313v1

On Independent Set on B1-EPG Graphs

Marin Bougeret , Stéphane Bessy , Daniel Gonçalves , Christophe Paul

WAOA 2015 - 13th International Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.158-169, ⟨10.1007/978-3-319-28684-6_14⟩

Communication dans un congrès lirmm-01264022v1
Deposit thumbnail

Enumerating the edge-colourings and total colourings of a regular graph

Stéphane Bessy , Frédéric Havet

2012 Workshop on Graph Theory and Combinatorics, Aug 2012, National Sun Yat-sen University, Kaohsiung, Taiwan

Communication dans un congrès lirmm-00811571v1
Deposit thumbnail

Polynomial Kernels for Proper Interval Completion and Related Problems

Stéphane Bessy , Anthony Perez

Fundamentals of Computation Theory 2011, Norway. pp.229-239

Communication dans un congrès lirmm-00738226v1
Deposit thumbnail

Kernels for Feedback Arc Set In Tournaments

Stéphane Bessy , Fedor V. Fomin , Serge Gaspers , Christophe Paul , Anthony Perez et al.

IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2009, IIT Kanpur, India. pp.37-47, ⟨10.4230/LIPIcs.FSTTCS.2009.2305⟩

Communication dans un congrès lirmm-00432668v1

Polynomial Kernels for 3-Leaf Power Graph Modification Problems

Stéphane Bessy , Anthony Perez , Christophe Paul

IWOCA'09: International Workshop on Combinatorial Algorithms, pp.72-82

Communication dans un congrès lirmm-00432664v1

Two proofs of Bermond-Thomassen conjecture for regular tournaments

Stéphane Bessy , Jean-Sébastien Sereni , Nicolas Lichiardopol

6th Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Jul 2007, Prague, République Tchèque, Czech Republic. pp.47-53, ⟨10.1016/j.endm.2007.01.008⟩

Communication dans un congrès istex lirmm-00153984v1
Deposit thumbnail

Some problems in graph theory and graphs algorithmic theory

Stéphane Bessy

Discrete Mathematics [cs.DM]. Université Montpellier II - Sciences et Techniques du Languedoc, 2012

HDR tel-00806716v1