| Publication | Date of Publication | Type |
|---|
| On the complexity of the problem of choice of large clusters | 2024-12-04 | Paper |
| PTAS for problems of vector choice and clustering with different centers | 2024-11-27 | Paper |
| On complexity of two-machine routing propotionate open shop | 2024-11-25 | Paper |
| New tools to study 1-11-representation of graphs | 2024-10-09 | Paper |
| On semi-transitive orientability of split graphs | 2024-03-26 | Paper |
| An embedding technique in the study of word-representability of graphs | 2024-02-14 | Paper |
| PTAS for \(p\)-means \(q\)-medoids \(r\)-given clustering problem | 2023-08-21 | Paper |
| Probabilistic and analytical properties of the last passage percolation constant in a weighted random directed graph | 2023-06-05 | Paper |
| On the maximum number of open triangles in graphs with the same number of vertices and edges | 2023-02-21 | Paper |
| On permutations avoiding partially ordered patterns defined by bipartite graphs | 2023-02-17 | Paper |
| Selecting a subset of diverse points based on the squared Euclidean distance | 2022-08-11 | Paper |
| On a routing Open Shop Problem on two nodes with unit processing times | 2022-07-15 | Paper |
| On permutations avoiding partially ordered patterns defined by bipartite graphs | 2022-04-19 | Paper |
| Irreducible bin packing and normality in routing open shop | 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 | 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 | 2021-02-25 | Paper |
| Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters | 2020-10-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 |
| 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 | 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 maximum number of induced open triangles in graphs of a given order | 2019-12-03 | Paper |
| On the complexity of some problems of searching for a family of disjoint clusters | 2019-06-24 | Paper |
| On \(k\)-\(11\)-representable graphs | 2019-05-24 | Paper |
| An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times | 2019-05-09 | Paper |
| Word-Representable Graphs: a Survey | 2018-11-21 | Paper |
| Combinatorial bounds via measure and conquer | 2018-11-05 | Paper |
| NP-hardness of some Euclidean problems of partitioning a finite set of points | 2018-08-20 | Paper |
| On the representation number of a crown graph | 2018-05-24 | Paper |
| On (1,l)-coloring of incidentors of multigraphs | 2018-04-06 | Paper |
| On list incidentor (k, l)-coloring | 2017-06-15 | Paper |
| On the complexity of some Euclidean problems of partitioning a finite set of points | 2017-04-11 | 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 |
| On square-free permutations | 2016-09-29 | Paper |
| On an interval (1, 1)-coloring of incidentors of interval colorable graphs | 2016-08-12 | Paper |
| Completing Partial Schedules for Open Shop with Unit Processing Times and Routing | 2016-07-25 | Paper |
| On the complexity of some quadratic Euclidean 2-clustering problems | 2016-07-08 | Paper |
| Semi-transitive orientations and word-representable graphs | 2016-02-04 | Paper |
| NP-hardness of some quadratic Euclidean 2-clustering problems | 2016-01-29 | Paper |
| Representing graphs via pattern avoiding words | 2015-08-26 | Paper |
| Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph | 2015-08-20 | Paper |
| On the edge multicoloring of unicyclic graphs | 2015-07-27 | Paper |
| Complexity of the weighted max-cut in Euclidean space | 2015-07-27 | Paper |
| On complexity of some problems of cluster analysis of vector sequences | 2015-07-17 | Paper |
| The open shop problem with routing at a two-node network and allowed preemption | 2015-07-17 | 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 |
| On Toughness and Hamiltonicity of 2K2‐Free Graphs | 2014-05-22 | Paper |
| Colorings with few colors: counting, enumeration and combinatorial bounds | 2013-08-01 | Paper |
| On the complexity of certain problems of choosing subset of vectors | 2013-07-03 | Paper |
| Triangle-free \(2P_3\)-free graphs are 4-colorable | 2013-03-04 | Paper |
| The complexity of finding uniform sparsest cuts in various graph classes | 2012-09-13 | Paper |
| Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions | 2012-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115233 | 2012-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115183 | 2012-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115010 | 2012-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115204 | 2012-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115657 | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115590 | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115635 | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115704 | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115710 | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115583 | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115634 | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115647 | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115687 | 2012-02-10 | Paper |
| Alternation Graphs | 2011-12-16 | Paper |
| On the complexity of a search for a subset of ``similar vectors | 2011-06-08 | Paper |
| The Complexity Status of Problems Related to Sparsest Cuts | 2011-05-19 | Paper |
| Complexity of certain problems of searching for subsets of vectors and cluster analysis | 2011-05-04 | Paper |
| Graphs Capturing Alternations in Words | 2010-08-31 | Paper |
| On representable graphs | 2009-01-15 | Paper |
| On the minimum feedback vertex set problem: Exact and enumeration algorithms | 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)$ | 2008-06-03 | Paper |
| Subdivided trees are integral sum graphs | 2008-03-13 | Paper |
| Erdős regular graphs of even degree | 2008-02-22 | Paper |
| A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem | 2008-02-20 | Paper |
| On maximum number of minimal dominating sets in graphs | 2007-05-29 | Paper |
| NP-hardness and approximation algorithms for solving Euclidean problem of finding a maximum total weight subset of vectors | 2007-05-29 | Paper |
| Incidentor coloring of weighted multigraphs | 2007-05-29 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5715092 | 2005-12-19 | Paper |
| Radio Labeling with Preassigned Frequencies | 2005-02-23 | Paper |
| Interval coloring of (3,4)-biregular bipartite graphs having large cubic subgraphs | 2005-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4812196 | 2004-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4812195 | 2004-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4812200 | 2004-09-07 | Paper |
| Regular 4‐critical graphs of even degree | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411360 | 2003-07-08 | Paper |
| 6-regular 4-critical graph | 2003-03-19 | Paper |
| On 4-chromatic edge-critical regular graphs of high connectivity | 2003-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788091 | 2003-01-19 | Paper |
| A graph with cover degeneracy less than chromatic number | 2002-11-17 | Paper |
| New formula for the sum number for the complete bipartite graphs | 2002-09-25 | Paper |
| Regular integral sum graphs | 2002-08-29 | Paper |
| The incidentor coloring of multigraphs and its applications | 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 | 2001-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4528826 | 2001-02-12 | Paper |
| Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most \(3\) | 2000-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4348911 | 1997-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4888946 | 1997-03-09 | Paper |
