Balabhaskar Balasundaram
According to our database^{1},
Balabhaskar Balasundaram
authored at least 25 papers
between 2005 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2020
INFORMS J. Comput., 2020
Eur. J. Oper. Res., 2020
2019
J. Glob. Optim., 2019
2018
Finding a maximum kclub using the kclique formulation and canonical hypercube cuts.
Optim. Lett., 2018
Correction to: Finding a maximum kclub using the kclique formulation and canonical hypercube cuts.
Optim. Lett., 2018
2017
Approaches for finding cohesive subgroups in largescale social networks via maximum <i>k</i>plex detection.
Networks, 2017
Ann. Oper. Res., 2017
2016
Oper. Res., 2016
The Minimum Spanning <i>k</i>Core Problem with Bounded CVaR Under Probabilistic Edge Failures.
INFORMS J. Comput., 2016
2014
J. Comb. Optim., 2014
Ann. Oper. Res., 2014
2013
Optim. Lett., 2013
A Specialty Steel Bar Company Uses Analytics to Determine AvailabletoPromise Dates.
Interfaces, 2013
J. Heuristics, 2013
J. Heuristics, 2013
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations.
Comput. Optim. Appl., 2013
2012
Discret. Optim., 2012
2011
Oper. Res., 2011
2010
Approximation algorithms for finding and partitioning unitdisk graphs into co<i>k</i>plexes.
Optim. Lett., 2010
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
PhD thesis, 2009
2006
J. Glob. Optim., 2006
Proceedings of the Handbook of Optimization in Telecommunications, 2006
2005
Constructing test functions for global optimization using continuous formulations of graph problems.
Optim. Methods Softw., 2005
J. Comb. Optim., 2005