ma trombine

Stéphane Bessy

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

   Coordonnées

LIRMM
161 rue Ada
34392 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


Licence Informatique, parcours Math-Info
GLIN501: algo de graphes           GLIN503: Réseaux (Td/Tp)
FMIN215: algo géo           GLMA605 Math du Web

   Encadrement doctoral:

- Nicolas Bousquet (2011-..., co-encadrement avec S. Thomassé).
- Anthony Perez (2008-2011, co-encadrement avec C. Paul), maître de conférences à l'Université d'Orléans.

   Travaux scientifiques

  1. J. Bang-Jensen, S. Bessy and S. Thomassé, Disjoint 3-cycles in tournaments: a proof of the Bermond-Thomassen conjecture for tournaments, accepted for publication in Journal of Graph Theory, 2012 .
  2. S. Bessy and F. Havet Enumerating the edge-colourings and total colourings of a regular graph, Journal of combinatorial Optimization, 25 (4), 2013, 523--535.
  3. S. Bessy and A. Perez, Polynomial kernels for Proper Interval Completion and related problems. Fundamentals of Computation Theory Lecture Notes in Computer Science, Volume 6914, 2011, pp 229--239, accepted for publication in Information and Computation, 2012.
  4. S. Bessy, C. Paul, A. Perez, Polynomial kernels for 3-leaf power graph modification problems. IWOCA 2009, Lecture Notes in Computer Science, Volume 5874, 2009, 72--82, et Discrete Applied Mathematics, 158 (2010) pp. 1732-1744 .
  5. S. Bessy, C. Lepelletier, Optical index of fault tolerant routings in WDM networks. Networks, 56 (2), 2010, 95--102.
  6. S. Bessy, S. Thomassé, Partitionning a graph into a cycle and an anticycle, a proof of Lehel's conjecture. Journal of Combinatorial Theory Serie B, 100 (2), 2010, 176--180.
  7. S. Bessy, N. Lichiardopol and J.-S. Sereni, Two proofs of Bermond-Thomassen conjecture for regular tournaments. Discrete Mathematics, 310 (3), 2010, 557--560, and 6th Czech-Slovak International Symposium on Combinatorics (2006).
  8. S. Bessy, F.V. Fomin, S. Gaspers, C. Paul, A. Perez, S. Saurabh, S.Thomassé, Kernels for Feedback Arc Set In Tournaments. FSTTCS 2009: 37-47, et Journal of Computer and System Sciences, 77 (6), 2011, 1071--1078.
  9. S. Bessy, Paths partition with prescribed sources in digraphs, a Chvátal-Erdös condition approach. Discrete Mathematics, Volume 308 (18), 2008, 4108--4115
  10. S. Bessy, S. Thomassé, Spanning a strong digraph with alpha cycles: a conjecture of Gallai. Combinatorica, 27 (6), 2007, 659--667 and Lecture Notes in Computer Science, Vol. 3064, Springer-Verlag, Actes de IPCO X 2004.
  11. S. Bessy, E. Birmelé, F. Havet, Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree. Journal of Graph Theory, 53 (4), 2006, 315--332.
  12. S. Bessy, S. Thomassé, The categorical product of two 5-chromatic digraphs can be 3-chromatic. Note, Discrete Mathematics, 305 (1-3), 2005, 344--346.
  13. S.Bessy, S.Thomassé, Every strong digraph has a spanning strong subgraph with at most n+2α-2 arcs. Journal of Combinatorial Theory, Series B, 87, 2003, 289--299.

   Divers

- Liens