---------------------------------------------------------------- IPCO VIII, 2001 (Utrecht): List of accepted papers ---------------------------------------------------------------- A. Archer Two O(log*k)-approximation algorithms for the asymmetric k-center problem Y. Azar, O. Regev Strongly polynomial algorithms for the unsplittable flow problem J. Cheriyan, S. Vempala Edge coverings of set-pairs C.F. Chou, M. Queyranne, D. Simchi-Levi The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates F.A. Chudak, T. Roughgarden, D.P. Williamson Approximate k-MSTs and k-Steiner Trees via the primal-dual method and Lagrangean relaxation G. Cornuejols, Y. Li On the rank of mixed 0,1 polyhedra F. Eisenbrand, G. Rote Fast 2-Variable Integer Programming M. Elkin, D. Peleg Approximating k-spanner problems for k>2 T. Fleiner A matroid-generalization of the stable matching polytope L. Fleischer A 2-approximation for (0,1,2) survivable network design A. Frank, T. Kiraly Combined connectivity augmentation and orientation problems A. Frank, L. Szego An extension of a theorem of Henneberg and Laman S. Fujishige, S. Iwata Bisubmodular function minimization N. Garg, R. Khandekar, G. Konjevod. R. Ravi, F.S. Salman, A. Sinha On the integrality gap of a natrural formulation of the single-sink buy-at-bulk network design problem B. Guenin Circuit Mengerian directed graphs B. Guenin Integral polyhedra related to even cycle and even cut matroids E. Halperin, U. Zwick A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems R. Hassin, A. Levin Synthesis of two-commodity flow networks B. Jackson, T. Jordan Independence free graphs and vertex connectivity augmentation G. Iyengar, M.T. Cezik Cutting planes for mixed 0-1 semidefinite programming M. Kodialam The throughput of sequential testing J.B. Lasserre An explicit exact SDP relaxation for nonlinear 0-1 programs F. Margot Pruning by isomorphism in branch-and-but A.J. Miller, G.L. Nemhauser, M.W.P. Savelsbergh Facets and polyhedral characterizations for a multi-item production planning model with setup times A. Newman, S. Vempala On the maximum acyclic subgraph problem M. Perregaard, E. Balas Generating cuts from multiple-term disjunctions M. Queyranne, M. Sviridenko A (2+eps)-approximation algorithm for the generalized preemptive open shop problem with minsum criteria P. Schuurman, T. Vredeveld Performance guarantees of local search for multiprocessor scheduling A. Sebo, E. Tannier Connected joins in graphs R. Sitters On the complexity of preemptive scheduling of unrelated machines C. Stein, D.P. Wagner Approximation algorithms for the minimum bends TSP D.A. van der Laan Bounds for deterministic periodic routing sequences