F. Mahdavi Pajouh

MaRDI QIDQ319912zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On interdicting dense clusters in a network INFORMS Journal on Computing	2025-11-19	Paper
On designing networks resilient to clique blockers European Journal of Operational Research	2023-07-03	Paper
Integer Programming Formulations for Minimum Spanning Tree Interdiction INFORMS Journal on Computing	2022-06-28	Paper
Minimum cost edge blocker clique problem Annals of Operations Research	2021-01-07	Paper
Detecting a most closeness-central clique in complex networks European Journal of Operational Research	2020-01-23	Paper
Exact algorithms for the minimum \(s\)-club partitioning problem Annals of Operations Research	2019-10-18	Paper
Analysis and design of robust network clusters with bounded diameter	2019-05-28	Paper
scientific article; zbMATH DE number 7059787 (Why is no real title available?)	2019-05-28	Paper
Exact algorithms for the minimum cost vertex blocker clique problem Computers & Operations Research	2018-12-17	Paper
Finding clique clusters with the highest betweenness centrality European Journal of Operational Research	2018-07-25	Paper
Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights Annals of Operations Research	2018-06-13	Paper
Minimum vertex blocker clique problem Networks	2018-05-23	Paper
On biconnected and fragile subgraphs of low diameter European Journal of Operational Research	2018-02-06	Paper
On characterization of maximal independent sets via quadratic optimization Journal of Heuristics	2017-06-27	Paper
Detecting large risk-averse 2-clubs in graphs with random edge failures Annals of Operations Research	2017-03-07	Paper
On the 2-club polytope of graphs Operations Research	2017-01-26	Paper
Minimum edge blocker dominating set problem European Journal of Operational Research	2016-10-06	Paper
The minimum spanning k-core problem with bounded CVaR under probabilistic edge failures INFORMS Journal on Computing	2016-08-12	Paper
A branch-and-bound approach for maximum quasi-cliques Annals of Operations Research	2014-09-26	Paper
On inclusionwise maximal and maximum cardinality k-clubs in graphs Discrete Optimization	2012-09-11	Paper

Research outcomes over time

This page was built for person: F. Mahdavi Pajouh