----------------------------------------------------------------
IPCO VII, 1999 (Graz):  List of accepted papers   
----------------------------------------------------------------



K. Aardal, C. Hurkens, A.K. Lenstra, J. Smeltink
Market split and basis reduction: towards a solution of the 
Cornuejols-Dawande instances

A.A. Ageev, M.I. Sviridenko
Approximation algorithms for maximum coverage and max cut 
with given sizes of parts

R. Ahuja, D.S. Hochbaum, J.B. Orlin 
Solving the convex cost integer dual network flow problem

E. Amaldi, M.E. Pfetsch, L.E. Trotter 
Structural properties of the maximum feasible subsystem problem

A. Atamturk, G.L. Nemhauser, M.W.P. Savelsbergh
Valid inequalities for problems with additive variable upper bounds

M.C. Cai, X. Deng, W. Zang
A min-max theorem on feedback vertex sets

A. Caprara, M. Fischetti, A.N. Letchford
On the separation of maximally violated mod-k cuts

F.A. Chudak, D.P. Williamson
Improved approximation algorithms for capacitated facility 
location problems 

W.H. Cunningham, L. Tang
Optimal 3-terminal cuts and linear programming

D. Cvetkovic, M. Cangalovic, V. Kovacevic-Vujcic
Semidefinite programming methods for traveling salesman problem

F. Eisenbrand, A.S. Schulz
Bounds on the Chvatal Rank of Polytopes in the 0/1-cube

L. Fleischer
Universally maximum flow with piecewise-constant capacities

J. Fonlupt, A.R. Mahjoub 
Critical extreme points of the 2-edge connected spanning 
subgraph polytope

A. Frank, T. Jordan, Z. Szigeti
An orientation theorem with parity conditions

A. Frank, Z. Kiraly
Parity constrained k-edge-connected orientations

E. Halperin, U. Zwick
Approximation algorithms for MAX 4-SAT and rounding procedures 
for semidefinite programs

M. Hartmann, M. Queyranne, Y. Wang
On the Chvatal rank of certain inequalities

D. Hartvigsen
The square-free 2-factor problem in bipartite graphs

C. Helmberg
The m-Cost ATSP

S. Iwata, S.T. McCormick, M. Shigeno
A strongly polynomial cut canceling algorithm for the 
submodular flow problem

T. Jordan
Edge splitting problems with demands

K. Kashiwabara, M. Nakamura, T. Takabatake
Integral polyhedra associated with certain submodular functions 
defined on 012-Vectors

G.W. Klau, P. Mutzel
Optimal compaction of orthogonal grid drawings

P. Klein, N. Young
On the number of iterations for Dantzig-Wolfe optimization and 
packing-covering approximation algorithms

S.G. Kolliopoulos, C. Stein
Experimental evaluation of approximation algorithms for 
single-source unsplittable flow

V. Melkonian, E. Tardos
A 4-approximation algorithm for a class of directed network 
design problems

P. Mutzel, R. Weiskircher
Optimizing over all combinatorial embeddings of a planar graph

H. Nagamochi, T. Ibaraki
A fast algorithm for computing minimum 3-way and 4-way cuts

J. Noga, S. Seiden
Scheduling two machines with release times

A. Sebo
An introduction to empty simplices

Z. Szigeti
On optimal ear-decompositions of graphs

C.P. Teo, J. Sethuraman, W.P. Tan
Gale-Shapley stable marriage revisited: Strategic issues and 
applications

E. Uchoa, M. Poggi de Aragao
Vertex-disjoint packing of two Steiner trees: Polyhedra 
and Branch-and-Cut