The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Artem V. Pyatkin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger
    Radio Labeling with Pre-assigned Frequencies. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:211-222 [Conf]
  2. Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov
    Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:573-582 [Conf]
  3. Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin
    Finding a Minimum Feedback Vertex Set in Time O (1.7548n). [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:184-191 [Conf]
  4. Artem V. Pyatkin
    The incidentor coloring of multigraphs and its applications. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:209-217 [Journal]
  5. Andrey A. Dobrynin, Leonid S. Melnikov, Artem V. Pyatkin
    On 4-chromatic edge-critical regular graphs of high connectivity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:260, n:1-3, pp:315-319 [Journal]
  6. Leonid S. Melnikov, Artem V. Pyatkin
    Regular integral sum graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:252, n:1-3, pp:237-245 [Journal]
  7. Artem V. Pyatkin
    New formula for the sum number for the complete bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:239, n:1-3, pp:155-160 [Journal]
  8. Artem V. Pyatkin
    Interval coloring of (3, 4)-biregular bipartite graphs having large cubic subgraphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:47, n:2, pp:122-128 [Journal]
  9. Andrey A. Dobrynin, Leonid S. Melnikov, Artem V. Pyatkin
    Regular 4-critical graphs of even degree. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:46, n:2, pp:103-130 [Journal]
  10. Artem V. Pyatkin
    Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most 3. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:185, n:1-3, pp:275-278 [Journal]

  11. Graphs Capturing Alternations in Words. [Citation Graph (, )][DBLP]


  12. A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem. [Citation Graph (, )][DBLP]


  13. On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms. [Citation Graph (, )][DBLP]


  14. Subdivided trees are integral sum graphs. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002