Similar Search Results

Detecting robust cliques in graphs subject to uncertain edge failures

Yezerska, Oleksandra; Butenko, Sergiy; Boginski, Vladimir L. - In: Risk management approaches in engineering applications, (pp. 109-132). 2018

Persistent link: https://www.econbiz.de/10011870005

On biconnected and fragile subgraphs of low diameter

Yezerska, Oleksandra; Mahdavi Pajouh, Foad; Butenko, Sergiy - In: European journal of operational research : EJOR 263 (2017) 2, pp. 390-400

Persistent link: https://www.econbiz.de/10011793928

Exact algorithms for the minimum s-club partitioning problem

Yezerska, Oleksandra; Mahdavi Pajouh, Foad; Veremyev, … - In: Computational biomedicine, (pp. 267-291). 2019

Persistent link: https://www.econbiz.de/10012017790

Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations

Trukhanov, Svyatoslav; Balasubramaniam, Chitra; … - In: Computational Optimization and Applications 56 (2013) 1, pp. 113-130

Given a simple undirected graph, the problem of finding a maximum subset of vertices satisfying a nontrivial, interesting property Π that is hereditary on induced subgraphs, is known to be NP-hard. Many well-known graph properties meet the above conditions, making the problem widely applicable....

Persistent link: https://www.econbiz.de/10010998329

The minimum spanning k-core problem with bounded CVaR under probabilistic edge failures

Ma, Juan; Mahdavi Pajouh, Foad; Balasundaram, Balabhaskar; … - In: INFORMS journal on computing : JOC 28 (2016) 2, pp. 295-307

Persistent link: https://www.econbiz.de/10011489338

On the 2-club polytope of graphs

Mahdavi Pajouh, Foad; Balasundaram, Balabhaskar; Hicks, … - In: Operations research 64 (2016) 6, pp. 1466-1481

Persistent link: https://www.econbiz.de/10011620704

Detecting large risk-averse 2-clubs in graphs with random edge failures

Mahdavi Pajouh, Foad; Moradi, Esmaeel; Balasundaram, … - In: Applied optimization and data mining : dedicated to Dr. …, (pp. 55-73). 2017

Persistent link: https://www.econbiz.de/10011616174

Detecting a most closeness-central clique in complex networks

Nasirian, Farzaneh; Mahdavi Pajouh, Foad; Balasundaram, … - In: European journal of operational research : EJOR 283 (2020) 2, pp. 461-475

Persistent link: https://www.econbiz.de/10012294843

An ellipsoidal bounding scheme for the quasi-clique number of a graph

Miao, Zhuqi; Balasundaram, Balabhaskar - In: INFORMS journal on computing : JOC 32 (2020) 3, pp. 763-778

Persistent link: https://www.econbiz.de/10012294727

Interdicting low-diameter cohesive subgroups in large-scale social networks

Daemi, Niloufar; Borrero, Juan S.; Balasundaram, Balabhaskar - In: INFORMS journal on optimization 4 (2022) 3, pp. 304-325

Persistent link: https://www.econbiz.de/10013373202