default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVolker Kaibel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j30]Damek Shea Davis, Oktay Günlük, Volker Kaibel, Giacomo Nannicini, Xa-Xiang Yuan:
Special Issue: International Symposium on Mathematical Programming 2022. Math. Program. 200(2): 629-631 (2023)- [j29]Elisabeth Lobe
, Volker Kaibel:
Optimal sufficient requirements on the embedded Ising problem in polynomial time. Quantum Inf. Process. 22(8): 305 (2023) - [e2]Alberto Del Pia, Volker Kaibel:
Integer Programming and Combinatorial Optimization - 24th International Conference, IPCO 2023, Madison, WI, USA, June 21-23, 2023, Proceedings. Lecture Notes in Computer Science 13904, Springer 2023, ISBN 978-3-031-32725-4 [contents] - [i7]Elisabeth Lobe, Volker Kaibel:
Optimal Sufficient Requirements on the Embedded Ising Problem in Polynomial Time. CoRR abs/2302.04162 (2023) - 2021
- [j28]Yury L. Orlovich, Kirill Kukharenko, Volker Kaibel, Pavel Skums:
Scale-Free Spanning Trees and Their Application in Genomic Epidemiology. J. Comput. Biol. 28(10): 945-960 (2021) - 2020
- [j27]Volker Kaibel, Jon Lee, Matthias Walter, Stefan Weltge:
Correction to: Extended Formulations for Independence Polytopes of Regular Matroids. Graphs Comb. 36(1): 177-179 (2020)
2010 – 2019
- 2018
- [j26]Gennadiy Averkov, Volker Kaibel, Stefan Weltge:
Maximum semidefinite and linear extension complexity of families of polytopes. Math. Program. 167(2): 381-394 (2018) - 2017
- [i6]Volker Kaibel, Matthias Walter:
A Note on Matchings Constructed during Edmonds' Weighted Perfect Matching Algorithm. CoRR abs/1703.09505 (2017) - 2016
- [j25]Volker Kaibel, Jon Lee, Matthias Walter, Stefan Weltge:
Extended Formulations for Independence Polytopes of Regular Matroids. Graphs Comb. 32(5): 1931-1944 (2016) - [i5]Gennadiy Averkov, Volker Kaibel, Stefan Weltge:
Maximum Semidefinite and Linear Extension Complexity of Families of Polytopes. CoRR abs/1605.08538 (2016) - 2015
- [j24]Volker Kaibel, Stefan Weltge:
A Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially. Discret. Comput. Geom. 53(2): 397-401 (2015) - [j23]Gustavo Angulo, Shabbir Ahmed, Santanu S. Dey, Volker Kaibel:
Forbidden Vertices. Math. Oper. Res. 40(2): 350-360 (2015) - [j22]Volker Kaibel, Rekha R. Thomas:
Lifts of convex sets in optimization. Math. Program. 153(1): 1-3 (2015) - [j21]Volker Kaibel, Matthias Walter:
Simple extensions of polytopes. Math. Program. 154(1-2): 381-406 (2015) - [j20]Volker Kaibel, Stefan Weltge:
Lower bounds on the sizes of integer programs without additional variables. Math. Program. 154(1-2): 407-425 (2015) - [j19]Michele Conforti, Volker Kaibel, Matthias Walter, Stefan Weltge:
Subgraph polytopes and independence polytopes of count matroids. Oper. Res. Lett. 43(5): 457-460 (2015) - [j18]Volker Kaibel, Shmuel Onn, Pauline Sarrabezolles:
The unimodular intersection problem. Oper. Res. Lett. 43(6): 592-594 (2015) - [i4]Michele Conforti, Volker Kaibel, Matthias Walter, Stefan Weltge:
Subgraph Polytopes and Independence Polytopes of Count Matroids. CoRR abs/1502.02817 (2015) - [i3]Volker Kaibel, Jon Lee, Matthias Walter, Stefan Weltge:
Extended Formulations for Independence Polytopes of Regular Matroids. CoRR abs/1504.03872 (2015) - 2014
- [c11]Volker Kaibel, Matthias Walter:
Simple Extensions of Polytopes. IPCO 2014: 309-320 - [c10]Volker Kaibel, Stefan Weltge:
Lower Bounds on the Sizes of Integer Programs without Additional Variables. IPCO 2014: 321-332 - 2013
- [j17]Samuel Fiorini, Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis:
Combinatorial bounds on nonnegative rank and extended formulations. Discret. Math. 313(1): 67-83 (2013) - [i2]Volker Kaibel, Matthias Walter:
Simple Extensions of Polytopes. CoRR abs/1311.3470 (2013) - 2012
- [j16]Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis:
Symmetry Matters for Sizes of Extended Formulations. SIAM J. Discret. Math. 26(3): 1361-1382 (2012) - 2011
- [j15]Volker Kaibel, Matthias Peinhardt, Marc E. Pfetsch:
Orbitopal fixing. Discret. Optim. 8(4): 595-610 (2011) - [c9]Volker Kaibel, Kanstantsin Pashkovich:
Constructing Extended Formulations from Reflection Relations. IPCO 2011: 287-300 - [i1]Samuel Fiorini, Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis:
Combinatorial Bounds on Nonnegative Rank and Extended Formulations. CoRR abs/1111.0444 (2011) - 2010
- [j14]Volker Kaibel, Rüdiger Stephan:
On cardinality constrained cycle and path polytopes. Math. Program. 123(2): 371-394 (2010) - [c8]Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis:
Symmetry Matters for the Sizes of Extended Formulations. IPCO 2010: 135-148 - [c7]Volker Kaibel, Andreas Loos:
Branched Polyhedral Systems. IPCO 2010: 177-190
2000 – 2009
- 2009
- [j13]Yuri Faenza, Volker Kaibel:
Extended Formulations for Packing and Partitioning Orbitopes. Math. Oper. Res. 34(3): 686-697 (2009) - 2008
- [j12]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
- [j11]Michael Jünger, Volker Kaibel:
Foreword: Special issue on IPCO 2005. Math. Program. 110(1): 1-2 (2007) - [j10]Bernd Gärtner, Volker Kaibel:
Two New Bounds for the Random-Edge Simplex-Algorithm. SIAM J. Discret. Math. 21(1): 178-190 (2007) - [c6]Volker Kaibel, Matthias Peinhardt, Marc E. Pfetsch:
Orbitopal Fixing. IPCO 2007: 74-88 - 2006
- [j9]Rafael Gillmann, Volker Kaibel:
Revlex-initial 0/1-polytopes. J. Comb. Theory A 113(5): 799-821 (2006) - 2005
- [e1]Michael Jünger, Volker Kaibel:
Integer Programming and Combinatorial Optimization, 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings. Lecture Notes in Computer Science 3509, Springer 2005, ISBN 3-540-26199-0 [contents] - 2004
- [j8]Volker Kaibel, Rafael Mechtel, Micha Sharir, Günter M. Ziegler:
The Simplex Algorithm in Dimension Three. SIAM J. Comput. 34(2): 475-497 (2004) - [c5]Volker Kaibel:
Low-Dimensional Faces of Random 0/1-Polytopes. IPCO 2004: 401-415 - [p1]Volker Kaibel:
On the Expansion of Graphs of 0/1-Polytopes. The Sharpest Cut 2004: 199-216 - 2003
- [j7]Volker Kaibel, Alexander Schwartz:
On the Complexity of Polytope Isomorphism Problems. Graphs Comb. 19(2): 215-230 (2003) - [c4]Volker Kaibel, Marc E. Pfetsch:
Some Algorithmic Problems in Polytope Theory. Algebra, Geometry, and Software Systems 2003: 23-47 - [c3]Volker Kaibel, Anja Remshagen:
On the Graph-Density of Random 0/1-Polytopes. RANDOM-APPROX 2003: 318-328 - 2002
- [j6]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
- [j5]Michael Jünger, Volker Kaibel:
The QAP-polytope and the star transformation. Discret. Appl. Math. 111(3): 283-306 (2001) - [j4]Michael Jünger, Volker Kaibel:
Box-inequalities for quadratic assignment polytopes. Math. Program. 91(1): 175-197 (2001) - [c2]Volker Kaibel:
Reconstructing a Simple Polytope from Its Graph. Combinatorial Optimization 2001: 105-118 - 2000
- [j3]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) - [j2]Volker Kaibel, Martin Wolff:
Simple 0/1-Polytopes. Eur. J. Comb. 21(1): 139-144 (2000) - [j1]Michael Jünger, Volker Kaibel:
On the SQAP-Polytope. SIAM J. Optim. 11(2): 444-463 (2000)
1990 – 1999
- 1998
- [c1]Volker Kaibel:
Polyhedral Combinatorics of Quadratic Assignment Problems with Less Objects than Locations. IPCO 1998: 409-422
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
