Paths in m-ary interval trees. - Mehri Javanian; Hosam M. Mahmoud; Mohammad Q. Vahidi-Asl (Discret. Math., 2004)

Depth of nodes in random recursive k-ary trees. - Mehri Javanian; Mohammad Q. Vahidi-Asl (Inf. Process. Lett., 2006)

On the size of paged recursive trees. - Mehri Javanian (Discret. Math. Algorithms Appl., 2017)

Analysis of digital search trees incorporated with paging. - Mehri Javanian; Mohammad Q. Vahidi-Asl (RAIRO Theor. Informatics Appl., 2017)

Protected node profile of Tries. - Mehri Javanian (Discret. Math. Theor. Comput. Sci., 2018)

Weakly protected nodes in random binary search trees. - Ezzat Mohammad Nezhad; Mehri Javanian; Ramin Imany-Nabiyyi (RAIRO Theor. Informatics Appl., 2022)

On the protected nodes in exponential recursive trees. - Mehri Javanian; Rafik Aguech (Discret. Math. Theor. Comput. Sci., 2023)

Note on the exponential recursive k-ary trees. - Mina Ghasemi; Mehri Javanian; Ramin Imany-Nabiyyi (RAIRO Theor. Informatics Appl., 2023)

Limit Law for Zagreb and Wiener Indices of Random Exponential Recursive Trees. - Ali Q. M. Al-Saedi; Ramin Imany-Nabiyyi; Mehri Javanian (Int. J. Found. Comput. Sci., 2025)