Arash Rafiey

From MaRDI portal
Person:385509

Available identifiers

zbMath Open rafiey.arashMaRDI QIDQ385509

List of research outcomes





PublicationDate of PublicationType
Min orderings and list homomorphism dichotomies for graphs and signed graphs2024-08-02Paper
Bi-arc digraphs: recognition algorithm and applications2024-05-31Paper
Vertex ordering with precedence constraints2024-05-29Paper
Recognizing interval bigraphs by forbidden patterns2023-10-05Paper
Min orderings and list homomorphism dichotomies for signed and unsigned graphs2023-07-26Paper
https://portal.mardi4nfdi.de/entity/Q50912522022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50051722021-08-04Paper
Min-Orderable Digraphs2020-10-28Paper
Space complexity of list H-colouring: a dichotomy2019-06-20Paper
Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy2018-04-23Paper
Pattern Overlap Implies Runaway Growth in Hierarchical Tile Systems2017-10-10Paper
https://portal.mardi4nfdi.de/entity/Q53651492017-09-29Paper
Pattern overlap implies runaway growth in hierarchical tile systems2017-03-30Paper
PTAS for Ordered Instances of Resource Allocation Problems2017-02-21Paper
Interval Minors of Complete Bipartite Graphs2016-08-12Paper
Bi-Arc Digraphs and Conservative Polymorphisms2016-08-11Paper
Approximation Algorithms for Generalized MST and TSP in Grid Clusters2016-02-05Paper
Ordering without Forbidden Patterns2014-10-08Paper
Graph classes and Ramsey numbers2014-08-22Paper
Finding clubs in graph classes2014-08-22Paper
Corrigendum to: ``The linear arrangement problem parameterized above guaranteed value2013-12-02Paper
Adjusted interval digraphs2013-07-04Paper
Cliques and Clubs2013-06-07Paper
The Dichotomy of Minimum Cost Homomorphism Problems for Digraphs2013-04-09Paper
Monotone Proper Interval Digraphs and Min-Max Orderings2013-04-09Paper
On the approximation of minimum cost homomorphism to bipartite graphs2013-03-12Paper
Single Exponential FPT Algorithm for Interval Vertex Deletion and Interval Completion Problem2012-11-19Paper
Approximation of Minimum Cost Homomorphisms2012-09-25Paper
Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms2012-05-11Paper
https://portal.mardi4nfdi.de/entity/Q35658722010-06-07Paper
Minimum cost homomorphism dichotomy for oriented cycles2010-01-18Paper
Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs2009-11-27Paper
Minimum cost homomorphisms to semicomplete multipartite digraphs2008-09-29Paper
Minimum Cost Homomorphism Dichotomy for Oriented Cycles2008-07-10Paper
A dichotomy for minimum cost graph homomorphisms2008-05-13Paper
Minimum Cost Homomorphisms to Reflexive Digraphs2008-04-15Paper
The linear arrangement problem parameterized above guaranteed value2007-12-19Paper
The Linear Arrangement Problem Parameterized Above Guaranteed Value2007-05-02Paper
https://portal.mardi4nfdi.de/entity/Q34286492007-03-29Paper
Characterization of edge-colored complete graphs with properly colored Hamilton paths2007-02-02Paper
Hamilton cycles in digraphs of unitary matrices2006-12-14Paper
Multipartite tournaments with small number of cycles2006-09-13Paper
On \(n\)-partite tournaments with unique \(n\)-cycle2006-09-12Paper
Minimum cost and list homomorphisms to semicomplete digraphs2006-06-09Paper
Level of repair analysis and minimum cost homomorphisms of graphs2006-06-09Paper
Algorithmic Applications in Management2005-11-30Paper
https://portal.mardi4nfdi.de/entity/Q54635332005-08-04Paper
When \(n\)-cycles in \(n\)-partite tournaments are longest cycles2005-02-22Paper

Research outcomes over time

This page was built for person: Arash Rafiey