Mehdi Ghiyasvand

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