# Pavol Hell Information

*https://en.wikipedia.org/wiki/Pavol_Hell*

**Pavol Hell** is a Canadian
mathematician and
computer scientist, born in Czechoslovakia. He is a professor of computing science at
Simon Fraser University. Hell started his mathematical studies at
Charles University in Prague, and moved to Canada in August 1968 after the Warsaw Pact invasion of Czechoslovakia. He obtained his MSc from
McMaster University in Hamilton, under the joint supervision of Gert Sabidussi and Alex Rosa, and his PhD at the
Universite de Montreal, with Gert Sabidussi. In his PhD research he pioneered, on the suggestion of Gert Sabidussi, the study of graph retracts. He describes his area of interest as "computational combinatorics", including
algorithmic
graph theory and complexity of graph problems. His current focus is on nicely structured graph classes, and on the complexity of various versions of
graph homomorphism problems.

Hell has written the book *Graph and Homomorphisms*
^{
[1]} with his long-term collaborator
Jaroslav Nešetřil, and many highly cited papers, including "On the complexity of H-coloring"^{
[2]} also with Nešetřil, "On the history of the minimum spanning tree problem",^{
[3]} with
Ron Graham, "On the completeness of a generalized matching problem"
^{
[4]} with
David Kirkpatrick, and "List homomorphisms and circular arc graphs"^{
[5]} with Tomas Feder and Jing Huang. He is a managing editor of the *Journal of Graph Theory*, and was named a
fellow of the
Society for Industrial and Applied Mathematics (SIAM) in 2012.^{
[6]}

## References

**^**Hell, Pavol; Nešetřil, Jaroslav (2004).*Graphs and homomorphisms*(Repr. ed.). Oxford: Oxford University Press. ISBN 978-0-19-852817-3.**^**Hell, P.; Nešetřil, J. (1990). "On the complexity of H-coloring".*J. Comb. Theory B*.**48**(1): 92–110. doi: 10.1016/0095-8956(90)90132-J.**^**Graham, R.L.; Hell, P. (1985). "On the history of the minimum spanning tree problem".*Annals of the History of Computing*.**7**(1): 43–57. doi: 10.1109/MAHC.1985.10011. S2CID 10555375.**^**Hell, P.; Kirkpatrick, D.G. (1978). "Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78".*STOC*. pp. 240–245. doi: 10.1145/800133.804353.**^**Feder, T.; Hell, P.; Huang, Jing (1999). "List homomorphisms and circular arc graphs".*Combinatorica*.**19**(4): 487–505. CiteSeerX 10.1.1.22.5758. doi: 10.1007/s004939970003. S2CID 8316302.**^**Fellow of the Society for Industrial and Applied Mathematics (SIAM) in 2012