Publications
66 / 66
2023
article
Optimal sufficient requirements on the embedded Ising problem in polynomial time
Quantum Information Processing
@article{LobK23,
author = {Lobe, Elisabeth and Kaibel, Volker},
title = {Optimal sufficient requirements on the embedded Ising problem in polynomial time},
journal = {Quantum Information Processing},
year = {2023},
volume = {22},
number = {8},
pages = {305},
url = {https://rdcu.be/diR8b},
doi = {10.1007/s11128-023-04058-2}
}
2023
misc
Polytope Extensions with Linear Diameters
@misc{kaibel2023polytope,
author = {Kaibel, Volker and Kukharenko, Kirill},
title = {Polytope Extensions with Linear Diameters},
year = {2023},
url = {https://arxiv.org/abs/2307.05246},
doi = {10.48550/arXiv.2307.05246}
}
2022
misc
Steiner Cut Dominants
@misc{https://doi.org/10.48550/arxiv.2209.14802,
author = {Conforti, Michele and Kaibel, Volker},
title = {Steiner Cut Dominants},
publisher = {arXiv},
year = {2022},
url = {https://arxiv.org/abs/2209.14802},
doi = {10.48550/ARXIV.2209.14802}
}
2021
article
Scale-Free Spanning Trees and Their Application in Genomic Epidemiology
Journal of Computational Biology
@article{OrlovichKKS21,
author = {Orlovich, Yury and Kukharenko, Kirill and Kaibel, Volker and Skums, Pavel},
title = {Scale-Free Spanning Trees and Their Application in Genomic Epidemiology},
journal = {Journal of Computational Biology},
year = {2021},
volume = {28},
number = {10},
pages = {945--960},
doi = {10.1089/cmb.2020.0500}
}
2020
article
Correction to: Extended Formulations for Independence Polytopes of Regular Matroids
Graphs and Combinatorics
We report a logical error in our article that turns out to be fatal for the main result. The error lies in Lemma 3 for the case of a 3-sum, that is
@article{KaibelLWW20,
author = {Kaibel, Volker and Lee, Jon and Walter, Matthias and Weltge, Stefan},
title = {Correction to: Extended Formulations for Independence Polytopes of Regular Matroids},
journal = {Graphs and Combinatorics},
year = {2020},
volume = {36},
number = {1},
pages = {177--179},
doi = {10.1007/s00373-019-02122-2}
}
2018
article
Maximum Semidefinite and Linear Extension Complexity of Families of Polytopes
Math. Program.
@article{AverkovKW16,
author = {Averkov, Gennadiy and Kaibel, Voker and Weltge, Stefan},
title = {Maximum Semidefinite and Linear Extension Complexity of Families of Polytopes},
journal = {Math. Program.},
year = {2018},
volume = {167},
number = {2},
pages = {381 -- 394},
doi = {10.1007/s10107-017-1134-7}
}
2017
electronic
A Note on Matchings Constructed during Edmonds' Weighted Perfect
@electronic{KaibelW1712,
author = {Kaibel, Volker and Walter, Matthias},
title = {A Note on Matchings Constructed during Edmonds' Weighted Perfect},
year = {2017},
url = {http://arxiv.org/abs/1703.09505}
}
2016
article
Extended Formulations for Independence Polytopes of Regular Matroids (+++See the erratum in Kaibel et al. 2020+++)
Graphs and Combinatorics
@article{KaibelLWW16,
author = {Kaibel, Volker and Lee, Jon and Walter, Matthias and Weltge, Stefan},
title = {Extended Formulations for Independence Polytopes of Regular Matroids (+++See the erratum in Kaibel et al. 2020+++)},
journal = {Graphs and Combinatorics},
year = {2016},
volume = {32},
number = {5},
pages = {1931--1944},
url = {http://arxiv.org/pdf/1504.03872v1},
doi = {10.1007/s00373-016-1709-8}
}
2015
article
Forbidden Vertices
Mathematics of Oper. Res.
In this work, we introduce and study the forbidden-vertices problem. Given a polytope P and a subset X of its vertices, we study the complexity of linear optimization over the subset of vertices of P that are not contained in X. This problem is closely related to finding the k-best basic solutions to a linear problem. We show that the complexity of the problem changes significantly depending on the encoding of both P and X. We provide additional tractability results and extended formulations when P has binary vertices only. Some applications and extensions to integral polytopes are discussed.
@article{AnguloADK15,
author = {Angulo, Gustavo and Ahmed, Shabbir and Dey, Santanu S. and Kaibel, Volker},
title = {Forbidden Vertices},
journal = {Mathematics of Oper. Res.},
year = {2015},
volume = {40},
number = {2},
pages = {350-360},
doi = {10.1287/moor.2014.0673}
}
2015
article
Subgraph polytopes and independence polytopes of count matroids
Operations Research Letters
Abstract Given a graph, the non-empty subgraph polytope is the convex hull of the characteristic vectors of all pairs ( F , S ) where S is a non-empty subset of nodes and F is a subset of the edges with both endnodes in S . We obtain a strong relationship between non-empty subgraph polytopes and spanning forest polytopes relating their extension complexities. We further show that these polytopes provide polynomial size extended formulations for independence polytopes of count matroids, generalizing recent results on sparsity matroids.
@article{ConfortiKWW15,
author = {Conforti, Michele and Kaibel, Volker and Walter, Matthias and Weltge, Stefan},
title = {Subgraph polytopes and independence polytopes of count matroids},
journal = {Operations Research Letters},
year = {2015},
volume = {43},
number = {5},
pages = {457 - 460},
url = {http://www.sciencedirect.com/science/article/pii/S016763771500084X},
doi = {10.1016/j.orl.2015.06.011}
}
2015
article
The Unimodular Intersection Problem
Operations Research Letters
@article{KaibelOS15,
author = {Kaibel, Volker and Onn, Shmuel and Sarrabezolles, Pauline},
title = {The Unimodular Intersection Problem},
journal = {Operations Research Letters},
year = {2015},
volume = {43},
number = {6},
url = {http://arxiv.org/pdf/1502.04301}
}
2015
article
A Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially
Discrete and Computational Geometry
@article{KaibelW15,
author = {Kaibel, Volker and Weltge, Stefan},
title = {A Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially},
journal = {Discrete and Computational Geometry},
publisher = {Springer},
year = {2015},
volume = {53},
number = {2},
pages = {396--401},
doi = {10.1007/s00454-014-9655-9}
}
2015
article
Simple extensions of polytopes
Math. Program. Ser. B
@article{KaibelW15a,
author = {Kaibel, Volker and Walter, Matthias},
title = {Simple extensions of polytopes},
journal = {Math. Program. Ser. B},
publisher = {Springer Berlin Heidelberg},
year = {2015},
volume = {154},
number = {1-2},
pages = {381-406},
doi = {10.1007/s10107-015-0885-2}
}
2015
article
Lower Bounds on the Sizes of Integer Programs without Additional Variables
Math. Program. Ser. B
@article{KaibelW15b,
author = {Kaibel, Volker and Weltge, Stefan},
title = {Lower Bounds on the Sizes of Integer Programs without Additional Variables},
journal = {Math. Program. Ser. B},
publisher = {Springer},
year = {2015},
volume = {154},
number = {1-2},
pages = {407--425},
doi = {10.1007/s10107-014-0855-0}
}
2014
inproceedings
Simple Extensions of Polytopes
Integer Programming and Combinatorial Optimization, 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014. Proceedings
@inproceedings{KaibelW14,
author = {Kaibel, Volker and Walter, Matthias},
title = {Simple Extensions of Polytopes},
booktitle = {Integer Programming and Combinatorial Optimization, 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014. Proceedings},
publisher = {Springer},
year = {2014},
editor = {Lee, Jon and Vygen, Jens},
volume = {8494},
series = {Lecture Notes in Computer Science},
pages = {309--320},
url = {http://arxiv.org/abs/1311.3470}
}
2014
inproceedings
Lower Bounds on the Sizes of Integer Programs without Additional Variables
Integer Programming and Combinatorial Optimization, 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014. Proceedings
@inproceedings{KaibelW14b,
author = {Kaibel, Volker and Weltge, Stefan},
title = {Lower Bounds on the Sizes of Integer Programs without Additional Variables},
booktitle = {Integer Programming and Combinatorial Optimization, 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014. Proceedings},
publisher = {Springer},
year = {2014},
editor = {Lee, Jon and Vygen, Jens},
volume = {8494},
series = {Lecture Notes in Computer Science},
pages = {321--332}
}
2013
article
Combinatorial Bounds on Nonnegative Rank and Extended Formulations
Discrete Math.
@article{FioriniKPT11,
author = {Fiorini, Samuel and Kaibel, Volker and Pashkovich, Kanstantsin and Theis, Dirk Oliver},
title = {Combinatorial Bounds on Nonnegative Rank and Extended Formulations},
journal = {Discrete Math.},
year = {2013},
volume = {313},
number = {1},
pages = {67-83},
url = {http://arxiv.org/abs/1111.0444}
}
2013
article
Which Nonnegative Matrices Are Slack Matrices?
Linear Algebra Appl.
@article{GouveiaGKPRT13,
author = {Gouveia, Joao and Grappe, Roland and Kaibel, Volker and Pashkovich, Kanstantsin and Robinson, Richard Z. and Thomas, Rekha R.},
title = {Which Nonnegative Matrices Are Slack Matrices?},
journal = {Linear Algebra Appl.},
year = {2013},
number = {439 (10)},
pages = {2921--2933},
url = {http://de.arxiv.org/pdf/1303.5670v1}
}
2013
incollection
Constructing Extended Formulations from Reflection Relations
Facets of Combinatorial Optimization – Festschrift for Martin Grötschel
@incollection{KaibelP13,
author = {Kaibel, Volker and Pashkovich, Kanstantsin},
title = {Constructing Extended Formulations from Reflection Relations},
booktitle = {Facets of Combinatorial Optimization -- Festschrift for Martin Gr\"otschel},
publisher = {Springer Berlin Heidelberg},
year = {2013},
editor = {J\"unger, Michael and Reinelt, Gerhard},
pages = {77-100},
url = {https://cloud.ovgu.de/s/wiRCm9EJXbwJkAm}
}
2012
article
Symmetry Matters for Sizes of Extended Formulations
SIAM J. Disc. Math.
@article{KaibelPT12,
author = {Kaibel, Volker and Pashkovich, Kanstantsin and Theis, Dirk Oliver},
title = {Symmetry Matters for Sizes of Extended Formulations},
journal = {SIAM J. Disc. Math.},
year = {2012},
volume = {26},
number = {3},
pages = {1361--1382},
url = {http://de.arxiv.org/pdf/0911.3712v3}
}
2011
incollection
Basic Polyhedral Theory
Wiley Encyclopedia of Operations Research and Management Science
@incollection{Kaibel11,
author = {Kaibel, Volker},
title = {Basic Polyhedral Theory},
booktitle = {Wiley Encyclopedia of Operations Research and Management Science},
publisher = {Wiley},
year = {2011},
editor = {Cochran, James J.},
url = {http://arxiv.org/abs/1001.2161}
}
2011
misc
Extended Formulations in Combinatorial Optimization
@misc{Kaibel11a,
author = {Kaibel, Volker},
title = {Extended Formulations in Combinatorial Optimization},
year = {2011},
note = {14 pages},
url = {http://www.mathopt.org/Optima-Issues/optima85.pdf}
}
2011
incollection
Finding Descriptions of Polytopes via Extended Formulations and Liftings
Progress in Combinatorial Optimization
@incollection{KaibelL11,
author = {Kaibel, Volker and Loos, Andreas},
title = {Finding Descriptions of Polytopes via Extended Formulations and Liftings},
booktitle = {Progress in Combinatorial Optimization},
publisher = {Wiley},
year = {2011},
editor = {Mahjoub, A. Ridha},
url = {http://arxiv.org/abs/1109.0815}
}
2011
inproceedings
Constructing Extended Formulations from Reflection Relations
Integer Programming and Combinatorial Optimization. Proceedings of IPCO XV, New York, NY
@inproceedings{KaibelP11a,
author = {Kaibel, Volker and Pashkovich, Kanstantsin},
title = {Constructing Extended Formulations from Reflection Relations},
booktitle = {Integer Programming and Combinatorial Optimization. Proceedings of IPCO XV, New York, NY},
publisher = {Springer},
year = {2011},
editor = {G{\"u}nl{\"u}k, O. and Woeginger, G.},
volume = {6655},
series = {Lecture Notes in Computer Science},
pages = {287--300},
url = {http://arxiv.org/abs/1011.3597v1}
}
2011
article
Orbitopal fixing
Discr. Opt.
@article{KaibelPP11,
author = {Kaibel, Volker and Peinhardt, Matthias and Pfetsch, Marc E.},
title = {Orbitopal fixing},
journal = {Discr. Opt.},
year = {2011},
volume = {8},
number = {4},
pages = {595--610},
doi = {10.1016/j.disopt.2011.07.001}
}
2010
inproceedings
Branched Polyhedral Systems
Integer Programming and Combinatorial Optimization. Proceedings of IPCO XIV, Ithaca, NY
@inproceedings{KaibelL10,
author = {Kaibel, Volker and Loos, Andreas},
title = {Branched Polyhedral Systems},
booktitle = {Integer Programming and Combinatorial Optimization. Proceedings of IPCO XIV, Ithaca, NY},
publisher = {Springer},
year = {2010},
editor = {Eisenbrand, Friedrich and Shepherd, Bruce F.},
volume = {6080},
series = {Lecture Notes in Computer Science},
pages = {177--190},
doi = {10.1007/978-3-642-13036-6_14}
}
2010
inproceedings
Symmetry Matters for the Sizes of Extended Formulations
Integer Programming and Combinatorial Optimization. Proceedings of IPCO XIV, Ithaca, NY
@inproceedings{KaibelPT10,
author = {Kaibel, Volker and Pashkovich, Kanstantsin and Theis, Dirk Oliver},
title = {Symmetry Matters for the Sizes of Extended Formulations},
booktitle = {Integer Programming and Combinatorial Optimization. Proceedings of IPCO XIV, Ithaca, NY},
publisher = {Springer},
year = {2010},
editor = {Eisenbrand, Friedrich and Shepherd, Bruce F.},
volume = {6080},
series = {Lecture Notes in Computer Science},
pages = {135--148},
url = {http://arxiv.org/abs/0911.3712v1},
doi = {10.1007/978-3-642-13036-6_11}
}
2010
article
On cardinality constrained cycle and path polytopes
Math. Program.
@article{KaibelS10,
author = {Kaibel, Volker and Stephan, R{{\"u}}diger},
title = {On cardinality constrained cycle and path polytopes},
journal = {Math. Program.},
year = {2010},
volume = {123},
number = {2, Ser. A},
pages = {371--394},
doi = {10.1007/s10107-008-0257-2}
}
2009
article
Extended Formulations for Packing and Partitioning Orbitopes
Math. Oper. Res.
@article{FaenzaK09,
author = {Faenza, Yuri and Kaibel, Volker},
title = {Extended Formulations for Packing and Partitioning Orbitopes},
journal = {Math. Oper. Res.},
year = {2009},
volume = {34},
number = {3},
pages = {686--697},
url = {https://cloud.ovgu.de/s/Tw4TtZ4qLeo2Knw},
doi = {10.1287/moor.1090.0392}
}
2009
electronic
Another Proof of the Fact that Polyhedral Cones are Finitely Generated
@electronic{Kaibel09,
author = {Kaibel, Volker},
title = {Another Proof of the Fact that Polyhedral Cones are Finitely Generated},
year = {2009},
url = {http://arxiv.org/abs/0912.2927v1}
}
2009
electronic
Two Theorems on Projections of Polyhedra
@electronic{Kaibel09a,
author = {Kaibel, Volker},
title = {Two Theorems on Projections of Polyhedra},
year = {2009},
url = {https://cloud.ovgu.de/s/zSiPesdNzcpq6W9}
}
2008
article
A Short Proof of the VPN Tree Routing Conjecture on Ring Networks
Oper. Res. Lett.
@article{GrandoniKOS08,
author = {Grandoni, Fabrizio and Kaibel, Volker and Oriolo, Gianpaolo and Skutella, Martin},
title = {A Short Proof of the {VPN} Tree Routing Conjecture on Ring Networks},
journal = {Oper. Res. Lett.},
year = {2008},
volume = {36},
number = {3},
pages = {361--365},
url = {https://cloud.ovgu.de/s/G4xYf5XcikL6awF},
doi = {10.1016/j.orl.2007.10.008}
}
2008
article
Packing and Partitioning Orbitopes
Math. Program.
@article{KaibelP08,
author = {Kaibel, Volker and Pfetsch, Marc E.},
title = {Packing and Partitioning Orbitopes},
journal = {Math. Program.},
year = {2008},
volume = {114},
number = {1, Ser. A},
pages = {1--36},
url = {http://arxiv.org/pdf/math.OC/0603678},
doi = {10.1007/s10107-006-0081-5}
}
2007
article
Two New Bounds for the Random-Edge Simplex-Algorithm
SIAM J. Disc. Math.
@article{GartnerK07,
author = {G{{\"a}}rtner, Bernd and Kaibel, Volker},
title = {Two New Bounds for the Random-Edge Simplex-Algorithm},
journal = {SIAM J. Disc. Math.},
year = {2007},
volume = {21},
number = {1},
pages = {178--190 (electronic)},
url = {http://arxiv.org/pdf/math.CO/0502025},
doi = {10.1137/05062370X}
}
2007
inproceedings
Orbitopal Fixing
Integer Programming and Combinatorial Optimization. Proceedings of IPCOP XII, Ithaca, NY
@inproceedings{KaibelPP07,
author = {Kaibel, Volker and Peinhardt, Matthias and Pfetsch, Marc E.},
title = {Orbitopal Fixing},
booktitle = {Integer Programming and Combinatorial Optimization. Proceedings of IPCOP XII, Ithaca, NY},
publisher = {Springer},
year = {2007},
editor = {Fischetti, Matteo and Williamson, David P.},
volume = {4315},
series = {Lecture Notes in Computer Science},
pages = {74--88},
address = {Berlin},
url = {http://arxiv.org/pdf/math.OC/0611531},
doi = {10.1007/978-3-540-72792-7_7}
}
2006
article
Revlex-initial $0/1$-polytopes
J. Combin. Theory Ser. A
@article{GillmannK06,
author = {Gillmann, Rafael and Kaibel, Volker},
title = {Revlex-initial {$0/1$}-polytopes},
journal = {J. Combin. Theory Ser. A},
year = {2006},
volume = {113},
number = {5},
pages = {799--821},
url = {http://arxiv.org/pdf/math.CO/0412028},
doi = {10.1016/j.jcta.2005.07.010}
}
2006
techreport
LP-Based Local Approximation for Markov Decision Problems
@techreport{HeinzKPRT06,
author = {Heinz, Stefan and Kaibel, Volker and Peinhardt, Matthias and Rambau, J{\"o}rg and Tuchscherer, Andreas},
title = {LP-Based Local Approximation for Markov Decision Problems},
year = {2006},
url = {https://cloud.ovgu.de/s/x5263H2RLQzA26T}
}
2006
misc
Mathematik für den Volkssport
@misc{KaibelK,
author = {Kaibel, Volker and Koch, Thorsten},
title = {Mathematik f{\"u}r den Volkssport},
year = {2006},
url = {https://cloud.ovgu.de/s/pKxyw5p5S65GYJK}
}
2006
techreport
On the Bottleneck Shortest Path Problem
@techreport{KaibelP06,
author = {Kaibel, Volker and Peinhardt, Matthias},
title = {On the Bottleneck Shortest Path Problem},
year = {2006},
url = {https://cloud.ovgu.de/s/TYQbg9YXYHNmgtn}
}
2004
incollection
On the Expansion of Graphs of 0/1-Polytopes
The Sharpest Cut: The Impact of Manfred Padberg and His Work
@incollection{Kaibel04,
author = {Kaibel, Volker},
title = {On the Expansion of Graphs of 0/1-Polytopes},
booktitle = {The Sharpest Cut: The Impact of Manfred Padberg and His Work},
publisher = {SIAM},
year = {2004},
editor = {Gr{\"o}tschel, Martin},
volume = {4},
series = {MPS-SIAM Series on Optimization},
pages = {199--216},
address = {Philadelphia, PA},
url = {http://arxiv.org/pdf/math.CO/0112146}
}
2004
inproceedings
Low-Dimensional Faces of Random $0/1$-Polytopes
Integer Programming and Combinatorial Optimization. Proceedings of IPCO X, New York, NY
@inproceedings{Kaibel04a,
author = {Kaibel, Volker},
title = {Low-Dimensional Faces of Random {$0/1$}-Polytopes},
booktitle = {Integer Programming and Combinatorial Optimization. Proceedings of IPCO X, New York, NY},
publisher = {Springer},
year = {2004},
editor = {Bienstock, Daniel and Nemhauser, George},
volume = {3064},
series = {Lecture Notes in Computer Science},
pages = {401--415},
url = {https://cloud.ovgu.de/s/2pabi8c4Lsz46gp},
doi = {10.1007/978-3-540-25960-2_30}
}
2004
article
The Simplex Algorithm in Dimension Three
SIAM J. Comput.
@article{KaibelMSZ05,
author = {Kaibel, Volker and Mechtel, Rafael and Sharir, Micha and Ziegler, G{{\"u}}nter M.},
title = {The Simplex Algorithm in Dimension Three},
journal = {SIAM J. Comput.},
year = {2004},
volume = {34},
number = {2},
pages = {475--497 (electronic)},
url = {http://arxiv.org/pdf/math.CO/0309351.pdf},
doi = {10.1137/S0097539703434978}
}
2003
incollection
Rotation Planning for the Continental Service of a European Airline
Mathematics – Key Technologies for the Future. Joint Projects between Universities and Industry
@incollection{ElfJK03,
author = {Elf, Matthias and J{{\"u}}nger, Michael and Kaibel, Volker},
title = {Rotation Planning for the Continental Service of a European Airline},
booktitle = {Mathematics -- Key Technologies for the Future. Joint Projects between Universities and Industry},
publisher = {Springer},
year = {2003},
editor = {J{{\"a}}ger, Willi and Krebs, Hans-Joachim},
pages = {675--689},
url = {https://cloud.ovgu.de/s/PZwqkFj4now6qJH}
}
2003
incollection
Some Algorithmic Problems in Polytope Theory
Algebra, Geometry, and Software Systems
@incollection{KaibelP03,
author = {Kaibel, Volker and Pfetsch, Marc E.},
title = {Some Algorithmic Problems in Polytope Theory},
booktitle = {Algebra, Geometry, and Software Systems},
publisher = {Springer},
year = {2003},
editor = {Joswig, Michael and Takayama, Nobuki},
pages = {23--47},
address = {Berlin},
url = {http://arxiv.org/pdf/math.CO/0202204}
}
2003
inproceedings
On the Graph-Density of Random 0/1-Polytopes
Approximation, Randomization, and Combinatorial Optimization (Proc. RANDOM03)
@inproceedings{KaibelR03a,
author = {Kaibel, Volker and Remshagen, Anja},
title = {On the Graph-Density of Random 0/1-Polytopes},
booktitle = {Approximation, Randomization, and Combinatorial Optimization (Proc. RANDOM03)},
publisher = {Springer},
year = {2003},
editor = {Arora, Sanjeev and Jansen, Klaus and Rolim, Jose D.P. and Sahai, Amit},
volume = {2764},
series = {Lecture Notes in Computer Science},
pages = {318--328},
url = {http://arxiv.org/pdf/math.CO/0306246}
}
2003
article
On the Complexity of Polytope Isomorphism Problems
Graphs Comb.
@article{KaibelS03,
author = {Kaibel, Volker and Schwartz, Alexander},
title = {On the Complexity of Polytope Isomorphism Problems},
journal = {Graphs Comb.},
year = {2003},
volume = {19},
number = {2},
pages = {215--230},
url = {http://arxiv.org/pdf/math.CO/0106093}
}
2003
misc
Automorphism Groups of Cyclic Polytopes
@misc{KaibelW03,
author = {Kaibel, Volker and Wassmer, Arnold},
title = {Automorphism Groups of Cyclic Polytopes},
year = {2003},
url = {https://cloud.ovgu.de/s/yAoQJRR35QiWF6M}
}
2003
incollection
Counting Lattice Triangulations
Surveys in Combinatorics 2003
@incollection{KaibelZ03,
author = {Kaibel, Volker and Ziegler, G{{\"u}}nter M.},
title = {Counting Lattice Triangulations},
booktitle = {Surveys in Combinatorics 2003},
publisher = {Cambridge University Press},
year = {2003},
editor = {Wensley, Christopher D.},
volume = {307},
series = {London Math. Society Lecture Notes Series},
pages = {277--307},
address = {Cambridge, UK},
url = {http://arxiv.org/pdf/math.CO/0211268}
}
2002
article
On the k-Systems of a Simple Polytope
Isr. J. Math.
@article{JoswigKK02,
author = {Joswig, Michael and K{{\"o}}rner, Friederike and Kaibel, Volker},
title = {On the k-Systems of a Simple Polytope},
journal = {Isr. J. Math.},
year = {2002},
volume = {129},
pages = {109--118},
url = {http://arxiv.org/pdf/math.CO/0012204}
}
2002
incollection
Reconstructing a Simple Polytope from its Graph
Combinatorial optimization – Eureka, You Shrink!
@incollection{Kaibel03,
author = {Kaibel, Volker},
title = {Reconstructing a Simple Polytope from its Graph},
booktitle = {Combinatorial optimization -- {E}ureka, You Shrink!},
publisher = {Springer},
year = {2002},
editor = {J{\"u}nger, Michael and Reinelt, Gerhard and Rinaldi, Giovanni},
volume = {2570},
series = {Lecture Notes in Computer Science},
pages = {105--118},
address = {Berlin},
url = {http://arxiv.org/pdf/math.CO/0202103},
doi = {10.1007/3-540-36478-1_11}
}
2002
article
Computing the Face Lattice of a Polytope from its Vertex-Facet Incidences
Comput. Geom.
@article{KaibelP02,
author = {Kaibel, Volker and Pfetsch, Marc E.},
title = {Computing the Face Lattice of a Polytope from its Vertex-Facet Incidences},
journal = {Comput. Geom.},
year = {2002},
volume = {23},
pages = {281--290},
url = {http://arxiv.org/pdf/math.MG/0106043}
}
2001
article
Upper Bounds on the Maximal Number of Facets of 0/1-Polytopes
European J. Comb.
@article{FleinerKR01,
author = {Fleiner, Tamas and Kaibel, Volker and Rote, G{{\"u}}nter},
title = {Upper Bounds on the Maximal Number of Facets of 0/1-Polytopes},
journal = {European J. Comb.},
year = {2001},
volume = {21},
number = {1},
pages = {121--130},
url = {https://cloud.ovgu.de/s/Bm9pfKYNnmsiGfF}
}
2001
article
Vertex-Facet Incidences of Unbounded Polyhedra
Adv. Geom.
@article{JoswigKPZ01,
author = {Joswig, Michael and Kaibel, Volker and Pfetsch, Marc E. and Ziegler, G{{\"u}}nter M.},
title = {Vertex-Facet Incidences of Unbounded Polyhedra},
journal = {Adv. Geom.},
year = {2001},
volume = {1},
number = {1},
pages = {23--36},
url = {http://arxiv.org/pdf/math.CO/0006225}
}
2001
article
On the SQAP-Polytope
SIAM J. Opt.
@article{JungerK01,
author = {J{{\"u}}nger, Michael and Kaibel, Volker},
title = {On the SQAP-Polytope},
journal = {SIAM J. Opt.},
year = {2001},
volume = {11},
number = {2},
pages = {444--468},
url = {https://cloud.ovgu.de/s/XrcfLTkYPd3mwFs}
}
2001
article
The QAP-Polytope and the Star-Transformation
Discr. Appl. Math.
@article{JungerK01a,
author = {J{{\"u}}nger, Michael and Kaibel, Volker},
title = {The QAP-Polytope and the Star-Transformation},
journal = {Discr. Appl. Math.},
year = {2001},
volume = {111},
number = {3},
pages = {283--306},
url = {https://cloud.ovgu.de/s/mf8GzjWQcQm8Pnk}
}
2001
article
Box-Inequalities for Quadratic Assignment Polytopes
Math. Program. Ser. A
@article{JungerK01b,
author = {J{{\"u}}nger, Michael and Kaibel, Volker},
title = {Box-Inequalities for Quadratic Assignment Polytopes},
journal = {Math. Program. Ser. A},
year = {2001},
volume = {91},
pages = {175--197},
url = {https://cloud.ovgu.de/s/qcKLBdnBr5oRzRC}
}
2001
misc
Zum Geburtstag ein Weltrekord
@misc{Kaibel01,
author = {Kaibel, Volker},
title = {Zum Geburtstag ein Weltrekord},
year = {2001},
url = {https://cloud.ovgu.de/s/BXN8tyce3mGWxst}
}
2001
article
Simple 0/1-Polytopes
European J. Comb.
@article{KaibelW01,
author = {Kaibel, Volker and Wolff, Martin},
title = {Simple 0/1-Polytopes},
journal = {European J. Comb.},
year = {2001},
volume = {21},
number = {1},
pages = {139--144},
url = {https://cloud.ovgu.de/s/j8xL5z4oNxZqGa7}
}
2000
incollection
Polyhedral Methods for the QAP
Nonlinear Assignment Problems: Algorithms and Applications
@incollection{Kaibel00,
author = {Kaibel, Volker},
title = {Polyhedral Methods for the QAP},
booktitle = {Nonlinear Assignment Problems: Algorithms and Applications},
publisher = {Kluwer Academic Publishers},
year = {2000},
editor = {Pardalos, Panos M. and Pitsoulis, Leonidas S.},
pages = {109--141},
url = {https://cloud.ovgu.de/s/TFK4AMK3mXxe6Tj}
}
1999
techreport
Randomized Simplex Algorithms and Random Cubes
@techreport{JoswigK99,
author = {Joswig, Michael and Kaibel, Volker},
title = {Randomized Simplex Algorithms and Random Cubes},
year = {1999},
url = {https://cloud.ovgu.de/s/iP3HfrcrLGwmySq}
}
1998
inproceedings
Polyhedral Combinatorics of QAPs with Less Objects than Locations
Proceedings of the 6th International IPCO Conference, Houston, Texas
@inproceedings{Kaibel98,
author = {Kaibel, Volker},
title = {Polyhedral Combinatorics of QAPs with Less Objects than Locations},
booktitle = {Proceedings of the 6th International IPCO Conference, Houston, Texas},
publisher = {Springer},
year = {1998},
editor = {Bixby, Robert E. and Boyd, Andrew E. and Rios-Mercado, Roger Z.},
volume = {1412},
series = {Lecture Notes in Computer Science},
pages = {409--422},
url = {https://cloud.ovgu.de/s/Rtay88ZKyZtpCa4}
}
1997
techreport
Abstract Objective Function Graphs on the 3-Cube - A Classification by Realizability
@techreport{GartnerK97,
author = {G{{\"a}}rtner, Bernd and Kaibel, Volker},
title = {Abstract Objective Function Graphs on the 3-Cube - A Classification by Realizability},
year = {1997},
url = {https://cloud.ovgu.de/s/TFyMqDG3B9J3a3A}
}
1997
phdthesis
Polyhedral Combinatorics of the Quadratic Assignment Problem
Universität zu Köln
@phdthesis{Volk97,
author = {Kaibel, Volker},
title = {Polyhedral Combinatorics of the Quadratic Assignment Problem},
school = {Universit{\"a}t zu K{\"o}ln},
year = {1997},
url = {https://cloud.ovgu.de/s/nYAqzYmticoHmy4}
}
1993
techreport
A Practical Method for Computing Correct Delaunay Triangulations in the Euclidian Metric
@techreport{JuengerKT93,
author = {J{\"u}nger, Michael and Kaibel, Volker and Thienel, Stefan},
title = {A Practical Method for Computing Correct Delaunay Triangulations in the Euclidian Metric},
year = {1993},
url = {https://cloud.ovgu.de/s/sdWweto8ewe2jLn}
}
1993
techreport
Computing Delaunay-Triangulations in Manhattan and Maximum Metric
@techreport{JuengerKT93a,
author = {J{\"u}nger, Michael and Kaibel, Volker and Thienel, Stefan},
title = {Computing Delaunay-Triangulations in Manhattan and Maximum Metric},
year = {1993},
url = {https://cloud.ovgu.de/s/cTQ6Cwxe66jzakN}
}
1993
mastersthesis
Delaunay-Triangulierungen in verschiedenen Metriken
Universität zu Köln
@mastersthesis{Kaibel93,
author = {Kaibel, Volker},
title = {Delaunay-Triangulierungen in verschiedenen Metriken},
school = {Universit{\"a}t zu K{\"o}ln},
year = {1993},
url = {https://cloud.ovgu.de/s/wogjZGRrmt6gnxY}
}
