The following pages link to Artem V. Pyatkin (Q334415):
Displaying 50 items.
- (Q210387) (redirect page) (← links)
- On the complexity of some Euclidean optimal summing problems (Q334416) (← links)
- Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions (Q414467) (← links)
- The complexity of finding uniform sparsest cuts in various graph classes (Q450559) (← links)
- NP-hardness of the Euclidean Max-Cut problem (Q471386) (← links)
- 2-approximation algorithm for finding a clique with minimum weight of vertices and edges (Q483409) (← links)
- Representing graphs via pattern avoiding words (Q491554) (← links)
- Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph (Q492279) (← links)
- On the complexity and approximability of some Euclidean optimal summing problems (Q506239) (← links)
- On the complexity of some Euclidean problems of partitioning a finite set of points (Q521408) (← links)
- On the complexity of a search for a subset of ``similar'' vectors (Q542229) (← links)
- NP-hardness of some quadratic Euclidean 2-clustering problems (Q906118) (← links)
- Semi-transitive orientations and word-representable graphs (Q908303) (← links)
- On the minimum feedback vertex set problem: Exact and enumeration algorithms (Q958216) (← links)
- Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most \(3\) (Q1584243) (← links)
- The incidentor coloring of multigraphs and its applications (Q1613375) (← links)
- Regular integral sum graphs (Q1613502) (← links)
- NP-hardness of some Euclidean problems of partitioning a finite set of points (Q1662580) (← links)
- On the representation number of a crown graph (Q1752592) (← links)
- On 4-chromatic edge-critical regular graphs of high connectivity (Q1861276) (← links)
- Triangle-free \(2P_3\)-free graphs are 4-colorable (Q1939592) (← links)
- On the complexity of some quadratic Euclidean partition problems into balanced clusters (Q1982892) (← links)
- The maximum number of induced open triangles in graphs of a given order (Q2010145) (← links)
- An exact algorithm of searching for the largest size cluster in an integer sequence 2-clustering problem (Q2026155) (← links)
- NP-hardness of some max-min clustering problems (Q2026156) (← links)
- Quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the size of the clusters: complexity and approximability (Q2043627) (← links)
- Selecting a subset of diverse points based on the squared Euclidean distance (Q2163859) (← links)
- Routing open shop with two nodes, unit processing times and equal number of jobs and machines (Q2181765) (← links)
- Maximum diversity problem with squared Euclidean distance (Q2181789) (← links)
- NP-hardness of quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the cluster sizes (Q2191318) (← links)
- Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters (Q2206419) (← links)
- Irreducible bin packing and normality in routing open shop (Q2240719) (← links)
- Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence (Q2294598) (← links)
- NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters (Q2304346) (← links)
- Colorings with few colors: counting, enumeration and combinatorial bounds (Q2392249) (← links)
- On \(k\)-\(11\)-representable graphs (Q2416927) (← links)
- On the complexity of some problems of searching for a family of disjoint clusters (Q2424385) (← links)
- Subdivided trees are integral sum graphs (Q2477401) (← links)
- On the complexity of some quadratic Euclidean 2-clustering problems (Q2630045) (← links)
- An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times (Q2633586) (← links)
- On permutations avoiding partially ordered patterns defined by bipartite graphs (Q2684900) (← links)
- (Q2713945) (← links)
- (Q2741361) (← links)
- A Graph with cover degeneracy less than chromatic number (Q2746206) (← links)
- (Q2819395) (← links)
- (Q2836761) (← links)
- Complexity of certain problems of searching for subsets of vectors and cluster analysis (Q2995693) (← links)
- The Complexity Status of Problems Related to Sparsest Cuts (Q3000501) (← links)
- Alternation Graphs (Q3104776) (← links)
- (Q3115010) (← links)
