|
Tuesday, October 17, 2006 |
||||||||
|
09:00 - 10:00
|
Registration
|
Room 5345
|
09:00 - 10:00
|
Coffee & Croissants
|
Room 6245
|
10:00 - 10:10
|
Opening remarks
|
Room 6214
|
Session 1a - Polyhedral Computation
Meeting room : 6214 |
10:10 - 10:50
|
Komei Fukuda
(Swiss Federal Institute of Technology, Zurich and Lausanne) Introduction to Polyhedral Computation | Abstract |
10:50 - 11:30
|
Gerhard Reinelt
(University of Heidelberg) Polyhedral Computations and Practical Problem Solving | Abstract |
11:30 - 12:10
|
Jesús De Loera
(University of California, Davis) Recent Progress in the Test Set method for Lattice Point Problems | Abstract |
12:10 - 14:00
|
Lunch Break
|
Session 1b - Combinatorial Generation
Meeting room : 6214 |
14:00 - 14:40
|
Brendan D. McKay
(Australian National University) Constructive Enumeration without Isomorphs | Abstract |
14:40 - 15:20
|
Alexander Hulpke
(Colorado State University) Computing with group actions (in GAP) | Abstract |
15:20 - 16:00
|
Khaled Elbassioni
(Max-Planck-Institut für Informatik) Some combinatorial generation techinques and their applications in vertex enumeration | Abstract |
Session 1c - Open Problems (16:00 - 17:00)
Meeting room : 6214 |
Günter Rote
(Freie Universität Berlin) On the number of cells in the source unfolding of convex 4-polytopes | Abstract |
Antoine Deza
(McMaster University) Polytopes and arrangements: diameter and curvature | Abstract |
16:00 - 17:00
|
Additional open problems are welcome
|
|
17:00
|
Welcoming reception
|
Room 6245
|
Wednesday, October 18, 2006 |
||||||||
|
09:30 - 10:00
|
Coffee & Croissants
|
Room 6245
|
Session 2a - Discrete Geometry
Meeting room : 6214 |
10:00 - 10:40
|
Charles Audet
(École Polytechnique de Montréal) Extremal problems for convex polygons | Abstract |
10:40 - 11:20
|
Achill Schürmann
(University of Magdeburg) Polyhedra with symmetries in the geometry of numbers | Abstract |
11:20 - 12:00
|
Tamon Stephen
(Simon Fraser University) Colourful Simplicial Depth | Abstract |
12:00 - 14:00
|
Lunch Break
|
Session 2b - Computational Complexity
Meeting room : 6214 |
14:00 - 14:40
|
Endre Boros
(Rutgers University) Vertex generation and related problems | Abstract |
14:40 - 15:20
|
Vladimir Gurvich
(Rutgers University) Generating all vertices of a polyhedron is hard | Abstract |
15:20 - 16:00
|
Free discussion
|
|
16:00 - 17:00
|
Coffee
|
Room 6245
|
Thursday, October 19, 2006 |
||||||||
|
09:30 - 10:00
|
Coffee & Croissants
|
Room 6245
|
Session 3a - Semidefinite Programming
Meeting room : 6214 |
10:00 - 10:40
|
Masakazu Kojima
(Tokyo Institute of Technology) Sparsity in Sum of Squares and Semidefinite Programming Relaxation of Polynomial Optimization Problems | Abstract |
10:40 - 11:20
|
Pablo A. Parrilo
(Massachusetts Institute of Technology) Exact semidefinite representations for genus zero curves | Abstract |
11:20 - 12:00
|
Frank Vallentin
(Centrum voor Wiskunde en Informatica) Approximating symmetric polyhedra using semidefinite programming | Abstract |
12:00 - 14:00
|
Lunch Break
|
Session 3b - Applications
Meeting room : 6214 |
14:00 - 14:40
|
Hiroshi Imai
(University of Tokyo) Polyhedral Approaches to Quantum Information | Abstract |
14:40 - 15:20
|
Thorsten Theobald
(Technische Universität Berlin) Computation of Nash equilibria in restricted games | Abstract |
15:20 - 16:00
|
Matthias Franz
(Siemens AG) Using polyhedral computations to understand the geometry and topology of G-varieties | Abstract |
16:00 - 17:00
|
Coffee
|
Room 6245
|
Friday, October 20, 2006 |
||||||||
|
09:30 - 10:00
|
Coffee & Croissants
|
Room 6245
|
Session 4a - Structured Input
Meeting room : 6214 |
10:00 - 10:40
|
Jean-François Maurras
(Université de la Méditerranée) On the connectivity of the $k$-clique polyhedra | Abstract |
10:40 - 11:20
|
Mathieu Dutour Sikiric
(Rudher Boskovic Institute) The recursive adjacency decomposition method | Abstract |
11:20 - 11:30
|
Break
|
Session 4b - Applications II
Meeting room : 6214 |
11:30 - 12:10
|
Roberto Bagnara
(Università di Parma) Applications of Polyhedral Computations to the Analysis and Verification of Hardware and Software Systems | Abstract |
12:10 - 12:50
|
René Brandenberg
(Technische Universität München) Approximating optimal containment problems | Abstract |
Last modified : Monday, October 16, 2006 11:01