| Publication | Date of Publication | Type |
|---|
A posteriori joint detection of a recurring tuple of reference fragments in a quasi-periodic sequence
Computational Mathematics and Mathematical Physics | 2024-03-07 | Paper |
| scientific article; zbMATH DE number 7617051 (Why is no real title available?) | 2022-11-15 | Paper |
Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems
Сибирский журнал вычислительной математики | 2022-10-26 | Paper |
Selecting a subset of diverse points based on the squared Euclidean distance
Annals of Mathematics and Artificial Intelligence | 2022-08-11 | Paper |
| On the complexity of some quadratic Euclidean partition problems into balanced clusters | 2021-09-14 | Paper |
Recognition of a quasi-periodic sequence containing an unknown number of nonlinearly extended reference subsequences
Computational Mathematics and Mathematical Physics | 2021-08-24 | Paper |
Quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the size of the clusters: complexity and approximability
Proceedings of the Steklov Institute of Mathematics | 2021-08-03 | Paper |
| NP-hardness of some max-min clustering problems | 2021-05-18 | Paper |
| An exact algorithm of searching for the largest size cluster in an integer sequence 2-clustering problem | 2021-05-18 | Paper |
Problem of minimizing a sum of differences of weighted convolutions
Computational Mathematics and Mathematical Physics | 2021-01-08 | Paper |
Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters
Computational Mathematics and Mathematical Physics | 2020-10-22 | Paper |
2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence
Lecture Notes in Computer Science | 2020-09-22 | Paper |
Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case
Lecture Notes in Computer Science | 2020-09-22 | Paper |
NP-hardness of quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the cluster sizes
Doklady Mathematics | 2020-06-24 | Paper |
| Maximum diversity problem with squared Euclidean distance | 2020-05-19 | Paper |
NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters
Doklady Mathematics | 2020-03-11 | Paper |
Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence
Annals of Mathematics and Artificial Intelligence | 2020-02-11 | Paper |
The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension
Mathematical Optimization Theory and Operations Research | 2020-02-07 | Paper |
Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem
Computational Mathematics and Mathematical Physics | 2020-01-14 | Paper |
On polynomial solvability of one quadratic Euclidean clustering problem on a line
Doklady Mathematics | 2019-12-13 | Paper |
Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space
Computational Mathematics and Mathematical Physics | 2019-11-04 | Paper |
Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster
Proceedings of the Steklov Institute of Mathematics | 2019-06-24 | Paper |
On the complexity of some problems of searching for a family of disjoint clusters
Doklady Mathematics | 2019-06-24 | Paper |
A randomized algorithm for a sequence 2-clustering problem
Computational Mathematics and Mathematical Physics | 2019-06-07 | Paper |
NP-hardness of some Euclidean problems of partitioning a finite set of points
Computational Mathematics and Mathematical Physics | 2018-08-20 | Paper |
Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center
Computational Mathematics and Mathematical Physics | 2018-04-25 | Paper |
An approximation scheme for the problem of finding a subsequence
Numerical Analysis and Applications | 2018-04-20 | Paper |
An approximation algorithm for a problem of partitioning a sequence into clusters with constraints on their cardinalities
Proceedings of the Steklov Institute of Mathematics | 2018-04-20 | Paper |
A fully polynomial-time approximation scheme for a special case of a balanced 2-clustering problem
Discrete Optimization and Operations Research | 2018-02-13 | Paper |
An approximation algorithm for a problem of partitioning a sequence into clusters with restrictions on their cardinalities
Discrete Optimization and Operations Research | 2018-02-13 | Paper |
Approximation algorithm for the problem of partitioning a sequence into clusters
Computational Mathematics and Mathematical Physics | 2017-12-06 | Paper |
A Posteriori Joint Detection and Discrimination of Pulses in a Quasiperiodic Pulse Train
IEEE Transactions on Signal Processing | 2017-09-08 | Paper |
Exact pseudopolynomial algorithm for one sequence partitioning problem
Automation and Remote Control | 2017-07-07 | Paper |
Pseudopolynomial time solvability of a quadratic Euclidean problem of finding a family of disjoint subsets
Numerical Analysis and Applications | 2017-06-15 | Paper |
Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters
Proceedings of the Steklov Institute of Mathematics | 2017-06-08 | Paper |
On the complexity of some Euclidean problems of partitioning a finite set of points
Doklady Mathematics | 2017-04-11 | Paper |
Exact pseudo-polynomial algorithms for a balanced 2-clustering problem
Journal of Applied and Industrial Mathematics | 2017-02-09 | Paper |
On the complexity and approximability of some Euclidean optimal summing problems
Computational Mathematics and Mathematical Physics | 2017-01-31 | Paper |
On the complexity of some Euclidean optimal summing problems
Doklady Mathematics | 2016-11-01 | Paper |
An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors
Journal of Applied and Industrial Mathematics | 2016-08-12 | Paper |
A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem
Journal of Applied and Industrial Mathematics | 2016-08-12 | Paper |
On the complexity of some quadratic Euclidean 2-clustering problems
Computational Mathematics and Mathematical Physics | 2016-07-08 | Paper |
Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem
Computational Mathematics and Mathematical Physics | 2016-07-08 | Paper |
NP-hardness of some quadratic Euclidean 2-clustering problems
Doklady Mathematics | 2016-01-29 | Paper |
An approximation polynomial-time algorithm for a sequence bi-clustering problem
Computational Mathematics and Mathematical Physics | 2015-09-29 | Paper |
Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph
Proceedings of the Steklov Institute of Mathematics | 2015-08-20 | Paper |
Complexity of the weighted max-cut in Euclidean space
Journal of Applied and Industrial Mathematics | 2015-07-27 | Paper |
An FPTAS for a vector subset search problem
Journal of Applied and Industrial Mathematics | 2015-07-27 | Paper |
An approximating polynomial algorithm for a sequence partitioning problem
Journal of Applied and Industrial Mathematics | 2015-07-27 | Paper |
A 2-approximation polynomial algorithm for a clustering problem
Journal of Applied and Industrial Mathematics | 2015-07-17 | Paper |
On complexity of some problems of cluster analysis of vector sequences
Journal of Applied and Industrial Mathematics | 2015-07-17 | Paper |
Approximation algorithms for some intractable problems of choosing a vector subsequence
Journal of Applied and Industrial Mathematics | 2015-07-17 | Paper |
A randomized algorithm for two-cluster partition of a set of vectors
Computational Mathematics and Mathematical Physics | 2015-07-13 | Paper |
Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems
Automation and Remote Control | 2015-03-13 | Paper |
2-approximation algorithm for finding a clique with minimum weight of vertices and edges
Proceedings of the Steklov Institute of Mathematics | 2014-12-17 | Paper |
NP-hardness of the Euclidean Max-Cut problem
Doklady Mathematics | 2014-11-14 | Paper |
A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets
Automation and Remote Control | 2014-10-16 | Paper |
Recognition of a sequence as a structure containing series of recurring vectors from an alphabet
Computational Mathematics and Mathematical Physics | 2014-04-28 | Paper |
On the complexity of certain problems of choosing subset of vectors
Zhurnal Vychislitel'noĭ Matematiki i Matematicheskoĭ Fiziki | 2013-07-03 | Paper |
Accurate pseudopolynomial-time algorithms for certain NP-hard problems of searching for a vector subsequence
Zhurnal Vychislitel'noĭ Matematiki i Matematicheskoĭ Fiziki | 2013-07-03 | Paper |
On the complexity of some cluster analysis problems
Zhurnal Vychislitel'noĭ Matematiki i Matematicheskoĭ Fiziki | 2012-07-16 | Paper |
| NP-completeness of some problems of a vectors subset choice | 2012-02-20 | Paper |
| An approximation algorithm for solving the problem of the search of a subset of vectors | 2012-02-20 | Paper |
| An approximation algorithm for a problem of cluster analysis | 2012-02-20 | Paper |
| scientific article; zbMATH DE number 6007853 (Why is no real title available?) | 2012-02-20 | Paper |
| On one problem of searching for tuples of fragments in a numerical sequence | 2012-02-20 | Paper |
| On a variant of the problem of choosing a vector subset | 2012-02-10 | Paper |
On the complexity of a search for a subset of ``similar vectors
Doklady Mathematics | 2011-06-08 | Paper |
| Recognition of a numerical sequence that includes series of quasiperiodically repeating standard fragments | 2011-06-08 | Paper |
| Recognition of a quasiperiodic sequence that includes a repeating set of fragments | 2011-06-08 | Paper |
| A posteriori detection of a quasiperiodic fragment with a given number of repetitions in a numerical sequence | 2011-05-11 | Paper |
| scientific article; zbMATH DE number 5887089 (Why is no real title available?) | 2011-05-11 | Paper |
| Joint a-posteriori detection and identification of quasiperiodic fragments in a sequence from pieces of them | 2011-05-11 | Paper |
Complexity of certain problems of searching for subsets of vectors and cluster analysis
Computational Mathematics and Mathematical Physics | 2011-05-04 | Paper |
On the complexity of some data analysis problems
Computational Mathematics and Mathematical Physics | 2011-05-04 | Paper |
| scientific article; zbMATH DE number 5800967 (Why is no real title available?) | 2010-10-18 | Paper |
Optimal detection of a recurring tuple of reference fragments in a quasiperiodic sequence
Numerical Analysis and Applications | 2010-10-18 | Paper |
A recognition problem for a vector alphabet generating a sequence with a quasiperiodic structure
Numerical Analysis and Applications | 2010-10-18 | Paper |
Off-line detection of a quasi-periodically recurring fragment in a numerical sequence
Proceedings of the Steklov Institute of Mathematics | 2009-10-23 | Paper |
A posteriori joint detection of reference fragments in a quasi-periodic sequence
Computational Mathematics and Mathematical Physics | 2008-12-09 | Paper |
| Joint detection of a given number of reference fragments in a quasi-periodic sequence and its partition into segments containing series of identical fragments | 2007-10-15 | Paper |
| scientific article; zbMATH DE number 5066530 (Why is no real title available?) | 2006-10-24 | Paper |
| scientific article; zbMATH DE number 2165190 (Why is no real title available?) | 2005-05-04 | Paper |
| scientific article; zbMATH DE number 2102667 (Why is no real title available?) | 2004-09-23 | Paper |
| scientific article; zbMATH DE number 2010037 (Why is no real title available?) | 2003-11-26 | Paper |
| scientific article; zbMATH DE number 1985640 (Why is no real title available?) | 2003-09-25 | Paper |
| scientific article; zbMATH DE number 1979633 (Why is no real title available?) | 2003-09-14 | Paper |
Posterior detection of a given number of identical subsequences in a quasi-periodic sequence
Computational Mathematics and Mathematical Physics | 2003-07-01 | Paper |
| scientific article; zbMATH DE number 1855601 (Why is no real title available?) | 2003-01-19 | Paper |
| scientific article; zbMATH DE number 1855606 (Why is no real title available?) | 2003-01-19 | Paper |
| scientific article; zbMATH DE number 1855596 (Why is no real title available?) | 2003-01-19 | Paper |
| scientific article; zbMATH DE number 1560591 (Why is no real title available?) | 2001-02-04 | Paper |
| scientific article; zbMATH DE number 1534560 (Why is no real title available?) | 2000-11-21 | Paper |
| scientific article; zbMATH DE number 1438873 (Why is no real title available?) | 2000-05-04 | Paper |
| scientific article; zbMATH DE number 1439045 (Why is no real title available?) | 2000-05-04 | Paper |
| scientific article; zbMATH DE number 1438915 (Why is no real title available?) | 2000-05-04 | Paper |
| scientific article; zbMATH DE number 1438914 (Why is no real title available?) | 2000-05-04 | Paper |
| scientific article; zbMATH DE number 1432151 (Why is no real title available?) | 2000-04-16 | Paper |
| scientific article; zbMATH DE number 1396569 (Why is no real title available?) | 2000-01-31 | Paper |
| scientific article; zbMATH DE number 919256 (Why is no real title available?) | 1997-10-26 | Paper |
| scientific article; zbMATH DE number 3759581 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3759582 (Why is no real title available?) | 1980-01-01 | Paper |
