Foad Mahdavi Pajouh

According to our database1, Foad Mahdavi Pajouh authored at least 17 papers between 2012 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Detecting a most closeness-central clique in complex networks.
Eur. J. Oper. Res., 2020

2019
Exact algorithms for the minimum cost vertex blocker clique problem.
Comput. Oper. Res., 2019

Exact algorithms for the minimum s-club partitioning problem.
Ann. Oper. Res., 2019

2018
Finding clique clusters with the highest betweenness centrality.
Eur. J. Oper. Res., 2018

Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights.
Ann. Oper. Res., 2018

2017
On biconnected and fragile subgraphs of low diameter.
Eur. J. Oper. Res., 2017

Detecting large risk-averse 2-clubs in graphs with random edge failures.
Ann. Oper. Res., 2017

2016
On the 2-Club Polytope of Graphs.
Oper. Res., 2016

The Minimum Spanning <i>k</i>-Core Problem with Bounded CVaR Under Probabilistic Edge Failures.
INFORMS J. Comput., 2016

2015
Minimum edge blocker dominating set problem.
Eur. J. Oper. Res., 2015

2014
On Risk-Averse Weighted k-Club Problems.
Proceedings of the Examining Robustness and Vulnerability of Networked Systems, 2014

Analysis and Design of Robust Network Clusters with Bounded Diameter.
Proceedings of the Examining Robustness and Vulnerability of Networked Systems, 2014

Minimum vertex blocker clique problem.
Networks, 2014

A branch-and-bound approach for maximum quasi-cliques.
Ann. Oper. Res., 2014

2013
A Specialty Steel Bar Company Uses Analytics to Determine Available-to-Promise Dates.
Interfaces, 2013

On characterization of maximal independent sets via quadratic optimization.
J. Heuristics, 2013

2012
On inclusionwise maximal and maximum cardinality k-clubs in graphs.
Discret. Optim., 2012


  Loading...