default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArtem V. Pyatkin
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j40]Sumin Huang
, Sergey Kitaev, Artem V. Pyatkin:
An embedding technique in the study of word-representability of graphs. Discret. Appl. Math. 346: 170-182 (2024)- [j39]Mikhail Futorny, Sergey Kitaev, Artem V. Pyatkin:
New Tools to Study 1-11-Representation of Graphs. Graphs Comb. 40(5): 97 (2024) - [j38]Sergey Kitaev, Artem V. Pyatkin:
On semi-transitive orientability of split graphs. Inf. Process. Lett. 184: 106435 (2024) - 2023
- [j37]Sergey Kitaev, Artem V. Pyatkin:
On Permutations Avoiding Partially Ordered Patterns Defined by Bipartite Graphs. Electron. J. Comb. 30(1) (2023) - [j36]Sergey Kitaev, Artem V. Pyatkin:
On semi-transitive orientability of triangle-free graphs. Discuss. Math. Graph Theory 43(2): 533-547 (2023) - 2022
- [j35]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-9): 965-977 (2022) - 2021
- [j34]Ilya Chernykh, Artem V. Pyatkin:
Irreducible bin packing and normality in routing open shop. Ann. Math. Artif. Intell. 89(8-9): 899-918 (2021) - 2020
- [j33]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): 157-168 (2020) - [j32]Alexander V. Kononov, Alexander S. Strekalovsky, Mikhail Posypkin, Artem V. Pyatkin:
Preface. J. Glob. Optim. 76(3): 453-454 (2020) - [c17]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: 40-45
2010 – 2019
- 2019
- [j31]Artem V. Pyatkin, Eugene Lykhovyd, Sergiy Butenko:
The maximum number of induced open triangles in graphs of a given order. Optim. Lett. 13(8): 1927-1935 (2019) - [c16]Ilya Chernykh, Artem V. Pyatkin:
Irreducible Bin Packing: Complexity, Solvability and Application to the Routing Open Shop. LION 2019: 106-120 - [c15]Mikhail Golovachev, Artem V. Pyatkin:
Routing Open Shop with Two Nodes, Unit Processing Times and Equal Number of Jobs and Machines. MOTOR 2019: 264-276 - [c14]Anton V. Eremeev, Alexander V. Kel'manov, Mikhail Y. Kovalyov, Artem V. Pyatkin:
Maximum Diversity Problem with Squared Euclidean Distance. MOTOR 2019: 541-551 - 2018
- [j30]Marc Glen, Sergey Kitaev, Artem V. Pyatkin:
On the representation number of a crown graph. Discret. Appl. Math. 244: 89-93 (2018) - [c13]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: 326-336 - 2017
- [j29]Artem V. Pyatkin, Daniel Aloise, Nenad Mladenovic:
NP-Hardness of balanced minimum sum-of-squares clustering. Pattern Recognit. Lett. 97: 44-45 (2017) - [c12]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: 142-151 - [i2]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 abs/1707.06068 (2017) - 2016
- [j28]Magnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin:
Semi-transitive orientations and word-representable graphs. Discret. Appl. Math. 201: 164-171 (2016) - [c11]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: 51-57 - [c10]Adil I. Erzin, Artem V. Pyatkin:
Convergecast scheduling problem in case of given aggregation tree: The complexity status and some special cases. CSNDSP 2016: 1-6 - [c9]René van Bevern, Artem V. Pyatkin:
Completing Partial Schedules for Open Shop with Unit Processing Times and Routing. CSR 2016: 73-87 - [c8]Anton V. Eremeev, Alexander Kelmanov, Artem V. Pyatkin:
On a Quadratic Euclidean Problem of Vector Subset Choice: Complexity and Algorithmic Approach. DOOR (Supplement) 2016: 526-535 - [i1]René van Bevern, Artem V. Pyatkin:
Completing partial schedules for Open Shop with unit processing times and routing. CoRR abs/1603.01191 (2016) - 2015
- [j27]Miles Eli Jones, Sergey Kitaev, Artem V. Pyatkin, Jeffrey B. Remmel:
Representing Graphs via Pattern Avoiding Words. Electron. J. Comb. 22(2): 2 (2015) - 2014
- [j26]Hajo Broersma, Viresh Patel, Artem V. Pyatkin:
On Toughness and Hamiltonicity of 2K2-Free Graphs. J. Graph Theory 75(3): 244-255 (2014) - 2013
- [j25]Artem V. Pyatkin:
Triangle-free 2P3-free graphs are 4-colorable. Discret. Math. 313(5): 715-720 (2013) - [j24]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): 645-667 (2013) - 2012
- [j23]Alexei Vernitski, Artem V. Pyatkin:
Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions. J. Discrete Algorithms 12: 24-28 (2012) - [j22]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: 136-149 (2012) - 2011
- [j21]Sergey V. Avgustinovich, Sergey Kitaev, Artem V. Pyatkin, Alexandr Valyuzhenich:
On Square-Free Permutations. J. Autom. Lang. Comb. 16(1): 3-10 (2011) - [c7]Magnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin:
Alternation Graphs. WG 2011: 191-202 - 2010
- [j20]Sergey Kitaev, Artem V. Pyatkin:
On avoidance of V- and ^-patterns in permutations. Ars Comb. 97 (2010) - [c6]Magnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin:
Graphs Capturing Alternations in Words. Developments in Language Theory 2010: 436-437 - [c5]Paul S. Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin:
The Complexity Status of Problems Related to Sparsest Cuts. IWOCA 2010: 125-135
2000 – 2009
- 2008
- [j19]Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin, Igor Razgon:
On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms. Algorithmica 52(2): 293-307 (2008) - [j18]Artem V. Pyatkin:
Subdivided trees are integral sum graphs. Discret. Math. 308(9): 1749-1750 (2008) - [j17]Sergey Kitaev, Artem V. Pyatkin:
On Representable Graphs. J. Autom. Lang. Comb. 13(1): 45-54 (2008) - [j16]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): 9:1-9:17 (2008) - 2007
- [j15]Andrey A. Dobrynin, Leonid S. Melnikov, Artem V. Pyatkin:
Erdõs regular graphs of even degree. Discuss. Math. Graph Theory 27(2): 269-279 (2007) - [c4]Alexander A. Ageev, Artem V. Pyatkin:
A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem. WAOA 2007: 103-115 - 2006
- [j14]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: 29-31 (2006) - [j13]Vadym G. Vizing, Artem V. Pyatkin:
Incidentor coloring of weighted multigraphs. Electron. Notes Discret. Math. 27: 103-104 (2006) - [c3]Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin:
Finding a Minimum Feedback Vertex Set in Time O (1.7548n). IWPEC 2006: 184-191 - 2005
- [j12]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: 157-162 (2005) - [c2]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: 573-582 - 2004
- [j11]Andrey A. Dobrynin, Leonid S. Melnikov, Artem V. Pyatkin:
Regular 4-critical graphs of even degree. J. Graph Theory 46(2): 103-130 (2004) - [j10]Artem V. Pyatkin:
Interval coloring of (3, 4)-biregular bipartite graphs having large cubic subgraphs. J. Graph Theory 47(2): 122-128 (2004) - [j9]Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger:
Radio Labeling with Preassigned Frequencies. SIAM J. Optim. 15(1): 1-16 (2004) - 2003
- [j8]Andrey A. Dobrynin, Leonid S. Melnikov, Artem V. Pyatkin:
On 4-chromatic edge-critical regular graphs of high connectivity. Discret. Math. 260(1-3): 315-319 (2003) - 2002
- [j7]Artem V. Pyatkin:
The incidentor coloring of multigraphs and its applications. Discret. Appl. Math. 120(1-3): 209-217 (2002) - [j6]Leonid S. Melnikov, Artem V. Pyatkin:
Regular integral sum graphs. Discret. Math. 252(1-3): 237-245 (2002) - [j5]Artem V. Pyatkin:
6-regular 4-critical graph. J. Graph Theory 41(4): 286-291 (2002) - [c1]Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger:
Radio Labeling with Pre-assigned Frequencies. ESA 2002: 211-222 - 2001
- [j4]Artem V. Pyatkin:
New formula for the sum number for the complete bipartite graphs. Discret. Math. 239(1-3): 155-160 (2001) - [j3]Artem V. Pyatkin:
A Graph with cover degeneracy less than chromatic number. J. Graph Theory 37(4): 243-246 (2001)
1990 – 1999
- 1999
- [j2]Artem V. Pyatkin:
The incidentor coloring of multigraphs and its application in data networks. Electron. Notes Discret. Math. 3: 162-165 (1999) - 1998
- [j1]Artem V. Pyatkin:
Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most 3. Discret. Math. 185(1-3): 275-278 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
