default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSergey A. Khamidullin
Person information
- affiliation: Russian Academy of Sciences, Siberian Branch, Sobolev Institute of Mathematics, Novosibirsk, Russi
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 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)- 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)
Conference and Workshop Papers
- 2020
- [c8]Sergey A. Khamidullin, Vladimir I. Khandeev, Anna Panasenko:
Randomized Algorithms for Some Sequence Clustering Problems. LION 2020: 96-101 - [c7]Liudmila Mikhailova, Sergey A. Khamidullin:
Simultaneous Detection and Discrimination of Subsequences Which Are Nonlinearly Extended Elements of the Given Sequences Alphabet in a Quasiperiodic Sequence. OPTIMA 2020: 209-223 - 2019
- [c6]Alexander Kel'manov, Sergey A. Khamidullin, Anna Panasenko:
Exact Algorithm for One Cardinality-Weighted 2-Partitioning Problem of a Sequence. LION 2019: 135-145 - [c5]Alexander Kel'manov, Sergey A. Khamidullin, Anna Panasenko:
2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence. NUMTA (2) 2019: 386-393 - 2018
- [c4]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
- [c3]Alexander Kel'manov, Sergey A. Khamidullin, Vladimir I. Khandeev:
A Randomized Algorithm for 2-Partition of a Sequence. AIST 2017: 313-322 - 2016
- [c2]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 - [c1]Alexander Kelmanov, Sergey A. Khamidullin, Semyon Romanchenko:
Fully Polynomial-Time Approximation Scheme for a Problem of Finding a Subsequence. DOOR (Supplement) 2016: 516-525
Coauthor Index
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:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
