Balabhaskar Balasundaram

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 16

Top Venues

Texas A&M University, College Station, USA (PHD)

Education History

Texas A&M University, College Station, USA

PHD

Publications

Niloufar Daemi, Juan Sebastian Borrero, Balabhaskar Balasundaram
First passage time interdiction in Markov chains. Oper. Res. Lett. 54 (2024)
Yajun Lu, Zhuqi Miao, Parisa Sahraeian, Balabhaskar Balasundaram
On atomic cliques in temporal graphs. Optim. Lett. 17 (4) (2023)
Hao Pan, Balabhaskar Balasundaram, Juan Sebastian Borrero
A Decomposition Branch-and-Cut Algorithm for the Maximum Cross-Graph k-Club Problem. INOC (2022)
Balabhaskar Balasundaram, Juan Sebastian Borrero, Hao Pan
Graph signatures: Identification and optimization. Eur. J. Oper. Res. 296 (3) (2022)
Niloufar Daemi, Juan Sebastian Borrero, Balabhaskar Balasundaram
Interdicting Low-Diameter Cohesive Subgroups in Large-Scale Social Networks. INFORMS J. Optim. 4 (3) (2022)
Yajun Lu, Hosseinali Salemi, Balabhaskar Balasundaram, Austin Buchanan
On Fault-Tolerant Low-Diameter Clusters in Graphs. INFORMS J. Comput. 34 (6) (2022)
Babak Farmanesh, Arash Pourhabib, Balabhaskar Balasundaram, Austin Buchanan
A Bayesian framework for functional calibration of expensive computational models through non-isometric matching. IISE Trans. 53 (3) (2021)
Farzaneh Nasirian, Foad Mahdavi Pajouh, Balabhaskar Balasundaram
Detecting a most closeness-central clique in complex networks. Eur. J. Oper. Res. 283 (2) (2020)
Zhuqi Miao, Balabhaskar Balasundaram
An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph. INFORMS J. Comput. 32 (3) (2020)
Juan Ma, Balabhaskar Balasundaram
On the chance-constrained minimum spanning k-core problem. J. Glob. Optim. 74 (4) (2019)
Yajun Lu, Esmaeel Moradi, Balabhaskar Balasundaram
Correction to: Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts. Optim. Lett. 12 (8) (2018)
Esmaeel Moradi, Balabhaskar Balasundaram
Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts. Optim. Lett. 12 (8) (2018)
Zhuqi Miao, Balabhaskar Balasundaram
-plex detection. Networks 69 (4) (2017)
Foad Mahdavi Pajouh, Esmaeel Moradi, Balabhaskar Balasundaram
Detecting large risk-averse 2-clubs in graphs with random edge failures. Ann. Oper. Res. 249 (1-2) (2017)
Juan Ma, Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Vladimir Boginski
-Core Problem with Bounded CVaR Under Probabilistic Edge Failures. INFORMS J. Comput. 28 (2) (2016)
Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Illya V. Hicks
On the 2-Club Polytope of Graphs. Oper. Res. 64 (6) (2016)
Zhuqi Miao, Balabhaskar Balasundaram, Eduardo L. Pasiliao
An exact algorithm for the maximum probabilistic clique problem. J. Comb. Optim. 28 (1) (2014)
Foad Mahdavi Pajouh, Zhuqi Miao, Balabhaskar Balasundaram
A branch-and-bound approach for maximum quasi-cliques. Ann. Oper. Res. 216 (1) (2014)
Svyatoslav Trukhanov, Chitra Balasubramaniam, Balabhaskar Balasundaram, Sergiy Butenko
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations. Comput. Optim. Appl. 56 (1) (2013)
Foad Mahdavi Pajouh, Dahai Xing, Yingjue Zhou, Sharethram Hariharan, Balabhaskar Balasundaram, Tieming Liu, Ramesh Sharda
A Specialty Steel Bar Company Uses Analytics to Determine Available-to-Promise Dates. Interfaces 43 (6) (2013)
Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Oleg A. Prokopyev
On characterization of maximal independent sets via quadratic optimization. J. Heuristics 19 (4) (2013)
Marco Carvalho, Alexey Sorokin, Vladimir Boginski, Balabhaskar Balasundaram
Topology design for on-demand dual-path routing in wireless networks. Optim. Lett. 7 (4) (2013)
Sergiy Butenko, Oleksandra Yezerska, Balabhaskar Balasundaram
Variable objective search. J. Heuristics 19 (4) (2013)
Foad Mahdavi Pajouh, Balabhaskar Balasundaram
On inclusionwise maximal and maximum cardinality k-clubs in graphs. Discret. Optim. 9 (2) (2012)
Balabhaskar Balasundaram, Sergiy Butenko, Illya V. Hicks
-Plex Problem. Oper. Res. 59 (1) (2011)
Balabhaskar Balasundaram, Shyam Sundar Chandramouli, Svyatoslav Trukhanov
-plexes. Optim. Lett. 4 (3) (2010)
Balabhaskar Balasundaram, Sergiy Butenko
On a Polynomial Fractional Formulation for Independence Number of a Graph. J. Glob. Optim. 35 (3) (2006)
Balabhaskar Balasundaram, Sergiy Butenko
Constructing test functions for global optimization using continuous formulations of graph problems. Optim. Methods Softw. 20 (4-5) (2005)
Balabhaskar Balasundaram, Sergiy Butenko, Svyatoslav Trukhanov
Novel Approaches for Analyzing Biological Networks. J. Comb. Optim. 10 (1) (2005)

Balabhaskar Balasundaram.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Balabhaskar Balasundaram