Sergey A. Khamidullin

Orcid: 0000-0003-2987-9832

Affiliations:
  • Russian Academy of Sciences, Siberian Branch, Sobolev Institute of Mathematics, Novosibirsk, Russi


According to our database1, Sergey A. Khamidullin authored at least 10 papers between 2016 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence.
Ann. Math. Artif. Intell., 2020

Simultaneous Detection and Discrimination of Subsequences Which Are Nonlinearly Extended Elements of the Given Sequences Alphabet in a Quasiperiodic Sequence.
Proceedings of the Optimization and Applications - 11th International Conference, 2020

Randomized Algorithms for Some Sequence Clustering Problems.
Proceedings of the Learning and Intelligent Optimization - 14th International Conference, 2020

2019
2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence.
Proceedings of the Numerical Computations: Theory and Algorithms, 2019

Exact Algorithm for One Cardinality-Weighted 2-Partitioning Problem of a Sequence.
Proceedings of the Learning and Intelligent Optimization - 13th International Conference, 2019

2018
Exact Algorithms for Two Quadratic Euclidean Problems of Searching for the Largest Subset and Longest Subsequence.
Proceedings of the Learning and Intelligent Optimization - 12th International Conference, 2018

2017
Exact pseudopolynomial algorithm for one sequence partitioning problem.
Autom. Remote. Control., 2017

A Randomized Algorithm for 2-Partition of a Sequence.
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.
Proceedings of the Discrete Optimization and Operations Research, 2016

Fully Polynomial-Time Approximation Scheme for a Problem of Finding a Subsequence.
Proceedings of the Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19, 2016


  Loading...