Connected Dominating Set Construction using an Efficient Pruning Method in Ad Hoc Networks. - Vahid Ghasemi; Seyed Naser Hashemi; Mojtaba Mozaffari (WICON, 2010)

Investigating a new formal model for autonomous virtual organisation using RAISE method. - Mohammad Reza Nami; Seyed Naser Hashemi (Int. J. Netw. Virtual Organisations, 2010)

Controlling an Influenza Outbreak in Deterministic and Stochastic Models with the Emergence and Evolution of Drug Resistance. - Fazeleh S. Salehi; Seyed Naser Hashemi (ICCSA Workshops, 2011)

Deployment of the meta heuristic Colonial Competitive Algorithm in synthesis of unequally spaced linear antenna array. - Somayeh Kazemi; Ayaz Ghorbani; Seyed Naser Hashemi (IEICE Electron. Express, 2011)

New Heuristics for Rooted Triplet Consistency. - Soheil Jahangiri; Seyed Naser Hashemi; Hadi Poormohammadi (Algorithms, 2013)

Multi-objective path planning in discrete space. - Mansoor Davoodi Monfared; Fatemeh Panahi; Ali Mohades; Seyed Naser Hashemi (Appl. Soft Comput., 2013)

Geometric algorithm for dominant point extraction from shape contour. - Maedeh S. Tahaei; Seyed Naser Hashemi; Ali Mohades; Amin Gheibi (Pattern Anal. Appl., 2014)

Clear and smooth path planning. - Mansoor Davoodi Monfared; Fatemeh Panahi; Ali Mohades; Seyed Naser Hashemi (Appl. Soft Comput., 2015)

Application of hierarchical clustering technique for numerical tectonic regionalization of the Zagros region (Iran). - Seyed Naser Hashemi; Rezvan Mehdizadeh (Earth Sci. Informatics, 2015)

Approximation Algorithms for Directed Multi-Multiway Cut and Directed Multicut Problems. - Seyed Naser Hashemi; Ramin Yarinezhad (CoRR, 2016)

Graph Characterization by Counting Sink Star Subgraphs. - Maedeh S. Tahaei; Seyed Naser Hashemi (J. Math. Imaging Vis., 2017)

An Efficient Approximation for Point-set Diameter in Higher Dimensions. - Mahdi Imanparast; Seyed Naser Hashemi; Ali Mohades (CCCG, 2018)

Better approximation algorithm for point-set diameter. - Mahdi Imanparast; Seyed Naser Hashemi (CoRR, 2018)

A routing algorithm for wireless sensor networks based on clustering and an fpt-approximation algorithm. - Ramin Yarinezhad; Seyed Naser Hashemi (J. Syst. Softw., 2019)

Solving the load balanced clustering and routing problems in WSNs with an fpt-approximation algorithm and a grid structure. - Ramin Yarinezhad; Seyed Naser Hashemi (Pervasive Mob. Comput., 2019)

A linear time randomized approximation algorithm for Euclidean matching. - Mahdi Imanparast; Seyed Naser Hashemi (J. Supercomput., 2019)

Distributed faulty node detection and recovery scheme for wireless sensor networks using cellular learning automata. - Ramin Yarinezhad; Seyed Naser Hashemi (Wirel. Networks, 2019)

Increasing the lifetime of sensor networks by a data dissemination model based on a new approximation algorithm. - Ramin Yarinezhad; Seyed Naser Hashemi (Ad Hoc Networks, 2020)

Exact and approximate algorithms for clustering problem in wireless sensor networks. - Ramin Yarinezhad; Seyed Naser Hashemi (IET Commun., 2020)

A sensor deployment approach for target coverage problem in wireless sensor networks. - Ramin Yarinezhad; Seyed Naser Hashemi (J. Ambient Intell. Humaniz. Comput., 2023)