Conference on Discrete Geometry and Optimization

September 19 - 23, 2011, The Fields Institute

Schedule

Monday, September 19th, 2011
09:20 to 09:30	Welcome and Introductions Jesus De Loera, University of California Davis
09:30 to 10:30	SDP and eigenvalue approaches to Bandwidth and Vertex-Separator problems in graphs Franz Rendl, Alpen-Adria University of Klagenfurt
10:30 to 11:00	Coffee Break
11:00 to 12:00	Spectral bounds for the independence number and the chromatic number of an operator Frank Vallentin, Tu Delft
12:00 to 13:00	Lunch Break
14:00 to 15:00	Lower bounds for the measurable chromatic number of Euclidean space Christina Bachoc, Universite de Bordeaux
15:00 to 15:30	Coffee Break
16:30 to 17:30	Reception

Tuesday, September 20th, 2011
09:30 to 10:30	The directed cut cone and polytope with mining applications David Avis, McGill University
10:30 to 11:00	Coffee Break
11:00 to 12:00	Linear Complementarity, Unique-Sink Orientations and Oriented Matroids Jan Foniok, Ecole Polytechnique
12:00 to 13:00	Lunch Break
14:00 to 15:00	The brick polytope of a sorting network Vincent Pilaud, École Polytechnique, France
15:00 to 15:30	Coffee Break
15:30 to 16:30	The width of 4-prismatoids Tamon Stephen, Simon Fraser University
16:30 to 17:30	On diameters of transportation and network flow polytopes Edward Kim, Tu Delft

Wednesday, September 21st, 2011
09:30 to 10:30	Optimizing and Approximating Geometric Covering Tours Joseph mitchell, SUNY Stony Brook
10:30 to 11:00	Coffee Break
11:00 to 12:00	Spheric analogs of fullerenes Michel Deza, Ecole Normale Supérieure
12:00 to 13:00	Lunch Break
14:00 to 15:00	Intermediate sums on polyhedra: Ehrhart theory and an application in mixed integer optimization Matthias Köppe, University of California Davis
15:00 to 15:30	Coffee Break
16:30 to 17:30	Irreducible contact graphs and Tammes' problem Oleg Musin, University of Texas Rio Grande Valley

Thursday, September 22nd, 2011
09:30 to 10:30	Convex graph invariants Pablo Parrilo, Massachusetts Institute of Technology
10:30 to 11:00	Coffee Break
11:00 to 12:00	Characterizing graphs with Gram dimension at most four Monique Laurent, CWI and Centrum Wiskunde & Informatica
12:00 to 13:00	Lunch Break
14:00 to 15:00	Orbitwise polyhedral representation conversion via fundamental domains David Bremner, University of New Brunswick
15:00 to 15:30	Coffee Break
15:30 to 16:30	Exploiting Polyhedral Symmetries in Social Choice Theory Achill Schürmann, University of Rostock
16:30 to 17:30	A Geometric Approach to Social Choice: Combinatorial Hodge Theory Yuan Yao, Peking University

Friday, September 23rd, 2011
09:30 to 10:30	Universal Rigidity Theory and Semidefinite Programming for Sensor Network Localization Yinyu Ye, Stanford University
10:30 to 11:00	Coffee Break
11:00 to 12:00	Rigidity and Localization: An Optimization Perspective Anthony Man-Cho So, The Chinese University of Hong Kong
12:00 to 13:00	Lunch Break
14:00 to 15:00	Integrals of polynomials over Convex Polytopes: Combinatorics and Algorithms Jesus De Loera, University of California Davis
15:00 to 15:30	Coffee Break
16:30 to 17:30	Contact numbers for congruent sphere packings Karoly Bezdek, University of Calgary

Photos for the conference

Organizing Committee

Karoly Bezdek - University of Calgary

Jesus De Loera - University of California Davis

Antoine Deza - McMaster University

Joseph mitchell - SUNY Stony Brook

Yinyu Ye - Stanford University

Scheduled as part of

Thematic Program on Discrete Geometry and Applications

People and Contacts

Contacting the Institute, Staff, and Visiting Members of the Fields Institute.

View Contacts

Calendar and Events

Stay up to date with our upcoming events and news by viewing our calendar.

View Events