F. Mahdavi Pajouh

Available identifiers

Publication	Date of Publication	Type
On designing networks resilient to clique blockers	2023-07-03	Paper
Integer Programming Formulations for Minimum Spanning Tree Interdiction	2022-06-28	Paper
Minimum cost edge blocker clique problem	2021-01-07	Paper
Detecting a most closeness-central clique in complex networks	2020-01-23	Paper
Exact algorithms for the minimum \(s\)-club partitioning problem	2019-10-18	Paper
https://portal.mardi4nfdi.de/entity/Q5379104	2019-05-28	Paper
https://portal.mardi4nfdi.de/entity/Q5379109	2019-05-28	Paper
Exact algorithms for the minimum cost vertex blocker clique problem	2018-12-17	Paper
Finding clique clusters with the highest betweenness centrality	2018-07-25	Paper
Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights	2018-06-13	Paper
Minimum vertex blocker clique problem	2018-05-23	Paper
On biconnected and fragile subgraphs of low diameter	2018-02-06	Paper
On characterization of maximal independent sets via quadratic optimization	2017-06-27	Paper
Detecting large risk-averse 2-clubs in graphs with random edge failures	2017-03-07	Paper
On the 2-Club Polytope of Graphs	2017-01-26	Paper
Minimum edge blocker dominating set problem	2016-10-06	Paper
The Minimum Spanning k-Core Problem with Bounded CVaR Under Probabilistic Edge Failures	2016-08-12	Paper
A branch-and-bound approach for maximum quasi-cliques	2014-09-26	Paper
On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs	2012-09-11	Paper

This page was built for person: F. Mahdavi Pajouh