A new approach for computing a most positive cut using the minimum flow algorithms. - Mehdi Ghiyasvand (Appl. Math. Comput., 2006)

A new algorithm for solving the feasibility problem of a network flow. - Hassan Salehi Fathabadi; Mehdi Ghiyasvand (Appl. Math. Comput., 2007)

A New Approach for Solving the Minimum Cost Flow Problem with Interval and Fuzzy Data. - Mehdi Ghiyasvand (Int. J. Uncertain. Fuzziness Knowl. Based Syst., 2011)

A Simple Approximation Algorithm for Computing Arrow-Debreu Prices. - Mehdi Ghiyasvand; James B. Orlin (Oper. Res., 2012)

An O(m(m + n log n) log(n C))-time algorithm to solve the minimum cost tension problem. - Mehdi Ghiyasvand (Theor. Comput. Sci., 2012)

Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs. - Mehdi Ghiyasvand (Ann. Oper. Res., 2015)

Upper bounds for the min-max and min-sum cost online problems in wireless ad hoc networks. - Mehdi Ghiyasvand; Iman Keshtkar (Wirel. Networks, 2015)

Minimum average relative load for online routing. - Mehdi Ghiyasvand; Azam Ramezanipour (Wirel. Networks, 2015)

Finding a contra-risk path between two nodes in undirected graphs. - Mehdi Ghiyasvand; Iman Keshtkar (J. Comb. Optim., 2016)

An O (mn log U ) time algorithm for estimating the maximum cost of adjusting an infeasible network. - Mehdi Ghiyasvand (Telecommun. Syst., 2016)

A faster strongly polynomial time algorithm to solve the minimum cost tension problem. - Mehdi Ghiyasvand (J. Comb. Optim., 2017)

Solving the MCQP, MLT, and MMLT problems and computing weakly and strongly stable quickest paths. - Mehdi Ghiyasvand; Azam Ramezanipour (Telecommun. Syst., 2018)

Inverse quickest center location problem on a tree. - Iman Keshtkar; Mehdi Ghiyasvand (Discret. Appl. Math., 2019)

An $$O(n(m+n log n) log n)$$ O ( n ( m + n log n ) log n ) time algorithm to solve the minimum cost tension problem. - Mehdi Ghiyasvand (J. Comb. Optim., 2019)

An O(|E|) time algorithm to find a bottleneck link in single rate two-pair networks. - Sepideh Ghazvineh; Mehdi Ghiyasvand (Phys. Commun., 2020)

An O(|E|) time version of Wang and Shroff's characterization for the networks with two unit-rate multicast sessions. - Sepideh Ghazvineh; Mehdi Ghiyasvand (Phys. Commun., 2021)

An upper bound on the minimum distance in locally recoverable codes with multiple localities and availability. - Anahita Kazemi; Mehdi Ghiyasvand (Phys. Commun., 2023)

q-ary Sequential Locally Recoverable Codes from the Product Construction. - Akram Baghban; Marc Newman; Anna-Lena Horlemann; Mehdi Ghiyasvand (CoRR, 2024)

Minimizing the expense transmission time from the source node to demand nodes. - Mehdi Ghiyasvand; Iman Keshtkar (J. Comb. Optim., 2024)

New Construction of Locally q-ary Sequential Recoverable Codes: Parity-check Matrix Approach. - Akram Baghban; Mehdi Ghiyasvand (CoRR, 2025)