Gennadiy Averkov

39 papers A* 1B 5Journal 33

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Convex hulls of monomial curves, and a sparse positivstellensatz. Math. Program. Gennadiy Averkov, Claus Scheiderer
2025	A*	`conf`	On the Expressiveness of Rational ReLU Neural Networks With Bounded Depth. ICLR Gennadiy Averkov, Christopher Hojny, Maximilian Merkert
2025	J	`jnl`	On the Expressiveness of Rational ReLU Neural Networks With Bounded Depth. CoRR Gennadiy Averkov, Christopher Hojny, Maximilian Merkert
2024	J	`jnl`	On the maximal number of columns of a Δ-modular integer matrix: bounds and computations. Math. Program. Gennadiy Averkov, Matthias Schymura
2024	J	`jnl`	The role of rationality in integer-programming relaxations. Math. Program. Manuel Aprile, Gennadiy Averkov, Marco Di Summa, Christopher Hojny
2023	J	`jnl`	Computational aspects of relaxation complexity: possibilities and limitations. Math. Program. Gennadiy Averkov, Christopher Hojny, Matthias Schymura
2023	J	`jnl`	Efficient MIP techniques for computing the relaxation complexity. Math. Program. Comput. Gennadiy Averkov, Christopher Hojny, Matthias Schymura
2022	J	`jnl`	Complexity of linear relaxations in integer programming. Math. Program. Gennadiy Averkov, Matthias Schymura
2022	J	`jnl`	Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes. Discret. Appl. Math. Emily Speakman, Gennadiy Averkov
2022	B	`conf`	On the Maximal Number of Columns of a $\varDelta $-modular Matrix. IPCO Gennadiy Averkov, Matthias Schymura
2022	J	`jnl`	Sparse representation of vectors in lattices and semigroups. Math. Program. Iskander Aliev, Gennadiy Averkov, Jesús A. De Loera, Timm Oertel
2022	J	`jnl`	The role of rationality in integer-programming relaxations. CoRR Manuel Aprile, Gennadiy Averkov, Marco Di Summa, Christopher Hojny
2021	J	`jnl`	A local maximizer for lattice width of 3-dimensional hollow bodies. Discret. Appl. Math. Gennadiy Averkov, Giulia Codenotti, Antonio Macchia, Francisco Santos
2021	J	`jnl`	Classification of Triples of Lattice Polytopes with a Given Mixed Volume. Discret. Comput. Geom. Gennadiy Averkov, Christopher Borger, Ivan Soprunov
2021	B	`conf`	Computational Aspects of Relaxation Complexity. IPCO Gennadiy Averkov, Christopher Hojny, Matthias Schymura
2021	J	`jnl`	Equality Case in van der Corput's Inequality and Collisions in Multiple Lattice Tilings. Discret. Comput. Geom. Gennadiy Averkov
2020	J	`jnl`	Local optimality of Zaks-Perles-Wills simplices. Adv. Appl. Math. Gennadiy Averkov
2020	B	`conf`	Optimizing Sparsity over Lattices and Semigroups. IPCO Iskander Aliev, Gennadiy Averkov, Jesús A. De Loera, Timm Oertel
2019	J	`jnl`	Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization. SIAM J. Appl. Algebra Geom. Gennadiy Averkov
2018	J	`jnl`	Approximation of Corner Polyhedra with Families of Intersection Cuts. SIAM J. Optim. Gennadiy Averkov, Amitabh Basu, Joseph Paat
2018	J	`jnl`	Maximum semidefinite and linear extension complexity of families of polytopes. Math. Program. Gennadiy Averkov, Volker Kaibel, Stefan Weltge
2017	B	`conf`	Approximation of Corner Polyhedra with Families of Intersection Cuts. IPCO Gennadiy Averkov, Amitabh Basu, Joseph Paat
2017	J	`jnl`	Notions of Maximality for Integral Lattice-Free Polyhedra: The Case of Dimension Three. Math. Oper. Res. Gennadiy Averkov, Jan Krümpelmann, Stefan Weltge
2017	J	`jnl`	Tight bounds on discrete quantitative Helly numbers. Adv. Appl. Math. Gennadiy Averkov, Bernardo González Merino, Ingo Paschke, Matthias Schymura, Stefan Weltge
2016	J	`jnl`	Homometry and Direct-Sum Decompositions of Lattice-Convex Sets. Discret. Comput. Geom. Gennadiy Averkov, Barbara Langfeld
2016	J	`jnl`	Maximum Semidefinite and Linear Extension Complexity of Families of Polytopes. CoRR Gennadiy Averkov, Volker Kaibel, Stefan Weltge
2015	J	`jnl`	Lifting properties of maximal lattice-free polyhedra. Math. Program. Gennadiy Averkov, Amitabh Basu
2014	B	`conf`	On the Unique-Lifting Property. IPCO Gennadiy Averkov, Amitabh Basu
2013	J	`jnl`	Constructive Proofs of some Positivstellensätze for Compact Semialgebraic Subsets of ℝ d. J. Optim. Theory Appl. Gennadiy Averkov
2013	J	`jnl`	On Maximal S-Free Sets and the Helly Number for the Family of S-Convex Sets. SIAM J. Discret. Math. Gennadiy Averkov
2013	J	`jnl`	On the Convergence of the Affine Hull of the Chvátal-Gomory Closures. SIAM J. Discret. Math. Gennadiy Averkov, Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza
2012	J	`jnl`	On finitely generated closures in the theory of cutting planes. Discret. Optim. Gennadiy Averkov
2012	J	`jnl`	On the Reconstruction of Planar Lattice-Convex Sets from the Covariogram. Discret. Comput. Geom. Gennadiy Averkov, Barbara Langfeld
2012	J	`jnl`	On the Size of Lattice Simplices with a Single Interior Lattice Point. SIAM J. Discret. Math. Gennadiy Averkov
2011	J	`jnl`	Maximal Lattice-Free Polyhedra: Finiteness and an Explicit Description in Dimension Three. Math. Oper. Res. Gennadiy Averkov, Christian Wagner, Robert Weismantel
2011	J	`jnl`	Representing simple Math. Program. Gennadiy Averkov, Martin Henk
2009	J	`jnl`	Detecting and reconstructing centrally symmetric sets from the autocorrelation: Two discrete cases. Appl. Math. Lett. Gennadiy Averkov
2009	J	`jnl`	Three-Dimensional Polyhedra Can Be Described by Three Polynomial Inequalities. Discret. Comput. Geom. Gennadiy Averkov, Martin Henk
2008	J	`jnl`	On pyramids and reducedness. Period. Math. Hung. Gennadiy Averkov, Horst Martini