Artem V. Pyatkin

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