The Challenge committee consisted of Vasek Chvatal, Rutgers University, Bill Cook, Bell Communications Research, David Johnson, AT&T Bell Laboratories, Cathy McGeoch, Amherst College, Bob Tarjan, Princeton University, and Michael Trick, DIMACS Visiting Fellow/Carnegie Mellon University, who was the Challenge Coordinator.
After an initial call for participation and two rounds of screening, papers were presented at a conference held at DIMACS in October, 1993. For a copy of the conference program, including author contact addresses, press here.
There were a large number of instances collected on the three problem types. The listing of instances for clique, coloring, and satisfiability. The TeX source is also available for clique, coloring, and satisfiability. These require the LaTeX style file supertab.sty.
You can access these instances at the Second DIMACS Challenge FTP Directory. There are also proposals, bibliographies, and other files available. An index is available.
Current plans include the publication of a conference volume as part of the DIMACS Series in Discrete Mathematics and Theoretical Computer Science, published by the American Mathematical Society. This volume should appear late 1994 or early 1995.
The First DIMACS Challenge addressed network optimization and matching. The Third DIMACS Challenge (currently underway) looks at parallel algorithms.
trick+@cmu.edu