Publications

QuickSearch:   Number of matching entries: 0.

AuthorTitleYearJournal/ProceedingsReftypeLink
Orlovich, Y., Kukharenko, K., Kaibel, V. & Skums, P. Scale-Free Spanning Trees and Their Application in Genomic Epidemiology 2021 Journal of Computational Biology   article DOI
 
BibTeX:
@article{OrlovichKKS21,
  author = {Yury Orlovich and Kirill Kukharenko and Volker Kaibel and Pavel Skums},
  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},
  comment = {On news pages: kaibel},
  doi = {http://dx.doi.org/10.1089/cmb.2020.0500}
}
Averkov, G., Kaibel, V. & Weltge, S. Maximum Semidefinite and Linear Extension Complexity of Families of Polytopes 2018 Math. Program.   article DOI
 
BibTeX:
@article{AverkovKW16,
  author = {Gennadiy Averkov and Voker Kaibel and Stefan Weltge},
  title = {Maximum Semidefinite and Linear Extension Complexity of Families of Polytopes},
  journal = {Math. Program.},
  year = {2018},
  volume = {167},
  number = {2},
  pages = {381 -- 394},
  comment = {On news pages: kaibel},
  doi = {https://doi.org/10.1007/s10107-017-1134-7}
}
Kaibel, V. & Walter, M. A Note on Matchings Constructed during Edmonds' Weighted Perfect 2017   electronic
url  
BibTeX:
@electronic{KaibelW1712,
  author = {Volker Kaibel and Matthias Walter},
  title = {A Note on Matchings Constructed during Edmonds' Weighted Perfect},
  year = {2017},
  comment = {on news pages: kaibel},
  url = {http://arxiv.org/abs/1703.09505}
}
Kaibel, V., Lee, J., Walter, M. & Weltge, S. Extended Formulations for Independence Polytopes of Regular Matroids 2016 Graphs and Combinatorics   article DOI
url  
BibTeX:
@article{KaibelLWW16,
  author = {Kaibel, Volker and Lee, Jon and Walter, Matthias and Weltge, Stefan},
  title = {Extended Formulations for Independence Polytopes of Regular Matroids},
  journal = {Graphs and Combinatorics},
  year = {2016},
  volume = {32},
  number = {5},
  pages = {1931--1944},
  comment = {On news pages: kaibel,walter,weltge},
  url = {http://arxiv.org/pdf/1504.03872v1},
  doi = {http://dx.doi.org/10.1007/s00373-016-1709-8}
}
Angulo, G., Ahmed, S., Dey, S. S. & Kaibel, V. Forbidden Vertices 2015 Mathematics of Oper. Res.   article DOI
url  
Abstract: 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.
BibTeX:
@article{AnguloADK15,
  author = {Gustavo Angulo and Shabbir Ahmed and Santanu S. Dey and Volker Kaibel},
  title = {Forbidden Vertices},
  journal = {Mathematics of Oper. Res.},
  year = {2015},
  volume = {40},
  number = {2},
  pages = {350-360},
  url = {http://dx.doi.org/10.1287/moor.2014.0673},
  doi = {http://dx.doi.org/10.1287/moor.2014.0673}
}
Conforti, M., Kaibel, V., Walter, M. & Weltge, S. Subgraph polytopes and independence polytopes of count matroids 2015 Operations Research Letters   article DOI
url  
Abstract: 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.
BibTeX:
@article{ConfortiKWW15,
  author = {Michele Conforti and Volker Kaibel and Matthias Walter and Stefan Weltge},
  title = {Subgraph polytopes and independence polytopes of count matroids},
  journal = {Operations Research Letters},
  year = {2015},
  volume = {43},
  number = {5},
  pages = {457 - 460},
  comment = {On news pages: walter, weltge},
  url = {http://www.sciencedirect.com/science/article/pii/S016763771500084X},
  doi = {http://dx.doi.org/10.1016/j.orl.2015.06.011}
}
Kaibel, V., Onn, S. & Sarrabezolles, P. The Unimodular Intersection Problem 2015 Operations Research Letters   article
url  
BibTeX:
@article{KaibelOS15,
  author = {Volker Kaibel and Shmuel Onn and Pauline Sarrabezolles},
  title = {The Unimodular Intersection Problem},
  journal = {Operations Research Letters},
  year = {2015},
  volume = {43},
  number = {6},
  comment = {On news pages:},
  url = {http://arxiv.org/pdf/1502.04301}
}
Kaibel, V. & Weltge, S. A Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially 2015 Discrete and Computational Geometry   article DOI
url  
BibTeX:
@article{KaibelW15,
  author = {Volker Kaibel and Stefan Weltge},
  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},
  comment = {On news pages: weltge},
  url = {http://dx.doi.org/10.1007/s00454-014-9655-9},
  doi = {http://dx.doi.org/10.1007/s00454-014-9655-9}
}
Kaibel, V. & Walter, M. Simple extensions of polytopes 2015 Math. Program. Ser. B   article DOI
url  
BibTeX:
@article{KaibelW15a,
  author = {Volker Kaibel and Matthias Walter},
  title = {Simple extensions of polytopes},
  journal = {Math. Program. Ser. B},
  publisher = {Springer Berlin Heidelberg},
  year = {2015},
  volume = {154},
  number = {1-2},
  pages = {381-406},
  comment = {On news pages: walter},
  url = {http://dx.doi.org/10.1007/s10107-015-0885-2},
  doi = {http://dx.doi.org/10.1007/s10107-015-0885-2}
}
Kaibel, V. & Weltge, S. Lower Bounds on the Sizes of Integer Programs without Additional Variables 2015 Math. Program. Ser. B   article DOI
url  
BibTeX:
@article{KaibelW15b,
  author = {Volker Kaibel and Stefan Weltge},
  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},
  url = {http://dx.doi.org/10.1007/s10107-014-0855-0},
  doi = {http://dx.doi.org/10.1007/s10107-014-0855-0}
}
Kaibel, V. & Walter, M. Simple Extensions of Polytopes 2014 Integer Programming and Combinatorial Optimization, 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014. Proceedings   inproceedings
url  
BibTeX:
@inproceedings{KaibelW14,
  author = {Volker Kaibel and Matthias Walter},
  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 = {Jon Lee and Jens Vygen},
  volume = {8494},
  series = {Lecture Notes in Computer Science},
  pages = {309--320},
  url = {http://arxiv.org/abs/1311.3470}
}
Kaibel, V. & Weltge, S. Lower Bounds on the Sizes of Integer Programs without Additional Variables 2014 Integer Programming and Combinatorial Optimization, 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014. Proceedings   inproceedings
 
BibTeX:
@inproceedings{KaibelW14b,
  author = {Volker Kaibel and Stefan Weltge},
  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 = {Jon Lee and Jens Vygen},
  volume = {8494},
  series = {Lecture Notes in Computer Science},
  pages = {321--332}
}
Fiorini, S., Kaibel, V., Pashkovich, K. & Theis, D. O. Combinatorial Bounds on Nonnegative Rank and Extended Formulations 2013 Discrete Math.   article
url  
BibTeX:
@article{FioriniKPT11,
  author = {Samuel Fiorini and Volker Kaibel and Kanstantsin Pashkovich and Dirk Oliver Theis},
  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}
}
Gouveia, J., Grappe, R., Kaibel, V., Pashkovich, K., Robinson, R. Z. & Thomas, R. R. Which Nonnegative Matrices Are Slack Matrices? 2013 Linear Algebra Appl.   article
url  
BibTeX:
@article{GouveiaGKPRT13,
  author = {Joao Gouveia and Roland Grappe and Volker Kaibel and Kanstantsin Pashkovich and Richard Z. Robinson and Rekha R. Thomas},
  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}
}
Kaibel, V. & Pashkovich, K. Constructing Extended Formulations from Reflection Relations 2013 Facets of Combinatorial Optimization -- Festschrift for Martin Grötschel   incollection
 
BibTeX:
@incollection{KaibelP13,
  author = {Volker Kaibel and Kanstantsin Pashkovich},
  title = {Constructing Extended Formulations from Reflection Relations},
  booktitle = {Facets of Combinatorial Optimization -- Festschrift for Martin Gr\"otschel},
  publisher = {Springer Berlin Heidelberg},
  year = {2013},
  editor = {Michael J\"unger and Gerhard Reinelt},
  pages = {77-100}
}
Kaibel, V., Pashkovich, K. & Theis, D. O. Symmetry Matters for Sizes of Extended Formulations 2012 SIAM J. Disc. Math.   article
url  
BibTeX:
@article{KaibelPT12,
  author = {Volker Kaibel and Kanstantsin Pashkovich and Dirk Oliver Theis},
  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}
}
Kaibel, V. Basic Polyhedral Theory 2011 Wiley Encyclopedia of Operations Research and Management Science   incollection
url  
BibTeX:
@incollection{Kaibel11,
  author = {Volker Kaibel},
  title = {Basic Polyhedral Theory},
  booktitle = {Wiley Encyclopedia of Operations Research and Management Science},
  publisher = {Wiley},
  year = {2011},
  editor = {James J. Cochran},
  url = {http://arxiv.org/abs/1001.2161}
}
Kaibel, V. Extended Formulations in Combinatorial Optimization 2011   misc
preprint  
BibTeX:
@misc{Kaibel11a,
  author = {Volker Kaibel},
  title = {Extended Formulations in Combinatorial Optimization},
  year = {2011},
  howpublished = {Optima 85},
  note = {14 pages},
  url = {http://www.mathopt.org/Optima-Issues/optima85.pdf}
}
Kaibel, V. & Loos, A. Finding Descriptions of Polytopes via Extended Formulations and Liftings 2011 Progress in Combinatorial Optimization   incollection
url  
BibTeX:
@incollection{KaibelL11,
  author = {Volker Kaibel and Andreas Loos},
  title = {Finding Descriptions of Polytopes via Extended Formulations and Liftings},
  booktitle = {Progress in Combinatorial Optimization},
  publisher = {Wiley},
  year = {2011},
  editor = {A. Ridha Mahjoub},
  url = {http://arxiv.org/abs/1109.0815}
}
Kaibel, V. & Pashkovich, K. Constructing Extended Formulations from Reflection Relations 2011 Integer Programming and Combinatorial Optimization. Proceedings of IPCO XV, New York, NY   inproceedings
url  
BibTeX:
@inproceedings{KaibelP11a,
  author = {Volker Kaibel and Kanstantsin Pashkovich},
  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 = {O. G{\"u}nl{\"u}k and G. Woeginger},
  volume = {6655},
  series = {Lecture Notes in Computer Science},
  pages = {287--300},
  url = {http://arxiv.org/abs/1011.3597v1}
}
Kaibel, V., Peinhardt, M. & Pfetsch, M. E. Orbitopal fixing 2011 Discr. Opt.   article DOI
url  
BibTeX:
@article{KaibelPP11,
  author = {Volker Kaibel and Matthias Peinhardt and Marc E. Pfetsch},
  title = {Orbitopal fixing},
  journal = {Discr. Opt.},
  year = {2011},
  volume = {8},
  number = {4},
  pages = {595--610},
  url = {http://dx.doi.org/10.1016/j.disopt.2011.07.001},
  doi = {http://dx.doi.org/10.1016/j.disopt.2011.07.001}
}
Kaibel, V. & Loos, A. Branched Polyhedral Systems 2010 Integer Programming and Combinatorial Optimization. Proceedings of IPCO XIV, Ithaca, NY   inproceedings DOI
url  
BibTeX:
@inproceedings{KaibelL10,
  author = {Volker Kaibel and Andreas Loos},
  title = {Branched Polyhedral Systems},
  booktitle = {Integer Programming and Combinatorial Optimization. Proceedings of IPCO XIV, Ithaca, NY},
  publisher = {Springer},
  year = {2010},
  editor = {Friedrich Eisenbrand and Bruce F. Shepherd},
  volume = {6080},
  series = {Lecture Notes in Computer Science},
  pages = {177--190},
  url = {http://dx.doi.org/10.1007/978-3-642-13036-6_14},
  doi = {http://dx.doi.org/10.1007/978-3-642-13036-6_14}
}
Kaibel, V., Pashkovich, K. & Theis, D. O. Symmetry Matters for the Sizes of Extended Formulations 2010 Integer Programming and Combinatorial Optimization. Proceedings of IPCO XIV, Ithaca, NY   inproceedings DOI
url  
BibTeX:
@inproceedings{KaibelPT10,
  author = {Volker Kaibel and Kanstantsin Pashkovich and Dirk Oliver Theis},
  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 = {Friedrich Eisenbrand and Bruce F. Shepherd},
  volume = {6080},
  series = {Lecture Notes in Computer Science},
  pages = {135--148},
  url = {http://arxiv.org/abs/0911.3712v1},
  doi = {http://dx.doi.org/10.1007/978-3-642-13036-6_11}
}
Kaibel, V. & Stephan, Rü. On cardinality constrained cycle and path polytopes 2010 Math. Program.   article DOI
url  
BibTeX:
@article{KaibelS10,
  author = {Volker Kaibel and R{{\"u}}diger Stephan},
  title = {On cardinality constrained cycle and path polytopes},
  journal = {Math. Program.},
  year = {2010},
  volume = {123},
  number = {2, Ser. A},
  pages = {371--394},
  url = {http://dx.doi.org/10.1007/s10107-008-0257-2},
  doi = {http://dx.doi.org/10.1007/s10107-008-0257-2}
}
Faenza, Y. & Kaibel, V. Extended Formulations for Packing and Partitioning Orbitopes 2009 Math. Oper. Res.   article DOI
url  
BibTeX:
@article{FaenzaK09,
  author = {Yuri Faenza and Volker Kaibel},
  title = {Extended Formulations for Packing and Partitioning Orbitopes},
  journal = {Math. Oper. Res.},
  year = {2009},
  volume = {34},
  number = {3},
  pages = {686--697},
  url = {http://dx.doi.org/10.1287/moor.1090.0392},
  doi = {http://dx.doi.org/10.1287/moor.1090.0392}
}
Kaibel, V. Another Proof of the Fact that Polyhedral Cones are Finitely Generated 2009   electronic
url  
BibTeX:
@electronic{Kaibel09,
  author = {Volker Kaibel},
  title = {Another Proof of the Fact that Polyhedral Cones are Finitely Generated},
  year = {2009},
  url = {http://arxiv.org/abs/0912.2927v1}
}
Kaibel, V. Two Theorems on Projections of Polyhedra 2009   electronic
url  
BibTeX:
@electronic{Kaibel09a,
  author = {Volker Kaibel},
  title = {Two Theorems on Projections of Polyhedra},
  year = {2009},
  url = {http://www.math.uni-magdeburg.de/~kaibel/Downloads/LocalPapers/Kaibel09a.pdf}
}
Grandoni, F., Kaibel, V., Oriolo, G. & Skutella, M. A Short Proof of the VPN Tree Routing Conjecture on Ring Networks 2008 Oper. Res. Lett.   article DOI
url  
BibTeX:
@article{GrandoniKOS08,
  author = {Fabrizio Grandoni and Kaibel, Volker and Gianpaolo Oriolo and Martin Skutella},
  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 = {http://dx.doi.org/10.1016/j.orl.2007.10.008},
  doi = {http://dx.doi.org/10.1016/j.orl.2007.10.008}
}
Kaibel, V. & Pfetsch, M. E. Packing and Partitioning Orbitopes 2008 Math. Program.   article DOI
url  
BibTeX:
@article{KaibelP08,
  author = {Volker Kaibel and Marc E. Pfetsch},
  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 = {http://dx.doi.org/10.1007/s10107-006-0081-5}
}
Gärtner, B. & Kaibel, V. Two New Bounds for the Random-Edge Simplex-Algorithm 2007 SIAM J. Disc. Math.   article DOI
url  
BibTeX:
@article{GartnerK07,
  author = {Bernd G{{\"a}}rtner and Volker Kaibel},
  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 = {http://dx.doi.org/10.1137/05062370X}
}
Jünger, M. & Kaibel, V. Special issue on IPCO 2005 2007 Math. Program.   article
 
BibTeX:
@article{JungerK07,
  author = {Michael J{\"u}nger and Volker Kaibel},
  title = {Special issue on IPCO 2005},
  journal = {Math. Program.},
  publisher = {Springer},
  year = {2007},
  volume = {110},
  number = {1},
  pages = {1--2}
}
Kaibel, V., Peinhardt, M. & Pfetsch, M. E. Orbitopal Fixing 2007 Integer Programming and Combinatorial Optimization. Proceedings of IPCOP XII, Ithaca, NY   inproceedings DOI
url  
BibTeX:
@inproceedings{KaibelPP07,
  author = {Volker Kaibel and Matthias Peinhardt and Marc E. Pfetsch},
  title = {Orbitopal Fixing},
  booktitle = {Integer Programming and Combinatorial Optimization. Proceedings of IPCOP XII, Ithaca, NY},
  publisher = {Springer},
  year = {2007},
  editor = {Matteo Fischetti and David P. Williamson},
  volume = {4315},
  series = {Lecture Notes in Computer Science},
  pages = {74--88},
  address = {Berlin},
  url = {http://arxiv.org/pdf/math.OC/0611531},
  doi = {http://dx.doi.org/10.1007/978-3-540-72792-7_7}
}
Gillmann, R. & Kaibel, V. Revlex-initial $0/1$-polytopes 2006 J. Combin. Theory Ser. A   article DOI
url  
BibTeX:
@article{GillmannK06,
  author = {Rafael Gillmann and Volker Kaibel},
  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 = {http://dx.doi.org/10.1016/j.jcta.2005.07.010}
}
Heinz, S., Kaibel, V., Peinhardt, M., Rambau, Jö. & Tuchscherer, A. LP-Based Local Approximation for Markov Decision Problems 2006   techreport
url  
BibTeX:
@techreport{HeinzKPRT06,
  author = {Stefan Heinz and Volker Kaibel and Matthias Peinhardt and J{\"o}rg Rambau and Andreas Tuchscherer},
  title = {LP-Based Local Approximation for Markov Decision Problems},
  year = {2006},
  url = {http://www.math.uni-magdeburg.de/~kaibel/Downloads/LocalPapers/HeinzKPRT06.pdf}
}
Kaibel, V. & Koch, T. Mathematik für den Volkssport 2006   misc
preprint  
BibTeX:
@misc{KaibelK,
  author = {Volker Kaibel and Thorsten Koch},
  title = {Mathematik f{\"u}r den Volkssport},
  year = {2006},
  howpublished = {DMV-Mitteilungen II/06, 93--96},
  url = {http://www.math.uni-magdeburg.de/~kaibel/Downloads/LocalPapers/KaibelK.pdf}
}
Kaibel, V. & Peinhardt, M. On the Bottleneck Shortest Path Problem 2006   techreport
url  
BibTeX:
@techreport{KaibelP06,
  author = {Volker Kaibel and Matthias Peinhardt},
  title = {On the Bottleneck Shortest Path Problem},
  year = {2006},
  url = {http://www.math.uni-magdeburg.de/~kaibel/Downloads/LocalPapers/KaibelP06.pdf}
}
Kaibel, V. On the Expansion of Graphs of 0/1-Polytopes 2004 The Sharpest Cut: The Impact of Manfred Padberg and His Work   incollection
url  
BibTeX:
@incollection{Kaibel04,
  author = {Volker Kaibel},
  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 = {Martin Gr{\"o}tschel},
  volume = {4},
  series = {MPS-SIAM Series on Optimization},
  pages = {199--216},
  address = {Philadelphia, PA},
  url = {http://arxiv.org/pdf/math.CO/0112146}
}
Kaibel, V. Low-Dimensional Faces of Random $0/1$-Polytopes 2004 Integer Programming and Combinatorial Optimization. Proceedings of IPCO X, New York, NY   inproceedings DOI
url  
BibTeX:
@inproceedings{Kaibel04a,
  author = {Volker Kaibel},
  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 = {Daniel Bienstock and George Nemhauser},
  volume = {3064},
  series = {Lecture Notes in Computer Science},
  pages = {401--415},
  url = {http://www.math.uni-magdeburg.de/~kaibel/Downloads/LocalPapers/Kaibel04a.pdf},
  doi = {http://dx.doi.org/10.1007/978-3-540-25960-2_30}
}
Kaibel, V., Mechtel, R., Sharir, M. & Ziegler, Gü. M. The Simplex Algorithm in Dimension Three 2004 SIAM J. Comput.   article DOI
url  
BibTeX:
@article{KaibelMSZ05,
  author = {Volker Kaibel and Rafael Mechtel and Micha Sharir and G{{\"u}}nter M. Ziegler},
  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 = {http://dx.doi.org/10.1137/S0097539703434978}
}
Elf, M., Jünger, M. & Kaibel, V. Rotation Planning for the Continental Service of a European Airline 2003 Mathematics -- Key Technologies for the Future. Joint Projects between Universities and Industry   incollection
url  
BibTeX:
@incollection{ElfJK03,
  author = {Matthias Elf and Michael J{{\"u}}nger and Volker Kaibel},
  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 = {Willi J{{\"a}}ger and Hans-Joachim Krebs},
  pages = {675--689},
  url = {http://www.math.uni-magdeburg.de/~kaibel/Downloads/LocalPapers/ElfJK03.pdf}
}
Kaibel, V. & Pfetsch, M. E. Some Algorithmic Problems in Polytope Theory 2003 Algebra, Geometry, and Software Systems   incollection
url  
BibTeX:
@incollection{KaibelP03,
  author = {Volker Kaibel and Marc E. Pfetsch},
  title = {Some Algorithmic Problems in Polytope Theory},
  booktitle = {Algebra, Geometry, and Software Systems},
  publisher = {Springer},
  year = {2003},
  editor = {Michael Joswig and Nobuki Takayama},
  pages = {23--47},
  address = {Berlin},
  url = {http://arxiv.org/pdf/math.CO/0202204}
}
Kaibel, V. & Remshagen, A. On the Graph-Density of Random 0/1-Polytopes 2003 Approximation, Randomization, and Combinatorial Optimization (Proc. RANDOM03)   inproceedings
url  
BibTeX:
@inproceedings{KaibelR03a,
  author = {Volker Kaibel and Anja Remshagen},
  title = {On the Graph-Density of Random 0/1-Polytopes},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization (Proc. RANDOM03)},
  publisher = {Springer},
  year = {2003},
  editor = {Sanjeev Arora and Klaus Jansen and Jose D.P. Rolim and Amit Sahai},
  volume = {2764},
  series = {Lecture Notes in Computer Science},
  pages = {318--328},
  url = {http://arxiv.org/pdf/math.CO/0306246}
}
Kaibel, V. & Schwartz, A. On the Complexity of Polytope Isomorphism Problems 2003 Graphs Comb.   article
url  
BibTeX:
@article{KaibelS03,
  author = {Volker Kaibel and Alexander Schwartz},
  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}
}
Kaibel, V. & Wassmer, A. Automorphism Groups of Cyclic Polytopes 2003   misc
preprint  
BibTeX:
@misc{KaibelW03,
  author = {Volker Kaibel and Arnold Wassmer},
  title = {Automorphism Groups of Cyclic Polytopes},
  year = {2003},
  url = {http://www.math.uni-magdeburg.de/~kaibel/Downloads/LocalPapers/KaibelW03.pdf}
}
Kaibel, V. & Ziegler, Gü. M. Counting Lattice Triangulations 2003 Surveys in Combinatorics 2003   incollection
url  
BibTeX:
@incollection{KaibelZ03,
  author = {Volker Kaibel and G{{\"u}}nter M. Ziegler},
  title = {Counting Lattice Triangulations},
  booktitle = {Surveys in Combinatorics 2003},
  publisher = {Cambridge University Press},
  year = {2003},
  editor = {Christopher D. Wensley},
  volume = {307},
  series = {London Math. Society Lecture Notes Series},
  pages = {277--307},
  address = {Cambridge, UK},
  url = {http://arxiv.org/pdf/math.CO/0211268}
}
Joswig, M., Körner, F. & Kaibel, V. On the k-Systems of a Simple Polytope 2002 Isr. J. Math.   article
url  
BibTeX:
@article{JoswigKK02,
  author = {Michael Joswig and Friederike K{{\"o}}rner and Volker Kaibel},
  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}
}
Kaibel, V. Reconstructing a Simple Polytope from its Graph 2002 Combinatorial optimization -- Eureka, You Shrink!   incollection DOI
url  
BibTeX:
@incollection{Kaibel03,
  author = {Volker Kaibel},
  title = {Reconstructing a Simple Polytope from its Graph},
  booktitle = {Combinatorial optimization -- {E}ureka, You Shrink!},
  publisher = {Springer},
  year = {2002},
  editor = {Michael J{\"u}nger and Gerhard Reinelt and Giovanni Rinaldi},
  volume = {2570},
  series = {Lecture Notes in Computer Science},
  pages = {105--118},
  address = {Berlin},
  url = {http://arxiv.org/pdf/math.CO/0202103},
  doi = {http://dx.doi.org/10.1007/3-540-36478-1_11}
}
Kaibel, V. & Pfetsch, M. E. Computing the Face Lattice of a Polytope from its Vertex-Facet Incidences 2002 Comput. Geom.   article
url  
BibTeX:
@article{KaibelP02,
  author = {Volker Kaibel and Marc E. Pfetsch},
  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}
}
Fleiner, T., Kaibel, V. & Rote, Gü. Upper Bounds on the Maximal Number of Facets of 0/1-Polytopes 2001 European J. Comb.   article
url  
BibTeX:
@article{FleinerKR01,
  author = {Tamas Fleiner and Volker Kaibel and G{{\"u}}nter Rote},
  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 = {http://www.math.uni-magdeburg.de/~kaibel/Downloads/LocalPapers/FleinerKR01.pdf}
}
Joswig, M., Kaibel, V., Pfetsch, M. E. & Ziegler, Gü. M. Vertex-Facet Incidences of Unbounded Polyhedra 2001 Adv. Geom.   article
url  
BibTeX:
@article{JoswigKPZ01,
  author = {Michael Joswig and Volker Kaibel and Marc E. Pfetsch and G{{\"u}}nter M. Ziegler},
  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}
}
Jünger, M. & Kaibel, V. On the SQAP-Polytope 2001 SIAM J. Opt.   article
url  
BibTeX:
@article{JungerK01,
  author = {Michael J{{\"u}}nger and Volker Kaibel},
  title = {On the SQAP-Polytope},
  journal = {SIAM J. Opt.},
  year = {2001},
  volume = {11},
  number = {2},
  pages = {444--468},
  url = {http://www.math.uni-magdeburg.de/~kaibel/Downloads/LocalPapers/JungerK01.pdf}
}
Jünger, M. & Kaibel, V. The QAP-Polytope and the Star-Transformation 2001 Discr. Appl. Math.   article
url  
BibTeX:
@article{JungerK01a,
  author = {Michael J{{\"u}}nger and Volker Kaibel},
  title = {The QAP-Polytope and the Star-Transformation},
  journal = {Discr. Appl. Math.},
  year = {2001},
  volume = {111},
  number = {3},
  pages = {283--306},
  url = {http://www.math.uni-magdeburg.de/~kaibel/Downloads/LocalPapers/JungerK01a.pdf}
}
Jünger, M. & Kaibel, V. Box-Inequalities for Quadratic Assignment Polytopes 2001 Math. Program. Ser. A   article
url  
BibTeX:
@article{JungerK01b,
  author = {Michael J{{\"u}}nger and Volker Kaibel},
  title = {Box-Inequalities for Quadratic Assignment Polytopes},
  journal = {Math. Program. Ser. A},
  year = {2001},
  volume = {91},
  pages = {175--197},
  url = {http://www.math.uni-magdeburg.de/~kaibel/Downloads/LocalPapers/JungerK01b.pdf}
}
Kaibel, V. Zum Geburtstag ein Weltrekord 2001   misc
preprint  
BibTeX:
@misc{Kaibel01,
  author = {Volker Kaibel},
  title = {Zum Geburtstag ein Weltrekord},
  year = {2001},
  howpublished = {DMV-Mitteilungen IV/01, 16--18},
  url = {http://www.math.uni-magdeburg.de/~kaibel/Downloads/LocalPapers/Kaibel01.pdf}
}
Kaibel, V. & Wolff, M. Simple 0/1-Polytopes 2001 European J. Comb.   article
url  
BibTeX:
@article{KaibelW01,
  author = {Volker Kaibel and Martin Wolff},
  title = {Simple 0/1-Polytopes},
  journal = {European J. Comb.},
  year = {2001},
  volume = {21},
  number = {1},
  pages = {139--144},
  url = {http://www.math.uni-magdeburg.de/~kaibel/Downloads/LocalPapers/KaibelW01}
}
Kaibel, V. Polyhedral Methods for the QAP 2000 Nonlinear Assignment Problems: Algorithms and Applications   incollection
url  
BibTeX:
@incollection{Kaibel00,
  author = {Volker Kaibel},
  title = {Polyhedral Methods for the QAP},
  booktitle = {Nonlinear Assignment Problems: Algorithms and Applications},
  publisher = {Kluwer Academic Publishers},
  year = {2000},
  editor = {Panos M. Pardalos and Leonidas S. Pitsoulis},
  pages = {109--141},
  url = {http://www.math.uni-magdeburg.de/~kaibel/Downloads/LocalPapers/Kaibel00.pdf}
}
Joswig, M. & Kaibel, V. Randomized Simplex Algorithms and Random Cubes 1999   techreport
url  
BibTeX:
@techreport{JoswigK99,
  author = {Michael Joswig and Volker Kaibel},
  title = {Randomized Simplex Algorithms and Random Cubes},
  year = {1999},
  url = {http://www.math.uni-magdeburg.de/~kaibel/Downloads/LocalPapers/JoswigK99.pdf}
}
Kaibel, V. Polyhedral Combinatorics of QAPs with Less Objects than Locations 1998 Proceedings of the 6th International IPCO Conference, Houston, Texas   inproceedings
url  
BibTeX:
@inproceedings{Kaibel98,
  author = {Volker Kaibel},
  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 = {Robert E. Bixby and Andrew E. Boyd and Roger Z. Rios-Mercado},
  volume = {1412},
  series = {Lecture Notes in Computer Science},
  pages = {409--422},
  url = {http://www.math.uni-magdeburg.de/~kaibel/Downloads/LocalPapers/Kaibel98.pdf}
}
Gärtner, B. & Kaibel, V. Abstract Objective Function Graphs on the 3-Cube - A Classification by Realizability 1997   techreport
url  
BibTeX:
@techreport{GartnerK97,
  author = {Bernd G{{\"a}}rtner and Volker Kaibel},
  title = {Abstract Objective Function Graphs on the 3-Cube - A Classification by Realizability},
  year = {1997},
  url = {http://www.math.uni-magdeburg.de/~kaibel/Downloads/LocalPapers/GartnerK97.pdf}
}
Kaibel, V. Polyhedral Combinatorics of the Quadratic Assignment Problem 1997 School: Universität zu Köln   phdthesis
url  
BibTeX:
@phdthesis{Volk97,
  author = {Volker Kaibel},
  title = {Polyhedral Combinatorics of the Quadratic Assignment Problem},
  school = {Universit{\"a}t zu K{\"o}ln},
  year = {1997},
  url = {http://www.math.uni-magdeburg.de/~kaibel/Downloads/LocalPapers/Volk97.pdf}
}
Jünger, M., Kaibel, V. & Thienel, S. A Practical Method for Computing Correct Delaunay Triangulations in the Euclidian Metric 1993   techreport
url  
BibTeX:
@techreport{JuengerKT93,
  author = {Michael J{\"u}nger and Volker Kaibel and Stefan Thienel},
  title = {A Practical Method for Computing Correct Delaunay Triangulations in the Euclidian Metric},
  year = {1993},
  url = {http://www.math.uni-magdeburg.de/~kaibel/Downloads/LocalPapers/JuengerKT93.pdf}
}
Jünger, M., Kaibel, V. & Thienel, S. Computing Delaunay-Triangulations in Manhattan and Maximum Metric 1993   techreport
url  
BibTeX:
@techreport{JuengerKT93a,
  author = {Michael J{\"u}nger and Volker Kaibel and Stefan Thienel},
  title = {Computing Delaunay-Triangulations in Manhattan and Maximum Metric},
  year = {1993},
  url = {http://www.math.uni-magdeburg.de/~kaibel/Downloads/LocalPapers/JuengerKT93a.pdf}
}
Kaibel, V. Delaunay-Triangulierungen in verschiedenen Metriken 1993 School: Universität zu Köln   mastersthesis
url  
BibTeX:
@mastersthesis{Kaibel93,
  author = {Volker Kaibel},
  title = {Delaunay-Triangulierungen in verschiedenen Metriken},
  school = {Universit{\"a}t zu K{\"o}ln},
  year = {1993},
  url = {http://www.math.uni-magdeburg.de/~kaibel/Downloads/LocalPapers/Kaibel93.pdf}
}

Created by JabRef on 22/05/2022. Thanks to Mark Schenk.

  • currently no upcoming news

...more

Susanne Heß

Universitätsplatz 2, 02-201
39106 Magdeburg, Germany

: +49 391 67 58756
:

  • currently no upcoming news

...more

Susanne Heß

Universitätsplatz 2, 02-201
39106 Magdeburg, Germany

: +49 391 67 58756
: