معرفی
Gena HAHN is a Full Professor at the Department of Computer Science and Operations Research, Faculty of Arts and Sciences at the University of Montreal. She holds a Ph.D. in Mathematics from McMaster University (1981) and a Doctorat d'État in Computer Science from Paris-Sud University (1986). Her research focuses on graph theory, combinatorics, algorithms, and infinite graphs, with a particular interest in theoretical and structural results. She has supervised numerous graduate students in discrete mathematics and related fields.
Affiliations include the Centre de Recherches Mathématiques (CRM) and the Laboratoire d'Informatique Théorique et Quantique (LITQ). She teaches courses such as Graphs and Networks (IFT3545) and Topics in Optimization (IFT6580). Notable grants include leadership in the CRSNG-funded 'GRAPH SEARCHING AND APPLICATIONS' (2012–2018) and contributions to the CRM strategic research network (2008–2029).
Her research explores cops-and-robbers games on graphs and structural properties of infinite graphs. Over 30 students have been supervised, with many focusing on graph algorithms, graph coloring, and pursuit-evasion games. Her work bridges theoretical computer science and discrete mathematics, emphasizing foundational contributions to graph theory.
