Stéphane Bessy
Stéphane Bessy
Unknown affiliation
Verified email at lirmm.fr
Title
Cited by
Cited by
Year
Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
S Bessy, S Thomassé
Journal of Combinatorial Theory, Series B 100 (2), 176-180, 2010
692010
Kernels for feedback arc set in tournaments
S Bessy, FV Fomin, S Gaspers, C Paul, A Perez, S Saurabh, S Thomassé
Journal of Computer and System Sciences 77 (6), 1071-1078, 2011
632011
Bounds on the burning number
S Bessy, A Bonato, J Janssen, D Rautenbach, E Roshanbin
Discrete Applied Mathematics 235, 16-22, 2018
29*2018
Burning a graph is hard
S Bessy, A Bonato, J Janssen, D Rautenbach, E Roshanbin
Discrete Applied Mathematics 232, 73-87, 2017
282017
Two proofs of the Bermond–Thomassen conjecture for tournaments with bounded minimum in-degree
S Bessy, N Lichiardopol, JS Sereni
Discrete Mathematics 310 (3), 557-560, 2010
242010
Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments
J Bang‐Jensen, S Bessy, S Thomassé
Journal of Graph Theory 75 (3), 284-302, 2014
232014
Spanning a strong digraph by á circuits: A proof of Gallai˘s conjecture
S Bessy, S Thomassé
Combinatorica 27 (6), 659-667, 2007
202007
Polynomial kernels for 3-leaf power graph modification problems
S Bessy, C Paul, A Perez
Discrete Applied Mathematics 158 (16), 1732-1744, 2010
182010
Polynomial kernels for Proper Interval Completion and related problems
S Bessy, A Perez
Information and Computation 231, 89-108, 2013
132013
Arc‐chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree
S Bessy, F Havet, E Birmelé
Journal of Graph Theory 53 (4), 315-332, 2006
122006
Every strong digraph has a spanning strong subgraph with at most n+ 2á− 2 arcs
S Bessy, S Thomassé
Journal of Combinatorial Theory, Series B 87 (2), 289-299, 2003
122003
Polynomial kernels for proper interval completion and related problems
S Bessy, A Perez
International Symposium on Fundamentals of Computation Theory, 229-239, 2011
112011
Bounds on the exponential domination number
S Bessy, P Ochem, D Rautenbach
Discrete Mathematics 340 (3), 494-503, 2017
102017
Exponential domination in subcubic graphs
S Bessy, P Ochem, D Rautenbach
arXiv preprint arXiv:1511.01398, 2015
102015
On independent set on B1-EPG graphs
M Bougeret, S Bessy, D Gonçalves, C Paul
International Workshop on Approximation and Online Algorithms, 158-169, 2015
102015
Three min-max theorems concerning cyclic orders of strong digraphs
S Bessy, S Thomassé
International Conference on Integer Programming and Combinatorial …, 2004
92004
Enumerating the edge-colourings and total colourings of a regular graph
S Bessy, F Havet
Journal of Combinatorial Optimization 25 (4), 523-535, 2013
82013
Dynamic monopolies for interval graphs with bounded thresholds
S Bessy, S Ehard, LD Penso, D Rautenbach
Discrete Applied Mathematics 260, 256-261, 2019
72019
The geodetic hull number is hard for chordal graphs
S Bessy, MC Dourado, LD Penso, D Rautenbach
SIAM Journal on Discrete Mathematics 32 (1), 543-547, 2018
72018
(Arc-) disjoint flows in networks
J Bang-Jensen, S Bessy
Theoretical Computer Science 526, 28-40, 2014
72014
The system can't perform the operation now. Try again later.
Articles 1–20