Follow
Balabhaskar Balasundaram
Balabhaskar Balasundaram
Verified email at okstate.edu - Homepage
Title
Cited by
Cited by
Year
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
B Balasundaram, S Butenko, IV Hicks
Operations Research 59 (1), 133-142, 2011
3262011
Novel approaches for analyzing biological networks
B Balasundaram, S Butenko, S Trukhanov
Journal of Combinatorial Optimization 10 (1), 23-39, 2005
1712005
Graph domination, coloring and cliques in telecommunications
B Balasundaram, S Butenko
Handbook of optimization in telecommunications, 865-890, 2006
882006
On inclusionwise maximal and maximum cardinality k-clubs in graphs
FM Pajouh, B Balasundaram
Discrete Optimization 9 (2), 84-97, 2012
712012
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
S Trukhanov, C Balasubramaniam, B Balasundaram, S Butenko
Computational Optimization and Applications 56 (1), 113-130, 2013
532013
A branch-and-bound approach for maximum quasi-cliques
F Mahdavi Pajouh, Z Miao, B Balasundaram
Annals of Operations Research 216 (1), 145-161, 2014
382014
Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts
E Moradi, B Balasundaram
Optimization Letters 12 (8), 1947-1957, 2018
282018
Graph theoretic generalizations of clique: Optimization and extensions
B Balasundaram
Texas A&M University, 2007
282007
Graph theoretic clique relaxations and applications
B Balasundaram, FM Pajouh
Handbook of combinatorial optimization, 1559-1598, 2013
232013
Constructing test functions for global optimization using continuous formulations of graph problems
B Balasundaram, S Butenko
Optimization Methods and Software 20 (4-5), 439-452, 2005
222005
Optimization Problems in Unit-Disk Graphs.
B Balasundaram, S Butenko
Encyclopedia of Optimization, 2832-2844, 2009
212009
Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
B Balasundaram, SS Chandramouli, S Trukhanov
Optimization Letters 4 (3), 311-320, 2010
202010
Network clustering
B Balasundaram, S Butenko
Analysis of Biological Networks, Wiley Series on Bioinformatics …, 2008
192008
Network clustering
B Balasundaram, S Butenko
Analysis of Biological Networks, Wiley Series on Bioinformatics …, 2008
192008
Approaches for finding cohesive subgroups in large‐scale social networks via maximum k‐plex detection
Z Miao, B Balasundaram
Networks 69 (4), 388-407, 2017
162017
Significant winter weather events and associated socioeconomic impacts (federal aid expenditures) across Oklahoma: 2000–10
T Grout, Y Hong, J Basara, B Balasundaram, Z Kong, STS Bukkapatnam
Weather, Climate, and Society 4 (1), 48-58, 2012
162012
On the 2-club polytope of graphs
FM Pajouh, B Balasundaram, IV Hicks
Operations Research 64 (6), 1466-1481, 2016
152016
Detecting a most closeness-central clique in complex networks
F Nasirian, FM Pajouh, B Balasundaram
European Journal of Operational Research 283 (2), 461-475, 2020
142020
Cohesive subgroup model for graph-based text mining
B Balasundaram
2008 IEEE International Conference on Automation Science and Engineering …, 2008
142008
An exact algorithm for the maximum probabilistic clique problem
Z Miao, B Balasundaram, EL Pasiliao
Journal of Combinatorial Optimization 28 (1), 105-120, 2014
122014
The system can't perform the operation now. Try again later.
Articles 1–20