1. Foreword: Special issue on IPCO 2005

   • Michael Jünger
   • Volker Kaibel

   PREFACE 01 December 2006 Pages: 1 - 2

2. Optimizing over the first Chvátal closure

   • Matteo Fischetti
   • Andrea Lodi

   FULL LENGTH PAPER 15 December 2006 Pages: 3 - 20

3. Smoothed analysis of integer programming

   • Heiko Röglin
   • Berthold Vöcking

   FULL LENGTH PAPER 05 January 2007 Pages: 21 - 56

4. Combinatorial algorithms for matchings, even factors and square-free 2-factors

   • Gyula Pap

   FULL LENGTH PAPER 12 December 2006 Pages: 57 - 69

5. Approximate min–max relations for odd cycles in planar graphs

   • Samuel Fiorini
   • Nadia Hardy
   • Adrian Vetta

   FULL LENGTH PAPER 15 December 2006 Pages: 71 - 91

6. On approximating complex quadratic optimization problems via semidefinite programming relaxations

   • Anthony Man-Cho So
   • Jiawei Zhang
   • Yinyu Ye

   FULL LENGTH PAPER 13 December 2006 Pages: 93 - 110

7. On the L_∞-norm of extreme points for crossing supermodular directed network LPs

   • Harold N. Gabow

   FULL LENGTH PAPER 15 December 2006 Pages: 111 - 144

8. Semidefinite bounds for the stability number of a graph via sums of squares of polynomials

   • Nebojša Gvozdenović
   • Monique Laurent

   FULL LENGTH PAPER 15 December 2006 Pages: 145 - 173

9. On the graphical relaxation of the symmetric traveling salesman polytope

   • Marcus Oswald
   • Gerhard Reinelt
   • Dirk Oliver Theis

   FULL LENGTH PAPER 15 December 2006 Pages: 175 - 193

10. Power optimization for connectivity problems

    • Mohammad T. Hajiaghayi
    • Guy Kortsarz
    • Zeev Nutov

    FULL LENGTH PAPER 14 December 2006 Pages: 195 - 208

11. Machine scheduling with resource dependent processing times

    • Alexander Grigoriev
    • Maxim Sviridenko
    • Marc Uetz

    FULL LENGTH PAPER 12 December 2006 Pages: 209 - 228

12. Computing the inertia from sign patterns

    • Naonori Kakimura
    • Satoru Iwata

    FULL LENGTH PAPER 12 December 2006 Pages: 229 - 244