Balabhaskar Balasundaram

According to our database1, Balabhaskar Balasundaram authored at least 25 papers between 2005 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph.
INFORMS J. Comput., 2020

Detecting a most closeness-central clique in complex networks.
Eur. J. Oper. Res., 2020

2019
On the chance-constrained minimum spanning k-core problem.
J. Glob. Optim., 2019

2018
Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts.
Optim. Lett., 2018

Correction to: Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts.
Optim. Lett., 2018

2017
Approaches for finding cohesive subgroups in large-scale social networks via maximum <i>k</i>-plex detection.
Networks, 2017

Detecting large risk-averse 2-clubs in graphs with random edge failures.
Ann. Oper. Res., 2017

2016
On the 2-Club Polytope of Graphs.
Oper. Res., 2016

The Minimum Spanning <i>k</i>-Core Problem with Bounded CVaR Under Probabilistic Edge Failures.
INFORMS J. Comput., 2016

2014
An exact algorithm for the maximum probabilistic clique problem.
J. Comb. Optim., 2014

A branch-and-bound approach for maximum quasi-cliques.
Ann. Oper. Res., 2014

2013
Topology design for on-demand dual-path routing in wireless networks.
Optim. Lett., 2013

A Specialty Steel Bar Company Uses Analytics to Determine Available-to-Promise Dates.
Interfaces, 2013

On characterization of maximal independent sets via quadratic optimization.
J. Heuristics, 2013

Variable objective search.
J. Heuristics, 2013

Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations.
Comput. Optim. Appl., 2013

2012
On inclusionwise maximal and maximum cardinality k-clubs in graphs.
Discret. Optim., 2012

2011
Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem.
Oper. Res., 2011

2010
Approximation algorithms for finding and partitioning unit-disk graphs into co-<i>k</i>-plexes.
Optim. Lett., 2010

2009
Optimization Problems in Unit-Disk Graphs.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Graph theoretic generalizations of clique: optimization and extensions.
PhD thesis, 2009

2006
On a Polynomial Fractional Formulation for Independence Number of a Graph.
J. Glob. Optim., 2006

Graph Domination, Coloring and Cliques in Telecommunications.
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

Novel Approaches for Analyzing Biological Networks.
J. Comb. Optim., 2005


  Loading...