++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
============================
First Day: Wednesday, June 9
============================
8:30-10:00 First morning session
* W.H. Cunningham, L. Tang
Optimal 3-terminal cuts and linear programming
* V. Melkonian, E. Tardos
A 4-approximation algorithm for a class of directed network
design problems
* A.A. Ageev, M.I. Sviridenko
Approximation algorithms for maximum coverage and max cut
with given sizes of parts
10:00-10:30 Coffee Break
10:30-12:30 Second morning session
* F. Eisenbrand, A.S. Schulz
Bounds on the Chvatal Rank of Polytopes in the 0/1-cube
* M. Hartmann, M. Queyranne, Y. Wang
On the Chvatal rank of certain inequalities
* J. Fonlupt, A.R. Mahjoub
Critical extreme points of the 2-edge connected spanning
subgraph polytope
* A. Caprara, M. Fischetti, A.N. Letchford
On the separation of maximally violated mod-k cuts
12:30-14:30 Lunch Break
14:30-16:00 First afternoon session
* G.W. Klau, P. Mutzel
Optimal compaction of orthogonal grid drawings
* S.G. Kolliopoulos, C. Stein
Experimental evaluation of approximation algorithms for
single-source unsplittable flow
* P. Mutzel, R. Weiskircher
Optimizing over all combinatorial embeddings of a planar graph
16:00-16:30 Coffee Break
16:30-18:00 Second afternoon session
* P. Klein, N. Young
On the number of iterations for Dantzig-Wolfe optimization and
packing-covering approximation algorithms
* E. Amaldi, M.E. Pfetsch, L.E. Trotter
Structural properties of the maximum feasible subsystem problem
* A. Sebo
An introduction to empty simplices
20:00 Social Program: Reception
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
=============================
Second Day: Thursday, June 10
=============================
8:30-10:30 First morning session
D. Hartvigsen
The square-free 2-factor problem in bipartite graphs
H. Nagamochi, T. Ibaraki
A fast algorithm for computing minimum 3-way and 4-way cuts
T. Jordan
Edge splitting problems with demands
M.C. Cai, X. Deng, W. Zang
A min-max theorem on feedback vertex sets
10:30-11:00 Coffee Break
11:00-12:30 Second morning session
A. Frank, Z. Kiraly
Parity constrained k-edge-connected orientations
Z. Szigeti
On optimal ear-decompositions of graphs
A. Frank, T. Jordan, Z. Szigeti
An orientation theorem with parity conditions
12:30-14:30 Lunch Break
16:00 Social Program (Guided City Tour)
20:00 Conference Dinner
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
==========================
Third Day: Friday, June 11
==========================
8:30-10:30 First morning session
F.A. Chudak, D.P. Williamson
Improved approximation algorithms for capacitated facility
location problems
E. Halperin, U. Zwick
Approximation algorithms for MAX 4-SAT and rounding procedures
for semidefinite programs
J. Noga, S. Seiden
Scheduling two machines with release times
D. Cvetkovic, M. Cangalovic, V. Kovacevic-Vujcic
Semidefinite programming methods for traveling salesman problem
10:30-11:00 Coffee Break
11:00-12:30 Second morning session
K. Aardal, B. Bixby, C. Hurkens, A.K. Lenstra, J. Smeltink
Market split and basis reduction: towards a solution of the
Cornuejols-Dawande instances
A. Atamturk, G.L. Nemhauser, M.W.P. Savelsbergh
Valid inequalities for problems with additive variable upper bounds
E. Uchoa, M. Poggi de Aragao
Vertex-disjoint packing of two Steiner trees: Polyhedra
and Branch-and-Cut
12:30-14:30 Lunch Break
14:30-16:00 First afternoon session
S. Iwata, S.T. McCormick, M. Shigeno
A strongly polynomial cut canceling algorithm for the
submodular flow problem
R. Ahuja, D.S. Hochbaum, J.B. Orlin
Solving the convex cost integer dual network flow problem
L. Fleischer
Universally maximum flow with piecewise-constant capacities
16:00-16:30 Coffee Break
16:30-18:00 Second afternoon session
C.P. Teo, J. Sethuraman, W.P. Tan
Gale-Shapley stable marriage revisited: Strategic issues and
applications
C. Helmberg
The m-Cost ATSP
K. Kashiwabara, M. Nakamura, T. Takabatake
Integral polyhedra associated with certain submodular functions
defined on 012-Vectors
18:00 Closing of the Conference
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++