ma trombine

Stéphane Bessy

Maître de conférences en informatique à l' Université de Montpellier.
Enseignant au département informatique de la Faculté des Sciences.
Membre de l'équipe ALgorithmes de Graphes et COmbinatoire (AlGCo) du LIRMM.

   Coordonnées

LIRMM
161 rue Ada
34095 Montpellier Cedex 5
FRANCE 		        
Bureau E318
Téléphone: 04 67 41 85 44
Fax: +00 33 (0)4 67 41 85 85
Email: Stephane.Bessy@lirmm.fr

   Thèmes de recherche

Théorie des graphes, algorithmique, optimisation combinatoire.

   Enseignement


Parcours Maths/Info de la Licence Info
HLIN508: Fondements de l'algorithmique    HLIN505: Modelisation et Poo (Td/Tp)
HMIN223: Graphes et Structures HMIN333: Graphes, algorithmique, complexité
HMIN235A: Algorithmique géométrique Oral 1, CAPES info     

   Travaux scientifiques

  1. Bounds on the burning number, S. Bessy, A. Bonato, J. C. M. Janssen, D. Rautenbach, E. Roshanbin. Discrete Applied Mathematics, 235, pp. 16-22 (2018).
  2. Triangle Packing in (Sparse) Tournaments: Approximation and Kernelization, S. Bessy, M. Bougeret, J. Thiebaut. ESA 2017, 14, pp. 1-14 (2017).
  3. The Geodetic Hull Number is Hard for Chordal Graphs, S. Bessy, M. Costa Dourado, L. Draque Penso, D. Rautenbach. Electronic Notes in Discrete Mathematics, LAGOS 2017, 62, pp. 291-296 (2017).
  4. Extremal Values of the Chromatic Number for a Given Degree Sequence, S. Bessy, D. Rautenbach. Graphs and Combinatorics , 33(4), pp. 789-799 (2017).
  5. Burning a graph is hard, S. Bessy, A. Bonato, J.C. M. Janssen, D. Rautenbach, E. Roshanbin. Discrete Applied Mathematics, 232, pp. 73-87 (2017).
  6. Bounds on the Exponential Domination Number, S. Bessy, P. Ochem, D. Rautenbach. Discrete Mathematics, 340(3), pp. 494-503 (2017).
  7. Colorful paths for 3-chromatic graphs, S. Bessy and N. Bousquet, Discrete Mathematics, 340(5), pp. 1000-1007 (2017).
  8. Antistrong digraph, J. Bang-Jensen, S. Bessy, B. Jackson, M. Kriesell. Journal of Combinatorial Series B, 122, pp. 68-90 (2017).
  9. Exponential domination in subcubic graphs, S. Bessy, P. Ochem and D. Rautenbach, Electronics of Journal Combinatorics, 23(4), pp. 4.42 (2016).
  10. Two floor building needing 8 colors, S. Bessy, D. Goncalves and J.-S. Sereni, Journal of Graph Algorithms Appl., 19(1), 1--9 (2015).
  11. On independent set on B1-EPG graphs, S. Bessy, M. Bougeret, D. Gonçalves and C. Paul, Conference WAOA 2015, 158--169 (2015).
  12. Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles, J. Bang-Jensen and S. Bessy, Journal of Graph Theory, 79(4), 249--266 (2015).
  13. Disjoint 3-cycles in tournaments: a proof of the Bermond-Thomassen conjecture for tournaments, J. Bang-Jensen, S. Bessy and S. Thomassé, Journal of Graph Theory, 75(3), 284--302 (2014).
  14. (Arc-)disjoint flows in networks , J. Bang-Jensen and S. Bessy, Theor. Comput. Sci., 526: 28--40 (2014).
  15. Enumerating the edge-colourings and total colourings of a regular graph, S. Bessy and F. Havet, Journal of combinatorial Optimization, 25 (4), 523--535 (2013).
  16. Polynomial kernels for Proper Interval Completion and related problems, S. Bessy and A. Perez, Information and Computation, 231: 89--108, (2013), and actes de Fundamentals of Computation Theory 11, Oslo, Volume 6914 (2011), pp 229--239.
  17. Polynomial kernels for 3-leaf power graph modification problems, S. Bessy, C. Paul, A. Perez, Discrete Applied Mathematics, 158: 1732--1744 (2010), and actes de IWOCA 2009 Volume 5874: 72--82, (2009).
  18. Optical index of fault tolerant routings in WDM networks. S. Bessy, C. Lepelletier, Networks, 56 (2): 95--102, (2010).
  19. Partitionning a graph into a cycle and an anticycle, a proof of Lehel's conjecture, S.Bessy, S. Thomassé, Journal of Combinatorial Theory Serie B, 100 (2): 176--180 (2010).
  20. Two proofs of Bermond-Thomassen conjecture for regular tournaments S. Bessy, N. Lichiardopol, J.-S. Sereni, Discrete Mathematics, 310 (3): 557--560 (2010), and
        6th Czech-Slovak International Symposium on Combinatorics (2006).
  21. Kernels for Feedback Arc Set In Tournaments, S.B., F.V. Fomin, S. Gaspers, C. Paul, A. Perez, S. Saurabh, S.Thomassé, Journal of Computer and System Sciences, 77 (6): 1071--1078 (2011), and actes de FSTTCS 2009: 37--47, Kampur, India.
  22. Paths partition with prescribed sources in digraphs, a Chvátal-Erdös condition approach, S. Bessy. Discrete Mathematics, Volume 308 (18): 4108--4115 (2008).
  23. Spanning a strong digraph with alpha cycles: a conjecture of Gallai, S.Bessy, S. Thomassé. Combinatorica, 27 (6): 659--667 (2007), et actes de IPCO X 2004, New-York.
  24. Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree, S.Bessy, E. Birmelé, F. Havet. Journal of Graph Theory, 53 (4): 315--332 (2006).
  25. The categorical product of two 5-chromatic digraphs can be 3-chromatic, S.Bessy, S. Thomassé. Note, Discrete Mathematics, 305 (1-3): 344--346 (2005).
  26. 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: 289--299 (2003).
----------------------------------------------------------------------- le trophe d equipe

   Divers

- Liens