 | 2012 |
| 13 |  | Amir Daneshgar,
Ramin Javadi,
Basir Shariat Razavi:
Clustering Using Isoperimetric Number of Trees
CoRR abs/1203.4204: (2012) |
| 12 |  | Amir Daneshgar,
Ramin Javadi:
On the complexity of isoperimetric problems on trees.
Discrete Applied Mathematics 160(1-2): 116-131 (2012) |
| 2011 |
| 11 |  | Golnaz Ghasemiesfeh,
Amir Daneshgar:
New Definition for Fuzzy Constraint Satisfaction Problem and its Applications
CoRR abs/1102.1122: (2011) |
| 2010 |
| 10 |  | Amir Daneshgar,
Ramin Javadi:
On Complexity of Isoperimetric Problems on Trees
CoRR abs/1009.0706: (2010) |
| 9 |  | Amir Daneshgar,
Hossein Hajiabolhassan,
Ramin Javadi:
On the isoperimetric spectrum of graphs and its approximations.
J. Comb. Theory, Ser. B 100(4): 390-412 (2010) |
| 2008 |
| 8 |  | Amir Daneshgar,
Hossein Hajiabolhassan,
Navid Hamedazimi:
On Connected Colourings of Graphs.
Ars Comb. 89: (2008) |
| 7 |  | Amir Daneshgar,
Hossein Hajiabolhassan:
Density and power graphs in graph homomorphism problem.
Discrete Mathematics 308(17): 4027-4030 (2008) |
| 2007 |
| 6 |  | Amir Daneshgar,
Hossein Hajiabolhassan,
Nasrin Soltankhah:
On defining numbers of circular complete graphs.
Discrete Mathematics 307(2): 173-180 (2007) |
| 5 |  | Amir Daneshgar,
Hossein Hajiabolhassan:
Circular colouring and algebraic no-homomorphism theorems.
Eur. J. Comb. 28(6): 1843-1853 (2007) |
| 2005 |
| 4 |  | Amir Daneshgar,
Hossein Hajiabolhassan:
Unique list-colourability and the fixing chromatic number of graphs.
Discrete Applied Mathematics 152(1-3): 123-138 (2005) |
| 2003 |
| 3 |  | Amir Daneshgar,
Reza Naserasr:
On Some Parameters Related to Uniquely Vertex-Colourable Graphs and Defining Sets.
Ars Comb. 69: (2003) |
| 2001 |
| 2 |  | Amir Daneshgar:
Forcing Structures and Cliques in Uniquely Vertex Colorable Graphs.
SIAM J. Discrete Math. 14(4): 433-445 (2001) |
| 2000 |
| 1 |  | Amir Daneshgar,
Reza Naserasr:
On small uniquely vertex-colourable graphs and Xu's conjecture.
Discrete Mathematics 223(1-3): 93-108 (2000) |