Publications
-Journal Papers and Proceedings
[1] A. Daneshgar | and M. Bagheri, Generalizing a property of Fibonacci numbers to |
recursive sequences, Reconciliation With Mathematics, XII (1989), | |
282--290. (In Persian) |
[2] A. Daneshgar, | General theory of translation invariant systems, Combinatorics advances |
(Tehran, 1994), 77--89, Math. Appl., 329, Kluwer Acad. Publ., | |
Dordrecht, 1995. (ISBN: 0-7923-3574-0 ) |
[3] A. Daneshgar, | Reconstruction in a generalized model for translation invariant systems, |
Fuzzy Sets And Systems, 83 (1996), no. 1, 51--55. |
[4] A. Daneshgar, | Duality in a generalized model for translation invariant systems, |
Fuzzy Sets And Systems, 83 (1996), no. 3, 347--352. |
[5] A. Daneshgar, | Thresholding in a generalized model for translation invariant systems, |
Fuzzy Sets And Systems, 85 (1997), no. 3, 391--395. |
[6] A. Daneshgar, | Residuated semigroups and morphological aspects of translation |
invariant systems, Fuzzy Sets And Systems, 90 (1997), no. 1, 69--81. |
[7] A. Daneshgar, | Forcing structures and uniquely colorable graphs, Proceedings of |
AIMC28, Part 1 (Tabriz, 1997), 121--128, Tabriz Univ. Ser. 377, | |
Tabriz Univ., Tabriz, 1997. |
[8] A. Daneshgar, | Forcing and graph colourings, in Proceedings of Combinatorics Day |
VII, Inst. Studies in Theoretical Phys. Math. (IPM), Tehran Iran, | |
17th Dec. 1997, 99--320, 3--10. |
[9] A.Daneshgar, | On r-type constructions and $\Delta$-colour-critical graphs, |
J. Combin. Math. Combin. Compute (JCMCC), 29 (1999), 183--206. | |
(Winner of the First Mehrabadi Prize) |
[10] A. Daneshgar | and R. Naserasr, On small uniquely-vertex-colourable graphs and Xu's |
conjecture, Discrete Mathematics, 223 (2000), 93--108. | |
[11] A. Daneshgar, | A. J. W. Hilton and P. D. Johnson, Relations among the fractional chromatic, |
Hall and Hall condition numbers of simple graphs, selected papers in honor of | |
Helge Tverberg, Discrete Matematics, 241 (2001), 189--199. |
[12] A. Daneshgar | and A. Hashemi, A general model for I/O system theory, Proceedings of |
AIMC31, Tehran University 27--30 Aug 2000, Tehran, Iran. |
[13] A. Daneshgar, | Forcing structures and cliques in uniquely vertex colourable graphs, |
SIAM J. Discrete Mathematics, No. 4, 14 (2001), 433--445. | |
(Winner of the 2nd Young Mathematician Prize) |
[14] A. Daneshgar | and R. Naserasr, On some parameters related to uniquely |
vertex-colourable graphs and defining sets, Ars Combinatoria, | |
69 (2003), 301--318. |
[15] A. Daneshgar | and H. Hajiabolhassan, Graph homomorphisms through random walks, |
J. Graph Theory, 44 (2003), 15--38. | |
[16] A. Daneshgar | and H. Hajiabolhassan, Random walks and graph homomorphisms , |
in Graph, Morphisms and Statistical Physics, J. Nesetril and P. Winkler Eds., |
AMS Proceedings DIMACS Series, Vol. 63 (2004), 49-63. . |
[17] A. Daneshgar | and H. Hajiabolhassan, Unique list-colourability and the fixing chromatic |
number of graphs, Discrete Applied Mathematics, 152 (2005), 123--138. |
[18] A. Daneshgar | and H. Hajiabolhassan, Graph homomorphisms and nodal domains, |
Linear Algebra And Its Applications, 418 (2006), 44--52. |
[19] A. Daneshgar | and A. Hashemi, Fuzzy sets from a meta-system-theoretic point of view, |
Iranian J. Fuzzy Systems, 3 (2006), 1--19. (Invited Paper) |
[20] A. Daneshgar, | H. Hajiabolhassan and N. Soltankhah, On defining numbers of circular complete graphs, |
Discrete Mathematics, 307 (2007), 173--180. |
[21] A. Daneshgar | and H. Hajiabolhassan, Circular colouring and algebraic no-homomorphism theorems, |
European J. Combinatorics, 28 (2007), 1843--1853.. |
[22] A. Daneshgar | H. Hajiabolhassan, Density and power graphs in graph homomorphism problem, |
Discrete Mathematics, 308 (2008), 4027-4030. |
[23] A. Daneshgar | H. Hajiabolhassan and N. Hamedazimi, On connected colourings of graphs, |
Ars Combinatoria, 89 (2008), 115--126. |
[24] A. Daneshgar | H. Hajiabolhassan and R. Javadi, On isoperimetric spectrum of graphs and its approximations, |
J. Combinatorial Theory Series B, 100 (2010), 390--412. Erratum |
[25] A. Daneshgar | H. Hajiabolhassan and S. Taati, On the complexity of unique list colourability and the fixing |
number of graphs, Ars Combinatoria, 97 (2010), 301--319. |
[26] A. Daneshgar | R. Javadi and L. Miclo, On nodal domains and higher-order Cheeger inequalities of finite |
reversible Markov processes, Stochastic Process. Appl., 122 (2012), 1748--1776. |
[27] A. Daneshgar | R. Javadi, On the complexity of isoperimetric problems on trees |
Discrete Appl. Math., 160 (2012), 116--131. |
[28] A. Daneshgar | A. Rahimi and S. Taati, Function simulation, graph grammars and colourings |
International Journal of Computer Mathematics, 90 (2013), 1334--1357. |
[29] A. Daneshgar | R. Javadi and B. Shariat Razavi, Clustering and outlier detection using isoperimetric number of trees |
Pattern recognition, 46 (2013), 3371--3382. |
-Talks [Top]
[1] A. Daneshgar, | On complete lattice-ordered groups, Combinatorics Day III, (IPM) April, |
1st, 1993. | |
[2] A. Daneshgar, | Analysis and design of stream ciphers, A short course in cryptology, ERC |
and Dept. Math. of Sharif University of Technology, July 31st -- August 4th | |
1993. |
[3] A. Daneshgar, | Public-key cryptography, A short course in cryptology, ERC and Dept. |
Math. of Sharif University of Technology, July 31st -- August 4th 1993. | |
[4] A. Daneshgar, | Design of secure systems, A short course in cryptology, ERC and Dept. |
Math. of Sharif University of Technology, July 31st -- August 4th 1993. | |
[5] A. Daneshgar, | General theory of translation invariant systems, Workshop of |
Combinatorics, AIMC25, March 28th -- 31st 1994. | |
[6] A. Daneshgar, | Forcing structures and uniquely colourable graphs, AIMC28, March |
28th -- 31st 1997. | |
[7] A. Daneshgar, | Forcing and graph colourings, Combinatorics Day VII, (IPM) Dec. |
17th, 1997. | |
[8] A. Daneshgar, | On fractional Hall numbers and fractional choice numbers, |
Combinatorics Day VIII, (IPM) July 28th, 1998. | |
[9] A. Daneshgar | and R. Naserasr, On the fixing number of graphs, Combinatorics Day |
VIII, (IPM) July 28th, 1998. | |
[10] A. Daneshgar | and A. Hashemi, A general model for I/O system theory, Proceedings of |
AIMC31, Tehran University 27--30 Aug 2000, Tehran, Iran. |
[11] A. Daneshgar | Some new concepts in graph colouring, in Proceedings of the First |
Seminar in Graph Theory, Combinatorics and Computational Algorithms, | |
Amir-Kabir University 31st Jan. - 1st Feb. (2001), Tehran Iran. | |
[12] A. Daneshgar | Some aspects of modern cryptography, Invited speaker, 2nd Iranian |
Society of Cryptology Conference, 21st - 22nd Oct. (2003), Tehran, Iran. |
[13] A. Daneshgar | Spectral analysis of networks, Mathematics in ICT, Dept. Math. Sci., |
Sharif Univ. of Tech., Tehran, Iran, 28th Jan. (2004). |
[14] A. Daneshgar | Random walks on graphs: theory and applications, Invited speaker, 7th Iranian |
Statistical Conference, Allameh Tabatabaie Univ., Tehran, Iran, August 23-25, (2004). |
[15] A. Daneshgar | A generalization of L-fuzzy sets and its application in general system theory, Invited speaker, |
5th Iranian Conference on Fuzzy Systems, Tehran, Iran, Sep. 7-9, (2004). |
[16] A. Daneshgar | Spectral geometry on graphs and surfaces, Invited speaker, |
AIMC35, Shahid-Chamran Univ., Ahvaz, Iran, Jan. 26-29, (2005). |
[17] A. Daneshgar | Fuzziness in graphs and their morphisms, Invited speaker, |
6th Iranian Conference on Fuzzy Systems, Shiraz, Iran, May 17-19, (2006). |
[18] A. Daneshgar | Spectral geometry in discrete case, Invited speaker, |
SIMPA-UNESCO-IPM School on recent topics in geometric analysis, May 20- June 2, (2006). |
[19] A. Daneshgar | Interdisciplinary research, Invited speaker, |
IRI Academy of Science, Oct. 7, (2010). PDF |
[20] A. Daneshgar | Do graphs admit topological field theories, |
IUT Combinatorics Day, Feb. 23, (2011). PDF |
[21] A. Daneshgar | On mathematical foundations of soft computing, Invited speaker, |
11th Iranian Conference on Fuzzy Systems, Zahedan, Iran, July 4-6, (2011). |
[22] A. Daneshgar | On higher Cheeger inequalities (a computational approach), |
SUT Group of Discrete Mathematics & its Applications, Feb. 3, (2013). PDF |