• 5 Citations
  • 2 h-Index
20132019
If you made any changes in Pure these will be visible here soon.

Research Output 2013 2019

  • 5 Citations
  • 2 h-Index
  • 11 Article
  • 4 Conference contribution
2019

Approximation algorithms for piercing special families of hippodromes: An extended abstract

Kobylkin, K. & Dryakhlova, I., 1 Jan 2019, Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Proceedings. Khachay, M., Pardalos, P. & Kochetov, Y. (eds.). Springer Verlag, p. 565-580 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11548 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Piercing
Approximation algorithms
Approximation Algorithms
Line segment
Straight Line
1 Citation (Scopus)

Constant factor approximation for intersecting line segments with disks

Kobylkin, K., 1 Jan 2019, Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers. Pardalos, P. M., Battiti, R., Brunato, M. & Kotsireas, I. (eds.). Springer Verlag, p. 447-454 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11353 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Line segment
Straight Line
Approximation algorithms
Approximation
Hitting Set
2018

Computational Complexity for the Problem of Optimal Intersection of Straight Line Segments by Disks

Kobylkin, K. S., 1 Dec 2018, In : Proceedings of the Steklov Institute of Mathematics. 303, p. 146-155 10 p.

Research output: Contribution to journalArticleResearchpeer-review

Line segment
Straight Line
Computational Complexity
Intersection
Line Drawing
2 Citations (Scopus)

Stabbing line segments with disks: Complexity and approximation algorithms

Kobylkin, K., 1 Jan 2018, Analysis of Images, Social Networks and Texts - 6th International Conference, AIST 2017, Revised Selected Papers. Springer Verlag, Vol. 10716 LNCS. p. 356-367 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10716 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Approximation algorithms
Line segment
Approximation Algorithms
Straight Line
Line Drawing
2017

Computational Complexity of the Vertex Cover Problem in the Class of Planar Triangulations

Kobylkin, K. S., 1 Dec 2017, In : Proceedings of the Steklov Institute of Mathematics. 299, p. 106-112 7 p.

Research output: Contribution to journalArticleResearchpeer-review

Vertex Cover
Triangulation
Computational Complexity
Equilateral triangle
Delaunay triangulation

Intersecting straight line segments with disks: Complexity and approximation

Kobylkin, K. S., 2017, In : CEUR Workshop Proceedings. 1894, p. 209-214 6 p.

Research output: Contribution to journalArticleResearchpeer-review

Network security
Approximation algorithms
Triangulation
Computational complexity
Hardness
2016

Complexity and approximability for a problem of intersecting of proximity graphs with minimum number of equal disks

Kobylkin, K., 20 Oct 2016, Numerical Computations: Theory and Algorithms, NUMTA 2016: Proceedings of the 2nd International Conference "Numerical Computations: Theory and Algorithms". American Institute of Physics Inc., Vol. 1776. 090028

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

proximity
triangulation
roads
embedding
telecommunication

Computational complexity of guarding connected plane graphs

Kobylkin, K. S., 2016, In : CEUR Workshop Proceedings. 1662, p. 200-205 6 p.

Research output: Contribution to journalArticleResearchpeer-review

Hamiltonians
Triangulation
Computational complexity
Hardness
Polynomials
2015
2 Citations (Scopus)

Lower bounds for the number of hyperplanes separating two finite sets of points

Kobylkin, K. S., Jul 2015, In : Proceedings of the Steklov Institute of Mathematics. 289, p. 126-138 13 p.

Research output: Contribution to journalArticleResearchpeer-review

2014
Hyperplane
Set of points
Finite Set
Lower bound
Separability
2013

Discriminative power for ensembles of linear decision rules

Kobylkin, K. S. & Khachai, M. Y., Jul 2013, In : Pattern Recognition and Image Analysis. 23, 3, p. 352-358 7 p.

Research output: Contribution to journalArticleResearchpeer-review

Modification of the algorithm for beat tracking of a musical melody

Khachai, M. Y., Kobylkin, K. S. & Khachai, D. M., 2013, In : Pattern Recognition and Image Analysis. 23, 1, p. 74-79 6 p.

Research output: Contribution to journalArticleResearchpeer-review

Heuristic algorithms