Gena Hahn
- Professeur titulaire
-
Faculté des arts et des sciences - Département d'informatique et de recherche opérationnelle
André-Aisenstadt office 3351
Télécopieur : 514 343-5834
Web : LinkedIn
Web : Autre site web
Web : Autre site web
Ph.D.
1981
, Mathématiques fondamentales , Université McMaster (Canada)
Doctorat d'état
1986
, Informatique , Université de Paris-Sud (France)
Affiliations
- Membre – CRM — Centre de recherches mathématiques
Education Programs
- Fundamental and Applied Sciences Information and Communication Technologies
- Fundamental and Applied Sciences Information and Communication Technologies
- Fundamental and Applied Sciences Information and Communication Technologies
- Fundamental and Applied Sciences
- Fundamental and Applied Sciences
- Fundamental and Applied Sciences
- Fundamental and Applied Sciences
- Fundamental and Applied Sciences
- Fundamental and Applied Sciences
- Fundamental and Applied Sciences Health Sciences Life Sciences
- Fundamental and Applied Sciences Health Sciences Life Sciences
- University Preparatory Programs
- Fundamental and Applied Sciences Information and Communication Technologies
Courses
- IFT2105 Introduction à l'informatique théorique
- IFT3150 Projet d'informatique
- IFT3545 Graphes et réseaux
- IFT6580 Sujets en optimisation
Areas of Expertise
- Graph algorithms
- Graph algorithms
- Graph coloring
- Cayley graph
- Infinite graphs
- Graph homomorphism
- Pursuit-evasion
- Discreet Mathematics
- Graphs Symmetry
- Graph theory
My main interest is graph theory and related areas, such as combinatorics, algorithms and complexity, communication in interconnection networks. I like theoretical and structural results that lead to better understanding. I do and will think about many different problems.
Responsabilities and outreach Expand all Collapse all
Student supervision Expand all Collapse all
Cycle : Master's
Grade : M. Sc.
Research projects Expand all Collapse all
Centre de recherches mathématiques (CRM) Projet de recherche au Canada / 2022 - 2029
Graph searching structural properties Projet de recherche au Canada / 2017 - 2026
Supplément COVID-19 CRSNG_Graph searching structural properties Projet de recherche au Canada / 2020 - 2021
GRAPH SEARCHING AND APPLICATIONS Projet de recherche au Canada / 2012 - 2018
CENTRE DE RECHERCHES MATHEMATIQUES (CRM) Projet de recherche au Canada / 2008 - 2016
Publications Expand all Collapse all
B. Bagheri, G. Hahn, A note on the circuit double cover of infinite graphs, Journal of Combinatorics, accepted 2016
A. Bonato, G. Hahn, C. Tardif, « Large classes of infinite k-cop-win graphs », Journal of Graph Theory 65 (2010), 334 - 342
G. Hahn, G. MacGillivray, « A characterisation of k-cop-win graphs and digraphs », Discrete Mathematics 306 (2006), 2492 - 2497
G. Hahn, F. Laviolette, N. Sauer, R.E. Woodrow, «On cop-win graphs», Discrete Mathematics 258 (2002), pp. 27 - 41
G. Hahn, J. Siran, D. Sotteau, «On the injective chromatic number of graphs », Discrete Mathematics 256 (2002), pp. 179 - 192
G. Hahn, C. Tardif, «Graph homomorphisms: structure and symmetry», in Graph symmetry, ASI ser C, Kluwer, 1997, pp. 107 -- 166
G. Hahn, P. Hell, S. Poljak, «On the ultimate independence ratio», European Journal of Combinatorics 16 (1995), pp. 253 - 261
G. Hahn, E. Milner, R.E. Woodrow, «Infinite Friendship Graphs with Infinite Parameters», Journal of Combinatorial Theory (B) 52 (1991) pp. 30 - 41
M. Farber, G. Hahn, P. Hell, D. Miller, «Concerning the achromatic number of graphs», Journal of Combinatorial Theory (B) 40 (1986) pp. 21 - 39
Media
Browse this profile on: