Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarArtem V. Pyatkin
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – today
- 2019
[c14]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- [c13]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
- [j29]Marc Glen, Sergey Kitaev, Artem V. Pyatkin:
On the representation number of a crown graph. Discrete Applied Mathematics 244: 89-93 (2018) - [c12]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
- [c11]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. Discrete Applied Mathematics 201: 164-171 (2016) - [c10]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 - [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. Electr. J. Comb. 22(2): P2.53 (2015) - 2014
- [j26]Hajo Broersma, Viresh Patel, Artem V. Pyatkin:
On Toughness and Hamiltonicity of 2K2-Free Graphs. Journal of Graph Theory 75(3): 244-255 (2014) - 2013
- [j25]Artem V. Pyatkin:
Triangle-free 2P3-free graphs are 4-colorable. Discrete Mathematics 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. Journal of Automata, Languages and Combinatorics 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. Discrete Mathematics 308(9): 1749-1750 (2008) - [j17]Sergey Kitaev, Artem V. Pyatkin:
On Representable Graphs. Journal of Automata, Languages and Combinatorics 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. Discussiones Mathematicae 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. Electronic Notes in Discrete Mathematics 27: 29-31 (2006) - [j13]Vadym G. Vizing, Artem V. Pyatkin:
Incidentor coloring of weighted multigraphs. Electronic Notes in Discrete Mathematics 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. Electronic Notes in Discrete Mathematics 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. Journal of Graph Theory 46(2): 103-130 (2004) - [j10]Artem V. Pyatkin:
Interval coloring of (3, 4)-biregular bipartite graphs having large cubic subgraphs. Journal of 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 Journal on Optimization 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. Discrete Mathematics 260(1-3): 315-319 (2003) - 2002
- [j7]Artem V. Pyatkin:
The incidentor coloring of multigraphs and its applications. Discrete Applied Mathematics 120(1-3): 209-217 (2002) - [j6]Leonid S. Melnikov, Artem V. Pyatkin:
Regular integral sum graphs. Discrete Mathematics 252(1-3): 237-245 (2002) - [j5]Artem V. Pyatkin:
6-regular 4-critical graph. Journal of 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. Discrete Mathematics 239(1-3): 155-160 (2001) - [j3]Artem V. Pyatkin:
A Graph with cover degeneracy less than chromatic number. Journal of 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. Electronic Notes in Discrete Mathematics 3: 162-165 (1999) - 1998
- [j1]Artem V. Pyatkin:
Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most 3. Discrete Mathematics 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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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 and opencitations.net 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 Crossref privacy policy and the OpenCitations privacy policy.
Citation data
Add a list of citing articles from 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 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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter accout. At the same time, Twitter will persitently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2019-10-02 04:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
