Approximation of corner polyhedra with families of intersection cuts
In: SIAM journal on optimization - Philadelphia, Pa: SIAM, Bd. 28.2018, 1, S. 904-929; http://dx.doi.org/10.1137/17m1128939

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, Bd. 167.2018, 2, S. 381-394; http://dx.doi.org/10.1007/s10107-017-1134-7

Tight bounds on discrete quantitative Helly numbers
In: Advances in applied mathematics - Amsterdam [u.a.]: Elsevier, Bd. 89.2017, S. 76-101; http://dx.doi.org/10.1016/j.aam.2017.04.003

Approximation of corner polyhedra with families of intersection cuts
In: Integer Programming and Combinatorial Optimization: 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings - Cham: Springer International Publishing, S. 51-62 - (Lecture Notes in Computer Science; 10328); http://dx.doi.org/10.1007/978-3-319-59250-3_5 ; [Konferenz: 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017]

Homometry and direct-sum decompositions of lattice-convex sets
In: Discrete & computational geometry: an international journal of mathematics and computer science - New York, NY: Springer, Bd. 56.2016, 1, S. 216-249, 56 2016 1 216-249; http://dx.doi.org/10.1007/s00454-016-9786-2

Maximum semidefinite and linear extension complexity of families of polytopes
In: De.arxiv.org - [S.l.]: Arxiv.org, insges. 11 S., 2016, 2016 11; http://arxiv.org/pdf/1605.08538v1.pdf

Notions of maximality for integral lattice-free polyhedra - the case of dimension three
In: De.arxiv.org - [S.l.]: Arxiv.org, insges. 45 S., 2016, 2016 45; https://arxiv.org/abs/1509.05200

Tight bounds on discrete quantitative Helly numbers
In: De.arxiv.org - [S.l.]: Arxiv.org, insges. 19 S., 2016, 2016 19; https://arxiv.org/abs/1602.07839

Covariograms generated by valuations
In: International mathematics research notices : IMRN. - Oxford : Oxford University Press, 19, S. 9277-9329, 2015

Largest integral simplices with one interior integral point - solution of Hensley's conjecture and related results
In: Advances in mathematics. - Amsterdam [u.a.] : Elsevier, Bd. 274.2015, S. 118-166, 2014

Lifting properties of maximal lattice-free polyhedra
In: Math. Program., Vol. 154, 2015, Issue 1-2, Ser. B, S. 81--111, ISSN 0025-5610, 10.1007/s10107-015-0865-6

On the unique-lifting property
In: Integer programming and combinatorial optimization. - Cham [u.a.] : Springer, S. 76-87, 2014 - (Lecture notes in computer science; 8494)

Constructive Proofs of some Positivstellensätze for Compact Semialgebraic Subsets of R d
In: Journal of optimization theory and applications. - Dordrecht [u.a.] : Springer Science + Business Media, Bd. 158.2013, 2, S. 410-418

On maximal S-free sets and the helly number for the family of S-convex sets
In: SIAM journal on discrete mathematics. - Philadelphia, Pa : Soc, Bd. 27.2013, 3, S. 1610-1624

On the convergence of the affine hull of the Chvátal-Gomory closures
In: SIAM journal on discrete mathematics. - Philadelphia, Pa : Soc, Bd. 27.2013, 3, S. 1492-1502

A proof of Lovászs theorem on maximal lattice-free sets
In: Beiträge zur Algebra und Geometrie. - Berlin : Springer, Bd. 54.2013, 1, S. 105-109

Inequalities for the lattice width of lattice-free convex sets in the plane
In: Beiträge zur Algebra und Geometrie. - Berlin : Springer, Bd. 53.2012, 1, S. 1-23

Minimal polynomial descriptions of polyhedra and special semialgebraic sets
In: Advances in geometry. - Berlin [u.a.] : de Gruyter, Bd. 12.2012, 3, S. 447-459

On finitely generated closures in the theory of cutting planes
In: Discrete optimization. - New York, NY [u.a.] : Elsevier, Bd. 9.2012, 4, S. 209-215

On the Reconstruction of Planar Lattice-Convex Sets from the Covariogram
In: Discrete & computational geometry. - New York, NY : Springer, Bd. 48.2012, 1, S. 216-238

On the size of lattice simplices with a single interior lattice point
In: SIAM journal on discrete mathematics. - Philadelphia, Pa : Soc, Bd. 26.2012, 2, S. 515-526

Transversal numbers over subsets of linear spaces
In: Advances in geometry. - Berlin [u.a.] : de Gruyter, Bd. 12.2012, 1, S. 19-28

Description of polygonal regions by polynomials of bounded degree
In: Monatshefte für Mathematik. - Wien [u.a.] : Springer, Bd. 162.2011, 1, S. 19-27

Representing simple d-dimensional polytopes by d polynomials
In: Mathematical programming / A - Berlin: Springer, Bd. 126.2011, 2, S. 203-230; http://dx.doi.org/10.1007/s10107-009-0280-y

On nearly equilateral simplices and nearly l 8 spaces
In: Canadian mathematical bulletin . - Toronto : Univ. of Toronto Press, Bd. 53.2010, 3, S. 394-397

Three-dimensional polyhedra can be described by three polynomial inequalities
In: Discrete & computational geometry. - New York, NY : Springer, Bd. 42.2009, 2, S. 166-186