School of Computing Science
Simon Fraser University
BURNABY, B.C., Canada V5A 1S6
phone 778-782-3391, fax 778-782-3045
email address for use by humans:
pavol at (the little spiral) sfu (stands for Simon Fraser University)
dot (machines, are you confused yet ?) ca (for Canada)
Journal of Graph Theory (Managing Editor)
Discrete Applied Mathematics
The sequence of ancestors in the
Mathematics Genealogy Project.
Erdös Number Project
Graphs with Fixed Degree and Diameter
Large Planar Graphs with
Fixed Degree and Diameter
Data Base of
Photo of Claude Berge, 1971
Space complexity of list H-colouring: a dichotomy (updated version)
(with L. Egri, B. Larose, and A. Rafiey).
Ordering without forbidden patterns (updated version)
(with B. Mohar and A. Rafiey).
Colouring, constraint satisfaction, and complexity,
(with J. Nesetril), Computer Science Review 2 (2008) 143--163.
List partitions (with T. Feder, S. Klein, and R. Motwani),
SIAM J. Discrete Math., 16 (2003) 449-478
Thirty First Annual ACM Symposium on Theory of Computing 1999, pp.464-472
List homomorphisms to reflexive graphs (with
J. Combinatorial Theory B
72 (1998) 236 - 250.
Duality and polynomial testing of tree homomorphisms
(with J. Nesetril and X. Zhu)
Trans. Amer. Math. Soc. 348 (1996) 1281-1297
On the complexity of H-colouring (with J. Nesetril),
J. Combinatorial Theory B 48 (1990) 92-110
On the history of the minimum spanning tree problem
(with Ron L. Graham),
Annals of the History of Computing
7 (1985) 43 - 57
Sorting and graphs
(with B. Bollobas), Invited Chapter in `Graphs and Order',
D. Reidel ASI Series 147 (1985) 169 - 184
On the complexity of general graph factor problems,
(with D.G. Kirkpatrick),
SIAM J. Computing 12 (1983) 601 - 609.
Parallel sorting with constant time for comparisons
(with Roland Haggkvist),
SIAM J. Computing 10 (1981) 465 - 472
An introduction to the category of graphs, Annals of the N.Y. Acad. Sc. 328 (1979) 120 - 136
Back to Faculty