Artem V. Pyatkin

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 25

Top Topics

Top Venues

Ann. Math. Artif. Intell.

Discret. Appl. Math.

Publications

Sumin Huang, Sergey Kitaev, Artem V. Pyatkin
An embedding technique in the study of word-representability of graphs. Discret. Appl. Math. 346 (2024)
Mikhail Futorny, Sergey Kitaev, Artem V. Pyatkin
New Tools to Study 1-11-Representation of Graphs. Graphs Comb. 40 (5) (2024)
Sergey Kitaev, Artem V. Pyatkin
On semi-transitive orientability of split graphs. Inf. Process. Lett. 184 (2024)
Sergey Kitaev, Artem V. Pyatkin
On Permutations Avoiding Partially Ordered Patterns Defined by Bipartite Graphs. Electron. J. Comb. 30 (1) (2023)
Sergey Kitaev, Artem V. Pyatkin
On semi-transitive orientability of triangle-free graphs. Discuss. Math. Graph Theory 43 (2) (2023)
Anton V. Eremeev, Alexander V. Kel'manov, Mikhail Y. Kovalyov, Artem V. Pyatkin
Selecting a subset of diverse points based on the squared euclidean distance. Ann. Math. Artif. Intell. 90 (7) (2022)
Ilya Chernykh, Artem V. Pyatkin
Irreducible bin packing and normality in routing open shop. Ann. Math. Artif. Intell. 89 (8-9) (2021)
Alexander V. Kononov, Alexander S. Strekalovsky, Mikhail Posypkin, Artem V. Pyatkin
Preface. J. Glob. Optim. 76 (3) (2020)
Alexander Kel'manov, Sergey A. Khamidullin, Vladimir I. Khandeev, Artem V. Pyatkin
Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence. Ann. Math. Artif. Intell. 88 (1-3) (2020)
Anton V. Eremeev, Mikhail Y. Kovalyov, Artem V. Pyatkin
On Finding Minimum Cardinality Subset of Vectors with a Constraint on the Sum of Squared Euclidean Pairwise Distances. LION (2020)
Artem V. Pyatkin, Eugene Lykhovyd, Sergiy Butenko
The maximum number of induced open triangles in graphs of a given order. Optim. Lett. 13 (8) (2019)
Ilya Chernykh, Artem V. Pyatkin
Irreducible Bin Packing: Complexity, Solvability and Application to the Routing Open Shop. LION (2019)
Anton V. Eremeev, Alexander V. Kel'manov, Mikhail Y. Kovalyov, Artem V. Pyatkin
Maximum Diversity Problem with Squared Euclidean Distance. MOTOR (2019)
Mikhail Golovachev, Artem V. Pyatkin
Routing Open Shop with Two Nodes, Unit Processing Times and Equal Number of Jobs and Machines. MOTOR (2019)
Marc Glen, Sergey Kitaev, Artem V. Pyatkin
On the representation number of a crown graph. Discret. Appl. Math. 244 (2018)
Alexander Kel'manov, Sergey A. Khamidullin, Vladimir I. Khandeev, Artem V. Pyatkin
Exact Algorithms for Two Quadratic Euclidean Problems of Searching for the Largest Subset and Longest Subsequence. LION (2018)
Anton V. Eremeev, Alexander V. Kel'manov, Artem V. Pyatkin, Igor A. Ziegler
On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum. AIST (2017)
Artem V. Pyatkin, Daniel Aloise, Nenad Mladenovic
NP-Hardness of balanced minimum sum-of-squares clustering. Pattern Recognit. Lett. 97 (2017)
Anton V. Eremeev, Alexander Kelmanov, Artem V. Pyatkin, Igor A. Ziegler
On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum. CoRR (2017)
René van Bevern, Artem V. Pyatkin
Completing partial schedules for Open Shop with unit processing times and routing. CoRR (2016)
René van Bevern, Artem V. Pyatkin
Completing Partial Schedules for Open Shop with Unit Processing Times and Routing. CSR (2016)
Magnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin
Semi-transitive orientations and word-representable graphs. Discret. Appl. Math. 201 (2016)
Adil I. Erzin, Artem V. Pyatkin
Convergecast scheduling problem in case of given aggregation tree: The complexity status and some special cases. CSNDSP (2016)
Anton V. Eremeev, Alexander Kelmanov, Artem V. Pyatkin
On a Quadratic Euclidean Problem of Vector Subset Choice: Complexity and Algorithmic Approach. DOOR (Supplement) (2016)
Anton V. Eremeev, Alexander V. Kel'manov, Artem V. Pyatkin
On Complexity of Searching a Subset of Vectors with Shortest Average Under a Cardinality Restriction. AIST (2016)
Miles Eli Jones, Sergey Kitaev, Artem V. Pyatkin, Jeffrey B. Remmel
Representing Graphs via Pattern Avoiding Words. Electron. J. Comb. 22 (2) (2015)
Hajo Broersma, Viresh Patel, Artem V. Pyatkin
-Free Graphs. J. Graph Theory 75 (3) (2014)
Artem V. Pyatkin
-free graphs are 4-colorable. Discret. Math. 313 (5) (2013)
Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Artem V. Pyatkin
Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds. Theory Comput. Syst. 52 (4) (2013)
Alexei Vernitski, Artem V. Pyatkin
Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions. J. Discrete Algorithms 12 (2012)
Paul S. Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin
The complexity of finding uniform sparsest cuts in various graph classes. J. Discrete Algorithms 14 (2012)
Sergey V. Avgustinovich, Sergey Kitaev, Artem V. Pyatkin, Alexandr Valyuzhenich
On Square-Free Permutations. J. Autom. Lang. Comb. 16 (1) (2011)
Magnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin
Alternation Graphs. WG (2011)
Magnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin
Graphs Capturing Alternations in Words. Developments in Language Theory (2010)
Sergey Kitaev, Artem V. Pyatkin
On avoidance of V- and ^-patterns in permutations. Ars Comb. 97 (2010)
Paul S. Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin
The Complexity Status of Problems Related to Sparsest Cuts. IWOCA (2010)
Artem V. Pyatkin
Subdivided trees are integral sum graphs. Discret. Math. 308 (9) (2008)
Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov
Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications. ACM Trans. Algorithms 5 (1) (2008)
Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin, Igor Razgon
On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms. Algorithmica 52 (2) (2008)
Sergey Kitaev, Artem V. Pyatkin
On Representable Graphs. J. Autom. Lang. Comb. 13 (1) (2008)
Andrey A. Dobrynin, Leonid S. Melnikov, Artem V. Pyatkin
Erdõs regular graphs of even degree. Discuss. Math. Graph Theory 27 (2) (2007)
Alexander A. Ageev, Artem V. Pyatkin
A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem. WAOA (2007)
Edward Gimadi, Alexey Baburin, Alexei N. Glebov, Artem V. Pyatkin
NP-hardness and approximation algorithms for solving Euclidean problem of finding a maximum total weight subset of vectors. Electron. Notes Discret. Math. 27 (2006)
Vadym G. Vizing, Artem V. Pyatkin
Incidentor coloring of weighted multigraphs. Electron. Notes Discret. Math. 27 (2006)
Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin
). IWPEC (2006)
Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov
Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach. ISAAC (2005)
Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov
On maximum number of minimal dominating sets in graphs. Electron. Notes Discret. Math. 22 (2005)
Andrey A. Dobrynin, Leonid S. Melnikov, Artem V. Pyatkin
Regular 4-critical graphs of even degree. J. Graph Theory 46 (2) (2004)
Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger
Radio Labeling with Preassigned Frequencies. SIAM J. Optim. 15 (1) (2004)
Artem V. Pyatkin
Interval coloring of (3, 4)-biregular bipartite graphs having large cubic subgraphs. J. Graph Theory 47 (2) (2004)
Andrey A. Dobrynin, Leonid S. Melnikov, Artem V. Pyatkin
On 4-chromatic edge-critical regular graphs of high connectivity. Discret. Math. 260 (1-3) (2003)
Artem V. Pyatkin
The incidentor coloring of multigraphs and its applications. Discret. Appl. Math. 120 (1-3) (2002)
Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger
Radio Labeling with Pre-assigned Frequencies. ESA (2002)
Leonid S. Melnikov, Artem V. Pyatkin
Regular integral sum graphs. Discret. Math. 252 (1-3) (2002)
Artem V. Pyatkin
6-regular 4-critical graph. J. Graph Theory 41 (4) (2002)
Artem V. Pyatkin
A Graph with cover degeneracy less than chromatic number. J. Graph Theory 37 (4) (2001)
Artem V. Pyatkin
New formula for the sum number for the complete bipartite graphs. Discret. Math. 239 (1-3) (2001)
Artem V. Pyatkin
The incidentor coloring of multigraphs and its application in data networks. Electron. Notes Discret. Math. 3 (1999)
Artem V. Pyatkin
Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most 3. Discret. Math. 185 (1-3) (1998)