Arash Rafiey

According to our database1, Arash Rafiey authored at least 65 papers between 2002 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Min Orderings and List Homomorphism Dichotomies for Graphs and Signed Graphs.
Algorithmica, July, 2024

Bi-arc Digraphs: Recognition Algorithm and Applications.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023
Vertex Ordering with Precedence Constraints.
Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2022
Recognizing interval bigraphs by forbidden patterns.
J. Graph Theory, 2022

Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2020
Min-Orderable Digraphs.
SIAM J. Discret. Math., 2020

A note on weak near unanimity polymorphisms.
CoRR, 2020

Digraphs Homomorphism Problems with Maltsev Condition.
CoRR, 2020

2019
Toward a Dichotomy for Approximation of H-Coloring.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Interval-Like Graphs and Digraphs.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017
Dichotomy for Digraph Homomorphism Problems.
CoRR, 2017

2016
Pattern overlap implies runaway growth in hierarchical tile systems.
J. Comput. Geom., 2016

Interval Minors of Complete Bipartite Graphs.
J. Graph Theory, 2016

PTAS for Ordered Instances of Resource Allocation Problems with Restrictions on Inclusions.
CoRR, 2016

Bi-Arc Digraphs and Conservative Polymorphisms.
CoRR, 2016

2015
Ordering with precedence constraints and budget minimization.
CoRR, 2015

Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

A Network Model for the Hospital Routing Problem.
Proceedings of the ICORES 2015, 2015

Approximation Algorithms for Generalized MST and TSP in Grid Clusters.
Proceedings of the Combinatorial Optimization and Applications, 2015

2014
Finding clubs in graph classes.
Discret. Appl. Math., 2014

Graph classes and Ramsey numbers.
Discret. Appl. Math., 2014

Finding minimum Tucker submatrices.
CoRR, 2014

Space complexity of list <i>H</i>-colouring: a dichotomy.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Ordering without Forbidden Patterns.
Proceedings of the Algorithms - ESA 2014, 2014

2013
Corrigendum. The Linear Arrangement Problem Parameterized Above Guaranteed Value.
Theory Comput. Syst., 2013

On the approximation of minimum cost homomorphism to bipartite graphs.
Discret. Appl. Math., 2013

Space complexity of list H-colouring: a dichotomy.
CoRR, 2013

PTAS for Ordered Instances of Resource Allocation Problems.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

Cliques and Clubs.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012
The Dichotomy of Minimum Cost Homomorphism Problems for Digraphs.
SIAM J. Discret. Math., 2012

Monotone Proper Interval Digraphs and Min-Max Orderings.
SIAM J. Discret. Math., 2012

Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms.
Discret. Appl. Math., 2012

Approximation of Minimum Cost Homomorphisms.
Proceedings of the Algorithms - ESA 2012, 2012

2011
The Dichotomy of List Homomorphisms for Digraphs.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010
Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs.
Australas. J Comb., 2010

An Algorithm for the Energy Barrier Problem Without Pseudoknots and Temporary Arcs.
Proceedings of the Biocomputing 2010: Proceedings of the Pacific Symposium, 2010

2009
Inverse Protein Folding in 3D Hexagonal Prism Lattice under HPC Model.
J. Comput. Biol., 2009

Stable Structure-Approximating Inverse Protein Folding in 2D Hydrophobic-Polar-Cysteine (HPC) Model.
J. Comput. Biol., 2009

Minimum Cost Homomorphism Dichotomy for Oriented Cycles.
Graphs Comb., 2009

Adjusted Interval Digraphs.
Electron. Notes Discret. Math., 2009

Duality for Min-Max Orderings and Dichotomy for Min Cost Homomorphisms
CoRR, 2009

Mining Cohesive Patterns from Graphs with Feature Vectors.
Proceedings of the SIAM International Conference on Data Mining, 2009

2008
Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs.
SIAM J. Discret. Math., 2008

A dichotomy for minimum cost graph homomorphisms.
Eur. J. Comb., 2008

Minimum cost homomorphisms to semicomplete multipartite digraphs.
Discret. Appl. Math., 2008

Minimum Cost Homomorphisms to Reflexive Digraphs.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs.
Proceedings of the Combinatorial Optimization and Applications, 2008

A Robust Class of Stable Proteins in the 2D HPC Model.
Proceedings of the Bioinformatics Research and Development, 2008

Inverse protein folding in 3D hexagonal prism lattice under HP model.
Proceedings of the International Conference on Bioinformatics & Computational Biology, 2008

Structure-Approximating Design of Stable Proteins in 2D HP Model Fortified by Cysteine Monomers.
Proceedings of the 6th Asia-Pacific Bioinformatics Conference, 2008

2007
The Linear Arrangement Problem Parameterized Above Guaranteed Value.
Theory Comput. Syst., 2007

Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs
CoRR, 2007

Design of Artificial Tubular Protein Structures in 3D Hexagonal Prism Lattice Under HP Model.
Proceedings of the International Conference on Bioinformatics & Computational Biology, 2007

2006
Characterization of edge-colored complete graphs with properly colored Hamilton paths.
J. Graph Theory, 2006

On <i>n</i>-partite Tournaments with Unique <i>n</i>-cycle.
Graphs Comb., 2006

Hamilton cycles in digraphs of unitary matrices.
Discret. Math., 2006

Level of repair analysis and minimum cost homomorphisms of graphs.
Discret. Appl. Math., 2006

Minimum cost and list homomorphisms to semicomplete digraphs.
Discret. Appl. Math., 2006

Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs
CoRR, 2006

C-Perfect K-Uniform Hypergraphs.
Ars Comb., 2006

Multipartite tournaments with small number of cycles.
Australas. J Comb., 2006

2005
Mediated digraphs and quantum nonlocality.
Discret. Appl. Math., 2005

2004
When <i>n</i>-cycles in <i>n</i>-partite tournaments are longest cycles.
Discret. Math., 2004

Circular Chromatic Number of Hypergraphs.
Ars Comb., 2004

2002
On Skeletons Attached to Grey Scale Images.
Proceedings of the 2002 International Conference on Machine Learning and Applications, 2002


  Loading...