Amir Daneshgar

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 14

Top Topics

Image Encryption

Maximum Parsimony

Encoding Scheme

Top Venues

IACR Cryptol. ePrint Arch.

J. Comb. Optim.

Publications

Hamed Vasei, Mohammad-Hadi Foroughmand-Araabi, Amir Daneshgar
Weighted centroid trees: a general approach to summarize phylogenies in single-labeled tumor mutation tree inference. Bioinform. 40 (7) (2024)
Morteza Alimi, Amir Daneshgar, Mohammad-Hadi Foroughmand-Araabi
Mean isoperimetry with control on outliers: Exact and approximation algorithms. Theor. Comput. Sci. 923 (2022)
Vahid Jahandideh, Amir Daneshgar, Mahmoud Salmasizadeh
Concrete Evaluation of the Random Probing Security. CoRR (2020)
Amir Daneshgar, Ali Taherkhani
A class of highly symmetric graphs, symmetric cylindrical constructions and their spectra. Discret. Math. 342 (1) (2019)
Amir S. Mortazavi, Mahmoud Salmasizadeh, Amir Daneshgar
Strong continuous non-malleable encoding schemes with tamper-detection. Inf. Sci. (2018)
Morteza Alimi, Amir Daneshgar, Mohammad-Hadi Foroughmand-Araabi
n log log n) Approximation Algorithm for Mean Isoperimetry and Robust k-means. CoRR (2018)
Amir Daneshgar, Fahimeh Mohebbipoor
A Secure Self-Synchronized Stream Cipher. Comput. J. 61 (8) (2018)
Amir S. Mortazavi, Mahmoud Salmasizadeh, Amir Daneshgar
A new security proof for FMNV continuous non-malleable encoding scheme. ISC Int. J. Inf. Secur. 9 (1) (2017)
Amir Daneshgar, Fahimeh Mohebbipoor
A Secure Self-synchronized Stream Cipher. CoRR (2017)
Amir Daneshgar, Meysam Madani
On the odd girth and the circular chromatic number of generalized Petersen graphs. J. Comb. Optim. 33 (3) (2017)
Amir S. Mortazavi, Mahmoud Salmasizadeh, Amir Daneshgar
FMNV Continuous Non-malleable Encoding Scheme is More Efficient Than Believed. IACR Cryptol. ePrint Arch. 2016 (2016)
Amir Daneshgar, Mohsen Hejrati, Meysam Madani
On Cylindrical Graph Construction and its Applications. Electron. J. Comb. 23 (1) (2016)
Amir S. Mortazavi, Mahmoud Salmasizadeh, Amir Daneshgar
Strong Continuous Non-malleable Encoding Schemes with Tamper-Detection. IACR Cryptol. ePrint Arch. 2016 (2016)
Amir S. Mortazavi, Mahmoud Salmasizadeh, Amir Daneshgar
FMNV continuous non-malleable encoding scheme is more efficient than believed. ISCISC (2016)
Amir Daneshgar, Behrooz Khadem
A self-synchronized chaotic image encryption scheme. Signal Process. Image Commun. 36 (2015)
Amir Daneshgar, Behrooz Khadem
A Self-synchronized Image Encryption Scheme. CoRR (2014)
Amir Daneshgar, Alireza Rahimi, Siamak Taati
Function simulation, graph grammars and colourings. Int. J. Comput. Math. 90 (7) (2013)
Amir Daneshgar, Ramin Javadi, Basir Shariat Razavi
Clustering and outlier detection using isoperimetric number of trees. Pattern Recognit. 46 (12) (2013)
Amir Daneshgar, Ramin Javadi
On the complexity of isoperimetric problems on trees. Discret. Appl. Math. 160 (1-2) (2012)
Amir Daneshgar, Ramin Javadi, Basir Shariat Razavi
Clustering Using Isoperimetric Number of Trees CoRR (2012)
Amir Daneshgar, Hossein Hajiabolhassan, Ramin Javadi
On the isoperimetric spectrum of graphs and its approximations. J. Comb. Theory, Ser. B 100 (4) (2010)
Amir Daneshgar, Hossein Hajiabolhassan, Siamak Taati
On The Complexity Of Unique List Colourability And The Fixing Number Of Graphs. Ars Comb. 97 (2010)
Amir Daneshgar, Ramin Javadi
On Complexity of Isoperimetric Problems on Trees CoRR (2010)
Amir Daneshgar, Hossein Hajiabolhassan
Density and power graphs in graph homomorphism problem. Discret. Math. 308 (17) (2008)
Amir Daneshgar, Hossein Hajiabolhassan, Navid Hamedazimi
On Connected Colourings of Graphs. Ars Comb. 89 (2008)
Amir Daneshgar, Hossein Hajiabolhassan
Circular colouring and algebraic no-homomorphism theorems. Eur. J. Comb. 28 (6) (2007)
Amir Daneshgar, Hossein Hajiabolhassan, Nasrin Soltankhah
On defining numbers of circular complete graphs. Discret. Math. 307 (2) (2007)
Amir Daneshgar, Hossein Hajiabolhassan
Unique list-colourability and the fixing chromatic number of graphs. Discret. Appl. Math. 152 (1-3) (2005)
Amir Daneshgar, Hossein Hajiabolhassan
Graph homomorphisms through random walks. J. Graph Theory 44 (1) (2003)
Amir Daneshgar, Reza Naserasr
On Some Parameters Related to Uniquely Vertex-Colourable Graphs and Defining Sets. Ars Comb. 69 (2003)
Amir Daneshgar, Anthony J. W. Hilton, Peter D. Johnson Jr.
Relations among the fractional chromatic, choice, Hall, and Hall-condition numbers of simple graphs. Discret. Math. 241 (1-3) (2001)
Amir Daneshgar, Hossein Hajiabolhassan
Random Walks and Graph Homomorphisms. Graphs, Morphisms and Statistical Physics (2001)
Amir Daneshgar
Forcing Structures and Cliques in Uniquely Vertex Colorable Graphs. SIAM J. Discret. Math. 14 (4) (2001)
Amir Daneshgar, Reza Naserasr
On small uniquely vertex-colourable graphs and Xu's conjecture. Discret. Math. 223 (1-3) (2000)
Amir Daneshgar
Thresholding in a generalized model for translation invariant systems. Fuzzy Sets Syst. 85 (3) (1997)
Amir Daneshgar
Residuated semigroups and morphological aspects of translation invariant systems. Fuzzy Sets Syst. 90 (1) (1997)
Amir Daneshgar
Reconstruction in a generalized model for translation invariant systems. Fuzzy Sets Syst. 83 (1) (1996)
Amir Daneshgar
Duality in a generalized model for translation invariant systems. Fuzzy Sets Syst. 83 (3) (1996)