![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Vladimir I. Khandeev
Person information
- affiliation: Russian Academy of Sciences, Siberian Branch, Sobolev Institute of Mathematics, Novosibirsk, Russi
- affiliation: Novosibirsk State University, Russia
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c11]Vladimir I. Khandeev
, Sergey Neshchadim
:
Max-Min Problems of Searching for Two Disjoint Subsets. OPTIMA 2021: 231-245 - 2020
- [j2]Alexander Kel'manov
, Sergey A. Khamidullin, Vladimir I. Khandeev
, Artem V. Pyatkin:
Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence. Ann. Math. Artif. Intell. 88(1-3): 157-168 (2020) - [c10]Sergey A. Khamidullin
, Vladimir I. Khandeev
, Anna Panasenko
:
Randomized Algorithms for Some Sequence Clustering Problems. LION 2020: 96-101
2010 – 2019
- 2019
- [c9]Alexander Kel'manov
, Vladimir I. Khandeev
:
Fast and Exact Algorithms for Some NP-Hard 2-Clustering Problems in the One-Dimensional Case. AIST 2019: 377-387 - [c8]Alexander Kel'manov
, Vladimir I. Khandeev
:
On Polynomial Solvability of One Quadratic Euclidean Clustering Problem on a Line. LION 2019: 46-52 - [c7]Alexander Kel'manov
, Vladimir I. Khandeev
:
The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension. MOTOR (2) 2019: 207-216 - [c6]Alexander Kel'manov
, Vladimir I. Khandeev
:
Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case. NUMTA (2) 2019: 394-399 - [c5]Vladimir I. Khandeev
:
Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation. NUMTA (2) 2019: 400-405 - 2018
- [c4]Alexander Kel'manov
, Vladimir I. Khandeev, Anna Panasenko:
Exact Algorithms for the Special Cases of Two Hard to Solve Problems of Searching for the Largest Subset. AIST 2018: 294-304 - [c3]Alexander Kel'manov
, Sergey A. Khamidullin, Vladimir I. Khandeev, Artem V. Pyatkin:
Exact Algorithms for Two Quadratic Euclidean Problems of Searching for the Largest Subset and Longest Subsequence. LION 2018: 326-336 - 2017
- [j1]Alexander V. Kel'manov
, Sergey A. Khamidullin
, Vladimir I. Khandeev
:
Exact pseudopolynomial algorithm for one sequence partitioning problem. Autom. Remote. Control. 78(1): 67-74 (2017) - [c2]Alexander Kel'manov
, Sergey A. Khamidullin
, Vladimir I. Khandeev
:
A Randomized Algorithm for 2-Partition of a Sequence. AIST 2017: 313-322 - 2016
- [c1]Alexander Kel'manov
, Ludmila Mikhailova, Sergey A. Khamidullin
, Vladimir I. Khandeev
:
An Approximation Algorithm for a Problem of Partitioning a Sequence into Clusters with Restrictions on Their Cardinalities. DOOR 2016: 171-181
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint