Konstantin Kobylkin
Konstantin Kobylkin
senior researcher, Krasovsky Institute of Mathematics and Mechanics
Verified email at imm.uran.ru - Homepage
Title
Cited by
Cited by
Year
Stabbing line segments with disks: complexity and approximation algorithms
K Kobylkin
International Conference on Analysis of Images, Social Networks and Texts …, 2017
82017
Necessary condition for committee existence
KS Kobylkin
Pattern Recognition and Image Analysis (Advances in Mathematical Theory and …, 2002
82002
Constant factor approximation for intersecting line segments with disks
K Kobylkin
International Conference on Learning and Intelligent Optimization, 447-454, 2018
42018
Constraint elimination method for the committee problem
KS Kobylkin
Automation and Remote Control 73 (2), 355-368, 2012
32012
Computational complexity of guarding of proximity graphs
K Kobylkin
CoRR, abs/1605.00313, 2016
22016
Lower bounds for the number of hyperplanes separating two finite sets of points
KS Kobylkin
Proceedings of the Steklov Institute of Mathematics 289 (1), 126-138, 2015
22015
Approximation algorithms for piercing special families of hippodromes
K Kobylkin, I Dryakhlova
International Conference on Mathematical Optimization Theory and Operations …, 2019
12019
Approximation algorithms with guaranteed performance for the intersection of edge sets of some metric graphs with equal disks
KS Kobylkin
Trudy Instituta Matematiki i Mekhaniki UrO RAN 25 (1), 62-77, 2019
12019
Approximation algorithms for intersecting straight line segments with equal disks
K Kobylkin
Applications”. Irkutsk: ESI SB RAS, 2017, 224 p., 47, 2017
12017
Computational complexity of the vertex cover problem in the class of planar triangulations
KS Kobylkin
Trudy Instituta Matematiki i Mekhaniki UrO RAN 22 (3), 153-159, 2016
12016
Constructing a committee of a system of linear inequalities
KS Kobylkin
Pattern Recognition and Image Analysis 16 (4), 711-725, 2006
12006
Practical Approximation Algorithms for Stabbing Special Families of Line Segments with Equal Disks
K Kobylkin, I Dryakhlova
International Conference on Learning and Intelligent Optimization, 46-51, 2020
2020
Computational Complexity for the Problem of Optimal Intersection of Straight Line Segments by Disks
KS Kobylkin
Proceedings of the Steklov Institute of Mathematics 303 (1), 146-155, 2018
2018
Efficient constant factor approximation algorithms for stabbing line segments with equal disks
K Kobylkin
arXiv preprint arXiv:1803.08341, 2018
2018
APPROXIMATION ALGORITHMS FOR SPECIAL GEOMETRIC HITTING SET PROBLEMS
KS Kobylkin
Проблемы оптимизации и их приложения, 96-96, 2018
2018
Computational complexity for the problem of optimal intersections of straight line segments by disks
KS Kobylkin
Trudy Instituta Matematiki i Mekhaniki UrO RAN 23 (3), 171-181, 2017
2017
Intersecting straight line segments with disks: complexity and approximation
KS Kobylkin
Современные проблемы математики и ее приложений, 209-214, 2017
2017
Complexity and approximability for a problem of intersecting of proximity graphs with minimum number of equal disks
K Kobylkin
AIP Conference Proceedings 1776 (1), 090028, 2016
2016
Computational complexity and approximability of guarding of proximity graphs⋆
K Kobylkin
arXiv preprint arXiv:1605.00313, 2016
2016
Computational complexity of guarding connected plane graphs
KS Kobylkin
CEUR Workshop Proceedings 1662, 200-205, 2016
2016
The system can't perform the operation now. Try again later.
Articles 1–20