Full list of publications: |
|
|
Citations (Crossref Cited-By Service + Math-Net.Ru) |
|
|
2023 |
1. |
D. D. Cherkshin, V. A. Voronov, “On the chromatic number of 2-dimensional spheres”, Discrete & Computational Geometry, 2023, 1–13 , arXiv: 2203.08666
|
1
[x]
|
2. |
V. A. Voronov, A. .D. Tolmachev, D. S. Protasov, A. M. Neopryatnaya, “Searching for Distance Graph Embeddings and Optimal Partitions of Compact Sets in Euclidean Space”, International Conference on Mathematical Optimization Theory and Operations Research, CCIS, 1881, Springer, 2023, 391–403 |
|
2022 |
3. |
V. A. Voronov, A. Ya. Kanel-Belov, G. A. Strukov, D. D. Cherkashin, “O khromaticheskikh chislakh trekhmernykh sloek”, Zapiski nauchnykh seminarov POMI, 518 (2022), 94-113 , arXiv: 2208.02230v1 |
4. |
V. A. Voronov, E. A. Dergachev, A. M. Neopryatnaya, “Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres ”, Discrete Mathematics, 345:12 (2022), 113106 , arXiv: 2106.11824
|
4
[x]
|
5. |
A. D. Tolmachev, D. S. Protasov, V. A. Voronov, “Coverings of planar and three-dimensional sets with subsets of smaller diameter”, Discrete Applied Mathematics, 320 (2022), 270–281 , arXiv: 2210.12394
|
3
[x]
|
|
2021 |
6. |
V. A. Voronov, E. A. Dergachev, M. E. Zhukovskii, A. M. Neopryatnaya, “First-Order Complexity of Subgraph Isomorphism via Kneser Graphs”, Math. Notes, 109:1 (2021), 29–37 |
|
2018 |
7. |
A. Ya. Kanel-Belov, V. A. Voronov, D. D. Cherkashin, “On the chromatic number of infinitesimal plane layer”, St. Petersburg Math. J., 29:5 (2018), 761–775 |
|
2016 |
8. |
D. V. Apanovich, V. A. Voronov, O. N. Samsonyuk, “Construction of the reachable set for a two-dimensional bilinear impulsive control system”, The Bulletin of Irkutsk State University. Series Mathematics, 15 (2016), 3–16 |
|
2011 |
9. |
V. A. Voronov, “The direct algorithm for calculating programmed controls of a special form in the problem of guidance of an orbital telescope”, Autom. Remote Control, 72:1 (2011), 1–9 |
|