Arash Rafiey                                                                                       

School of Computing, 

Simon Fraser University

I am a postdoctoral fellow at School of Computing, Simon Fraser University. I am working with Prof. Pavol Hell and Prof. Arvind Gupta.

I finished my  PhD under supervision of Professor Gregory Gutin in Department of Computer Science, University of London  (September 2003- March 2006).

Research Interests

		Graph Theory and Algorithm (Graph Homomorphism, Constraint Satisfaction Problem) Computational Biology (Inverse Protein Folding, RNA and DNA folding)
		Combinatorial Optimization (Scheduling)
		Algorithm Design (Fixed Parameter Tractability) Extremal Graph Theory, and the Probabilistic Methods
Publications
	Submitted Papers : P.Hell, A.Rafiey. Duality for Min-Max Ordering, and Dichotomy for Min Cost Homomorphism.   P.Jula, A.Rafiey. Coordinated Scheduling of a Single Machine with Sequence Dependent Setup Times and Time Window Constraints. P. Hell, and A. Rafiey. New characterization of Interval Graphs. T. Feder, P. Hell, and A. Rafiey. List Homomorphism to Balanced Digraphs. Journal Papers : T.Feder, P.Hell, J.Huang, and A.Rafiey. Adjusted Interval Digraphs. Electronic Notes in Discrete Mathematics 32: 83-91 (2009) A. Gupta, A. Khodabakhshi, J. Manuch, and A. Rafiey. Inverse Protein Folding in 3D Hexagonal Prism Lattice under HP Model, To appear in Journal of Computational Biology. Gupta, A. Khodabakhshi, J. Manuch, and A. Rafiey. A Robust Class of Stable Proteins in the 2D HPC, To appear in Journal of Computational Biology. G. Gutin, A. Rafiey, and A. Yeo. Minimum Cost Homomorphism to Semicomplete Bipartite Digraphs, SIAM journal on Discrete Mathematics, 22(4) (2008) 1624–1639. G. Gutin, A. Rafiey, and A. Yeo. Minimum Cost Homomorphism to Semicomplete Multipartite Digraphs, London Algorithmics and Stringology 2006, College Publications, 2007, 65–74. Discrete Applied Mathematics, 156 (12) (2008), 2429-2435. G. Gutin, P. Hell, A. Rafiey, and A. Yeo. A dichotomy for minimum cost graph homomorphisms, European Journal of Combinatorics, 29 (4) (2008), 900–911. G. Gutin, A. Rafiey, S.Szeider, A.Yeo, The Linear Arrangement Problem Parameterized Above Guaranteed Value, Theory of Computing Systems, 3 (2007) 521-538. G. Gutin, A. Rafiey, S.Severini, A.Yeo, Hamilton Cycles in Digraphs of Unitary Matrices, Discrete Mathematics 306 (24), (2006). G.Gutin, T. Jensen, A.Rafiey , Characterization of edge-colored complete graphs with properly colored Hamilton paths, Journal of Graph Theory 53(4)(2006) 333-346. G. Gutin, A. Rafiey, A.Yeo, On n-partite tournaments with unique n-cycle, Graphs and Combinatorics, 22, (2006) 241-249. C. Eslahchi, A.Rafiey, C-Perfect K-Uniform Hypergraphs, Ars  Combinatoria, 79, (2006) 235-244. G. Gutin, A. Rafiey, A.Yeo, Minimum Cost and List Homomorphism to Semicomplete Digraphs, Discrete Applied Math, 154, (2006) 890-897. G. Gutin, A. Rafiey, M.Tso , A.Yeo, Level of Repair Analysis and Minimum Cost Homomorphism of Graphs , Discrete Applied Math, 154, (2006) 881-889. G.Gutin, A.Rafiey, Multipartite tournaments with small number of cycles, Australian Journal of Combinatorics, 34(2006), 17-21. G. Gutin, N.Jones, A. Rafiey, S.Severini, A.Yeo,  Mediated Digraphs and Quantum Nonlocality, Discrete Applied Math, 150, (2005) 41-50. G. Gutin and A. Rafiey. When n-cycles in n-partite Tournaments are Longest Cycles, Discrete Math, 289 (2004), 163–168. C. Eslahchi and A. Rafiey. Circular Chromatic Number of Hypergaphs, Ars Combinatoria, 73 (2004), 239–246. Conference Papers : A.Gupta, P.Hell, M.Karimi, A.Rafiey, Minimum Cost Homomorphism to Reflexive Digraphs,  LATIN (2008), 182-193. A. Gupta, A. Khodabakhshi, J. Manuch, and A. Rafiey. A Robust Class of Stable Proteins in the 2D HPC, BIRD (2008), 180-192. A.Gupta, A.Khodabakhshi, J.Manuch, A. Rafiey, Structure-approximating Design of Stable Proteins in 2D HP Model Fortified by Cysteine Monomers, APBC ( Kyoto, Japan, 2008). R. Colak, M. Ester, F. Moser and A.Rafiey. Mining Cohesive Patterns from Graphs with Feature Vectors. SDM 2009. G. Gutin, A. Rafiey, and A. Yeo. Minimum Cost Homomorphism to Oriented Cycles, AAIM 2008: 224-234. A. Gupta, G. Gutin , M. Karimi, E.J. Kim, and A. Rafiey. Minimum Cost Homomorphisms to Locally In-Semicomplete Digraphs, COCOA (2008) 374-383. A.Gupta, M.Karimi, A.Khodabakhshi, J.Manuch, A. Rafiey, Design of Artificial tubular Protein Structures in 3D Hexagonal Prism Lattice under HP Model, BIOCOMP (2007) 362-369. G. Gutin, A. Rafiey, S.Szeider, A.Yeo, The Linear Arrangement Problem Parameterized Above Guaranteed Value. CIAC (2006), 356–367. G. Gutin, A. Rafiey, M.Tso , A.Yeo, Level of Repair Analysis and Minimum Cost Homomorphism of Graphs, AAIM (2005), 427–439. M.Karimi-Behbahani, A.Rafiey, M.Shahshahani, On the skeletons attached to the gray scale images, International  Conference on Machine Learning and Applications (ICMLA’02) 282-288.
Contact Information
			Emails: arashr@cs.sfu.ca My mailing address is  : Arash Rafiey School of Computing, Simon Fraser University, Burnaby , BC Canada V5A 1S6,