Stéphane Bessy

Stéphane Bessy is a Professor of Computer Science at the University of Montpellier, serving as Director of the Computer Science Department within the Faculty of Sciences. He is a member of the Graph Algorithms and Combinatorics (AlGCo) team at LIRMM (Laboratory of Informatics, Robotics, and Microelectronics of Montpellier). His research focuses on graph theory, directed graphs, algorithms, and combinatorial optimization.

Current teachings include Algorithmic 3, System, Algebra and Geometry, Probability and Statistics, Graphs and Structures, Graphs, Algorithms, Complexity, and Oral Preparation courses.

His publications explore topics such as cycle packing in tournaments, exponential domination in graphs, Wiener index optimization, and degree-constrained graph partitions. His work often intersects algorithmic complexity and structural graph theory.

Contact: Stephane.Bessy@lirmm.fr