Artem V. Pyatkin

Orcid: 0000-0001-5355-411X

According to our database1, Artem V. Pyatkin authored at least 56 papers between 1998 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:



On semi-transitive orientability of split graphs.
Inf. Process. Lett., February, 2024

An embedding technique in the study of word-representability of graphs.
Discret. Appl. Math., 2024

On semi-transitive orientability of triangle-free graphs.
Discuss. Math. Graph Theory, 2023

On Permutations Avoiding Partially Ordered Patterns Defined by Bipartite Graphs.
Electron. J. Comb., 2023

Selecting a subset of diverse points based on the squared euclidean distance.
Ann. Math. Artif. Intell., 2022

Irreducible bin packing and normality in routing open shop.
Ann. Math. Artif. Intell., 2021

J. Glob. Optim., 2020

Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence.
Ann. Math. Artif. Intell., 2020

On Finding Minimum Cardinality Subset of Vectors with a Constraint on the Sum of Squared Euclidean Pairwise Distances.
Proceedings of the Learning and Intelligent Optimization - 14th International Conference, 2020

The maximum number of induced open triangles in graphs of a given order.
Optim. Lett., 2019

Routing Open Shop with Two Nodes, Unit Processing Times and Equal Number of Jobs and Machines.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

Maximum Diversity Problem with Squared Euclidean Distance.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

Irreducible Bin Packing: Complexity, Solvability and Application to the Routing Open Shop.
Proceedings of the Learning and Intelligent Optimization - 13th International Conference, 2019

On the representation number of a crown graph.
Discret. Appl. Math., 2018

Exact Algorithms for Two Quadratic Euclidean Problems of Searching for the Largest Subset and Longest Subsequence.
Proceedings of the Learning and Intelligent Optimization - 12th International Conference, 2018

NP-Hardness of balanced minimum sum-of-squares clustering.
Pattern Recognit. Lett., 2017

On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum.
Proceedings of the Analysis of Images, Social Networks and Texts, 2017

Semi-transitive orientations and word-representable graphs.
Discret. Appl. Math., 2016

On a Quadratic Euclidean Problem of Vector Subset Choice: Complexity and Algorithmic Approach.
Proceedings of the Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19, 2016

Completing Partial Schedules for Open Shop with Unit Processing Times and Routing.
Proceedings of the Computer Science - Theory and Applications, 2016

Convergecast scheduling problem in case of given aggregation tree: The complexity status and some special cases.
Proceedings of the 10th International Symposium on Communication Systems, 2016

On Complexity of Searching a Subset of Vectors with Shortest Average Under a Cardinality Restriction.
Proceedings of the Analysis of Images, Social Networks and Texts, 2016

Representing Graphs via Pattern Avoiding Words.
Electron. J. Comb., 2015

On Toughness and Hamiltonicity of 2<i>K</i><sub>2</sub>-Free Graphs.
J. Graph Theory, 2014

Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds.
Theory Comput. Syst., 2013

Triangle-free 2<i>P</i><sub>3</sub>-free graphs are 4-colorable.
Discret. Math., 2013

Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions.
J. Discrete Algorithms, 2012

The complexity of finding uniform sparsest cuts in various graph classes.
J. Discrete Algorithms, 2012

On Square-Free Permutations.
J. Autom. Lang. Comb., 2011

Alternation Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

On avoidance of V- and ^-patterns in permutations.
Ars Comb., 2010

The Complexity Status of Problems Related to Sparsest Cuts.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Graphs Capturing Alternations in Words.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications.
ACM Trans. Algorithms, 2008

On Representable Graphs.
J. Autom. Lang. Comb., 2008

Subdivided trees are integral sum graphs.
Discret. Math., 2008

On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms.
Algorithmica, 2008

Erdõs regular graphs of even degree.
Discuss. Math. Graph Theory, 2007

A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem.
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

Incidentor coloring of weighted multigraphs.
Electron. Notes Discret. Math., 2006

NP-hardness and approximation algorithms for solving Euclidean problem of finding a maximum total weight subset of vectors.
Electron. Notes Discret. Math., 2006

Finding a Minimum Feedback Vertex Set in Time <i>O</i> (1.7548<sup><i>n</i></sup>).
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

On maximum number of minimal dominating sets in graphs.
Electron. Notes Discret. Math., 2005

Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Radio Labeling with Preassigned Frequencies.
SIAM J. Optim., 2004

Interval coloring of (3, 4)-biregular bipartite graphs having large cubic subgraphs.
J. Graph Theory, 2004

Regular 4-critical graphs of even degree.
J. Graph Theory, 2004

On 4-chromatic edge-critical regular graphs of high connectivity.
Discret. Math., 2003

6-regular 4-critical graph.
J. Graph Theory, 2002

Regular integral sum graphs.
Discret. Math., 2002

The incidentor coloring of multigraphs and its applications.
Discret. Appl. Math., 2002

Radio Labeling with Pre-assigned Frequencies.
Proceedings of the Algorithms, 2002

A Graph with cover degeneracy less than chromatic number.
J. Graph Theory, 2001

New formula for the sum number for the complete bipartite graphs.
Discret. Math., 2001

The incidentor coloring of multigraphs and its application in data networks.
Electron. Notes Discret. Math., 1999

Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most 3.
Discret. Math., 1998