1. Naderi, H., Rumpler, B. PERCIRS: a system to combine personalized and collaborative information retrieval, Journal of Documentation, 66(4), 2010, pp.532-562, DOI: 10.1108/00220411011052948
  2. Naderi, H., Rumpler, B., Graph-based Profile Similarity Calculation Method and Evaluation, In ACM ECIR 08, publication in Springer LNCS. ed. Glasgow , Scotland., 2008, pp. 637-641. ISSN 0302-9743, DOI: 10.1145/1363686.1363948
  3. Naderi, H., Rumpler, B., Pinon J.M., An Efficient Collaborative Information Retrieval System by Incorporating the User Profile, AMR 2006, publication in Springer LNCS 4398, Geneva, Switzerland, ISSN 0302-9743, 2007, pp 247-257, DOI: 10.1007/978-3-540-71545-0_19
  4. Naderi, H., Kangavari, M.R, and Okhovvat, M., ScEP: A Scalable and Energy Aware Protocol to Increase Network Lifetime in Wireless Sensor Networks. Wirel. Pers. Commun. 82(1), 2015, pp. 611-623, DOI: 10.1007/s11277-014-2243-8 .
  5. Sagharichian, M., Naderi, H., and Haghjoo, M., ExPregel: a new computational model for large-scale graph processing, Concurrency and Computation: Practice and Experience, 27(17), 2015, pp.4954-4969, DOI: 10.1002/cpe.3482.
  6. Dinari, H., Naderi, H., A method for improving graph queries processing using positional inverted index (P.I.I) idea in search engines and parallelization technique, Journal of Central South University, 23(1), 2016, pp. 150-159, DOI: 10.1007/s11771-016-3058-4
  7. Abbasifard, M.R., Naderi, H., Fallahnejad, Z., IsfahaniAlamdari O., Approximate aggregate nearest neighbor search on moving objects trajectories, Journal of Central South University, 22(11), 2015, pp.4954-4969, DOI: 10.1007/s11771-015-2973-0
  8. Sagharichian, M., Langouri, M.A. and Naderi, H., A fast method to exactly calculate the diameter of incremental disconnected graphs. World Wide Web, 2016, pp.1-18, DOI: 10.1007/s11280-016-0394-0
  9. Sagharichian, M., Langouri, M.A. and Naderi, H., Calculating Exact Diameter Metric of Large Static Graphs, Journal of Universal Computer Science, 22(3), pp. 302-318, 2016, free access on the link: here