default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGennadiy Averkov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Manuel Aprile
, Gennadiy Averkov, Marco Di Summa, Christopher Hojny:
The role of rationality in integer-programming relaxations. Math. Program. 205(1): 745-771 (2024)- [j28]Gennadiy Averkov, Matthias Schymura:
On the maximal number of columns of a Δ-modular integer matrix: bounds and computations. Math. Program. 206(1): 61-89 (2024) - 2023
- [j27]Gennadiy Averkov, Christopher Hojny, Matthias Schymura:
Computational aspects of relaxation complexity: possibilities and limitations. Math. Program. 197(2): 1173-1200 (2023) - [j26]Gennadiy Averkov, Christopher Hojny, Matthias Schymura:
Efficient MIP techniques for computing the relaxation complexity. Math. Program. Comput. 15(3): 549-580 (2023) - 2022
- [j25]Emily Speakman, Gennadiy Averkov:
Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes. Discret. Appl. Math. 308: 36-45 (2022) - [j24]Iskander Aliev, Gennadiy Averkov, Jesús A. De Loera, Timm Oertel:
Sparse representation of vectors in lattices and semigroups. Math. Program. 192(1): 519-546 (2022) - [j23]Gennadiy Averkov, Matthias Schymura:
Complexity of linear relaxations in integer programming. Math. Program. 194(1): 191-227 (2022) - [c5]Gennadiy Averkov, Matthias Schymura:
On the Maximal Number of Columns of a $\varDelta $-modular Matrix. IPCO 2022: 29-42 - [i2]Manuel Aprile, Gennadiy Averkov, Marco Di Summa, Christopher Hojny:
The role of rationality in integer-programming relaxations. CoRR abs/2206.12253 (2022) - 2021
- [j22]Gennadiy Averkov, Giulia Codenotti, Antonio Macchia, Francisco Santos:
A local maximizer for lattice width of 3-dimensional hollow bodies. Discret. Appl. Math. 298: 129-142 (2021) - [j21]Gennadiy Averkov:
Equality Case in van der Corput's Inequality and Collisions in Multiple Lattice Tilings. Discret. Comput. Geom. 65(1): 212-226 (2021) - [j20]Gennadiy Averkov, Christopher Borger, Ivan Soprunov:
Classification of Triples of Lattice Polytopes with a Given Mixed Volume. Discret. Comput. Geom. 66(1): 165-202 (2021) - [c4]Gennadiy Averkov, Christopher Hojny, Matthias Schymura:
Computational Aspects of Relaxation Complexity. IPCO 2021: 368-382 - 2020
- [j19]Gennadiy Averkov:
Local optimality of Zaks-Perles-Wills simplices. Adv. Appl. Math. 112 (2020) - [c3]Iskander Aliev, Gennadiy Averkov, Jesús A. De Loera, Timm Oertel:
Optimizing Sparsity over Lattices and Semigroups. IPCO 2020: 40-51
2010 – 2019
- 2019
- [j18]Gennadiy Averkov:
Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization. SIAM J. Appl. Algebra Geom. 3(1): 128-151 (2019) - 2018
- [j17]Gennadiy Averkov, Volker Kaibel, Stefan Weltge:
Maximum semidefinite and linear extension complexity of families of polytopes. Math. Program. 167(2): 381-394 (2018) - [j16]Gennadiy Averkov, Amitabh Basu, Joseph Paat:
Approximation of Corner Polyhedra with Families of Intersection Cuts. SIAM J. Optim. 28(1): 904-929 (2018) - 2017
- [j15]Gennadiy Averkov, Bernardo González Merino, Ingo Paschke, Matthias Schymura, Stefan Weltge:
Tight bounds on discrete quantitative Helly numbers. Adv. Appl. Math. 89: 76-101 (2017) - [j14]Gennadiy Averkov, Jan Krümpelmann, Stefan Weltge:
Notions of Maximality for Integral Lattice-Free Polyhedra: The Case of Dimension Three. Math. Oper. Res. 42(4): 1035-1062 (2017) - [c2]Gennadiy Averkov, Amitabh Basu, Joseph Paat:
Approximation of Corner Polyhedra with Families of Intersection Cuts. IPCO 2017: 51-62 - 2016
- [j13]Gennadiy Averkov, Barbara Langfeld:
Homometry and Direct-Sum Decompositions of Lattice-Convex Sets. Discret. Comput. Geom. 56(1): 216-249 (2016) - [i1]Gennadiy Averkov, Volker Kaibel, Stefan Weltge:
Maximum Semidefinite and Linear Extension Complexity of Families of Polytopes. CoRR abs/1605.08538 (2016) - 2015
- [j12]Gennadiy Averkov, Amitabh Basu:
Lifting properties of maximal lattice-free polyhedra. Math. Program. 154(1-2): 81-111 (2015) - 2014
- [c1]Gennadiy Averkov, Amitabh Basu:
On the Unique-Lifting Property. IPCO 2014: 76-87 - 2013
- [j11]Gennadiy Averkov:
Constructive Proofs of some Positivstellensätze for Compact Semialgebraic Subsets of ℝ d. J. Optim. Theory Appl. 158(2): 410-418 (2013) - [j10]Gennadiy Averkov, Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza:
On the Convergence of the Affine Hull of the Chvátal-Gomory Closures. SIAM J. Discret. Math. 27(3): 1492-1502 (2013) - [j9]Gennadiy Averkov:
On Maximal S-Free Sets and the Helly Number for the Family of S-Convex Sets. SIAM J. Discret. Math. 27(3): 1610-1624 (2013) - 2012
- [j8]Gennadiy Averkov, Barbara Langfeld:
On the Reconstruction of Planar Lattice-Convex Sets from the Covariogram. Discret. Comput. Geom. 48(1): 216-238 (2012) - [j7]Gennadiy Averkov:
On finitely generated closures in the theory of cutting planes. Discret. Optim. 9(4): 209-215 (2012) - [j6]Gennadiy Averkov:
On the Size of Lattice Simplices with a Single Interior Lattice Point. SIAM J. Discret. Math. 26(2): 515-526 (2012) - 2011
- [j5]Gennadiy Averkov, Christian Wagner, Robert Weismantel:
Maximal Lattice-Free Polyhedra: Finiteness and an Explicit Description in Dimension Three. Math. Oper. Res. 36(4): 721-742 (2011) - [j4]Gennadiy Averkov, Martin Henk:
Representing simple d-dimensional polytopes by d polynomials. Math. Program. 126(2): 203-230 (2011)
2000 – 2009
- 2009
- [j3]Gennadiy Averkov:
Detecting and reconstructing centrally symmetric sets from the autocorrelation: Two discrete cases. Appl. Math. Lett. 22(9): 1476-1478 (2009) - [j2]Gennadiy Averkov, Martin Henk:
Three-Dimensional Polyhedra Can Be Described by Three Polynomial Inequalities. Discret. Comput. Geom. 42(2): 166-186 (2009) - 2008
- [j1]Gennadiy Averkov, Horst Martini:
On pyramids and reducedness. Period. Math. Hung. 57(2): 117-120 (2008)
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 2025-01-21 00:23 CET 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:
