Volker Kaibel

According to our database1, Volker Kaibel authored at least 39 papers between 1998 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Optimal sufficient requirements on the embedded Ising problem in polynomial time.
Quantum Inf. Process., August, 2023

Special Issue: International Symposium on Mathematical Programming 2022.
Math. Program., July, 2023

2021
Scale-Free Spanning Trees and Their Application in Genomic Epidemiology.
J. Comput. Biol., 2021

2020
Correction to: Extended Formulations for Independence Polytopes of Regular Matroids.
Graphs Comb., 2020

2018
Maximum semidefinite and linear extension complexity of families of polytopes.
Math. Program., 2018

2017
A Note on Matchings Constructed during Edmonds' Weighted Perfect Matching Algorithm.
CoRR, 2017

2016
Extended Formulations for Independence Polytopes of Regular Matroids.
Graphs Comb., 2016

2015
The unimodular intersection problem.
Oper. Res. Lett., 2015

Subgraph polytopes and independence polytopes of count matroids.
Oper. Res. Lett., 2015

Lower bounds on the sizes of integer programs without additional variables.
Math. Program., 2015

Simple extensions of polytopes.
Math. Program., 2015

Lifts of convex sets in optimization.
Math. Program., 2015

Forbidden Vertices.
Math. Oper. Res., 2015

A Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially.
Discret. Comput. Geom., 2015

2013
Combinatorial bounds on nonnegative rank and extended formulations.
Discret. Math., 2013

2012
Symmetry Matters for Sizes of Extended Formulations.
SIAM J. Discret. Math., 2012

2011
Orbitopal fixing.
Discret. Optim., 2011

Constructing Extended Formulations from Reflection Relations.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2010
On cardinality constrained cycle and path polytopes.
Math. Program., 2010

Branched Polyhedral Systems.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2009
Extended Formulations for Packing and Partitioning Orbitopes.
Math. Oper. Res., 2009

2008
A short proof of the VPN Tree Routing Conjecture on ring networks.
Oper. Res. Lett., 2008

2007
Two New Bounds for the Random-Edge Simplex-Algorithm.
SIAM J. Discret. Math., 2007

Foreword: Special issue on IPCO 2005.
Math. Program., 2007

2006
Revlex-initial 0/1-polytopes.
J. Comb. Theory, Ser. A, 2006

2004
The Simplex Algorithm in Dimension Three.
SIAM J. Comput., 2004

Low-Dimensional Faces of Random 0/1-Polytopes.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

On the Expansion of Graphs of 0/1-Polytopes.
Proceedings of the Sharpest Cut, 2004

2003
On the Complexity of Polytope Isomorphism Problems.
Graphs Comb., 2003

On the Graph-Density of Random 0/1-Polytopes.
Proceedings of the Approximation, 2003

Some Algorithmic Problems in Polytope Theory.
Proceedings of the Algebra, Geometry, and Software Systems [outcome of a Dagstuhl seminar], 2003

2002
Computing the face lattice of a polytope from its vertex-facet incidences.
Comput. Geom., 2002

2001
Box-inequalities for quadratic assignment polytopes.
Math. Program., 2001

The QAP-polytope and the star transformation.
Discret. Appl. Math., 2001

Reconstructing a Simple Polytope from Its Graph.
Proceedings of the Combinatorial Optimization, 2001

2000
On the SQAP-Polytope.
SIAM J. Optim., 2000

Simple 0/1-Polytopes.
Eur. J. Comb., 2000

Upper Bounds on the Maximal Number of Facets of 0/1-Polytopes.
Eur. J. Comb., 2000

1998
Polyhedral Combinatorics of Quadratic Assignment Problems with Less Objects than Locations.
Proceedings of the Integer Programming and Combinatorial Optimization, 1998


  Loading...