DIMACS Workshop on New Directions in Algorithms, Combinatorics and Optimization:
A Conference Honoring the 65th Birthday of William T. Trotter
May 5 - 9, 2008
Georgia Institute of Technology
- Organizers:
- Graham Brightwell, London School of Economics, G.R.Brightwell at lse.ac.uk
- Dwight Duffus, Emory University, dwight at mathcs.emory.edu
- Stefan Felsner,Technische Universität Berlin, lastname at domain-math.tu-berlin.de
- Hal Kierstead, Arizona State University, kierstead at asu.edu
- Prasad Tetali, Georgia Institute of Technology, lastname at math dot gatech dot edu
- Robin Thomas, Georgia Institute of Technology, thomas at math.gatech.edu
- Peter Winkler, Dartmouth College, firstname dot lastname at dartmouth dot edu
- Xingxing Yu, Georgia Institute of Technology, yu at math.gatech.edu
Workshop Program:
Monday, May 5, 2008
7:30 - 8:45 Breakfast and registration
8:45 - 9:00 Opening Remarks
Dean Paul Houston
9:00 - 9:40 Perfect Matchings in Planar Cubic Graphs
Paul Seymour, Princeton University
9:40 - 10:20 A Dirac-Type Theorem for 3-Uniform Hypergraphs
Endre Szemeredi, Rutgers University
10:20 - 10:50 Coffee Break
10:50 - 11:30 K2,t Minors in Dense Graphs
Maria Chudnovsky, Columbia University
11:30 - 12:10 Some Recent Results on Random Matrices
Van Vu, Rutgers University
12:10 - 2:00 Lunch
2:00 - 2:40 Looking for 14-Cycles in the Cube
Zoltan Furedi, University of Illinois at Urbana-Champaign
2:40 - 3:20 On Graph Packing Theorems by Sauer and Spencer
Alexandr Kostochka, University of Illinois at Urbana-Champaign
3:20 - 3:50 Coffee Break
3:50 - 4:30 Three Problems in Extremal Set Theory
Dhruv Mubayi, Carnegie-Mellon University and University of Illinois at Chicago
4:30 - 5:10 Ramsey Numbers of Sparse Graphs and Hypergraphs
Benny Sudakov, University of California, Los Angeles
5:10 - 5:20 A Few Words About Tom Trotter
Fred Roberts, Rutgers University
5:15 Welcome Reception - Klaus Atrium: Poster Displays
Tuesday, May 6, 2008
8:00 - 9:00 Breakfast
9:00 - 9:40 Random Graphs and Branching Processes
Bela Bollobas, University of Cambridge and University of Memphis
9:40 - 10:20 The Erdos-Renyi Phase Transition
Joel Spencer, Courant Institute, New York University
10:20 - 10:50 Coffee Break
10:50 - 11:30 On Boltzmann Samplers and Properties of Combinatorial Structures
Angelika Steger, ETH Zurich
11:30 - 12:10 Cycles in Sparse Graphs
Jacques Verstraete, University of California, San Diego
12:10 - 2:00 Lunch
2:00 - 2:40 Numerically Accurate Solutions in Linear and Integer Programming
William Cook
2:40 - 3:20 Iterative Rounding in Graph Connectivity Problems
Kamal Jain
3:20 - 3:50 Coffee Break
3:50 - 4:30 Some Problems from the Past and Some Speculation about the Future
Dan Kleitman, Massachusetts Institute of Technology
4:30 - 5:10 Problem Session
Wednesday, May 7, 2008
8:00 - 9:00 Breakfast
9:00 - 9:40 Correlation Questions
Jeffry Kahn, Rutgers University
9:40 - 10:20 On Sperner's Lemma and Scarf's Lemma
Penny Haxell, University of Waterloo
10:20 - 10:50 Coffee Break
10:50 - 11:30 On Line Embeddings of Posets and Structures
Jaroslav Nesetril, Charles University Prague
11:30 - 12:10 Lattice Point Enumeration, Linear Extensions, and the Theory of Partitions
Carla Savage, North Carolina State University
12:10 - 2:00 Lunch
2:00 Free Afternoon Free Time
6:30 Banquet - Please register if you wish to attend
Klaus Atrium
Thursday, May 8, 2008
8:00 - 9:00 Breakfast
9:00 - 9:40 Distributed Monotonicity Reconstruction
Michael Saks, Rutgers University
9:40 - 10:20 Branched Polymers
Peter Winkler, Dartmouth College
10:20 - 10:50 Coffee Break
10:50 - 11:30 The PageRank of a Graph
Fan Chung Graham, University of California, San Diego
11:30 - 12:10 On-line Partitioning
Hal Kierstead, Arizona State University
12:10 - 2:00 Lunch
2:00 - 2:40 Geometric Representations of Graphs
Jan Kratochvil, Charles University, Prague
2:40 - 3:20 Extremal Problems for Convex Lattice Polytopes
Imre Barany, Alfred Renyi Mathematical Institute
3:20 - 3:50 Coffee Break
3:50 - 4:30 String Graphs and Partial Orders
Janos Pach, City College and Courant Institute, New York
4:30 - 5:10 On the Number of High Multiplicity Points for 1-Parameter Families of Curves
Miklos Simonovits, Mathematical Institute of Eötvös University
Friday, May 9, 2008
8:00 - 9:00 Breakfast
9:00 - 9:40 Large Families of Subsets Avoiding a given Configuration
Jerrold Griggs, University of South Carolina, Columbia
9:40 - 10:20 Random Linear Extensions of Infinite Posets
Graham Brightwell, London School of Economics
10:20 - 10:50 Coffee Break
10:50 - 11:30 ULD-Lattices, Instances and Applications
Stefan Felsner, Technische Universität Berlin, Germany
11:30 - 12:10 Bounds for the k-Dimension of Products of Special Posets
Douglas West, University of Illinois-Urbana
12:10 - 2:00 Lunch
Previous: Participation
Workshop Index
DIMACS Homepage
Contacting the Center
Document last modified on May 2, 2008.