| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Approximate min–max relations for odd cycles in planar graphs
|
Fiorini, Samuel
|
|
2006
|
110 |
1 |
p. 71-91
|
article
|
| 2 |
Combinatorial algorithms for matchings, even factors and square-free 2-factors
|
Pap, Gyula
|
|
2006
|
110 |
1 |
p. 57-69
|
article
|
| 3 |
Computing the inertia from sign patterns
|
Kakimura, Naonori
|
|
2006
|
110 |
1 |
p. 229-244
|
article
|
| 4 |
Foreword: Special issue on IPCO 2005
|
Jünger, Michael
|
|
2006
|
110 |
1 |
p. 1-2
|
article
|
| 5 |
Machine scheduling with resource dependent processing times
|
Grigoriev, Alexander
|
|
2006
|
110 |
1 |
p. 209-228
|
article
|
| 6 |
On approximating complex quadratic optimization problems via semidefinite programming relaxations
|
So, Anthony Man-Cho
|
|
2006
|
110 |
1 |
p. 93-110
|
article
|
| 7 |
On the graphical relaxation of the symmetric traveling salesman polytope
|
Oswald, Marcus
|
|
2006
|
110 |
1 |
p. 175-193
|
article
|
| 8 |
On the L∞-norm of extreme points for crossing supermodular directed network LPs
|
Gabow, Harold N.
|
|
2006
|
110 |
1 |
p. 111-144
|
article
|
| 9 |
Optimizing over the first Chvátal closure
|
Fischetti, Matteo
|
|
2006
|
110 |
1 |
p. 3-20
|
article
|
| 10 |
Power optimization for connectivity problems
|
Hajiaghayi, Mohammad T.
|
|
2006
|
110 |
1 |
p. 195-208
|
article
|
| 11 |
Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
|
Gvozdenović, Nebojša
|
|
2006
|
110 |
1 |
p. 145-173
|
article
|
| 12 |
Smoothed analysis of integer programming
|
Röglin, Heiko
|
|
2006
|
110 |
1 |
p. 21-56
|
article
|
Journal description