The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Arash Rafiey: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gregory Gutin, Arash Rafiey, Anders Yeo, Michael Tso
    Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs. [Citation Graph (0, 0)][DBLP]
    AAIM, 2005, pp:427-439 [Conf]
  2. Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo
    The Linear Arrangement Problem Parameterized Above Guaranteed Value. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:356-367 [Conf]
  3. M. Karimi Behbahani, Arash Rafiey, Mehrdad Shahshahani
    On Skeletons Attached to Grey Scale Images. [Citation Graph (0, 0)][DBLP]
    ICMLA, 2002, pp:282-288 [Conf]
  4. Changiz Eslagchi, Arash Rafiey
    Circular Chromatic Number of Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:73, n:, pp:- [Journal]
  5. Gregory Gutin, N. Jones, Arash Rafiey, Simone Severini, Anders Yeo
    Mediated digraphs and quantum nonlocality. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:150, n:1-3, pp:41-50 [Journal]
  6. Gregory Gutin, Arash Rafiey, Anders Yeo
    Minimum cost and list homomorphisms to semicomplete digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:6, pp:890-897 [Journal]
  7. Gregory Gutin, Arash Rafiey, Anders Yeo, Michael Tso
    Level of repair analysis and minimum cost homomorphisms of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:6, pp:881-889 [Journal]
  8. Gregory Gutin, Arash Rafiey
    When n-cycles in n-partite tournaments are longest cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:289, n:1-3, pp:163-168 [Journal]
  9. Gregory Gutin, Arash Rafiey, Simone Severini, Anders Yeo
    Hamilton cycles in digraphs of unitary matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:24, pp:3315-3320 [Journal]
  10. Gregory Gutin, Arash Rafiey, Anders Yeo
    On n-partite Tournaments with Unique n-cycle. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2006, v:22, n:2, pp:241-249 [Journal]
  11. Jinfeng Feng, Hans-Erik Giesen, Yubao Guo, Gregory Gutin, Tommy R. Jensen, Arash Rafiey
    Characterization of edge-colored complete graphs with properly colored Hamilton paths. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:53, n:4, pp:333-346 [Journal]
  12. Gregory Gutin, Pavol Hell, Arash Rafiey, Anders Yeo
    Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  13. Gregory Gutin, Arash Rafiey, Anders Yeo
    Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  14. Arvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey
    Minimum Cost Homomorphisms to Reflexive Digraphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  15. Minimum Cost Homomorphism Dichotomy for Oriented Cycles. [Citation Graph (, )][DBLP]


  16. Structure-Approximating Design of Stable Proteins in 2D HP Model Fortified by Cysteine Monomers. [Citation Graph (, )][DBLP]


  17. Design of Artificial Tubular Protein Structures in 3D Hexagonal Prism Lattice Under HP Model. [Citation Graph (, )][DBLP]


  18. Inverse protein folding in 3D hexagonal prism lattice under HP model. [Citation Graph (, )][DBLP]


  19. Minimum Cost Homomorphisms to Reflexive Digraphs. [Citation Graph (, )][DBLP]


  20. Mining Cohesive Patterns from Graphs with Feature Vectors. [Citation Graph (, )][DBLP]


  21. A Robust Class of Stable Proteins in the 2D HPC Model. [Citation Graph (, )][DBLP]


  22. Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs. [Citation Graph (, )][DBLP]


  23. C-Perfect K-Uniform Hypergraphs. [Citation Graph (, )][DBLP]


  24. Minimum Cost and List Homomorphisms to Semicomplete Digraphs [Citation Graph (, )][DBLP]


  25. Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs [Citation Graph (, )][DBLP]


  26. The Linear Arrangement Problem Parameterized Above Guaranteed Value [Citation Graph (, )][DBLP]


  27. Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs [Citation Graph (, )][DBLP]


  28. Duality for Min-Max Orderings and Dichotomy for Min Cost Homomorphisms [Citation Graph (, )][DBLP]


  29. The Dichotomy of List Homomorphisms for Digraphs [Citation Graph (, )][DBLP]


  30. Minimum cost homomorphisms to semicomplete multipartite digraphs. [Citation Graph (, )][DBLP]


  31. A dichotomy for minimum cost graph homomorphisms. [Citation Graph (, )][DBLP]


Search in 0.002secs, 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