office bldg. 70B room 3657
phones (585) 475-5193 * fax (585) 475-4935
publications by time or
theses/projects of MS advisees, topics/problems to work on
up to: CS faculty * CS department * College of Computing * RIT * Rochester NY
My main interest is in combinatorial computing - solving classical problems in combinatorics, graph theory and design theory, usually with the help of massive computations. Bounds on Ramsey numbers are my favorite. The survey of Small Ramsey Numbers is a regularly updated living article in Dynamic Surveys of the Electronic Journal of Combinatorics. Jointly with Brendan McKay, we have computed the Ramsey number R(4,5)=25 ( paper / picture ) and improved upper bounds for R(5,5) and R(4,6). For multicolor numbers, a joint work with Susan Fettes and Richard Kramer led to a new upper bound R(3,3,3,3) <= 62. And more ...
Computational Ramsey Theory at RIT page. House of Graphs containing many interesting Ramsey graphs, designed and maintained by Jan Goedgebeur at the University of Ghent. Lectures on Combinatorial Computing and Cryptography in Gdańsk.
My other favorite field are computations in the design theory. We know that 4-(12,6,6) designs do not exist. Many people for a long time were trying to decide whether 2-(22,8,4) designs exist. One related project used more than a century of cpu time. In Spring 2006 we learned that it does not exist. Check the complete list of my publications for other papers (most of them in postscript and/or pdf). From 1991 to 2009, I was organizing the CS Colloquia Series ( html | ps | tiny-ps | tiny-pdf best viewed with 1600% zoom ).
I was born in Gdańsk, Poland. In 1980, I have earned Ph.D. from the Institute of Informatics at the University of Warsaw. During 1980-1984 I worked in IIMAS at the National Autonomous University of Mexico ( UNAM ) in Mexico City, and since the Fall of 1984 at the RIT.