Knowledge (XXG)

Pavol Hell

Source 📝

288: 353: 46:, 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 348: 85: 343: 68:, and many highly cited papers, including "On the complexity of H-coloring" also with Nešetřil, "On the history of the minimum spanning tree problem", with 328: 323: 116: 313: 338: 53:
and complexity of graph problems. His current focus is on nicely structured graph classes, and on the complexity of various versions of
318: 38:
in Prague, and moved to Canada in August 1968 after the Warsaw Pact invasion of Czechoslovakia. He obtained his MSc from
194:
Hell, P.; Kirkpatrick, D.G. (1978). "Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78".
76:, and "List homomorphisms and circular arc graphs" with Tomas Feder and Jing Huang. He is a managing editor of the 333: 65: 31: 308: 228: 43: 293: 73: 233: 39: 246: 176: 54: 35: 27: 112: 263: 42:
in Hamilton, under the joint supervision of Gert Sabidussi and Alex Rosa, and his PhD at the
238: 199: 168: 141: 287: 219:
Feder, T.; Hell, P.; Huang, Jing (1999). "List homomorphisms and circular arc graphs".
159:
Graham, R.L.; Hell, P. (1985). "On the history of the minimum spanning tree problem".
106: 302: 145: 69: 23: 180: 250: 50: 172: 47: 264:
Fellow of the Society for Industrial and Applied Mathematics (SIAM) in 2012
242: 204: 81: 30:, born in Czechoslovakia. He is a professor of computing science at 278: 132:
Hell, P.; Nešetřil, J. (1990). "On the complexity of H-coloring".
282: 72:, "On the completeness of a generalized matching problem" with 354:
Fellows of the Society for Industrial and Applied Mathematics
111:(Repr. ed.). Oxford: Oxford University Press. 86:Society for Industrial and Applied Mathematics 16:Canadian mathematician and computer scientist 8: 34:. Hell started his mathematical studies at 286: 349:Academic staff of Simon Fraser University 232: 203: 105:Hell, Pavol; NeÅ¡etřil, Jaroslav (2004). 97: 7: 161:Annals of the History of Computing 14: 329:Czechoslovak emigrants to Canada 64:with his long-term collaborator 1: 344:Université de Montréal alumni 324:Canadian computer scientists 146:10.1016/0095-8956(90)90132-J 314:Czechoslovak mathematicians 60:Hell has written the book 370: 339:McMaster University alumni 108:Graphs and homomorphisms 319:Canadian mathematicians 294:Journal of Graph Theory 173:10.1109/MAHC.1985.10011 78:Journal of Graph Theory 62:Graph and Homomorphisms 32:Simon Fraser University 44:Universite de Montreal 243:10.1007/s004939970003 205:10.1145/800133.804353 285:Bibliography Server 198:. pp. 240–245. 40:McMaster University 80:, and was named a 55:graph homomorphism 36:Charles University 28:computer scientist 134:J. Comb. Theory B 118:978-0-19-852817-3 74:David Kirkpatrick 66:Jaroslav NeÅ¡etřil 361: 290: 266: 261: 255: 254: 236: 216: 210: 209: 207: 191: 185: 184: 156: 150: 149: 129: 123: 122: 102: 88:(SIAM) in 2012. 369: 368: 364: 363: 362: 360: 359: 358: 334:Graph theorists 299: 298: 275: 270: 269: 262: 258: 218: 217: 213: 193: 192: 188: 158: 157: 153: 131: 130: 126: 119: 104: 103: 99: 94: 17: 12: 11: 5: 367: 365: 357: 356: 351: 346: 341: 336: 331: 326: 321: 316: 311: 301: 300: 297: 296: 291: 274: 273:External links 271: 268: 267: 256: 234:10.1.1.22.5758 227:(4): 487–505. 211: 186: 151: 124: 117: 96: 95: 93: 90: 22:is a Canadian 15: 13: 10: 9: 6: 4: 3: 2: 366: 355: 352: 350: 347: 345: 342: 340: 337: 335: 332: 330: 327: 325: 322: 320: 317: 315: 312: 310: 309:Living people 307: 306: 304: 295: 292: 289: 284: 280: 277: 276: 272: 265: 260: 257: 252: 248: 244: 240: 235: 230: 226: 222: 221:Combinatorica 215: 212: 206: 201: 197: 190: 187: 182: 178: 174: 170: 166: 162: 155: 152: 147: 143: 140:(1): 92–110. 139: 135: 128: 125: 120: 114: 110: 109: 101: 98: 91: 89: 87: 83: 79: 75: 71: 67: 63: 58: 56: 52: 49: 45: 41: 37: 33: 29: 25: 24:mathematician 21: 259: 224: 220: 214: 195: 189: 167:(1): 43–57. 164: 160: 154: 137: 133: 127: 107: 100: 77: 61: 59: 51:graph theory 19: 18: 48:algorithmic 303:Categories 279:Pavol Hell 92:References 70:Ron Graham 57:problems. 20:Pavol Hell 229:CiteSeerX 181:10555375 251:8316302 84:of the 249:  231:  179:  115:  82:fellow 247:S2CID 177:S2CID 283:DBLP 196:STOC 113:ISBN 26:and 281:at 239:doi 200:doi 169:doi 142:doi 305:: 245:. 237:. 225:19 223:. 175:. 163:. 138:48 136:. 253:. 241:: 208:. 202:: 183:. 171:: 165:7 148:. 144:: 121:.

Index

mathematician
computer scientist
Simon Fraser University
Charles University
McMaster University
Universite de Montreal
algorithmic
graph theory
graph homomorphism
Jaroslav Nešetřil
Ron Graham
David Kirkpatrick
fellow
Society for Industrial and Applied Mathematics
Graphs and homomorphisms
ISBN
978-0-19-852817-3
doi
10.1016/0095-8956(90)90132-J
doi
10.1109/MAHC.1985.10011
S2CID
10555375
doi
10.1145/800133.804353
CiteSeerX
10.1.1.22.5758
doi
10.1007/s004939970003
S2CID

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.

↑