|
|
|
Publications in Math-Net.Ru |
Citations |
|
2022 |
| 1. |
D. Gribanov, D. Malyshev, “A faster algorithm for counting the integer points number in $\Delta$-modular polyhedra”, Sib. Èlektron. Mat. Izv., 19:2 (2022), 613–626   |
|
2020 |
| 2. |
D. V. Gribanov, D. S. Malyshev, D. B. Mokeev, “Efficient solvability of the weighted vertex coloring problem for some hereditary class of graphs with $5$-vertex prohibitions”, Diskretn. Anal. Issled. Oper., 27:3 (2020), 71–87 ; J. Appl. Industr. Math., 14:3 (2020), 480–489  |
1
|
| 3. |
D. V. Gribanov, D. S. Malyshev, “Minimization of even conic functions on the two-dimensional integral lattice”, Diskretn. Anal. Issled. Oper., 27:1 (2020), 17–42 ; J. Appl. Industr. Math., 14:1 (2020), 56–72 |
3
|
|
2018 |
| 4. |
S. I. Veselov, D. V. Gribanov, N. Yu. Zolotykh, A. Yu. Chirkov, “Minimizing a symmetric quasiconvex function on a two-dimensional lattice”, Diskretn. Anal. Issled. Oper., 25:3 (2018), 23–35  ; J. Appl. Industr. Math., 12:3 (2018), 587–594 |
4
|
|
2016 |
| 5. |
S. I. Veselov, A. Yu. Chirkov, D. V. Gribanov, “Aggregation of equations in integer programming”, University proceedings. Volga region. Physical and mathematical sciences, 2016, no. 2, 5–12 |
| 6. |
D. V. Gribanov, D. S. Malyshev, “The complexity of some graph problems with bounded minors of their constraint matrices”, Zhurnal SVMO, 18:3 (2016), 19–31 |
|
| Organisations |
|
| |
|
|
Contact us: