| 2008 |
| 18 | EE | 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) |
| 17 | EE | 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) |
| 16 | EE | Artem V. Pyatkin:
Subdivided trees are integral sum graphs.
Discrete Mathematics 308(9): 1749-1750 (2008) |
| 15 | | Sergey Kitaev,
Artem V. Pyatkin:
On Representable Graphs.
Journal of Automata, Languages and Combinatorics 13(1): 45-54 (2008) |
| 2007 |
| 14 | EE | Alexander A. Ageev,
Artem V. Pyatkin:
A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem.
WAOA 2007: 103-115 |
| 2006 |
| 13 | EE | Fedor V. Fomin,
Serge Gaspers,
Artem V. Pyatkin:
Finding a Minimum Feedback Vertex Set in Time O (1.7548n).
IWPEC 2006: 184-191 |
| 12 | EE | Vadym G. Vizing,
Artem V. Pyatkin:
Incidentor coloring of weighted multigraphs.
Electronic Notes in Discrete Mathematics 27: 103-104 (2006) |
| 2005 |
| 11 | EE | 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 |
| 10 | EE | 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) |
| 2004 |
| 9 | EE | 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) |
| 8 | EE | Artem V. Pyatkin:
Interval coloring of (3, 4)-biregular bipartite graphs having large cubic subgraphs.
Journal of Graph Theory 47(2): 122-128 (2004) |
| 2003 |
| 7 | EE | 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 |
| 6 | EE | Hans L. Bodlaender,
Hajo Broersma,
Fedor V. Fomin,
Artem V. Pyatkin,
Gerhard J. Woeginger:
Radio Labeling with Pre-assigned Frequencies.
ESA 2002: 211-222 |
| 5 | | Artem V. Pyatkin:
The incidentor coloring of multigraphs and its applications.
Discrete Applied Mathematics 120(1-3): 209-217 (2002) |
| 4 | EE | Leonid S. Melnikov,
Artem V. Pyatkin:
Regular integral sum graphs.
Discrete Mathematics 252(1-3): 237-245 (2002) |
| 2001 |
| 3 | EE | Artem V. Pyatkin:
New formula for the sum number for the complete bipartite graphs.
Discrete Mathematics 239(1-3): 155-160 (2001) |
| 1999 |
| 2 | EE | Artem V. Pyatkin:
The incidentor coloring of multigraphs and its application in data networks.
Electronic Notes in Discrete Mathematics 3: 162-165 (1999) |
| 1998 |
| 1 | EE | Artem V. Pyatkin:
Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most 3.
Discrete Mathematics 185(1-3): 275-278 (1998) |