Mehdi Ghiyasvand

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 14

Top Topics

Ad Hoc Networks

Approximation Ratio

Top Venues

J. Comb. Optim.

Wirel. Networks

Telecommun. Syst.

Publications

Mehdi Ghiyasvand, Iman Keshtkar
Minimizing the expense transmission time from the source node to demand nodes. J. Comb. Optim. 47 (3) (2024)
Akram Baghban, Marc Newman, Anna-Lena Horlemann, Mehdi Ghiyasvand
q-ary Sequential Locally Recoverable Codes from the Product Construction. CoRR (2024)
Anahita Kazemi, Mehdi Ghiyasvand
An upper bound on the minimum distance in locally recoverable codes with multiple localities and availability. Phys. Commun. 60 (2023)
Sepideh Ghazvineh, Mehdi Ghiyasvand
An O(|E|) time version of Wang and Shroff's characterization for the networks with two unit-rate multicast sessions. Phys. Commun. 47 (2021)
Sepideh Ghazvineh, Mehdi Ghiyasvand
An O(|E|) time algorithm to find a bottleneck link in single rate two-pair networks. Phys. Commun. 43 (2020)
Iman Keshtkar, Mehdi Ghiyasvand
Inverse quickest center location problem on a tree. Discret. Appl. Math. 260 (2019)
Mehdi Ghiyasvand
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. J. Comb. Optim. 37 (3) (2019)
Mehdi Ghiyasvand, Azam Ramezanipour
Solving the MCQP, MLT, and MMLT problems and computing weakly and strongly stable quickest paths. Telecommun. Syst. 68 (2) (2018)
Mehdi Ghiyasvand
A faster strongly polynomial time algorithm to solve the minimum cost tension problem. J. Comb. Optim. 34 (1) (2017)
Mehdi Ghiyasvand
An O (mn log U ) time algorithm for estimating the maximum cost of adjusting an infeasible network. Telecommun. Syst. 63 (4) (2016)
Mehdi Ghiyasvand, Iman Keshtkar
Finding a contra-risk path between two nodes in undirected graphs. J. Comb. Optim. 32 (3) (2016)
Mehdi Ghiyasvand
Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs. Ann. Oper. Res. 229 (1) (2015)
Mehdi Ghiyasvand, Iman Keshtkar
Upper bounds for the min-max and min-sum cost online problems in wireless ad hoc networks. Wirel. Networks 21 (3) (2015)
Mehdi Ghiyasvand, Azam Ramezanipour
Minimum average relative load for online routing. Wirel. Networks 21 (8) (2015)
Mehdi Ghiyasvand, James B. Orlin
A Simple Approximation Algorithm for Computing Arrow-Debreu Prices. Oper. Res. 60 (5) (2012)
Mehdi Ghiyasvand
An O(m(m + n log n) log(n C))-time algorithm to solve the minimum cost tension problem. Theor. Comput. Sci. 448 (2012)
Mehdi Ghiyasvand
A New Approach for Solving the Minimum Cost Flow Problem with Interval and Fuzzy Data. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 19 (1) (2011)
Hassan Salehi Fathabadi, Mehdi Ghiyasvand
A new algorithm for solving the feasibility problem of a network flow. Appl. Math. Comput. 192 (2) (2007)
Mehdi Ghiyasvand
A new approach for computing a most positive cut using the minimum flow algorithms. Appl. Math. Comput. 176 (1) (2006)