RIT Computer Science

Combinatorial Computing
Fall 2011


Stanislaw Radziszowski

bldg. 70B, room 3657,
(585) 475-5193, spr@cs.rit.edu
Office hours: M 5-6pm, TR 8-9pm (if nobody comes by 8:15pm I may go home), or send email

Tuesday/Thursday 4-6pm, 70-3455


This course will explore the possibilities and limitations of effective computations in combinatorics. The first half of the course will cover classical algorithms in combinatorial computing, together with the problems of generation, enumeration and manipulation of various types of combinatorial objects (graphs and finite set systems). The second part will concentrate on computational techniques for the search of different combinatorial configurations: Ramsey numbers, t-designs, Turan coverings, Folkman colorings and others. A number of topics suitable for further independent study, project or thesis development will be discussed.

Students will write a term paper, either theoretical based on literature or reporting student's own implementation or experiments with a chosen combinatorial problem. Depending on the size of the group, some or all students will give a presentation to the class.


Prerequisite: VCSG-800/VCSS-515, Algorithms


  1. Combinatorial objects
  2. Backtracking
  3. Heuristic searches for combinatorial configurations
  4. Basis reduction
  5. Computations in Ramsey theory
  6. Computations in design theory
  7. Student presentations


The evaluation of undergraduate and graduate students will be based on the same items, except that specific requirements of some will be more extensive for graduate students. This may include more difficult requirements for programming assignments and additional problems on standard homeworks.