Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Artem V. Pyatkin
2010 – today
- 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 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]
- 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 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 Transactions on Algorithms 5(1) (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, Nikolai 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]
- [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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-17 21:47 CEST by the dblp team