Amir Daneshgar

Orcid: 0000-0002-2639-5376

Affiliations:
  • Sharif University of Technology, Tehran, Department of Mathematical Sciences


According to our database1, Amir Daneshgar authored at least 33 papers between 1996 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Weighted centroid trees: a general approach to summarize phylogenies in single-labeled tumor mutation tree inference.
Bioinform., 2024

2022
Mean isoperimetry with control on outliers: Exact and approximation algorithms.
Theor. Comput. Sci., 2022

2019
A class of highly symmetric graphs, symmetric cylindrical constructions and their spectra.
Discret. Math., 2019

2018
Strong continuous non-malleable encoding schemes with tamper-detection.
Inf. Sci., 2018

An O(log<sup>1.5</sup>n log log n) Approximation Algorithm for Mean Isoperimetry and Robust k-means.
CoRR, 2018

A Secure Self-Synchronized Stream Cipher.
Comput. J., 2018

2017
On the odd girth and the circular chromatic number of generalized Petersen graphs.
J. Comb. Optim., 2017

A new security proof for FMNV continuous non-malleable encoding scheme.
ISC Int. J. Inf. Secur., 2017

2016
FMNV Continuous Non-malleable Encoding Scheme is More Efficient Than Believed.
IACR Cryptol. ePrint Arch., 2016

On Cylindrical Graph Construction and its Applications.
Electron. J. Comb., 2016

2015
A self-synchronized chaotic image encryption scheme.
Signal Process. Image Commun., 2015

2014
A Self-synchronized Image Encryption Scheme.
CoRR, 2014

2013
Clustering and outlier detection using isoperimetric number of trees.
Pattern Recognit., 2013

Function simulation, graph grammars and colourings.
Int. J. Comput. Math., 2013

2012
On the complexity of isoperimetric problems on trees.
Discret. Appl. Math., 2012

Clustering Using Isoperimetric Number of Trees
CoRR, 2012

2010
On the isoperimetric spectrum of graphs and its approximations.
J. Comb. Theory B, 2010

On The Complexity Of Unique List Colourability And The Fixing Number Of Graphs.
Ars Comb., 2010

2008
Density and power graphs in graph homomorphism problem.
Discret. Math., 2008

On Connected Colourings of Graphs.
Ars Comb., 2008

2007
Circular colouring and algebraic no-homomorphism theorems.
Eur. J. Comb., 2007

On defining numbers of circular complete graphs.
Discret. Math., 2007

2005
Unique list-colourability and the fixing chromatic number of graphs.
Discret. Appl. Math., 2005

2003
Graph homomorphisms through random walks.
J. Graph Theory, 2003

On Some Parameters Related to Uniquely Vertex-Colourable Graphs and Defining Sets.
Ars Comb., 2003

2001
Forcing Structures and Cliques in Uniquely Vertex Colorable Graphs.
SIAM J. Discret. Math., 2001

Relations among the fractional chromatic, choice, Hall, and Hall-condition numbers of simple graphs.
Discret. Math., 2001

Random Walks and Graph Homomorphisms.
Proceedings of the Graphs, 2001

2000
On small uniquely vertex-colourable graphs and Xu's conjecture.
Discret. Math., 2000

1997
Thresholding in a generalized model for translation invariant systems.
Fuzzy Sets Syst., 1997

Residuated semigroups and morphological aspects of translation invariant systems.
Fuzzy Sets Syst., 1997

1996
Duality in a generalized model for translation invariant systems.
Fuzzy Sets Syst., 1996

Reconstruction in a generalized model for translation invariant systems.
Fuzzy Sets Syst., 1996


  Loading...