The Gaussian conditional independence inference problem
In: Magdeburg: Universitätsbibliothek, 2022, 1 Online-Ressource (ii, 143 Seiten, 1,33 MB), Formeln

Combinatorial problems in programming quantum annealers
In: Magdeburg: Universitätsbibliothek, 2022, 1 Online-Ressource (II, 156, Seite III-X, 2,5 MB), Illustrationen

Scale-free spanning trees and their application in genomic epidemiology
In: Journal of computational biology - Larchmont, NY: Liebert, Bd. 28 (2021), 10, S. 945-960

Maximum semidefinite and linear extension complexity of families of polytopes
In: Mathematical programming: Series A, Series B ; a publication of the Mathematical Programming Society - Berlin: Springer, 1971, Bd. 167.2018, 2, S. 381-394

Undominated complexes of cut polytopes
In: Magdeburg, 2018, viii, 169 Seiten, Illustrationen ; [Literaturverzeichnis: Seite 167-169]

A note on matchings constructed during Edmonds' weighted perfect matching algorithm
In: Magdeburg: Universität, Fakultät für Mathematik, 2017, 8 Seiten - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2017,Nr.06)

Maximum semidefinite and linear extension complexity of families of polytopes
In: De.arxiv.org - [S.l.]: Arxiv.org, 1991 . - 2016, insges. 11 S.

Extended formulations for independence polytopes of regular matroids
In: Graphs and combinatorics - Tokyo: Springer-Verl. Tokyo, 1985, Bd. 32.2016, 5, S. 1931-1944

Subgraph polytopes and independence polytopes of count matroids
In: Operations research letters: a journal of INFORMS devoted to the rapid publication of concise contributions in operations research - Amsterdam [u.a.]: Elsevier Science, Bd. 43.2015, 5, S. 457-460

Lifts of convex sets in optimization
In: Mathematical programming: Series A, Series B : a publication of the Mathematical Programming Society - Berlin: Springer, Bd. 153.2015, 1, S. 1-3

The unimodular intersection problem
In: Operations Research Letters, 2015, S. 592-594, ISSN 01676377, 10.1016/j.orl.2015.09.005

Which nonnegative matrices are slack matrices?
In: De.arxiv.org. - [S.l.] : Arxiv.org, insges. 14 S., 2014

Lower bounds on the sizes of integer programs without additional variables
In: Integer programming and combinatorial optimization. - Cham [u.a.] : Springer, S. 321-332, 2014 - (Lecture notes in computer science; 8494)

Simple extensions of polytopes
In: Integer programming and combinatorial optimization. - Cham [u.a.] : Springer, S. 309-320, 2014 - (Lecture notes in computer science; 8494)

Combinatorial bounds on nonnegative rank and extended formulations
In: Discrete mathematics. - Amsterdam : Elsevier Science, Bd. 313.2013, 1, S. 67-83

Which nonnegative matrices are slack matrices?
In: Linear algebra and its applications. - New York, NY : American Elsevier Publ, Bd. 439.2013, 10, S. 2921-2933

Forbidden vertices
In: Magdeburg: Univ., Fak. für Mathematik, 2013, 15 S. - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2013,23)

Which nonnegative matrices are slack matrices?
In: Magdeburg: Univ., Fak. für Mathematik, 2013, 14 S. - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2013,6)

A short proof that the extension complexity of the correlation polytope grows exponentially
In: Magdeburg: Univ., Fak. für Mathematik, 2013, [10] S. - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2013,25)

Lower bounds on the sizes of integer programs without additional variables
In: Magdeburg: Univ., Fak. für Mathematik, 2013, [17] S. - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2013,26)

Simple extensions of polytopes
In: Magdeburg: Univ., Fak. für Mathematik, 2013, 21 S. - (Preprint; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2013,24)

Symmetry matters for sizes of extended formulations
In: SIAM journal on discrete mathematics. - Philadelphia, Pa : Soc, Bd. 26.2012, 3, S. 1361-1382

Mixed-integer programming subject to uncertain data
In: Zugl.: Magdeburg, Otto-von-Guericke-Univ., Fak. für Mathematik., Diss., 2012: Göttingen: Cuvillier, 1. Aufl., X, 123 S., graph. Darst., 21 cm

Extended formulations in combinatorial optimization
In: Optima. - Philadelphia, Pa. [u.a.] : Soc., 85, S. 2-7, 2011

Basic polyhedral theory
In: De.arxiv.org. - [S.l.] : Arxiv.org, insges. 14 S., 2011

Extended formulations in combinatorial optimization
In: De.arxiv.org. - [S.l.] : Arxiv.org, insges. 14 S., 2011

Finding descriptions of polytopes via extended formulations and liftings
In: De.arxiv.org. - [S.l.] : Arxiv.org, insges. 20 S., 2011

Orbitopal fixing
In: Discrete optimization. - New York, NY [u.a.] : Elsevier, Bd. 8.2011, 4, S. 595-610

Constructing extended formulations from reflection relations
In: Integer programming and combinatorial optimization. - Heidelberg [u.a.] : Springer, S. 287-300, 2011 - (Lecture notes in computer science; 6655)

On cardinality constrained cycle and path polytopes
In: Mathematical programming / a publ. of the Mathematical Programming Society - Berlin: Springer, Bd. 123 (2010), 2, S. 371-394

Branched polyhedral systems
In: Integer programming and combinatorial optimization: 14th international conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010 ; proceedings - Berlin: Springer, 2010 . - 2010, S. 177-190 - (Lecture notes in computer science; 6080)

Symmetry matters for sizes of extended formulations
In: Integer programming and combinatorial optimization: 14th international conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010 ; proceedings - Berlin: Springer, 2010 . - 2009, S. 135-148 - (Lecture notes in computer science; 6080)

"Alles was zählt!" - der mathematische Blick
In: Magdeburg: Univ., Fak. für Mathematik, 2009, Getr. Zählung, Ill., 29 cm - (Technical Report; Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg; 2009,2)

Extended formulations for packing and partitioning orbitopes
In: Mathematics of operations research / publ. quarterly by the Institute for Operations Research and the Management Sciences - Catonsville, MD: INFORMS, Bd. 34 (2009), 3, S. 686-697

A short proof of the VPN tree routing conjecture on ring networks
In: Operations research letters . - Amsterdam [u.a.] : Elsevier, Bd. 36.2008, 3, S. 361-365

Packing and partitioning orbitopes
In: Mathematical programming . - Berlin : Springer, Bd. 114.2008, 1, S. 1-36

Two new bounds for the random-edge simplex algorithm
In: Society for Industrial and Applied Mathematics : SIAM journal on discrete mathematics . - Philadelphia, Pa. : Soc., Bd. 21.2007, 1, S. 178-190

Orbitopal fixing
In: Integer programming and combinatorial optimization: 12th International IPCO Conference, Ithaca, NY, USA, June 25 - 27, 2007 ; proceedings / Matteo Fischetti; David P. Williamson (eds.) - Berlin: Springer, 2007 . - 2007, S. 74-88 - (Lecture notes in computer science; 4513)