With acknowledgement of additional support from IBM.
Friday, September 19, 2014 (talks will be held in the CoRE Auditorium - first floor of the CoRE building)
12:00 - 12:50 Lunch (4th floor lounge)
12:50 - 1:00 Opening Hoffman Fest
Rebecca Wright, Director of DIMACS
Vasek Chvatal, Concordia University
Session 1: Bill Pulleyblank (Chair)
1:00 - 2:00 Coloring graphs with no odd holes
Paul Seymour, Princeton University
2:00 - 2:45 Lines and closure lines in metric spaces
Vasek Chvatal, Concordia University
2:45 - 3:30 On-line decision problems with exponentially many experts
Richard Karp, University of California, Berkeley
3:30 - 4:00 Coffee break
Session 2: Baruch M. Schieber (Chair)
4:00 - 5:00 NP ≠ NP ∩ coNP = P
Jack Edmonds, York University
5:00 - 5:45 On the singularity of matrices
Don Coppersmith, IEEE
5:45 - 6:30 Inversions by descents/ascents and symmetric integral matrices
Richard Brualdi, University of Wisconsin-Madison
6:45 Dinner (4th floor lounge)
Saturday, September 20, 2014
8:00 - 9:00 Breakfast (4th floor lounge)
Session 3: Vasek Chvatal (Chair)
9:00 - 9:45 Tuza's Conjecture is asymptotically tight for dense graphs
Jeff Kahn, Rutgers University
9:45 - 10:30 A simple, greedy approximation algorithm for the maximum satisfiability problem
David Williamson, Cornell University
10:30 - 11:00 Coffee break
Session 4: Bill Cook (Chair)
11:00 - 12:00 Primal-dual algorithms for weighted path and cut packing
Thomas McCormick
12:00 - 12:45 Graceful labeling of trees and integer programming
Bill Pulleyblank, US Military Academy
Previous: Participation
Next: Registration
Workshop Index