Solving a class of geometric programming problems by an efficient dynamic model. - Alireza Nazemi; Elahe Sharifi (Commun. Nonlinear Sci. Numer. Simul., 2013)

Bounds on Global Total Domination in Graphs. - Nader Jafari Rad; Elahe Sharifi (Comput. Sci. J. Moldova, 2015)

A note on the independence number in bipartite graphs. - Elahe Sharifi; Nader Jafari Rad (Australas. J Comb., 2016)

Domination stability in graphs. - Nader Jafari Rad; Elahe Sharifi; Marcin Krzywkowski (Discret. Math., 2016)

Bounds on the independence number of a graph in terms of order, size and maximum degree. - Nader Jafari Rad; Elahe Sharifi (Discret. Appl. Math., 2017)

New bounds on the independence number of connected graphs. - Nader Jafari Rad; Elahe Sharifi (Discret. Math. Algorithms Appl., 2018)

Maximum nullity and zero forcing number on graphs with maximum degree at most three. - Meysam Alishahi; Elahe Rezaei-Sani; Elahe Sharifi (Discret. Appl. Math., 2020)