Seguir
Stéphane Bessy
Stéphane Bessy
Afiliación desconocida
Dirección de correo verificada de lirmm.fr
Título
Citado por
Citado por
Año
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
862010
Burning a graph is hard
S Bessy, A Bonato, J Janssen, D Rautenbach, E Roshanbin
Discrete Applied Mathematics 232, 73-87, 2017
742017
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
742011
Bounds on the burning number
S Bessy, A Bonato, J Janssen, D Rautenbach, E Roshanbin
Discrete Applied Mathematics 235, 16-22, 2018
612018
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
332014
Polynomial kernels for proper interval completion and related problems
S Bessy, A Perez
Information and Computation 231, 89-108, 2013
302013
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
282010
Polynomial kernels for 3-leaf power graph modification problems
S Bessy, C Paul, A Perez
Discrete Applied Mathematics 158 (16), 1732-1744, 2010
242010
Spanning a strong digraph by α circuits: A proof of Gallai’s conjecture
S Bessy, S Thomassé
Combinatorica 27, 659-667, 2007
232007
Relating broadcast independence and independence
S Bessy, D Rautenbach
Discrete Mathematics 342 (12), 111589, 2019
212019
Girth, minimum degree, independence, and broadcast independence
S Bessy, D Rautenbach
arXiv preprint arXiv:1809.09565, 2018
182018
Parameterized complexity of a coupled-task scheduling problem
S Bessy, R Giroudeau
Journal of Scheduling 22 (3), 305-313, 2019
162019
Dynamic monopolies for interval graphs with bounded thresholds
S Bessy, S Ehard, LD Penso, D Rautenbach
Discrete Applied Mathematics 260, 256-261, 2019
162019
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
162003
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
152006
Packing arc-disjoint cycles in tournaments
S Bessy, M Bougeret, R Krithika, A Sahu, S Saurabh, J Thiebaut, ...
Algorithmica 83, 1393-1420, 2021
142021
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
142018
Three min-max theorems concerning cyclic orders of strong digraphs
S Bessy, S Thomassé
International Conference on Integer Programming and Combinatorial …, 2004
132004
Out‐colourings of digraphs
N Alon, J Bang‐Jensen, S Bessy
Journal of Graph Theory 93 (1), 88-112, 2020
122020
Bounds on the exponential domination number
S Bessy, P Ochem, D Rautenbach
Discrete Mathematics 340 (3), 494-503, 2017
122017
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20