Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

On $$\Delta $$-modular integer linear problems in the canonical form and equivalent problems
D. V. Gribanov, Ivan Shumilov, D. S. Malyshev, et al.
Journal of Global Optimization (2022) Vol. 88, Iss. 3, pp. 591-651
Closed Access | Times Cited: 14

Showing 14 citing articles:

Advances on Strictly $$\varDelta $$-Modular IPs
Martin Nägele, Christian Nöbel, Richard Santiago, et al.
Lecture notes in computer science (2023), pp. 393-407
Closed Access | Times Cited: 4
Optimizing for strategy diversity in the design of video games
Oussama Hanguir, Will Ma, Jiangze Han, et al.
Mathematical Programming (2024)
Closed Access | Times Cited: 1
Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems
D. V. Gribanov, Ivan Shumilov, D. Malyshev, et al.
Journal of Global Optimization (2024) Vol. 89, Iss. 4, pp. 1033-1067
Open Access | Times Cited: 1
Notes on {a,b,c}-Modular Matrices
Christoph Glanzer, Ingo Stallknecht, Robert Weismantel
Vietnam Journal of Mathematics (2021) Vol. 50, Iss. 2, pp. 469-485
Open Access | Times Cited: 4
New Support Size Bounds and Proximity Bounds for Integer Linear Programming
Sebastian Berndt, Matthias Mnich, Tobias Stamm
Lecture notes in computer science (2024), pp. 82-95
Closed Access
Preface
Ilias Kotsireas, Pãnos M. Pardalos, Julius Žilinskas
Journal of Global Optimization (2024) Vol. 88, Iss. 3, pp. 531-532
Closed Access
On a Simple Connection Between $$\Delta$$-Modular ILP and LP, and a New Bound on the Number of Integer Vertices
Dmitry Gribanov, D. S. Malyshev, Ivan Shumilov
Operations Research Forum (2024) Vol. 5, Iss. 2
Open Access
Total Matching and Subdeterminants
Luca Ferrarini, Samuel Fiorini, Stefan Kober, et al.
Lecture notes in computer science (2024), pp. 192-204
Closed Access
Advances on strictly $$\Delta $$-modular IPs
Martin Nägele, Christian Nöbel, Richard Santiago, et al.
Mathematical Programming (2024) Vol. 210, Iss. 1-2, pp. 731-760
Open Access
A new and faster representation for counting integer points in parametric polyhedra
D. V. Gribanov, D. S. Malyshev, Pãnos M. Pardalos, et al.
Computational Optimization and Applications (2024)
Closed Access
Extended formulations for the integer hull of strictly Δ-modular cographic polyhedral cones
Joseph Paat, Zach Walsh, Luze Xu
Operations Research Letters (2024), pp. 107235-107235
Open Access
Structured $$(\min ,+)$$-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems
D. V. Gribanov, Ivan Shumilov, D. S. Malyshev
Optimization Letters (2023) Vol. 18, Iss. 1, pp. 73-103
Closed Access | Times Cited: 1
Enumeration and Unimodular Equivalence of Empty Delta-Modular Simplices
D. V. Gribanov
Lecture notes in computer science (2023), pp. 115-132
Closed Access
On a Simple Connection Between ∆-modular ILP and LP, and a New Bound on the Number of Integer Vertices
Dmitry Gribanov, D. S. Malyshev, Ivan Shumilov
Research Square (Research Square) (2023)
Open Access
Page 1

Scroll to top