D.S. Malyshev, D.V. Gribanov, “The computational complexity of dominating set problems for instances with bounded minors of constraint matrices”, Discrete Optimization, 29, 2018, 103
Dmitry V. Gribanov, 104, Models, Algorithms and Technologies for Network Analysis, 2014, 37
Samuel Fiorini, Gwenael Joret, Stefan Weltge, Yelena Yuditsky, 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2022, 13
Dmitry Gribanov, Ivan Shumilov, Dmitry Malyshev, Panos Pardalos, “On $\Delta $-modular integer linear problems in the canonical form and equivalent problems”, J Glob Optim, 88, № 3, 2024, 591
Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge, “Extended formulations for stable set polytopes of graphs without two disjoint odd cycles”, Math. Program., 192, № 1-2, 2022, 547
D. V. Gribanov, 247, Computational Aspects and Applications in Large-Scale Networks, 2018, 19
Iskander Aliev, Martin Henk, Mark Hogan, Stefan Kuhlmann, Timm Oertel, “New Bounds for the Integer Carathéodory Rank”, SIAM J. Optim., 34, № 1, 2024, 190
Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge, 12125, Integer Programming and Combinatorial Optimization, 2020, 104
Hongyi Jiang, Amitabh Basu, “Enumerating Integer Points in Polytopes with Bounded Subdeterminants”, SIAM J. Discrete Math., 36, № 1, 2022, 449
Jon Lee, Joseph Paat, Ingo Stallknecht, Luze Xu, “Polynomial Upper Bounds on the Number of Differing Columns of Δ-Modular Integer Programs”, Mathematics of OR, 2022, moor.2022.1339