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

Personal profile

Education/Academic qualification

Mathematics and Physics, Candidate

29 Nov 2005 → …

Fingerprint Fingerprint is based on mining the text of the person's scientific documents to create an index of weighted terms, which defines the key subjects of each individual researcher.

  • 2 Similar Profiles
Approximation algorithms Engineering & Materials Science
Line segment Mathematics
Triangulation Engineering & Materials Science
Straight Line Mathematics
Computational complexity Engineering & Materials Science
Hardness Engineering & Materials Science
Computational Complexity Mathematics
Network security Engineering & Materials Science

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 2013 2019

  • 3 Citations
  • 1 h-Index
  • 11 Article
  • 3 Conference contribution

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

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
1 Citation (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

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