A survey on software defect prediction using deep learning EN Akimova, AY Bersenev, AA Deikov, KS Kobylkin, AV Konygin, ... Mathematics 9 (11), 1180, 2021 | 63 | 2021 |

Stabbing line segments with disks: complexity and approximation algorithms K Kobylkin International Conference on Analysis of Images, Social Networks and Texts …, 2017 | 12 | 2017 |

Pytracebugs: A large python code dataset for supervised machine learning in software defect prediction EN Akimova, AY Bersenev, AA Deikov, KS Kobylkin, AV Konygin, ... 2021 28th Asia-Pacific Software Engineering Conference (APSEC), 141-151, 2021 | 9 | 2021 |

Necessary condition for committee existence KS Kobylkin Pattern Recognition and Image Analysis (Advances in Mathematical Theory and …, 2002 | 8 | 2002 |

Constant factor approximation for intersecting line segments with disks K Kobylkin International Conference on Learning and Intelligent Optimization, 447-454, 2018 | 7 | 2018 |

Lower bounds for the number of hyperplanes separating two finite sets of points KS Kobylkin Proceedings of the Steklov Institute of Mathematics 289, 126-138, 2015 | 4 | 2015 |

Constraint elimination method for the committee problem KS Kobylkin Automation and Remote Control 73, 355-368, 2012 | 4 | 2012 |

Approximation algorithms for piercing special families of hippodromes K Kobylkin, I Dryakhlova International Conference on Mathematical Optimization Theory and Operations …, 2019 | 3 | 2019 |

Computational complexity of guarding of proximity graphs K Kobylkin CoRR, abs/1605.00313, 2016 | 3 | 2016 |

Approximation algorithms with guaranteed performance for the intersection of edge sets of some metric graphs with equal disks KS Kobylkin Krasovskii Institute of Mathematics and Mechanics 25 (1), 62-77, 2019 | 1 | 2019 |

Efficient constant factor approximation algorithms for stabbing line segments with equal disks K Kobylkin arXiv preprint arXiv:1803.08341, 2018 | 1 | 2018 |

Approximation algorithms for intersecting straight line segments with equal disks K Kobylkin Applications”. Irkutsk: ESI SB RAS, 2017, 224 p., 47, 2017 | 1 | 2017 |

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 | 1 | 2016 |

Constructing a committee of a system of linear inequalities KS Kobylkin Pattern Recognition and Image Analysis 16, 711-725, 2006 | 1 | 2006 |

A-Index: Semantic-based Anomaly Index for Source Code. EN Akimova, AY Bersenev, AS Cheshkov, AA Deikov, KS Kobylkin, ... ENASE, 259-266, 2022 | | 2022 |

Fast Approximation Algorithms for Stabbing Special Families of Line Segments with Equal Disks K Kobylkin Analysis of Images, Social Networks and Texts: 9th International Conference …, 2021 | | 2021 |

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, 146-155, 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 |