Mehdi Ghiyasvand

Research activities

Journal Papers

An upper bound on the minimum distance in locally recoverable codes with multiple localities and availability , Mehdi Ghiyasvand (2023)

Computing maximum proportion and most violated sets Mehdi Ghiyasvand (2023)

Solving the Absolute 1-Center Problem in the Quickest Path Case Mehdi Ghiyasvand, (2022)

An O(|E|) time version of Wang and Shroff’s characterization for the networks with two unit-rate multicast sessions , Mehdi Ghiyasvand (2021)

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

Inverse quickest center location problem on a tree , Mehdi Ghiyasvand (2019)

An O(n(m+nlogn)logn) time algorithm to solve the minimum cost tension problem Mehdi Ghiyasvand (2019)

Solving the MCQP, MLT, and MMLT problems and computing weakly and strongly stable quickest paths Mehdi Ghiyasvand, (2018)

Adjusting an infeasible network by minimizing the sum of the violation costs Mehdi Ghiyasvand (2017)

A faster strongly polynomial time algorithm to solve the minimum cost tension problem Mehdi Ghiyasvand (2017)

An O (mn\ log U) time algorithm for estimating the maximum cost of adjusting an infeasible network Mehdi Ghiyasvand (2016)

A geometrical explanation for the optimality concept of minimum cost flows Mehdi Ghiyasvand (2016)

Minimum average relative load for online routing Mehdi Ghiyasvand, (2015)

Finding a contra-risk path between two nodes in undirected graphs Mehdi Ghiyasvand, (2015)

Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs Mehdi Ghiyasvand (2015)

Upper bounds for the min–max and min–sum cost online problems in wireless ad hoc networks Mehdi Ghiyasvand, (2015)

A scaling implementation of the tension rectification algorithm to solve the feasible differential problem Mehdi Ghiyasvand (2014)

A new polynomial-time implementation of the out-of-kilter algorithm using Mintys lemma Mehdi Ghiyasvand (2014)

Conference Papers

The relationship between the MCT and MCF problems Mehdi Ghiyasvand (2018)

Online Min-Max Quickest Path Problem and its Application in Gas Pipeline Systems , Mehdi Ghiyasvand (2014)

Maximum Reliability and Minimum Sum Load in Constraint Problems , Mehdi Ghiyasvand (2014)

A Survey of Network Virtualization , Mehdi Ghiyasvand (2013)

Online energy aware routing in wireless networks , Mehdi Ghiyasvand (2013)

Minimizing the costs of changing the bounds in order to have a feasible network Mehdi Ghiyasvand (2013)

Computing a feasible flow or diagnosing infeasibility of a network flow in O(mn log U) time Mehdi Ghiyasvand (2013)

A new algorithm to solve the minimum cost flow problem Mehdi Ghiyasvand (2013)

COMPUTING ARROW-DEBREU PRICES FOR THE CASE OF LINEAR UTILITIES Mehdi Ghiyasvand (2013)

.row3_default .researchActivities .researchTypeContent { opacity: 1; position: static; height: initial; } .row3_default .researchActivities .researchActivitiesWrapper .researchTypeTitle { visibility: visible; font-family: Arial; font-size: 1.3rem; transition: background-color .5s, color .5s; display: block; float: left; color: rgb(102, 102, 102); background-color: rgb(255, 255, 255); direction: ltr; text-align: left; padding: .5% 2%; cursor: pointer; border-radius: 5%; margin-top: 1%; } .row3_default .researchActivities .researchTypeContent table .Gv-Empty { text-align: left; direction: ltr; }