default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArash Rafiey
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j31]Jan Bok
, Richard C. Brewster, Pavol Hell, Nikola Jedlicková, Arash Rafiey:
Min Orderings and List Homomorphism Dichotomies for Graphs and Signed Graphs. Algorithmica 86(7): 2289-2316 (2024)- [c27]Pavol Hell, Akbar Rafiey, Arash Rafiey:
Bi-arc Digraphs: Recognition Algorithm and Applications. LATIN (2) 2024: 31-45 - 2023
- [c26]Jeff Kinne, Akbar Rafiey, Arash Rafiey, Mohammad Sorkhpar:
Vertex Ordering with Precedence Constraints. FCT 2023: 304-317 - 2022
- [j30]Arash Rafiey:
Recognizing interval bigraphs by forbidden patterns. J. Graph Theory 100(3): 504-529 (2022) - [c25]Jan Bok, Richard C. Brewster, Pavol Hell, Nikola Jedlicková, Arash Rafiey:
Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs. LATIN 2022: 510-526 - [i25]Jan Bok, Richard C. Brewster, Pavol Hell, Nikola Jedlicková, Arash Rafiey:
Min orderings and list homomorphism dichotomies for signed and unsigned graphs. CoRR abs/2206.01068 (2022) - 2020
- [j29]Pavol Hell, Jing Huang, Ross M. McConnell, Arash Rafiey:
Min-Orderable Digraphs. SIAM J. Discret. Math. 34(3): 1710-1724 (2020) - [i24]Jeff Kinne, Ashwin Murali, Arash Rafiey:
Digraphs Homomorphism Problems with Maltsev Condition. CoRR abs/2008.09921 (2020) - [i23]Arash Rafiey:
A note on weak near unanimity polymorphisms. CoRR abs/2009.13090 (2020)
2010 – 2019
- 2019
- [c24]Akbar Rafiey, Arash Rafiey, Thiago Santos:
Toward a Dichotomy for Approximation of H-Coloring. ICALP 2019: 91:1-91:16 - [i22]Akbar Rafiey, Arash Rafiey, Thiago Santos:
Toward a Dichotomy for Approximation of $H$-coloring. CoRR abs/1902.02201 (2019) - 2018
- [c23]Pavol Hell, Jing Huang, Ross M. McConnell, Arash Rafiey:
Interval-Like Graphs and Digraphs. MFCS 2018: 68:1-68:13 - [i21]Pavol Hell, Jing Huang, Ross M. McConnell, Arash Rafiey:
Interval-Like Graphs and Digraphs. CoRR abs/1804.05258 (2018) - 2017
- [i20]Arash Rafiey, Jeff Kinne, Tomás Feder:
Dichotomy for Digraph Homomorphism Problems. CoRR abs/1701.02409 (2017) - 2016
- [j28]Bojan Mohar, Arash Rafiey, Behruz Tayfeh-Rezaie, Hehui Wu:
Interval Minors of Complete Bipartite Graphs. J. Graph Theory 82(3): 312-321 (2016) - [j27]David Doty, Ho-Lin Chen, Ján Manuch, Arash Rafiey, Ladislav Stacho:
Pattern overlap implies runaway growth in hierarchical tile systems. J. Comput. Geom. 7(2): 3-18 (2016) - [i19]Pavol Hell, Arash Rafiey:
Bi-Arc Digraphs and Conservative Polymorphisms. CoRR abs/1608.03368 (2016) - [i18]Kamyar Khodamoradi, Ramesh Krishnamurti, Arash Rafiey, Georgios Stamoulis:
PTAS for Ordered Instances of Resource Allocation Problems with Restrictions on Inclusions. CoRR abs/1610.00082 (2016) - 2015
- [c22]Binay K. Bhattacharya, Ante Custic, Akbar Rafiey, Arash Rafiey, Vladyslav Sokol:
Approximation Algorithms for Generalized MST and TSP in Grid Clusters. COCOA 2015: 110-125 - [c21]Ho-Lin Chen, David Doty, Ján Manuch, Arash Rafiey, Ladislav Stacho:
Pattern Overlap Implies Runaway Growth in Hierarchical Tile Systems. SoCG 2015: 360-373 - [c20]Arash Rafiey, Vladyslav Sokol, Ramesh Krishnamurti, Snezana Mitrovic-Minic, Abraham P. Punnen, Krishna Teja Malladi:
A Network Model for the Hospital Routing Problem. ICORES 2015: 353-358 - [c19]Víctor Dalmau, László Egri, Pavol Hell, Benoît Larose, Arash Rafiey:
Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy. LICS 2015: 487-498 - [i17]Binay K. Bhattacharya, Ante Custic, Akbar Rafiey, Arash Rafiey, Vladyslav Sokol:
Approximation Algorithms for Generalized MST and TSP in Grid Clusters. CoRR abs/1507.04438 (2015) - [i16]Jeff Kinne, Ján Manuch, Akbar Rafiey, Arash Rafiey:
Ordering with precedence constraints and budget minimization. CoRR abs/1507.04885 (2015) - 2014
- [j26]Rémy Belmonte, Pinar Heggernes, Pim van 't Hof, Arash Rafiey, Reza Saei:
Graph classes and Ramsey numbers. Discret. Appl. Math. 173: 16-27 (2014) - [j25]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey:
Finding clubs in graph classes. Discret. Appl. Math. 174: 57-65 (2014) - [c18]Pavol Hell, Bojan Mohar, Arash Rafiey:
Ordering without Forbidden Patterns. ESA 2014: 554-565 - [c17]László Egri, Pavol Hell, Benoît Larose, Arash Rafiey:
Space complexity of list H-colouring: a dichotomy. SODA 2014: 349-365 - [i15]Ján Manuch, Arash Rafiey:
Finding minimum Tucker submatrices. CoRR abs/1401.4739 (2014) - [i14]Bojan Mohar, Arash Rafiey, Behruz Tayfeh-Rezaie, Hehui Wu:
Interval minors of complete bipartite graphs. CoRR abs/1408.1155 (2014) - [i13]Pavol Hell, Bojan Mohar, Arash Rafiey:
Ordering without forbidden patterns. CoRR abs/1408.1461 (2014) - [i12]Ho-Lin Chen, David Doty, Ján Manuch, Arash Rafiey, Ladislav Stacho:
Pattern overlap implies runaway growth in hierarchical tile systems. CoRR abs/1411.6672 (2014) - 2013
- [j24]Monaldo Mastrolilli, Arash Rafiey:
On the approximation of minimum cost homomorphism to bipartite graphs. Discret. Appl. Math. 161(4-5): 670-676 (2013) - [j23]Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo:
Corrigendum. The Linear Arrangement Problem Parameterized Above Guaranteed Value. Theory Comput. Syst. 53(4): 690-691 (2013) - [c16]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey:
Cliques and Clubs. CIAC 2013: 276-287 - [c15]Kamyar Khodamoradi, Ramesh Krishnamurti, Arash Rafiey, Georgios Stamoulis:
PTAS for Ordered Instances of Resource Allocation Problems. FSTTCS 2013: 461-473 - [i11]László Egri, Pavol Hell, Benoît Larose, Arash Rafiey:
Space complexity of list H-colouring: a dichotomy. CoRR abs/1308.0180 (2013) - 2012
- [j22]Tomás Feder, Pavol Hell, Jing Huang, Arash Rafiey:
Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms. Discret. Appl. Math. 160(6): 697-707 (2012) - [j21]Pavol Hell, Arash Rafiey:
Monotone Proper Interval Digraphs and Min-Max Orderings. SIAM J. Discret. Math. 26(4): 1576-1596 (2012) - [j20]Pavol Hell, Arash Rafiey:
The Dichotomy of Minimum Cost Homomorphism Problems for Digraphs. SIAM J. Discret. Math. 26(4): 1597-1608 (2012) - [c14]Pavol Hell, Monaldo Mastrolilli, Mayssam Mohammadi Nevisi, Arash Rafiey:
Approximation of Minimum Cost Homomorphisms. ESA 2012: 587-598 - [i10]Arash Rafiey:
Recognizing Interval Bigraphs by Forbidden Patterns. CoRR abs/1211.2662 (2012) - 2011
- [c13]Pavol Hell, Arash Rafiey:
The Dichotomy of List Homomorphisms for Digraphs. SODA 2011: 1703-1713 - 2010
- [j19]Arvind Gupta, Gregory Z. Gutin, Mehdi Karimi, Eun Jung Kim, Arash Rafiey:
Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs. Australas. J Comb. 46: 217-232 (2010) - [c12]Chris Thachuk, Ján Manuch, Arash Rafiey, Leigh-Anne Mathieson, Ladislav Stacho, Anne Condon:
An Algorithm for the Energy Barrier Problem Without Pseudoknots and Temporary Arcs. Pacific Symposium on Biocomputing 2010: 108-119 - [i9]Pavol Hell, Arash Rafiey:
The Dichotomy of List Homomorphisms for Digraphs. CoRR abs/1004.2908 (2010)
2000 – 2009
- 2009
- [j18]Tomás Feder, Pavol Hell, Jing Huang, Arash Rafiey:
Adjusted Interval Digraphs. Electron. Notes Discret. Math. 32: 83-91 (2009) - [j17]Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
Minimum Cost Homomorphism Dichotomy for Oriented Cycles. Graphs Comb. 25(4): 521-531 (2009) - [j16]Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta:
Stable Structure-Approximating Inverse Protein Folding in 2D Hydrophobic-Polar-Cysteine (HPC) Model. J. Comput. Biol. 16(1): 19-30 (2009) - [j15]Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta:
Inverse Protein Folding in 3D Hexagonal Prism Lattice under HPC Model. J. Comput. Biol. 16(6): 769-802 (2009) - [c11]Flavia Moser, Recep Colak, Arash Rafiey, Martin Ester:
Mining Cohesive Patterns from Graphs with Feature Vectors. SDM 2009: 593-604 - [i8]Arash Rafiey, Pavol Hell:
Duality for Min-Max Orderings and Dichotomy for Min Cost Homomorphisms. CoRR abs/0907.3016 (2009) - 2008
- [j14]Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
Minimum cost homomorphisms to semicomplete multipartite digraphs. Discret. Appl. Math. 156(12): 2429-2435 (2008) - [j13]Gregory Z. Gutin, Pavol Hell, Arash Rafiey, Anders Yeo:
A dichotomy for minimum cost graph homomorphisms. Eur. J. Comb. 29(4): 900-911 (2008) - [j12]Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs. SIAM J. Discret. Math. 22(4): 1624-1639 (2008) - [c10]Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
Minimum Cost Homomorphism Dichotomy for Oriented Cycles. AAIM 2008: 224-234 - [c9]Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta:
Structure-Approximating Design of Stable Proteins in 2D HP Model Fortified by Cysteine Monomers. APBC 2008: 49-58 - [c8]Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta:
Inverse protein folding in 3D hexagonal prism lattice under HP model. BIOCOMP 2008: 619-625 - [c7]Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta:
A Robust Class of Stable Proteins in the 2D HPC Model. BIRD 2008: 180-192 - [c6]Arvind Gupta, Mehdi Karimi, Eun Jung Kim, Arash Rafiey:
Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs. COCOA 2008: 374-383 - [c5]Arvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey:
Minimum Cost Homomorphisms to Reflexive Digraphs. LATIN 2008: 182-193 - 2007
- [j11]Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo:
The Linear Arrangement Problem Parameterized Above Guaranteed Value. Theory Comput. Syst. 41(3): 521-538 (2007) - [c4]Arvind Gupta, Mehdi Karimi, Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey:
Design of Artificial Tubular Protein Structures in 3D Hexagonal Prism Lattice Under HP Model. BIOCOMP 2007: 362-369 - [i7]Arvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey:
Minimum Cost Homomorphisms to Reflexive Digraphs. CoRR abs/0708.2514 (2007) - [i6]Arvind Gupta, Gregory Z. Gutin, Mehdi Karimi, Eun Jung Kim, Arash Rafiey:
Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs. CoRR abs/0712.0804 (2007) - 2006
- [j10]Gregory Z. Gutin, Arash Rafiey:
Multipartite tournaments with small number of cycles. Australas. J Comb. 34: 17-22 (2006) - [j9]Changiz Eslahchi, Arash Rafiey:
C-Perfect K-Uniform Hypergraphs. Ars Comb. 79 (2006) - [j8]Gregory Z. Gutin, Arash Rafiey, Anders Yeo, Michael Tso:
Level of repair analysis and minimum cost homomorphisms of graphs. Discret. Appl. Math. 154(6): 881-889 (2006) - [j7]Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
Minimum cost and list homomorphisms to semicomplete digraphs. Discret. Appl. Math. 154(6): 890-897 (2006) - [j6]Gregory Z. Gutin, Arash Rafiey, Simone Severini, Anders Yeo:
Hamilton cycles in digraphs of unitary matrices. Discret. Math. 306(24): 3315-3320 (2006) - [j5]Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
On n-partite Tournaments with Unique n-cycle. Graphs Comb. 22(2): 241-249 (2006) - [j4]Jinfeng Feng, Hans-Erik Giesen, Yubao Guo, Gregory Z. Gutin, Tommy R. Jensen, Arash Rafiey:
Characterization of edge-colored complete graphs with properly colored Hamilton paths. J. Graph Theory 53(4): 333-346 (2006) - [c3]Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo:
The Linear Arrangement Problem Parameterized Above Guaranteed Value. CIAC 2006: 356-367 - [i5]Gregory Z. Gutin, Pavol Hell, Arash Rafiey, Anders Yeo:
Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs. CoRR abs/cs/0602038 (2006) - [i4]Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs. CoRR abs/cs/0608101 (2006) - 2005
- [j3]Gregory Z. Gutin, Nick S. Jones, Arash Rafiey, Simone Severini, Anders Yeo:
Mediated digraphs and quantum nonlocality. Discret. Appl. Math. 150(1-3): 41-50 (2005) - [c2]Gregory Z. Gutin, Arash Rafiey, Anders Yeo, Michael Tso:
Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs. AAIM 2005: 427-439 - [i3]Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
Minimum Cost and List Homomorphisms to Semicomplete Digraphs. CoRR abs/cs/0507017 (2005) - [i2]Gregory Z. Gutin, Arash Rafiey, Anders Yeo:
Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs. CoRR abs/cs/0509091 (2005) - [i1]Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo:
The Linear Arrangement Problem Parameterized Above Guaranteed Value. CoRR abs/cs/0511030 (2005) - 2004
- [j2]Changiz Eslahchi, Arash Rafiey:
Circular Chromatic Number of Hypergraphs. Ars Comb. 73 (2004) - [j1]Gregory Z. Gutin, Arash Rafiey:
When n-cycles in n-partite tournaments are longest cycles. Discret. Math. 289(1-3): 163-168 (2004) - 2002
- [c1]M. Karimi Behbahani, Arash Rafiey, Mehrdad Shahshahani:
On Skeletons Attached to Grey Scale Images. ICMLA 2002: 282-288
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).
Privacy notice: By enabling the option above, your browser will contact the API of 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, opencitations.net, and semanticscholar.org to load article reference 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, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and 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 and semanticscholar.org 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 as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional 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 information given by OpenAlex.
last updated on 2025-01-09 13:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
