M. Cherniavskii

collaborators

2 papers

cs.DS2026

Algorithms for Standard-form ILP Problems via KomlÃ³s' Discrepancy Setting

Dmitry Gribanov, Tagir Khayaleyev, Mikhail Cherniavskii +3

We study the standard-form ILP problem $max {c^{⊤} x : A x = b, x \in Z_{\geq 0}^{n}}$ , where $A \in Z^{k \times n}$ has full row rank. We obtain refined FPT algorithms par…

cs.CC2025

Delta-modular ILP Problems of Bounded Codimension, Discrepancy, and Convolution (new version)

M. Cherniavskii, D. Gribanov, D. Malyshev +1

For integers $k, n \geq 0$ and a cost vector $c \in Z^{n}$ , we study two fundamental integer linear programming (ILP) problems: \[ \text{(Standard Form)} \quad \max\bigl\{c^\top x \co…