(The following program was derived from an email announcement by Eli Goodman. It is almost the actual order of events; a few talks were rescheduled at the conference. -Jeff)

Program for the
AMS-IMS-SIAM Joint Summer Research Conference*

Discrete and Computational Geometry:
Ten Years Later

Mount Holyoke College, South Hadley, Massachusetts
July 13-19, 1996

Organizing Committee:
Bernard Chazelle
Jacob E. Goodman (co-chair)
Joseph O'Rourke
Janos Pach
Richard Pollack (co-chair)

Saturday, July 13: Arrival Day

5:00-8:00 P.M.:
Registration (or 8:00 A.M.-5:00 P.M. on other days)
6:15-7:45 P.M.:
Dinner

Sunday, July 14

7:30-8:30 A.M.:
Breakfast
9:00-10:00 A.M.:
Victor Klee (University of Washington)
Computational Convexity
10:00-10:30 A.M.:
Coffee break
10:30-11:30 A.M.:
Joseph O'Rourke (Smith College)
Visibility and Illumination
11:45 A.M.-12:15 P.M.:
Louis Billera (Cornell University)
Enumerative Properties of Arrangements
12:30-1:30 P.M.:
Lunch
1:30-3:30 P.M.:
Break for informal discussion (3:00-3:30 coffee)
3:30-4:30 P.M.:
Janos Pach (Courant Institute and City University of New York)
Extremal Problems in Combinatorial Geometry
4:45-5:15 P.M.:
Boris Aronov (Polytechnic University)
Visibility with Multiple Reflections
5:20-5:50 P.M.:
Karoly Bezdek (Eotvos University, Budapest)
Isoperimetric Inequalities and the Dodecahedral Conjecture Revisited
6:15-7:45 P.M.:
Dinner
8:00-10:00 P.M.:
Reception

Monday, July 15

7:30-8:30 A.M.:
Breakfast
9:00-10:00 A.M.:
Branko Grünbaum (University of Washington)
Polygons and Polyhedra
10:00-10:30 A.M.:
Coffee break
10:30-11:30 A.M.:
Rephael Wenger (Ohio State University)
Geometric Transversal Theory
11:45 A.M.-12:15 P.M.:
Jörg Wills (Siegen University)
Sphere Packings and Crystal Growth
12:30-1:30 P.M.:
Lunch
1:30-3:30 P.M.:
Break for informal discussion (3:00-3:30 coffee)
3:30-4:30 P.M.:
Jiri Matousek (Charles University, Pragü)
Randomization and De-randomization
4:35-5:05 P.M.:
Imre Barany (Hungarian Academy of Sciences)
Affine Perimeter and Limit Shape
5:10-5:40 P.M.:
David Bremner (McGill) and Raimund Seidel (Saarbrücken)
On the Difficulty of Vertex- and Facet-Enumeration
5:45-6:00 P.M.:
Helge Tverberg (University of Bergen)
Proof of Reay's Conjecture on Certain One-Dimensional Intersections
6:15-7:45 P.M.:
Dinner
8:00-8:50 P.M.:
Jürgen Richter-Gebert (Technical University, Berlin)
Universality Theorems for Oriented Matroids and Polytopes
9:00 P.M.- :
Problem session

Tuesday, July 16

7:30-8:30 A.M.:
Breakfast
9:00-10:00 A.M.:
Micha Sharir (Tel Aviv University)
Complexity of Arrangements
10:00-10:30 A.M.:
Coffee break
10:30-11:30 A.M.:
Marjorie Senechal (Smith College)
Periodic and Non-Periodic Tilings
11:45 A.M.-12:15 P.M.:
Pankaj K. Agarwal (Duke University)
Approximating Shortest Paths on a Convex Polytope in Three Dimensions
12:30-1:30 P.M.:
lunch
1:30-?? P.M.:
Free time for excursion, hike, etc.
6:15-7:45 P.M.:
Dinner (for those not eating away)

Wednesday, July 17

7:30-8:30 A.M.:
Breakfast
9:00-10:00 A.M.:
Marie-Francoise Roy (University of Rennes)
Interactions between Real Algebraic Geometry and Discrete and Computational Geometry
10:00-10:30 A.M.:
Coffee break
10:30-11:30 P.M.:
Günter M. Ziegler (Technical University, Berlin)
Recent Progress on Polytopes
11:45 A.M.-12:15 P.M.:
Vladimir Boltyanski (Steklov Institute and CIMAT)
Fixing and Hindering Systems for Convex Bodies
12:30-1:30 P.M.:
Lunch
1:30-3:00 P.M.:
Break for informal discussion (2:30-3:00 coffee)
3:00-4:00 P.M.:
Joel Spencer (Courant Institute)
Geometric Discrepancy Theory
4:10-4:40 P.M.:
Neil J. A. Sloane (AT&T Research)
New Results on Packings in Grassmannian Space and Connections with Quantum-error-correcting Codes
4:45-5:15 P.M.:
Hubert de Fraysseix (CNRS, Paris)
Intersection Graphs of Jordan Arcs
5:20-6:00 P.M.:
Robert Connelly (Cornell University)
The Bellows Conjecture
6:15-7:45 P.M.:
Dinner
8:00-8:30 P.M.:
Jesus de Loera (The Geometry Center, Minneapolis)
Computing Combinatorial Models of Real Smooth Algebraic Varieties: demo/talk
8:45-9:30 P.M.
Jürgen Richter-Gebert (Technical University, Berlin) Cinderella, a program for geometric drawing and automated theorem proving (demo)

Thursday, July 18

7:30-8:30 A.M.:
Breakfast
9:00-10:00 A.M.:
Herbert Edelsbrunner (University of Illinois)
Computational Topology
10:00-10:30 A.M.:
Coffee break
10:30-11:30 A.M.:
Gabor Fejes Toth (Hungarian Academy of Sciences, Budapest)
Recent Progress on Packing and Covering
11:45 A.M.-12:15 P.M.:
Saugata Basu (Courant Institute)
Bounding the Topological Complexity of Semi-Algebraic Sets
12:30-1:30 P.M.:
Lunch
2:00-3:00 P.M.:
Bernard Chazelle (Princeton University)
Computational Geometry-The Next Ten Years
3:00-3:30 P.M.:
Coffee break
3:30-4:00 P.M.:
Thomas Hales (University of Michigan)
Recent Progress on the Kepler Conjecture
4:10-4:40 P.M.:
Andreas Brieden (University of Trier)
A Polynomial-Time Approximation Technique for Norm-Maximization
4:45-5:15 P.M.:
Karoly Bezdek (Eotvos University, Budapest)
Isoperimetric Inequalities and the Dodecahedral Conjecture Revisited
5:20-5:50 P.M.:
Steven Fortune (Bell Laboratories)
Algorithms for Prediction of Indoor Radio Propagation
6:15-7:45 P.M.:
Dinner

Friday, July 19: Departure Day

7:30-8:30 A.M.:
Breakfast

*Note: This conference has been organized with the generous support of the National Science Foundation, the National Security Agency, and Springer-Verlag.

Thanks to Eli Goodman for making this program available.