default search action
Iskander Aliev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Iskander Aliev, Martin Henk, Mark Hogan, Stefan Kuhlmann, Timm Oertel:
New Bounds for the Integer Carathéodory Rank. SIAM J. Optim. 34(1): 190-200 (2024) - [c4]Iskander Aliev, Marcel Celaya, Martin Henk:
Sparsity and Integrality Gap Transference Bounds for Integer Programs. IPCO 2024: 1-13 - 2023
- [j17]Abdullah Alasmari, Iskander Aliev:
On unique recovery of finite-valued integer signals and admissible lattices of sparse hypercubes. Optim. Lett. 17(3): 739-751 (2023) - 2022
- [j16]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) - 2021
- [j15]Iskander Aliev, Marcel Celaya, Martin Henk, Aled Williams:
Distance-Sparsity Transference for Vertices of Corner Polyhedra. SIAM J. Optim. 31(1): 200-216 (2021) - 2020
- [j14]Iskander Aliev, Martin Henk
Distances to lattice points in knapsack polyhedra. Math. Program. 182(1): 175-198 (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
- 2018
- [j13]Iskander Aliev, Jesús A. De Loera, Friedrich Eisenbrand, Timm Oertel
The Support of Integer Optimal Solutions. SIAM J. Optim. 28(3): 2152-2157 (2018) - 2017
- [j12]Iskander Aliev, Robert Bassett, Jesús A. De Loera, Quentin Louveaux:
A quantitative Doignon-Bell-Scarf theorem. Comb. 37(3): 313-332 (2017) - [j11]Iskander Aliev, Jesús A. De Loera, Timm Oertel
Sparse Solutions of Linear Diophantine Equations. SIAM J. Appl. Algebra Geom. 1(1): 239-253 (2017) - [c2]Iskander Aliev, Martin Henk, Timm Oertel
Integrality Gaps of Integer Knapsack Problems. IPCO 2017: 25-38 - 2015
- [j10]Iskander Aliev:
On the lattice programming gap of the group problems. Oper. Res. Lett. 43(2): 199-202 (2015) - 2014
- [j9]Iskander Aliev, Adam N. Letchford
Iterated Chvátal-Gomory Cuts and the Geometry of Numbers. SIAM J. Optim. 24(3): 1294-1312 (2014) - [c1]Iskander Aliev, Jesús A. De Loera, Quentin Louveaux:
Integer Programs with Prescribed Number of Solutions and a Weighted Version of Doignon-Bell-Scarf's Theorem. IPCO 2014: 37-51 - 2013
- [j8]Iskander Aliev, Martin Henk, Eva Linke:
Integer Points in Knapsack Polytopes and s-Covering Radius. Electron. J. Comb. 20(2): 42 (2013) - 2012
- [j7]Iskander Aliev, Martin Henk
LLL-reduction for integer knapsacks. J. Comb. Optim. 24(4): 613-626 (2012) - 2011
- [j6]Iskander Aliev, Martin Henk
Expected Frobenius numbers. J. Comb. Theory A 118(2): 525-531 (2011) - 2010
- [j5]Iskander Aliev, Martin Henk
Feasibility of Integer Knapsacks. SIAM J. Optim. 20(6): 2978-2993 (2010)
2000 – 2009
- 2009
- [j4]Iskander Aliev, Martin Henk
Integer Knapsacks: Average Behavior of the Frobenius Numbers. Math. Oper. Res. 34(3): 698-705 (2009) - 2008
- [j3]Iskander Aliev:
Siegel's Lemma and Sum-Distinct Sets. Discret. Comput. Geom. 39(1-3): 59-66 (2008) - 2006
- [j2]Iskander Aliev, Peter M. Gruber:
Best Simultaneous Diophantine Approximations under a Constraint on the Denominator. Contributions Discret. Math. 1(1) (2006) - [j1]Iskander Aliev, Peter M. Gruber:
Lattice Points in Large Borel Sets and Successive Minima. Discret. Comput. Geom. 35(3): 429-435 (2006)
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 2024-06-10 21:20 CEST 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: