| Publication | Date of Publication | Type |
|---|
| A posteriori joint detection of a recurring tuple of reference fragments in a quasi-periodic sequence | 2024-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5048139 | 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 | 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 | 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 | 2021-08-03 | Paper |
| An exact algorithm of searching for the largest size cluster in an integer sequence 2-clustering problem | 2021-05-18 | Paper |
| NP-hardness of some max-min clustering problems | 2021-05-18 | Paper |
| Problem of minimizing a sum of differences of weighted convolutions | 2021-01-08 | Paper |
| Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters | 2020-10-22 | Paper |
| 2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence | 2020-09-22 | Paper |
| Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case | 2020-09-22 | Paper |
| NP-hardness of quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the cluster sizes | 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 | 2020-03-11 | Paper |
| Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence | 2020-02-11 | Paper |
| The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension | 2020-02-07 | Paper |
| Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem | 2020-01-14 | Paper |
| On polynomial solvability of one quadratic Euclidean clustering problem on a line | 2019-12-13 | Paper |
| Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space | 2019-11-04 | Paper |
| Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster | 2019-06-24 | Paper |
| On the complexity of some problems of searching for a family of disjoint clusters | 2019-06-24 | Paper |
| A randomized algorithm for a sequence 2-clustering problem | 2019-06-07 | Paper |
| NP-hardness of some Euclidean problems of partitioning a finite set of points | 2018-08-20 | Paper |
| Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center | 2018-04-25 | Paper |
| An approximation algorithm for a problem of partitioning a sequence into clusters with constraints on their cardinalities | 2018-04-20 | Paper |
| An Approximation Scheme for the Problem of Finding a Subsequence | 2018-04-20 | Paper |
| An Approximation Algorithm for a Problem of Partitioning a Sequence into Clusters with Restrictions on Their Cardinalities | 2018-02-13 | Paper |
| A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem | 2018-02-13 | Paper |
| Approximation algorithm for the problem of partitioning a sequence into clusters | 2017-12-06 | Paper |
| A Posteriori Joint Detection and Discrimination of Pulses in a Quasiperiodic Pulse Train | 2017-09-08 | Paper |
| Exact pseudopolynomial algorithm for one sequence partitioning problem | 2017-07-07 | Paper |
| Pseudopolynomial time solvability of a quadratic Euclidean problem of finding a family of disjoint subsets | 2017-06-15 | Paper |
| Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters | 2017-06-08 | Paper |
| On the complexity of some Euclidean problems of partitioning a finite set of points | 2017-04-11 | Paper |
| Exact pseudopolynomial algorithms for a balanced 2-clustering problem | 2017-02-09 | Paper |
| On the complexity and approximability of some Euclidean optimal summing problems | 2017-01-31 | Paper |
| On the complexity of some Euclidean optimal summing problems | 2016-11-01 | Paper |
| An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors | 2016-08-12 | Paper |
| A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem | 2016-08-12 | Paper |
| Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem | 2016-07-08 | Paper |
| On the complexity of some quadratic Euclidean 2-clustering problems | 2016-07-08 | Paper |
| NP-hardness of some quadratic Euclidean 2-clustering problems | 2016-01-29 | Paper |
| An approximation polynomial-time algorithm for a sequence bi-clustering problem | 2015-09-29 | Paper |
| Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph | 2015-08-20 | Paper |
| An approximating polynomial algorithm for a sequence partitioning problem | 2015-07-27 | Paper |
| An FPTAS for a vector subset search problem | 2015-07-27 | Paper |
| Complexity of the weighted max-cut in Euclidean space | 2015-07-27 | Paper |
| Approximation algorithms for some intractable problems of choosing a vector subsequence | 2015-07-17 | Paper |
| On complexity of some problems of cluster analysis of vector sequences | 2015-07-17 | Paper |
| A 2-approximation polynomial algorithm for a clustering problem | 2015-07-17 | Paper |
| A randomized algorithm for two-cluster partition of a set of vectors | 2015-07-13 | Paper |
| Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems | 2015-03-13 | Paper |
| 2-approximation algorithm for finding a clique with minimum weight of vertices and edges | 2014-12-17 | Paper |
| NP-hardness of the Euclidean Max-Cut problem | 2014-11-14 | Paper |
| A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets | 2014-10-16 | Paper |
| Recognition of a sequence as a structure containing series of recurring vectors from an alphabet | 2014-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2836761 | 2013-07-03 | Paper |
| Точные псевдополиномиальные алгоритмы для некоторых труднорешаемых задач поиска подпоследовательности векторов | 2013-07-03 | Paper |
| On the complexity of some cluster analysis problems | 2012-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115185 | 2012-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115213 | 2012-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115233 | 2012-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115249 | 2012-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115255 | 2012-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115704 | 2012-02-10 | Paper |
| On the complexity of a search for a subset of ``similar vectors | 2011-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3005460 | 2011-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3005493 | 2011-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2998954 | 2011-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2998977 | 2011-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2998997 | 2011-05-11 | Paper |
| Complexity of certain problems of searching for subsets of vectors and cluster analysis | 2011-05-04 | Paper |
| On the complexity of some data analysis problems | 2011-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3161901 | 2010-10-18 | Paper |
| Optimal detection of a recurring tuple of reference fragments in a quasiperiodic sequence | 2010-10-18 | Paper |
| A recognition problem for a vector alphabet generating a sequence with a quasiperiodic structure | 2010-10-18 | Paper |
| Off-line detection of a quasi-periodically recurring fragment in a numerical sequence | 2009-10-23 | Paper |
| A posteriori joint detection of reference fragments in a quasi-periodic sequence | 2008-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5310931 | 2007-10-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5393721 | 2006-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4676672 | 2005-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4817499 | 2004-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4434976 | 2003-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4429331 | 2003-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428016 | 2003-09-14 | Paper |
| Posterior detection of a given number of identical subsequences in a quasi-periodic sequence | 2003-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4787989 | 2003-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4787993 | 2003-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788000 | 2003-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527365 | 2001-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4517345 | 2000-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4951202 | 2000-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4951235 | 2000-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4951236 | 2000-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4951373 | 2000-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4947147 | 2000-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4936525 | 2000-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4888920 | 1997-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3942425 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3942426 | 1980-01-01 | Paper |
