Polyhedral Combinatorics of Quadratic Assignment Problems with Less Objects than Locations. - Volker Kaibel (IPCO, 1998)

Upper Bounds on the Maximal Number of Facets of 0/1-Polytopes. - Tamás Fleiner; Volker Kaibel; Günter Rote (Eur. J. Comb., 2000)

Simple 0/1-Polytopes. - Volker Kaibel; Martin Wolff (Eur. J. Comb., 2000)

On the SQAP-Polytope. - Michael Jünger; Volker Kaibel (SIAM J. Optim., 2000)

Reconstructing a Simple Polytope from Its Graph. - Volker Kaibel (Combinatorial Optimization, 2001)

The QAP-polytope and the star transformation. - Michael Jünger; Volker Kaibel (Discret. Appl. Math., 2001)

Box-inequalities for quadratic assignment polytopes. - Michael Jünger; Volker Kaibel (Math. Program., 2001)

Computing the face lattice of a polytope from its vertex-facet incidences. - Volker Kaibel; Marc E. Pfetsch (Comput. Geom., 2002)

Some Algorithmic Problems in Polytope Theory. - Volker Kaibel; Marc E. Pfetsch (Algebra, Geometry, and Software Systems, 2003)

On the Graph-Density of Random 0/1-Polytopes. - Volker Kaibel; Anja Remshagen (RANDOM-APPROX, 2003)

On the Complexity of Polytope Isomorphism Problems. - Volker Kaibel; Alexander Schwartz (Graphs Comb., 2003)

On the Expansion of Graphs of 0/1-Polytopes. - Volker Kaibel (The Sharpest Cut, 2004)

Low-Dimensional Faces of Random 0/1-Polytopes. - Volker Kaibel (IPCO, 2004)

The Simplex Algorithm in Dimension Three. - Volker Kaibel; Rafael Mechtel; Micha Sharir; Günter M. Ziegler (SIAM J. Comput., 2004)

Revlex-initial 0/1-polytopes. - Rafael Gillmann; Volker Kaibel (J. Comb. Theory A, 2006)

Foreword: Special issue on IPCO 2005. - Michael Jünger; Volker Kaibel (Math. Program., 2007)

Two New Bounds for the Random-Edge Simplex-Algorithm. - Bernd Gärtner; Volker Kaibel (SIAM J. Discret. Math., 2007)

A short proof of the VPN Tree Routing Conjecture on ring networks. - Fabrizio Grandoni 001; Volker Kaibel; Gianpaolo Oriolo; Martin Skutella (Oper. Res. Lett., 2008)

Extended Formulations for Packing and Partitioning Orbitopes. - Yuri Faenza; Volker Kaibel (Math. Oper. Res., 2009)

Branched Polyhedral Systems. - Volker Kaibel; Andreas Loos (IPCO, 2010)

On cardinality constrained cycle and path polytopes. - Volker Kaibel; Rüdiger Stephan (Math. Program., 2010)

Constructing Extended Formulations from Reflection Relations. - Volker Kaibel; Kanstantsin Pashkovich (IPCO, 2011)

Orbitopal fixing. - Volker Kaibel; Matthias Peinhardt; Marc E. Pfetsch (Discret. Optim., 2011)

Symmetry Matters for Sizes of Extended Formulations. - Volker Kaibel; Kanstantsin Pashkovich; Dirk Oliver Theis (SIAM J. Discret. Math., 2012)

Combinatorial bounds on nonnegative rank and extended formulations. - Samuel Fiorini; Volker Kaibel; Kanstantsin Pashkovich; Dirk Oliver Theis (Discret. Math., 2013)

A Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially. - Volker Kaibel; Stefan Weltge (Discret. Comput. Geom., 2015)

Forbidden Vertices. - Gustavo Angulo; Shabbir Ahmed 001; Santanu S. Dey; Volker Kaibel (Math. Oper. Res., 2015)

Lifts of convex sets in optimization. - Volker Kaibel; Rekha R. Thomas (Math. Program., 2015)

Simple extensions of polytopes. - Volker Kaibel; Matthias Walter (Math. Program., 2015)

Lower bounds on the sizes of integer programs without additional variables. - Volker Kaibel; Stefan Weltge (Math. Program., 2015)

Subgraph polytopes and independence polytopes of count matroids. - Michele Conforti; Volker Kaibel; Matthias Walter; Stefan Weltge (Oper. Res. Lett., 2015)

The unimodular intersection problem. - Volker Kaibel; Shmuel Onn; Pauline Sarrabezolles (Oper. Res. Lett., 2015)

Extended Formulations for Independence Polytopes of Regular Matroids. - Volker Kaibel; Jon Lee 001; Matthias Walter; Stefan Weltge (Graphs Comb., 2016)

A Note on Matchings Constructed during Edmonds' Weighted Perfect Matching Algorithm. - Volker Kaibel; Matthias Walter (CoRR, 2017)

Maximum semidefinite and linear extension complexity of families of polytopes. - Gennadiy Averkov; Volker Kaibel; Stefan Weltge (Math. Program., 2018)

Correction to: Extended Formulations for Independence Polytopes of Regular Matroids. - Volker Kaibel; Jon Lee 001; Matthias Walter; Stefan Weltge (Graphs Comb., 2020)

Scale-Free Spanning Trees and Their Application in Genomic Epidemiology. - Yury L. Orlovich; Kirill Kukharenko; Volker Kaibel; Pavel Skums (J. Comput. Biol., 2021)

Special Issue: International Symposium on Mathematical Programming 2022. - Damek Shea Davis; Oktay Günlük; Volker Kaibel; Giacomo Nannicini; Xa-Xiang Yuan (Math. Program., 2023)

Optimal sufficient requirements on the embedded Ising problem in polynomial time. - Elisabeth Lobe; Volker Kaibel (Quantum Inf. Process., 2023)

Rock Extensions with Linear Diameters. - Volker Kaibel; Kirill Kukharenko (SIAM J. Discret. Math., 2024)

Steiner Cut Dominants. - Michele Conforti; Volker Kaibel (Math. Oper. Res., 2025)

Refined TSSOS. - Daria Shaydurova; Volker Kaibel; Sebastian Sager (SIAM J. Optim., 2025)

Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2023. - Alberto Del Pia; Volker Kaibel (Math. Program., 2025)