An extended method using TOPSIS and VIKOR for multiple attribute decision making with multiple decision makers and single valued neutrosophic numbers H Pouresmaeil, E Shivanian, E Khorram, HS Fathabadi Adv. Appl. Stat 50, 261-292, 2017 | 62 | 2017 |

Minimum cost multiple multicast network coding with quantized rates MA Raayatpanah, HS Fathabadi, BH Khalaj, S Khodayifar Computer Networks 57 (5), 1113-1123, 2013 | 27 | 2013 |

Reliability evaluation of network flows with stochastic capacity and cost constraint HS Fathabadi, M Khodaei International Journal of Mathematics in Operational Research 4 (4), 439-452, 2012 | 24 | 2012 |

Maximum flow problem on dynamic generative network flows with time-varying bounds HS Fathabadi, SA Hosseini Applied mathematical modelling 34 (8), 2136-2147, 2010 | 17 | 2010 |

Bounds on end-to-end statistical delay and jitter in multiple multicast coded packet networks MA Raayatpanah, HS Fathabadi, BH Khalaj, S Khodayifar, PM Pardalos Journal of Network and Computer Applications 41, 217-227, 2014 | 15 | 2014 |

Minimum flow problem on network flows with time-varying bounds HS Fathabadi, S Khodayifar, MA Raayatpanah Applied Mathematical Modelling 36 (9), 4414-4421, 2012 | 15 | 2012 |

A new algorithm for solving the feasibility problem of a network flow HS Fathabadi, M Ghiyasvand Applied Mathematics and Computation 192 (2), 429-438, 2007 | 15 | 2007 |

A note on “A simple approach to search for all d-MCs of a limited-flow network” HS Fathabadi, M Forghani-elahabadi Reliability Engineering & System Safety 94 (11), 1878-1880, 2009 | 11 | 2009 |

A simple algorithm for reliability evaluation in dynamic networks with stochastic transit times HS Fathabadi, S Khezri, S Khodayifar Journal of Industrial and Production Engineering 32 (2), 115-120, 2015 | 10 | 2015 |

Determining all minimal paths of a network HS Fathabadi, M Soltanifar, A Ebrahimnejad, SH Nasseri Australian Journal of Basic and Applied Sciences 3 (4), 3771-3777, 2009 | 9 | 2009 |

AN O (nm^ sup 2^) TIME ALGORITHM FOR SOLVING MINIMAL COST NETWORK FLOW PROBLEMS HS Fathabadi, GH Shirdel Asia-Pacific Journal of Operational Research 20 (2), 161, 2003 | 9 | 2003 |

A fast algorithm for the partial digest problem R Nadimi, HS Fathabadi, M Ganjtabesh Japan journal of industrial and applied mathematics 28, 315-325, 2011 | 8 | 2011 |

Multi-sourcesinks network flow interdiction problem R Keshavarzi, HS Fathabadi International Journal of Academic Research 7 (2), 108-115, 2015 | 4 | 2015 |

Minimum cost flow problem on dynamic multi generative networks SA Hosseini, HS Fathabadi Algorithmic Operations Research 5 (1), 39-48, 2010 | 4 | 2010 |

Behavior of Limit Cycles in Nonlinear Systems H Fathabadi International Journal of Information and Electronics Engineering 2 (4), 523, 2012 | 3 | 2012 |

An Interval Model in Interdiction Network Flow R Keshavarzi International Journal of Industrial Mathematics 13 (3), 279-285, 2021 | 1 | 2021 |

Survivable multi-commodity network flow design: case of node capacities and arc failure M Anisi, HS Fathabadi International Journal of Operational Research 35 (3), 355-365, 2019 | 1 | 2019 |

A SOLUTION TO THE INVERSE MINIMUM CUT PROBLEM IN DYNAMIC NETWORK FLOWS H Banikhademi, HS Fathabadi Advances and Applications in Statistics 49 (4), 267, 2016 | | 2016 |

Survivable Network Design Problem in the Case of Arc Failure M Anisi, HS Fathabadi Indian Journal of Science and Technology 8 (S8), 484-492, 2015 | | 2015 |

Maximum Flow in Self-Similar Flow Networks HS Fathabadi, M Toloo Management Science and Financial Engineering 8 (1), 39-51, 2002 | | 2002 |