RIT Computer Science

Topics in Advanced Algorithms -
Combinatorial Computing
CSCI-761, Spring 2019


Stanisław Radziszowski

bldg. 70B, room 3657,
(585) 475-5193, spr@cs.rit.edu
office hours: TR 6:20pm-8pm, or send email


Tuesday/Thursday, 5:00pm-6:15pm, room 70-1455

General Course Documents

College course document, and common RIT policies and calendar.


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.


Prerequisites: CSCI-665 or ((CSCI-261 or CSCI-264) and permission of the instructor)



  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

Useful Links