Mehdi Ghiyasvand

Orcid: 0000-0001-8357-7857

According to our database1, Mehdi Ghiyasvand authored at least 19 papers between 2006 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Minimizing the expense transmission time from the source node to demand nodes.
J. Comb. Optim., April, 2024

q-ary Sequential Locally Recoverable Codes from the Product Construction.
CoRR, 2024

2023
An upper bound on the minimum distance in locally recoverable codes with multiple localities and availability.
Phys. Commun., October, 2023

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

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

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.
J. Comb. Optim., 2019

Inverse quickest center location problem on a tree.
Discret. Appl. Math., 2019

2018
Solving the MCQP, MLT, and MMLT problems and computing weakly and strongly stable quickest paths.
Telecommun. Syst., 2018

2017
A faster strongly polynomial time algorithm to solve the minimum cost tension problem.
J. Comb. Optim., 2017

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

Finding a contra-risk path between two nodes in undirected graphs.
J. Comb. Optim., 2016

2015
Minimum average relative load for online routing.
Wirel. Networks, 2015

Upper bounds for the min-max and min-sum cost online problems in wireless ad hoc networks.
Wirel. Networks, 2015

Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs.
Ann. Oper. Res., 2015

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

A Simple Approximation Algorithm for Computing Arrow-Debreu Prices.
Oper. Res., 2012

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

2007
A new algorithm for solving the feasibility problem of a network flow.
Appl. Math. Comput., 2007

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


  Loading...