default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmir Daneshgar
Person information
- affiliation: Sharif University of Technology, Tehran, Department of Mathematical Sciences
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j28]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)- 2022
- [j27]Morteza Alimi, Amir Daneshgar, Mohammad-Hadi Foroughmand-Araabi:
Mean isoperimetry with control on outliers: Exact and approximation algorithms. Theor. Comput. Sci. 923: 348-365 (2022)
2010 – 2019
- 2019
- [j26]Amir Daneshgar
, Ali Taherkhani:
A class of highly symmetric graphs, symmetric cylindrical constructions and their spectra. Discret. Math. 342(1): 96-112 (2019) - 2018
- [j25]Amir Daneshgar, Fahimeh Mohebbipoor:
A Secure Self-Synchronized Stream Cipher. Comput. J. 61(8): 1180-1201 (2018) - [j24]Amir S. Mortazavi, Mahmoud Salmasizadeh, Amir Daneshgar:
Strong continuous non-malleable encoding schemes with tamper-detection. Inf. Sci. 451-452: 253-270 (2018) - [i7]Morteza Alimi, Amir Daneshgar, Mohammad-Hadi Foroughmand-Araabi:
An O(log1.5n log log n) Approximation Algorithm for Mean Isoperimetry and Robust k-means. CoRR abs/1807.05125 (2018) - 2017
- [j23]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): 41-51 (2017) - [j22]Amir Daneshgar, Meysam Madani:
On the odd girth and the circular chromatic number of generalized Petersen graphs. J. Comb. Optim. 33(3): 897-923 (2017) - [i6]Amir Daneshgar, Fahimeh Mohebbipoor:
A Secure Self-synchronized Stream Cipher. CoRR abs/1709.08613 (2017) - 2016
- [j21]Amir Daneshgar, Mohsen Hejrati, Meysam Madani:
On Cylindrical Graph Construction and its Applications. Electron. J. Comb. 23(1): 1 (2016) - [c2]Amir S. Mortazavi, Mahmoud Salmasizadeh, Amir Daneshgar:
FMNV continuous non-malleable encoding scheme is more efficient than believed. ISCISC 2016: 72-78 - [i5]Amir S. Mortazavi, Mahmoud Salmasizadeh, Amir Daneshgar:
Strong Continuous Non-malleable Encoding Schemes with Tamper-Detection. IACR Cryptol. ePrint Arch. 2016: 43 (2016) - [i4]Amir S. Mortazavi, Mahmoud Salmasizadeh, Amir Daneshgar:
FMNV Continuous Non-malleable Encoding Scheme is More Efficient Than Believed. IACR Cryptol. ePrint Arch. 2016: 604 (2016) - 2015
- [j20]Amir Daneshgar, Behrooz Khadem:
A self-synchronized chaotic image encryption scheme. Signal Process. Image Commun. 36: 106-114 (2015) - 2014
- [i3]Amir Daneshgar, Behrooz Khadem:
A Self-synchronized Image Encryption Scheme. CoRR abs/1411.7487 (2014) - 2013
- [j19]Amir Daneshgar, Alireza Rahimi, Siamak Taati:
Function simulation, graph grammars and colourings. Int. J. Comput. Math. 90(7): 1334-1357 (2013) - [j18]Amir Daneshgar, Ramin Javadi, Basir Shariat Razavi:
Clustering and outlier detection using isoperimetric number of trees. Pattern Recognit. 46(12): 3371-3382 (2013) - 2012
- [j17]Amir Daneshgar, Ramin Javadi:
On the complexity of isoperimetric problems on trees. Discret. Appl. Math. 160(1-2): 116-131 (2012) - [i2]Amir Daneshgar, Ramin Javadi, Basir Shariat Razavi:
Clustering Using Isoperimetric Number of Trees. CoRR abs/1203.4204 (2012) - 2010
- [j16]Amir Daneshgar, Hossein Hajiabolhassan, Siamak Taati:
On The Complexity Of Unique List Colourability And The Fixing Number Of Graphs. Ars Comb. 97 (2010) - [j15]Amir Daneshgar, Hossein Hajiabolhassan, Ramin Javadi:
On the isoperimetric spectrum of graphs and its approximations. J. Comb. Theory B 100(4): 390-412 (2010) - [i1]Amir Daneshgar, Ramin Javadi:
On Complexity of Isoperimetric Problems on Trees. CoRR abs/1009.0706 (2010)
2000 – 2009
- 2008
- [j14]Amir Daneshgar, Hossein Hajiabolhassan, Navid Hamedazimi:
On Connected Colourings of Graphs. Ars Comb. 89 (2008) - [j13]Amir Daneshgar, Hossein Hajiabolhassan:
Density and power graphs in graph homomorphism problem. Discret. Math. 308(17): 4027-4030 (2008) - 2007
- [j12]Amir Daneshgar, Hossein Hajiabolhassan, Nasrin Soltankhah:
On defining numbers of circular complete graphs. Discret. Math. 307(2): 173-180 (2007) - [j11]Amir Daneshgar, Hossein Hajiabolhassan:
Circular colouring and algebraic no-homomorphism theorems. Eur. J. Comb. 28(6): 1843-1853 (2007) - 2005
- [j10]Amir Daneshgar, Hossein Hajiabolhassan:
Unique list-colourability and the fixing chromatic number of graphs. Discret. Appl. Math. 152(1-3): 123-138 (2005) - 2003
- [j9]Amir Daneshgar, Reza Naserasr:
On Some Parameters Related to Uniquely Vertex-Colourable Graphs and Defining Sets. Ars Comb. 69 (2003) - [j8]Amir Daneshgar, Hossein Hajiabolhassan:
Graph homomorphisms through random walks. J. Graph Theory 44(1): 15-38 (2003) - 2001
- [j7]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): 189-199 (2001) - [j6]Amir Daneshgar:
Forcing Structures and Cliques in Uniquely Vertex Colorable Graphs. SIAM J. Discret. Math. 14(4): 433-445 (2001) - [c1]Amir Daneshgar, Hossein Hajiabolhassan:
Random Walks and Graph Homomorphisms. Graphs, Morphisms and Statistical Physics 2001: 49-63 - 2000
- [j5]Amir Daneshgar, Reza Naserasr:
On small uniquely vertex-colourable graphs and Xu's conjecture. Discret. Math. 223(1-3): 93-108 (2000)
1990 – 1999
- 1997
- [j4]Amir Daneshgar:
Thresholding in a generalized model for translation invariant systems. Fuzzy Sets Syst. 85(3): 391-395 (1997) - [j3]Amir Daneshgar:
Residuated semigroups and morphological aspects of translation invariant systems. Fuzzy Sets Syst. 90(1): 69-81 (1997) - 1996
- [j2]Amir Daneshgar:
Reconstruction in a generalized model for translation invariant systems. Fuzzy Sets Syst. 83(1): 51-55 (1996) - [j1]Amir Daneshgar:
Duality in a generalized model for translation invariant systems. Fuzzy Sets Syst. 83(3): 347-352 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-19 18:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
