 | 2011 |
| 25 |  | Volker Kaibel,
Kanstantsin Pashkovich:
Constructing Extended Formulations from Reflection Relations.
IPCO 2011: 287-300 |
| 24 |  | Samuel Fiorini,
Volker Kaibel,
Kanstantsin Pashkovich,
Dirk Oliver Theis:
Combinatorial Bounds on Nonnegative Rank and Extended Formulations
CoRR abs/1111.0444: (2011) |
| 23 |  | Volker Kaibel,
Matthias Peinhardt,
Marc E. Pfetsch:
Orbitopal fixing.
Discrete Optimization 8(4): 595-610 (2011) |
| 2010 |
| 22 |  | Volker Kaibel,
Kanstantsin Pashkovich,
Dirk Oliver Theis:
Symmetry Matters for the Sizes of Extended Formulations.
IPCO 2010: 135-148 |
| 21 |  | Volker Kaibel,
Andreas Loos:
Branched Polyhedral Systems.
IPCO 2010: 177-190 |
| 20 |  | Volker Kaibel,
Rüdiger Stephan:
On cardinality constrained cycle and path polytopes.
Math. Program. 123(2): 371-394 (2010) |
| 2009 |
| 19 |  | Yuri Faenza,
Volker Kaibel:
Extended Formulations for Packing and Partitioning Orbitopes.
Math. Oper. Res. 34(3): 686-697 (2009) |
| 2008 |
| 18 |  | Fabrizio Grandoni,
Volker Kaibel,
Gianpaolo Oriolo,
Martin Skutella:
A short proof of the VPN Tree Routing Conjecture on ring networks.
Oper. Res. Lett. 36(3): 361-365 (2008) |
| 2007 |
| 17 |  | Volker Kaibel,
Matthias Peinhardt,
Marc E. Pfetsch:
Orbitopal Fixing.
IPCO 2007: 74-88 |
| 16 |  | Michael Jünger,
Volker Kaibel:
Foreword: Special issue on IPCO 2005.
Math. Program. 110(1): 1-2 (2007) |
| 15 |  | Bernd Gärtner,
Volker Kaibel:
Two New Bounds for the Random-Edge Simplex-Algorithm.
SIAM J. Discrete Math. 21(1): 178-190 (2007) |
| 2006 |
| 14 |  | Rafael Gillmann,
Volker Kaibel:
Revlex-initial 0/1-polytopes.
J. Comb. Theory, Ser. A 113(5): 799-821 (2006) |
| 2005 |
| 13 |  | Michael Jünger,
Volker Kaibel:
Integer Programming and Combinatorial Optimization, 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings
Springer 2005 |
| 2004 |
| 12 |  | Volker Kaibel:
Low-Dimensional Faces of Random 0/1-Polytopes.
IPCO 2004: 401-415 |
| 11 |  | Volker Kaibel,
Rafael Mechtel,
Micha Sharir,
Günter M. Ziegler:
The Simplex Algorithm in Dimension Three.
SIAM J. Comput. 34(2): 475-497 (2004) |
| 2003 |
| 10 |  | Volker Kaibel,
Marc E. Pfetsch:
Some Algorithmic Problems in Polytope Theory.
Algebra, Geometry, and Software Systems 2003: 23-47 |
| 9 |  | Volker Kaibel,
Anja Remshagen:
On the Graph-Density of Random 0/1-Polytopes.
RANDOM-APPROX 2003: 318-328 |
| 8 |  | Volker Kaibel,
Alexander Schwartz:
On the Complexity of Polytope Isomorphism Problems.
Graphs and Combinatorics 19(2): 215-230 (2003) |
| 2002 |
| 7 |  | Volker Kaibel,
Marc E. Pfetsch:
Computing the face lattice of a polytope from its vertex-facet incidences.
Comput. Geom. 23(3): 281-290 (2002) |
| 2001 |
| 6 |  | Volker Kaibel:
Reconstructing a Simple Polytope from Its Graph.
Combinatorial Optimization 2001: 105-118 |
| 5 |  | Michael Jünger,
Volker Kaibel:
The QAP-polytope and the star transformation.
Discrete Applied Mathematics 111(3): 283-306 (2001) |
| 2000 |
| 4 |  | Tamás Fleiner,
Volker Kaibel,
Günter Rote:
Upper Bounds on the Maximal Number of Facets of 0/1-Polytopes.
Eur. J. Comb. 21(1): 121-130 (2000) |
| 3 |  | Volker Kaibel,
Martin Wolff:
Simple 0/1-Polytopes.
Eur. J. Comb. 21(1): 139-144 (2000) |
| 2 |  | Michael Jünger,
Volker Kaibel:
On the SQAP-Polytope.
SIAM Journal on Optimization 11(2): 444-463 (2000) |
| 1998 |
| 1 |  | Volker Kaibel:
Polyhedral Combinatorics of Quadratic Assignment Problems with Less Objects than Locations.
IPCO 1998: 409-422 |