Artem V. Pyatkin

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

New Tools to Study 1-11-Representation of Graphs.

Mikhail Futorny, Sergey Kitaev, Artem V. Pyatkin

Graphs Comb., October, 2024

On semi-transitive orientability of split graphs.

Sergey Kitaev, Artem V. Pyatkin

Inf. Process. Lett., February, 2024

An embedding technique in the study of word-representability of graphs.

Sumin Huang, Sergey Kitaev, Artem V. Pyatkin

Discret. Appl. Math., 2024

2023

On semi-transitive orientability of triangle-free graphs.

Sergey Kitaev, Artem V. Pyatkin

Discuss. Math. Graph Theory, 2023

On Permutations Avoiding Partially Ordered Patterns Defined by Bipartite Graphs.

Sergey Kitaev, Artem V. Pyatkin

Electron. J. Comb., 2023

2022

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

2021

Irreducible bin packing and normality in routing open shop.

Ilya Chernykh, Artem V. Pyatkin

Ann. Math. Artif. Intell., 2021

2020

Preface.

Alexander V. Kononov, Alexander S. Strekalovsky, Mikhail Posypkin, Artem V. Pyatkin

J. Glob. Optim., 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

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

Proceedings of the Learning and Intelligent Optimization - 14th International Conference, 2020

2019

The maximum number of induced open triangles in graphs of a given order.

Artem V. Pyatkin, Eugene Lykhovyd, Sergiy Butenko

Optim. Lett., 2019

Routing Open Shop with Two Nodes, Unit Processing Times and Equal Number of Jobs and Machines.

Mikhail Golovachev, Artem V. Pyatkin

Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

Maximum Diversity Problem with Squared Euclidean Distance.

Anton V. Eremeev, Alexander V. Kel'manov, Mikhail Y. Kovalyov, Artem V. Pyatkin

Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

Irreducible Bin Packing: Complexity, Solvability and Application to the Routing Open Shop.

Ilya Chernykh, Artem V. Pyatkin

Proceedings of the Learning and Intelligent Optimization - 13th International Conference, 2019

2018

On the representation number of a crown graph.

Marc Glen, Sergey Kitaev, Artem V. Pyatkin

Discret. Appl. Math., 2018

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

Proceedings of the Learning and Intelligent Optimization - 12th International Conference, 2018

2017

NP-Hardness of balanced minimum sum-of-squares clustering.

Artem V. Pyatkin, Daniel Aloise, Nenad Mladenovic

Pattern Recognit. Lett., 2017

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

Proceedings of the Analysis of Images, Social Networks and Texts, 2017

2016

Semi-transitive orientations and word-representable graphs.

Magnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin

Discret. Appl. Math., 2016

On a Quadratic Euclidean Problem of Vector Subset Choice: Complexity and Algorithmic Approach.

Anton V. Eremeev, Alexander Kelmanov, Artem V. Pyatkin

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.

René van Bevern, Artem V. Pyatkin

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.

Adil I. Erzin, Artem V. Pyatkin

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.

Anton V. Eremeev, Alexander V. Kel'manov, Artem V. Pyatkin

Proceedings of the Analysis of Images, Social Networks and Texts, 2016

2015

Representing Graphs via Pattern Avoiding Words.

Miles Eli Jones, Sergey Kitaev, Artem V. Pyatkin, Jeffrey B. Remmel

Electron. J. Comb., 2015

2014

On Toughness and Hamiltonicity of 2<i>K</i>₂-Free Graphs.

Hajo Broersma, Viresh Patel, Artem V. Pyatkin

J. Graph Theory, 2014

2013

Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds.

Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Artem V. Pyatkin

Theory Comput. Syst., 2013

Triangle-free 2<i>P</i>₃-free graphs are 4-colorable.

Artem V. Pyatkin

Discret. Math., 2013

2012

Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions.

Alexei Vernitski, Artem V. Pyatkin

J. Discrete Algorithms, 2012

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

2011

On Square-Free Permutations.

Sergey V. Avgustinovich, Sergey Kitaev, Artem V. Pyatkin, Alexandr Valyuzhenich

J. Autom. Lang. Comb., 2011

Alternation Graphs.

Magnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin

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

2010

On avoidance of V- and ^-patterns in permutations.

Sergey Kitaev, Artem V. Pyatkin

Ars Comb., 2010

The Complexity Status of Problems Related to Sparsest Cuts.

Paul S. Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Graphs Capturing Alternations in Words.

Magnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin

Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2008

Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications.

Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov

ACM Trans. Algorithms, 2008

On Representable Graphs.

Sergey Kitaev, Artem V. Pyatkin

J. Autom. Lang. Comb., 2008

Subdivided trees are integral sum graphs.

Artem V. Pyatkin

Discret. Math., 2008

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

Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin, Igor Razgon

Algorithmica, 2008

2007

Erdõs regular graphs of even degree.

Andrey A. Dobrynin, Leonid S. Melnikov, Artem V. Pyatkin

Discuss. Math. Graph Theory, 2007

A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem.

Alexander A. Ageev, Artem V. Pyatkin

Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

2006

Incidentor coloring of weighted multigraphs.

Vadym G. Vizing, Artem V. Pyatkin

Electron. Notes Discret. Math., 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

Finding a Minimum Feedback Vertex Set in Time <i>O</i> (1.7548^<i>n</i>).

Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin

Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

2005

On maximum number of minimal dominating sets in graphs.

Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov

Electron. Notes Discret. Math., 2005

Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach.

Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

Radio Labeling with Preassigned Frequencies.

Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger

SIAM J. Optim., 2004

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

Artem V. Pyatkin

J. Graph Theory, 2004

Regular 4-critical graphs of even degree.

Andrey A. Dobrynin, Leonid S. Melnikov, Artem V. Pyatkin

J. Graph Theory, 2004

2003

On 4-chromatic edge-critical regular graphs of high connectivity.

Andrey A. Dobrynin, Leonid S. Melnikov, Artem V. Pyatkin

Discret. Math., 2003

2002

6-regular 4-critical graph.

Artem V. Pyatkin

J. Graph Theory, 2002

Regular integral sum graphs.

Leonid S. Melnikov, Artem V. Pyatkin

Discret. Math., 2002

The incidentor coloring of multigraphs and its applications.

Artem V. Pyatkin

Discret. Appl. Math., 2002

Radio Labeling with Pre-assigned Frequencies.

Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger

Proceedings of the Algorithms, 2002

2001

A Graph with cover degeneracy less than chromatic number.

Artem V. Pyatkin

J. Graph Theory, 2001

New formula for the sum number for the complete bipartite graphs.

Artem V. Pyatkin

Discret. Math., 2001

1999

The incidentor coloring of multigraphs and its application in data networks.

Artem V. Pyatkin

Electron. Notes Discret. Math., 1999

1998

Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most 3.

Artem V. Pyatkin

Discret. Math., 1998