Kobylkin, Konstantin Sergeevich

Candidate of Sciences

  • Source: Scopus
  • Calculated based on no. of publications stored in Pure and citations from Scopus
20132020

Research activity per year

If you made any changes in Pure these will be visible here soon.
Filter
Conference contribution

Search results

  • 2020

    Practical approximation algorithms for stabbing special families of line segments with equal disks

    Kobylkin, K. & Dryakhlova, I., 1 Jan 2020, Learning and Intelligent Optimization - 14th International Conference, LION 14, 2020, Revised Selected Papers. Kotsireas, I. S. & Pardalos, P. M. (eds.). Springer, p. 46-51 6 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12096 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference 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, Vol. 11548. 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 contribution

    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 contribution

    3 Citations (Scopus)
  • 2018

    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. VanDerAalst, WMP., Ignatov, DI., Khachay, M., Kuznetsov, SO., Lempitsky, Lomazova, IA., Loukachevitch, N., Napoli, A., Panchenko, A., Pardalos, PM., Savchenko, AV. & Wasserman, S. (eds.). 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 contribution

    5 Citations (Scopus)
  • 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 contribution