Kobylkin Konstantin Sergeevich

Publications in Math-Net.Ru

1. 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
2. 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
3. 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
4. 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
5. Constraint elimination method for the committee problem
   
   Avtomat. i Telemekh., 2012, no. 2,  163–177
6. Two-dimensional representation of three-dimensional systems of homogeneous linear inequalities
   
   Avtomat. i Telemekh., 2004, no. 3,  17–22