| Publication | Date of Publication | Type |
|---|
On the complexity of the problem of choice of large clusters
Diskretnyĭ Analiz i Issledovanie Operatsiĭ | 2024-12-04 | Paper |
PTAS for problems of vector choice and clustering with different centers
Diskretnyĭ Analiz i Issledovanie Operatsiĭ | 2024-11-27 | Paper |
On complexity of two-machine routing propotionate open shop
Sibirskie Elektronnye Matematicheskie Izvestiya | 2024-11-25 | Paper |
New tools to study 1-11-representation of graphs
Graphs and Combinatorics | 2024-10-09 | Paper |
On semi-transitive orientability of split graphs
Information Processing Letters | 2024-03-26 | Paper |
An embedding technique in the study of word-representability of graphs
Discrete Applied Mathematics | 2024-02-14 | Paper |
PTAS for \(p\)-means \(q\)-medoids \(r\)-given clustering problem
Mathematical Optimization Theory and Operations Research | 2023-08-21 | Paper |
Probabilistic and analytical properties of the last passage percolation constant in a weighted random directed graph
The Annals of Applied Probability | 2023-06-05 | Paper |
On the maximum number of open triangles in graphs with the same number of vertices and edges
Diskretnyi analiz i issledovanie operatsii | 2023-02-21 | Paper |
On permutations avoiding partially ordered patterns defined by bipartite graphs
The Electronic Journal of Combinatorics | 2023-02-17 | Paper |
Selecting a subset of diverse points based on the squared Euclidean distance
Annals of Mathematics and Artificial Intelligence | 2022-08-11 | Paper |
On a routing open shop problem on two nodes with unit processing times
Diskretnyi analiz i issledovanie operatsii | 2022-07-15 | Paper |
On permutations avoiding partially ordered patterns defined by bipartite graphs
(available as arXiv preprint) | 2022-04-19 | Paper |
Irreducible bin packing and normality in routing open shop
Annals of Mathematics and Artificial Intelligence | 2021-11-04 | Paper |
| On the complexity of some quadratic Euclidean partition problems into balanced clusters | 2021-09-14 | 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 |
Easy NP-hardness Proofs of Some Subset Choice Problems
Mathematical Optimization Theory and Operations Research | 2021-02-25 | 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 |
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 |
| Routing open shop with two nodes, unit processing times and equal number of jobs and machines | 2020-05-19 | Paper |
| Maximum diversity problem with squared Euclidean distance | 2020-05-19 | Paper |
| On semi-transitive orientability of triangle-free graphs | 2020-03-13 | 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 maximum number of induced open triangles in graphs of a given order
Optimization Letters | 2019-12-03 | Paper |
On the complexity of some problems of searching for a family of disjoint clusters
Doklady Mathematics | 2019-06-24 | Paper |
On \(k\)-\(11\)-representable graphs
Journal of Combinatorics | 2019-05-24 | Paper |
An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times
Sibirskie Elektronnye Matematicheskie Izvestiya | 2019-05-09 | Paper |
Word-Representable Graphs: a Survey
Journal of Applied and Industrial Mathematics | 2018-11-21 | Paper |
Combinatorial bounds via measure and conquer
ACM Transactions on Algorithms | 2018-11-05 | Paper |
NP-hardness of some Euclidean problems of partitioning a finite set of points
Computational Mathematics and Mathematical Physics | 2018-08-20 | Paper |
On the representation number of a crown graph
Discrete Applied Mathematics | 2018-05-24 | Paper |
On the representation number of a crown graph
Discrete Applied Mathematics | 2018-05-24 | Paper |
On \((1,l)\)-coloring of incidentors of multigraphs
Journal of Applied and Industrial Mathematics | 2018-04-06 | Paper |
On list incidentor \((k,l)\)-coloring
Journal of Applied and Industrial Mathematics | 2017-06-15 | Paper |
On the complexity of some Euclidean problems of partitioning a finite set of points
Doklady Mathematics | 2017-04-11 | 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 |
On square-free permutations
Journal of Automata, Languages and Combinatorics | 2016-09-29 | Paper |
On an interval \((1, 1)\)-coloring of incidentors of interval colorable graphs
Journal of Applied and Industrial Mathematics | 2016-08-12 | Paper |
Completing partial schedules for open shop with unit processing times and routing
Computer Science – Theory and Applications | 2016-07-25 | Paper |
On the complexity of some quadratic Euclidean 2-clustering problems
Computational Mathematics and Mathematical Physics | 2016-07-08 | Paper |
Semi-transitive orientations and word-representable graphs
Discrete Applied Mathematics | 2016-02-04 | Paper |
NP-hardness of some quadratic Euclidean 2-clustering problems
Doklady Mathematics | 2016-01-29 | Paper |
Representing graphs via pattern avoiding words
The Electronic Journal of Combinatorics | 2015-08-26 | Paper |
Representing graphs via pattern avoiding words
The Electronic Journal of Combinatorics | 2015-08-26 | 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 |
On the edge multicoloring of unicyclic graphs
Journal of Applied and Industrial Mathematics | 2015-07-27 | Paper |
Complexity of the weighted max-cut in Euclidean space
Journal of Applied and Industrial Mathematics | 2015-07-27 | Paper |
On complexity of some problems of cluster analysis of vector sequences
Journal of Applied and Industrial Mathematics | 2015-07-17 | Paper |
The open shop problem with routing at a two-node network and allowed preemption
Journal of Applied and Industrial Mathematics | 2015-07-17 | 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 |
On toughness and Hamiltonicity of \(2K_{2}\)-free graphs
Journal of Graph Theory | 2014-05-22 | Paper |
Colorings with few colors: counting, enumeration and combinatorial bounds
Theory of Computing Systems | 2013-08-01 | Paper |
On the complexity of certain problems of choosing subset of vectors
Zhurnal Vychislitel'noĭ Matematiki i Matematicheskoĭ Fiziki | 2013-07-03 | Paper |
Triangle-free \(2P_3\)-free graphs are 4-colorable
Discrete Mathematics | 2013-03-04 | Paper |
The complexity of finding uniform sparsest cuts in various graph classes
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions
Journal of Discrete Algorithms | 2012-05-11 | Paper |
| NP-completeness of some problems of a vectors subset choice | 2012-02-20 | Paper |
| A 2-approximation algorithm for the metric 2-peripatetic salesman problem | 2012-02-20 | Paper |
| On avoidance of V- and \(\Lambda \)-patterns in permutations. | 2012-02-20 | Paper |
| On complexity of the problem of choosing a vector subset with maximal sum length | 2012-02-20 | Paper |
| The problem of finding a subset of vectors with maximal total weight | 2012-02-10 | Paper |
| Polynomial algorithms for solving the vector sum problem | 2012-02-10 | Paper |
| Unicyclic nonintegral sum graphs | 2012-02-10 | Paper |
| On a variant of the problem of choosing a vector subset | 2012-02-10 | Paper |
| scientific article; zbMATH DE number 6004969 (Why is no real title available?) | 2012-02-10 | Paper |
| On the coloring of incidentors in an oriented weighted multigraph | 2012-02-10 | Paper |
| Bounds for the incidentor chromatic number of a weighted undirected multigraph | 2012-02-10 | Paper |
| On list incidentor coloring of a multigraph of degree 3 | 2012-02-10 | Paper |
| On a decentralized transportation problem | 2012-02-10 | Paper |
Alternation graphs
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
On the complexity of a search for a subset of ``similar vectors
Doklady Mathematics | 2011-06-08 | Paper |
The complexity status of problems related to sparsest cuts
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Complexity of certain problems of searching for subsets of vectors and cluster analysis
Computational Mathematics and Mathematical Physics | 2011-05-04 | Paper |
Graphs Capturing Alternations in Words
Developments in Language Theory | 2010-08-31 | Paper |
| On representable graphs | 2009-01-15 | Paper |
On the minimum feedback vertex set problem: Exact and enumeration algorithms
Algorithmica | 2008-12-02 | Paper |
| On representable graphs, semi-transitive orientations, and the representation numbers | 2008-10-01 | Paper |
Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$
Parameterized and Exact Computation | 2008-06-03 | Paper |
Subdivided trees are integral sum graphs
Discrete Mathematics | 2008-03-13 | Paper |
Erdős regular graphs of even degree
Discussiones Mathematicae Graph Theory | 2008-02-22 | Paper |
A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem
Approximation and Online Algorithms | 2008-02-20 | Paper |
On maximum number of minimal dominating sets in graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
NP-hardness and approximation algorithms for solving Euclidean problem of finding a maximum total weight subset of vectors
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Incidentor coloring of weighted multigraphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
| scientific article; zbMATH DE number 2239562 (Why is no real title available?) | 2005-12-19 | Paper |
Radio Labeling with Preassigned Frequencies
SIAM Journal on Optimization | 2005-02-23 | Paper |
Interval coloring of (3,4)-biregular bipartite graphs having large cubic subgraphs
Journal of Graph Theory | 2005-02-16 | Paper |
| scientific article; zbMATH DE number 2097447 (Why is no real title available?) | 2004-09-07 | Paper |
| scientific article; zbMATH DE number 2097446 (Why is no real title available?) | 2004-09-07 | Paper |
| scientific article; zbMATH DE number 2097451 (Why is no real title available?) | 2004-09-07 | Paper |
Regular 4‐critical graphs of even degree
Journal of Graph Theory | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 1947394 (Why is no real title available?) | 2003-07-08 | Paper |
6-regular 4-critical graph
Journal of Graph Theory | 2003-03-19 | Paper |
On 4-chromatic edge-critical regular graphs of high connectivity
Discrete Mathematics | 2003-03-16 | Paper |
| scientific article; zbMATH DE number 1855676 (Why is no real title available?) | 2003-01-19 | Paper |
A graph with cover degeneracy less than chromatic number
Journal of Graph Theory | 2002-11-17 | Paper |
New formula for the sum number for the complete bipartite graphs
Discrete Mathematics | 2002-09-25 | Paper |
Regular integral sum graphs
Discrete Mathematics | 2002-08-29 | Paper |
The incidentor coloring of multigraphs and its applications
Discrete Applied Mathematics | 2002-08-29 | Paper |
| The incidentor coloring of multigraphs and its application in data networks | 2001-09-23 | Paper |
A two-level bimatrix game with a control of payoff
Diskretnyĭ Analiz i Issledovanie Operatsiĭ. Seriya 2 | 2001-06-10 | Paper |
| scientific article; zbMATH DE number 1564005 (Why is no real title available?) | 2001-02-12 | Paper |
Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most \(3\)
Discrete Mathematics | 2000-11-02 | Paper |
| scientific article; zbMATH DE number 1046599 (Why is no real title available?) | 1997-08-07 | Paper |
| scientific article; zbMATH DE number 919282 (Why is no real title available?) | 1997-03-09 | Paper |
