On pyramids and reducedness. - Gennadiy Averkov; Horst Martini (Period. Math. Hung., 2008)

Detecting and reconstructing centrally symmetric sets from the autocorrelation: Two discrete cases. - Gennadiy Averkov (Appl. Math. Lett., 2009)

Three-Dimensional Polyhedra Can Be Described by Three Polynomial Inequalities. - Gennadiy Averkov; Martin Henk (Discret. Comput. Geom., 2009)

Maximal Lattice-Free Polyhedra: Finiteness and an Explicit Description in Dimension Three. - Gennadiy Averkov; Christian Wagner 006; Robert Weismantel (Math. Oper. Res., 2011)

Representing simple d-dimensional polytopes by d polynomials. - Gennadiy Averkov; Martin Henk (Math. Program., 2011)

On the Reconstruction of Planar Lattice-Convex Sets from the Covariogram. - Gennadiy Averkov; Barbara Langfeld (Discret. Comput. Geom., 2012)

On finitely generated closures in the theory of cutting planes. - Gennadiy Averkov (Discret. Optim., 2012)

On the Size of Lattice Simplices with a Single Interior Lattice Point. - Gennadiy Averkov (SIAM J. Discret. Math., 2012)

Constructive Proofs of some Positivstellensätze for Compact Semialgebraic Subsets of ℝ d. - Gennadiy Averkov (J. Optim. Theory Appl., 2013)

On Maximal S-Free Sets and the Helly Number for the Family of S-Convex Sets. - Gennadiy Averkov (SIAM J. Discret. Math., 2013)

On the Convergence of the Affine Hull of the Chvátal-Gomory Closures. - Gennadiy Averkov; Michele Conforti; Alberto Del Pia; Marco Di Summa; Yuri Faenza (SIAM J. Discret. Math., 2013)

On the Unique-Lifting Property. - Gennadiy Averkov; Amitabh Basu (IPCO, 2014)

Lifting properties of maximal lattice-free polyhedra. - Gennadiy Averkov; Amitabh Basu (Math. Program., 2015)

Homometry and Direct-Sum Decompositions of Lattice-Convex Sets. - Gennadiy Averkov; Barbara Langfeld (Discret. Comput. Geom., 2016)

Tight bounds on discrete quantitative Helly numbers. - Gennadiy Averkov; Bernardo González Merino; Ingo Paschke; Matthias Schymura; Stefan Weltge (Adv. Appl. Math., 2017)

Notions of Maximality for Integral Lattice-Free Polyhedra: The Case of Dimension Three. - Gennadiy Averkov; Jan Krümpelmann; Stefan Weltge (Math. Oper. Res., 2017)

Maximum semidefinite and linear extension complexity of families of polytopes. - Gennadiy Averkov; Volker Kaibel; Stefan Weltge (Math. Program., 2018)

Approximation of Corner Polyhedra with Families of Intersection Cuts. - Gennadiy Averkov; Amitabh Basu; Joseph Paat (SIAM J. Optim., 2018)

Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization. - Gennadiy Averkov (SIAM J. Appl. Algebra Geom., 2019)

Optimizing Sparsity over Lattices and Semigroups. - Iskander Aliev; Gennadiy Averkov; Jesús A. De Loera; Timm Oertel (IPCO, 2020)

Local optimality of Zaks-Perles-Wills simplices. - Gennadiy Averkov (Adv. Appl. Math., 2020)

Computational Aspects of Relaxation Complexity. - Gennadiy Averkov; Christopher Hojny; Matthias Schymura (IPCO, 2021)

A local maximizer for lattice width of 3-dimensional hollow bodies. - Gennadiy Averkov; Giulia Codenotti; Antonio Macchia; Francisco Santos (Discret. Appl. Math., 2021)

Equality Case in van der Corput's Inequality and Collisions in Multiple Lattice Tilings. - Gennadiy Averkov (Discret. Comput. Geom., 2021)

Classification of Triples of Lattice Polytopes with a Given Mixed Volume. - Gennadiy Averkov; Christopher Borger; Ivan Soprunov (Discret. Comput. Geom., 2021)

On the Maximal Number of Columns of a $ varDelta $-modular Matrix. - Gennadiy Averkov; Matthias Schymura (IPCO, 2022)

Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes. - Emily Speakman; Gennadiy Averkov (Discret. Appl. Math., 2022)

Sparse representation of vectors in lattices and semigroups. - Iskander Aliev; Gennadiy Averkov; Jesús A. De Loera; Timm Oertel (Math. Program., 2022)

Complexity of linear relaxations in integer programming. - Gennadiy Averkov; Matthias Schymura (Math. Program., 2022)

Computational aspects of relaxation complexity: possibilities and limitations. - Gennadiy Averkov; Christopher Hojny; Matthias Schymura (Math. Program., 2023)

Efficient MIP techniques for computing the relaxation complexity. - Gennadiy Averkov; Christopher Hojny; Matthias Schymura (Math. Program. Comput., 2023)

The role of rationality in integer-programming relaxations. - Manuel Aprile; Gennadiy Averkov; Marco Di Summa; Christopher Hojny (Math. Program., 2024)

On the maximal number of columns of a Δ-modular integer matrix: bounds and computations. - Gennadiy Averkov; Matthias Schymura (Math. Program., 2024)

On the Expressiveness of Rational ReLU Neural Networks With Bounded Depth. - Gennadiy Averkov; Christopher Hojny; Maximilian Merkert (ICLR, 2025)

Convex hulls of monomial curves, and a sparse positivstellensatz. - Gennadiy Averkov; Claus Scheiderer (Math. Program., 2025)