All lectures will take place in the Mathematics building, Room M-101,
The Institute for Advanced Study, Princeton.

Monday, November 2, 1998
 

  9:15 - 10:00    Coffee/Tea/Muffins (Dining Room)

 10:00 - 11:00    Miki Simonovits: The regularity lemma and its applications
 
 11:15 - 11:45    Gabor Sarkozy: The Regularity Lemma and the Blow-up Lemma

 12:00 - 12:30    Raphy Yuster: Decomposing Hypergraphs with Hypertrees

  12:45 - 2:30    Lunch 

   2:30 - 3:00    Andrzej Rucinski: How to avoid the regularity lemma

   3:15 - 3:45    Yoshiharu Kohayakawa: Embeddings of small graphs in sparse 
                  regular graphs

   3:45 - 4:30    Tea/Coffee (Fuld Hall)

   4:30 - 5:00    Jeong Han Kim: Small Complete Arcs in Projective Planes

   5:15 - 5:45    Vijay Vazirani: Majorizing estimators and the approximation
                  of #P-complete problems


Tuesday, November 3, 1998

  9:15 - 10:00    Coffee/Tea/Muffins (Dining Room)

 10:00 - 10:45    Andrew Thomason: Colouring by hereditary properties

 11:00 - 11:30    Penny Haxell: Integer and fractional packings in dense graphs

 11:45 - 12:15    Lubos Thoma: On Dependent Arcs in Acyclic Orientations

  12:45 - 2:30    Lunch 

   2:30 - 3:00    Joel Spencer: Packing random rectangles

   3:00 - 3:45    Sarmad Abbasi: Spanning Subgraphs of Dense Graphs 

   3:45 - 4:30    Tea/Coffee (Fuld Hall)

   4:30 - 5:30    Open Problems

   6:30           Buffet Dinner (Dining Room)

Wednesday, November 4, 1998

  9:15 - 10:00    Coffee/Tea/Muffins (Dining Room)

 10:00 - 10:45    Ravi Kannan: Low rank Approximations, Regularity and 
                  Clustering

 11:00 - 11:30    Van Vu: On the list-chromatic number of locally sparse graphs

 11:45 - 12:30    Michael Krivelevich: Testing Bipartiteness Efficiently

  12:45 - 2:30    Lunch 

   2:30 - 3:00    Janos Komlos: Tiling Turan Theorems

   3:15 - 3:45    Hanno Lefmann: Independent Sets in Graphs and Hypergraphs 
                  and Applications

   3:45 - 4:30    Tea/Coffee (Fuld Hall)

   4:30 - 5:00    Andrzej Czygrinow: The algorithmic aspects of the hypergraph
                  regularity lemma

Previous: Participation

Next: Registration

Workshop Index

DIMACS Homepage