Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem von Balasundaram, Balabhaskar, Butenko, Sergiy, Hicks, Illya V.

Volltext

SNP variable selection by generalized graph domination von Sun, Shuzhen, Miao, Zhuqi, Ratcliffe, Blaise, Campbell, Polly, Pasch, Bret, El-Kassaby, Yousry A, Balasundaram, Balabhaskar, Chen, Charles

Volltext

An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph von Miao, Zhuqi, Balasundaram, Balabhaskar

Volltext

Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts von Moradi, Esmaeel, Balasundaram, Balabhaskar

Volltext

Approaches for finding cohesive subgroups in large‐scale social networks via maximum k‐plex detection von Miao, Zhuqi, Balasundaram, Balabhaskar

Volltext

On the chance-constrained minimum spanning k-core problem von Ma, Juan, Balasundaram, Balabhaskar

Volltext

First passage time interdiction in Markov chains von Daemi, Niloufar, Borrero, Juan S., Balasundaram, Balabhaskar

Volltext

On characterization of maximal independent sets via quadratic optimization von Mahdavi Pajouh, Foad, Balasundaram, Balabhaskar, Prokopyev, Oleg A.

Volltext

Detecting a most closeness-central clique in complex networks von Nasirian, Farzaneh, Mahdavi Pajouh, Foad, Balasundaram, Balabhaskar

Volltext

Graph signatures: Identification and optimization von Balasundaram, Balabhaskar, Borrero, Juan S., Pan, Hao

Volltext

On Fault-Tolerant Low-Diameter Clusters in Graphs von Lu, Yajun, Salemi, Hosseinali, Balasundaram, Balabhaskar, Buchanan, Austin

Volltext

Development and optimization of expected cross value for mate selection problems von Ahadi, Pouya, Balasundaram, Balabhaskar, Borrero, Juan S, Chen, Charles

Volltext

A Bayesian framework for functional calibration of expensive computational models through non-isometric matching von Farmanesh, Babak, Pourhabib, Arash, Balasundaram, Balabhaskar, Buchanan, Austin

Volltext

On atomic cliques in temporal graphs von Lu, Yajun, Miao, Zhuqi, Sahraeian, Parisa, Balasundaram, Balabhaskar

Volltext

Finding conserved low‐diameter subgraphs in social and biological networks von Pan, Hao, Lu, Yajun, Balasundaram, Balabhaskar, Borrero, Juan S.

Volltext

Interdicting Low-Diameter Cohesive Subgroups in Large-Scale Social Networks von Daemi, Niloufar, Borrero, Juan S., Balasundaram, Balabhaskar

Volltext

Significant Winter Weather Events and Associated Socioeconomic Impacts (Federal Aid Expenditures) across Oklahoma: 2000–10 von Grout, Trevor, Hong, Yang, Basara, Jeffrey, Balasundaram, Balabhaskar, Kong, Zhenyu, Bukkapatnam, Satish T. S.

Volltext

A branch-and-bound approach for maximum quasi-cliques von Mahdavi Pajouh, Foad, Miao, Zhuqi, Balasundaram, Balabhaskar

Volltext

Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations von Trukhanov, Svyatoslav, Balasubramaniam, Chitra, Balasundaram, Balabhaskar, Butenko, Sergiy

Volltext

Correction to: Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts von Lu, Yajun, Moradi, Esmaeel, Balasundaram, Balabhaskar

Volltext