|
|
|
Publications in Math-Net.Ru |
Citations |
|
2019 |
| 1. |
K. S. Kobylkin, “Approximation algorithms with guaranteed performance for the intersection of edge sets of some metric graphs with equal disks”, Trudy Inst. Mat. i Mekh. UrO RAN, 25:1 (2019), 62–77   |
1
|
|
2017 |
| 2. |
K. S. Kobylkin, “Computational complexity for the problem of optimal intersections of straight line segments by disks”, Trudy Inst. Mat. i Mekh. UrO RAN, 23:3 (2017), 171–181 ; Proc. Steklov Inst. Math. (Suppl.), 303, suppl. 1 (2018), 146–155  |
1
|
|
2016 |
| 3. |
K. S. Kobylkin, “Computational complexity of the vertex cover problem in the class of planar triangulations”, Trudy Inst. Mat. i Mekh. UrO RAN, 22:3 (2016), 153–159  ; Proc. Steklov Inst. Math. (Suppl.), 299, suppl. 1 (2017), 106–112  |
1
|
|
2014 |
| 4. |
K. S. Kobylkin, “Lower bounds for the number of hyperplanes separating two finite sets of points”, Trudy Inst. Mat. i Mekh. UrO RAN, 20:2 (2014), 210–222 ; Proc. Steklov Inst. Math. (Suppl.), 289, suppl. 1 (2015), 126–138 |
4
|
|
2012 |
| 5. |
K. S. Kobylkin, “Constraint elimination method for the committee problem”, Avtomat. i Telemekh., 2012, no. 2, 163–177 ; Autom. Remote Control, 73:2 (2012), 355–368 |
4
|
|
2004 |
| 6. |
K. S. Kobylkin, “Two-dimensional representation of three-dimensional systems of homogeneous linear inequalities”, Avtomat. i Telemekh., 2004, no. 3, 17–22  ; Autom. Remote Control, 65:3 (2004), 369–374 |
|
| Presentations in Math-Net.Ru |
|
|
| Organisations |
|
| |
|
|
Contact us: