Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most 3. - Artem V. Pyatkin (Discret. Math., 1998)

The incidentor coloring of multigraphs and its application in data networks. - Artem V. Pyatkin (Electron. Notes Discret. Math., 1999)

New formula for the sum number for the complete bipartite graphs. - Artem V. Pyatkin (Discret. Math., 2001)

A Graph with cover degeneracy less than chromatic number. - Artem V. Pyatkin (J. Graph Theory, 2001)

Radio Labeling with Pre-assigned Frequencies. - Hans L. Bodlaender; Hajo Broersma; Fedor V. Fomin; Artem V. Pyatkin; Gerhard J. Woeginger (ESA, 2002)

The incidentor coloring of multigraphs and its applications. - Artem V. Pyatkin (Discret. Appl. Math., 2002)

Regular integral sum graphs. - Leonid S. Melnikov; Artem V. Pyatkin (Discret. Math., 2002)

6-regular 4-critical graph. - Artem V. Pyatkin (J. Graph Theory, 2002)

On 4-chromatic edge-critical regular graphs of high connectivity. - Andrey A. Dobrynin; Leonid S. Melnikov; Artem V. Pyatkin (Discret. Math., 2003)

Regular 4-critical graphs of even degree. - Andrey A. Dobrynin; Leonid S. Melnikov; Artem V. Pyatkin (J. Graph Theory, 2004)

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

Radio Labeling with Preassigned Frequencies. - Hans L. Bodlaender; Hajo Broersma; Fedor V. Fomin; Artem V. Pyatkin; Gerhard J. Woeginger (SIAM J. Optim., 2004)

Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach. - Fedor V. Fomin; Fabrizio Grandoni 001; Artem V. Pyatkin; Alexey A. Stepanov (ISAAC, 2005)

On maximum number of minimal dominating sets in graphs. - Fedor V. Fomin; Fabrizio Grandoni 001; Artem V. Pyatkin; Alexey A. Stepanov (Electron. Notes Discret. Math., 2005)

Finding a Minimum Feedback Vertex Set in Time O (1.7548n). - Fedor V. Fomin; Serge Gaspers; Artem V. Pyatkin (IWPEC, 2006)

NP-hardness and approximation algorithms for solving Euclidean problem of finding a maximum total weight subset of vectors. - Edward Gimadi; Alexey Baburin; Alexei N. Glebov; Artem V. Pyatkin (Electron. Notes Discret. Math., 2006)

Incidentor coloring of weighted multigraphs. - Vadym G. Vizing; Artem V. Pyatkin (Electron. Notes Discret. Math., 2006)

A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem. - Alexander A. Ageev; Artem V. Pyatkin (WAOA, 2007)

Erdõs regular graphs of even degree. - Andrey A. Dobrynin; Leonid S. Melnikov; Artem V. Pyatkin (Discuss. Math. Graph Theory, 2007)

On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms. - Fedor V. Fomin; Serge Gaspers; Artem V. Pyatkin; Igor Razgon (Algorithmica, 2008)

Subdivided trees are integral sum graphs. - Artem V. Pyatkin (Discret. Math., 2008)

On Representable Graphs. - Sergey Kitaev; Artem V. Pyatkin (J. Autom. Lang. Comb., 2008)

Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications. - Fedor V. Fomin; Fabrizio Grandoni 001; Artem V. Pyatkin; Alexey A. Stepanov (ACM Trans. Algorithms, 2008)

Graphs Capturing Alternations in Words. - Magnús M. Halldórsson; Sergey Kitaev; Artem V. Pyatkin (Developments in Language Theory, 2010)

The Complexity Status of Problems Related to Sparsest Cuts. - Paul S. Bonsma; Hajo Broersma; Viresh Patel; Artem V. Pyatkin (IWOCA, 2010)

On avoidance of V- and ^-patterns in permutations. - Sergey Kitaev; Artem V. Pyatkin (Ars Comb., 2010)

Alternation Graphs. - Magnús M. Halldórsson; Sergey Kitaev; Artem V. Pyatkin (WG, 2011)

On Square-Free Permutations. - Sergey V. Avgustinovich; Sergey Kitaev; Artem V. Pyatkin; Alexandr Valyuzhenich (J. Autom. Lang. Comb., 2011)

The complexity of finding uniform sparsest cuts in various graph classes. - Paul S. Bonsma; Hajo Broersma; Viresh Patel; Artem V. Pyatkin (J. Discrete Algorithms, 2012)

Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions. - Alexei Vernitski; Artem V. Pyatkin (J. Discrete Algorithms, 2012)

Triangle-free 2P3-free graphs are 4-colorable. - Artem V. Pyatkin (Discret. Math., 2013)

Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds. - Jean-François Couturier 001; Petr A. Golovach; Dieter Kratsch; Mathieu Liedloff; Artem V. Pyatkin (Theory Comput. Syst., 2013)

On Toughness and Hamiltonicity of 2K2-Free Graphs. - Hajo Broersma; Viresh Patel; Artem V. Pyatkin (J. Graph Theory, 2014)

Representing Graphs via Pattern Avoiding Words. - Miles Eli Jones; Sergey Kitaev; Artem V. Pyatkin; Jeffrey B. Remmel (Electron. J. Comb., 2015)

On Complexity of Searching a Subset of Vectors with Shortest Average Under a Cardinality Restriction. - Anton V. Eremeev; Alexander V. Kel'manov; Artem V. Pyatkin (AIST, 2016)

Convergecast scheduling problem in case of given aggregation tree: The complexity status and some special cases. - Adil I. Erzin; Artem V. Pyatkin (CSNDSP, 2016)

Completing Partial Schedules for Open Shop with Unit Processing Times and Routing. - René van Bevern; Artem V. Pyatkin (CSR, 2016)

On a Quadratic Euclidean Problem of Vector Subset Choice: Complexity and Algorithmic Approach. - Anton V. Eremeev; Alexander Kelmanov; Artem V. Pyatkin (DOOR (Supplement), 2016)

Semi-transitive orientations and word-representable graphs. - Magnús M. Halldórsson; Sergey Kitaev; Artem V. Pyatkin (Discret. Appl. Math., 2016)

On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum. - Anton V. Eremeev; Alexander V. Kel'manov; Artem V. Pyatkin; Igor A. Ziegler (AIST, 2017)

NP-Hardness of balanced minimum sum-of-squares clustering. - Artem V. Pyatkin; Daniel Aloise; Nenad Mladenovic (Pattern Recognit. Lett., 2017)

Exact Algorithms for Two Quadratic Euclidean Problems of Searching for the Largest Subset and Longest Subsequence. - Alexander Kel'manov; Sergey A. Khamidullin; Vladimir I. Khandeev; Artem V. Pyatkin (LION, 2018)

On the representation number of a crown graph. - Marc Glen; Sergey Kitaev; Artem V. Pyatkin (Discret. Appl. Math., 2018)

Irreducible Bin Packing: Complexity, Solvability and Application to the Routing Open Shop. - Ilya Chernykh; Artem V. Pyatkin (LION, 2019)

Maximum Diversity Problem with Squared Euclidean Distance. - Anton V. Eremeev; Alexander V. Kel'manov; Mikhail Y. Kovalyov; Artem V. Pyatkin (MOTOR, 2019)

Routing Open Shop with Two Nodes, Unit Processing Times and Equal Number of Jobs and Machines. - Mikhail Golovachev; Artem V. Pyatkin (MOTOR, 2019)

The maximum number of induced open triangles in graphs of a given order. - Artem V. Pyatkin; Eugene Lykhovyd; Sergiy Butenko (Optim. Lett., 2019)

On Finding Minimum Cardinality Subset of Vectors with a Constraint on the Sum of Squared Euclidean Pairwise Distances. - Anton V. Eremeev; Mikhail Y. Kovalyov; Artem V. Pyatkin (LION, 2020)

Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence. - Alexander Kel'manov; Sergey A. Khamidullin; Vladimir I. Khandeev; Artem V. Pyatkin (Ann. Math. Artif. Intell., 2020)

Preface. - Alexander V. Kononov; Alexander S. Strekalovsky; Mikhail Posypkin; Artem V. Pyatkin (J. Glob. Optim., 2020)

Irreducible bin packing and normality in routing open shop. - Ilya Chernykh; Artem V. Pyatkin (Ann. Math. Artif. Intell., 2021)

Selecting a subset of diverse points based on the squared euclidean distance. - Anton V. Eremeev; Alexander V. Kel'manov; Mikhail Y. Kovalyov; Artem V. Pyatkin (Ann. Math. Artif. Intell., 2022)

On Permutations Avoiding Partially Ordered Patterns Defined by Bipartite Graphs. - Sergey Kitaev; Artem V. Pyatkin (Electron. J. Comb., 2023)

On semi-transitive orientability of triangle-free graphs. - Sergey Kitaev; Artem V. Pyatkin (Discuss. Math. Graph Theory, 2023)

An embedding technique in the study of word-representability of graphs. - Sumin Huang; Sergey Kitaev; Artem V. Pyatkin (Discret. Appl. Math., 2024)

On semi-transitive orientability of split graphs. - Sergey Kitaev; Artem V. Pyatkin (Inf. Process. Lett., 2024)

New Tools to Study 1-11-Representation of Graphs. - Mikhail Futorny; Sergey Kitaev; Artem V. Pyatkin (Graphs Comb., 2024)