Pavol Hell is a Professor of Computing Science at Simon Fraser University, Burnaby, Canada. He received his PhD from the Université de Montreal in 1973, under the supervision of Gert Sabidussi. Prior to joining SFU, Hell was with Rutgers University in New Brunswick, New Jersey. He is a Visiting Professor at Charles University in Prague and has held other visiting positions at a number of universities in Brazil, France, Italy, and the Czech Republic. He is a managing editor of the Journal of Graph Theory, and a SIAM Fellow, class of 2012. His research interests focus on algorithmic graph theory, especially the complexity of homomorphism problems.
- Counting Complexity and Phase Transitions, Spring 2016. Visiting Scientist.