Vladimir I. Khandeev

According to our database, Vladimir I. Khandeev authored at least 13 papers between 2016 and 2021.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2021

Max-Min Problems of Searching for Two Disjoint Subsets.

Vladimir I. Khandeev, Sergey Neshchadim

Proceedings of the Optimization and Applications - 12th International Conference, 2021

2020

Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence.

Alexander Kel'manov, Sergey A. Khamidullin, Vladimir I. Khandeev, Artem V. Pyatkin

Ann. Math. Artif. Intell., 2020

Randomized Algorithms for Some Sequence Clustering Problems.

Sergey A. Khamidullin, Vladimir I. Khandeev, Anna Panasenko

Proceedings of the Learning and Intelligent Optimization - 14th International Conference, 2020

2019

Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation.

Vladimir I. Khandeev

Proceedings of the Numerical Computations: Theory and Algorithms, 2019

Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case.

Alexander Kel'manov, Vladimir I. Khandeev

Proceedings of the Numerical Computations: Theory and Algorithms, 2019

The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension.

Alexander Kel'manov, Vladimir I. Khandeev

Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

On Polynomial Solvability of One Quadratic Euclidean Clustering Problem on a Line.

Alexander Kel'manov, Vladimir I. Khandeev

Proceedings of the Learning and Intelligent Optimization - 13th International Conference, 2019

Fast and Exact Algorithms for Some NP-Hard 2-Clustering Problems in the One-Dimensional Case.

Alexander Kel'manov, Vladimir I. Khandeev

Proceedings of the Analysis of Images, Social Networks and Texts, 2019

2018

Exact Algorithms for Two Quadratic Euclidean Problems of Searching for the Largest Subset and Longest Subsequence.

Alexander Kel'manov, Sergey A. Khamidullin, Vladimir I. Khandeev, Artem V. Pyatkin

Proceedings of the Learning and Intelligent Optimization - 12th International Conference, 2018

Exact Algorithms for the Special Cases of Two Hard to Solve Problems of Searching for the Largest Subset.

Alexander Kel'manov, Vladimir I. Khandeev, Anna Panasenko

Proceedings of the Analysis of Images, Social Networks and Texts, 2018

2017

Exact pseudopolynomial algorithm for one sequence partitioning problem.

Alexander V. Kel'manov, Sergey A. Khamidullin, Vladimir I. Khandeev

Autom. Remote. Control., 2017

A Randomized Algorithm for 2-Partition of a Sequence.

Alexander Kel'manov, Sergey A. Khamidullin, Vladimir I. Khandeev

Proceedings of the Analysis of Images, Social Networks and Texts, 2017

2016

An Approximation Algorithm for a Problem of Partitioning a Sequence into Clusters with Restrictions on Their Cardinalities.

Alexander Kel'manov, Ludmila Mikhailova, Sergey A. Khamidullin, Vladimir I. Khandeev

Proceedings of the Discrete Optimization and Operations Research, 2016