| 词条 | 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]References1. ^{{cite book|last=Hell|first=Pavol|title=Graphs and homomorphisms|date=2004|publisher=Oxford University Press|location=Oxford|isbn=978-0-19-852817-3|url=http://ukcatalogue.oup.com/product/9780198528173.do|edition=Repr.|author2=Nešetřil, Jaroslav}} 2. ^{{cite journal|last1=Hell|first1=P.|last2=Nešetřil|first2=J.|title=On the complexity of H-coloring|journal=J. Comb. Theory B|date=1990|volume=48|issue=1|pages=92–110|doi=10.1016/0095-8956(90)90132-J}} 3. ^{{cite journal|last1=Graham|first1=R.L.|last2=Hell|first2=P.|title=On the history of the minimum spanning tree problem|journal=Annals of the History of Computing|date=1985|volume=7|issue=1|pages=43–57|doi=10.1109/MAHC.1985.10011}} 4. ^{{cite conference |url= |title= On the completeness of a generalized matching problem|last1=Hell |first1=P. |last2=Kirkpatrick |first2=D.G. |date=1978 |booktitle=STOC |pages=240–245 |doi=10.1145/800133.804353 }} 5. ^{{cite journal|last1=Feder|first1=T.|last2=Hell|first2=P.| last3=Huang|first3=Jing|title=List homomorphisms and circular arc graphs|journal= Combinatorica|date=1999|volume=19|issue=4|pages=487–505|doi=10.1007/s004939970003|citeseerx=10.1.1.22.5758}} 6. ^Fellow of the Society for Industrial and Applied Mathematics (SIAM) in 2012 External links
11 : Year of birth missing (living people)|Living people|Czech mathematicians|Czech computer scientists|Canadian mathematicians|Canadian computer scientists|Graph theorists|McMaster University alumni|Université de Montréal alumni|Simon Fraser University faculty|Fellows of the Society for Industrial and Applied Mathematics |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。