Balabhaskar Balasundaram, Ph.D.
Affiliations: | 2007 | Texas A & M University, College Station, TX, United States |
Area:
Operations Research, Industrial EngineeringGoogle:
"Balabhaskar Balasundaram"Parents
Sign in to add mentor| Sergiy Butenko | grad student | 2007 | Texas A & M | |
| (Graph theoretic generalizations of clique: Optimization and extensions.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Miao Z, Balasundaram B. (2020) An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph Informs Journal On Computing. 32: 763-778 |
| Nasirian F, Pajouh FM, Balasundaram B. (2020) Detecting a most closeness-central clique in complex networks European Journal of Operational Research. 283: 461-475 |
| Sun S, Miao Z, Ratcliffe B, et al. (2019) SNP variable selection by generalized graph domination. Plos One. 14: e0203242 |
| Ma J, Balasundaram B. (2019) On the chance-constrained minimum spanning k -core problem Journal of Global Optimization. 74: 783-801 |
| Lu Y, Moradi E, Balasundaram B. (2018) Correction to: Finding a maximum k -club using the k -clique formulation and canonical hypercube cuts Optimization Letters. 12: 1959-1969 |
| Pajouh FM, Moradi E, Balasundaram B. (2017) Detecting large risk-averse 2-clubs in graphs with random edge failures Annals of Operations Research. 249: 55-73 |
| Miao Z, Balasundaram B. (2017) Approaches for finding cohesive subgroups in large-scale social networks via maximum k-plex detection† Networks. 69: 388-407 |
| Pajouh FM, Balasundaram B, Hicks IV. (2016) On the 2-Club Polytope of Graphs Operations Research. 64: 1466-1481 |
| Ma J, Pajouh FM, Balasundaram B, et al. (2016) The minimum spanning k-core problem with bounded cvar under probabilistic edge failures Informs Journal On Computing. 28: 295-307 |
| Moradi E, Balasundaram B. (2015) Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts Optimization Letters. 1-11 |