| Clustering and outlier detection using isoperimetric number of trees A Daneshgar, R Javadi, SBS Razavi Pattern recognition 46 (12), 3371-3382, 2013 | 25 | 2013 |
| A self-synchronized chaotic image encryption scheme A Daneshgar, B Khadem Signal Processing: Image Communication 36, 106-114, 2015 | 22 | 2015 |
| Relations among the fractional chromatic, choice, Hall, and Hall-condition numbers of simple graphs A Daneshgar, AJW Hilton, PD Johnson Jr Discrete Mathematics 241 (1-3), 189-199, 2001 | 21 | 2001 |
| On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processes A Daneshgar, R Javadi, L Miclo Stochastic Processes and their Applications 122 (4), 1748-1776, 2012 | 19 | 2012 |
| On the isoperimetric spectrum of graphs and its approximations A Daneshgar, H Hajiabolhassan, R Javadi Journal of Combinatorial Theory, Series B 100 (4), 390-412, 2010 | 18 | 2010 |
| Graph homomorphisms and nodal domains A Daneshgar, H Hajiabolhassan Linear algebra and its applications 418 (1), 44-52, 2006 | 18 | 2006 |
| Graph homomorphisms through random walks A Daneshgar, H Hajiabolhassan Journal of Graph Theory 44 (1), 15-38, 2003 | 17 | 2003 |
| Forcing structures and cliques in uniquely vertex colorable graphs A Daneshgar SIAM Journal on Discrete Mathematics 14 (4), 433-445, 2001 | 12 | 2001 |
| On the complexity of isoperimetric problems on trees A Daneshgar, R Javadi Discrete applied mathematics 160 (1-2), 116-131, 2012 | 11 | 2012 |
| Circular colouring and algebraic no-homomorphism theorems A Daneshgar, H Hajiabolhassan European Journal of Combinatorics 28 (6), 1843-1853, 2007 | 10 | 2007 |
| On small uniquely vertex-colourable graphs and Xu's conjecture A Daneshgar, R Naserasr Discrete Mathematics 223 (1-3), 93-108, 2000 | 8 | 2000 |
| Density and power graphs in graph homomorphism problem A Daneshgar, H Hajiabolhassan Discrete Mathematics 308 (17), 4027-4030, 2008 | 7 | 2008 |
| Random Walks and Graph Homomorphisms. A Daneshgar, H Hajiabolhassan DIMACS SERIES IN DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE 63, 49-64, 2004 | 6 | 2004 |
| FMNV continuous non-malleable encoding scheme is more efficient than believed AS Mortazavi, M Salmasizadeh, A Daneshgar 2016 13th International Iranian Society of Cryptology Conference on …, 2016 | 5 | 2016 |
| Cylindrical Graph Construction (definition and basic properties) A Daneshgar, M Hejrati, M Madani arXiv preprint arXiv:1406.3767, 2014 | 5 | 2014 |
| System theory and fuzzy sets, part II: topology and duality in translation invariant systems A Daneshgar Tech. Rep. 93-021, 1993 | 5 | 1993 |
| Trust modeling based on Capra cognitive framework K Mirzaie, MN Fesharaki, A Daneshgar Procedia-Social and Behavioral Sciences 32, 197-203, 2012 | 4 | 2012 |
| On the complexity of unique list colourability and the fixing number of graphs A Daneshgar, H Hajiabolhassan, S Taati Ars Combinatoria 97, 301-319, 2010 | 4 | 2010 |
| On some parameters related to uniquely vertex-colourable graphs and defining sets A Daneshgar, R Naserasr Ars Combinatoria 69, 301-318, 2003 | 4 | 2003 |
| On r-Type-Constructions and delta-Colour-Critical Graphs A Daneshgar JOURNAL OF COMBINATORIAL MATHEMATICS AND COMBINATORIAL COMPUTING 29, 183-206, 1999 | 4 | 1999 |
Hossein HajiabolhassanMedizinische Universität GrazVerified email at medunigraz.at
