Publications

Hao Pan, Yajun Lu, Balabhaskar Balasundaram, Juan S. Borrero (2024). Finding conserved low-diameter subgraphs in social and biological networks. Networks.

PDF DOI

Pouya Ahadi, Balabhaskar Balasundaram, Juan S. Borrero, Charles Chen (2024). Development and optimization of expected cross value for mate selection problems. Heredity.

PDF DOI

Niloufar Daemi, Juan S. Borrero, Balabhaskar Balasundaram (2024). First passage time interdiction in Markov chains. Operations Research Letters.

PDF DOI

Yajun Lu, Zhuqi Miao, Parisa Sahraeian, Balabhaskar Balasundaram (2023). On atomic cliques in temporal graphs. Optimization Letters.

PDF DOI

Yajun Lu, Hosseinali Salemi, Balabhaskar Balasundaram, Austin Buchanan (2022). On fault-tolerant low-diameter clusters in graphs. INFORMS Journal on Computing.

PDF DOI

Niloufar Daemi, Juan S. Borrero, Balabhaskar Balasundaram (2022). Interdicting low-diameter cohesive subgroups in large-scale social networks. INFORMS Journal on Optimization.

PDF DOI

Hao Pan, Balabhaskar Balasundaram, Juan S. Borrero (2022). A decomposition branch-and-cut algorithm for the maximum cross-graph $k$-club problem. Proceedings of the 10th International Network Optimization Conference (INOC 2022).

PDF

Balabhaskar Balasundaram, Juan S. Borrero, Hao Pan (2022). Graph signatures: Identification and optimization. European Journal of Operational Research.

PDF DOI

Babak Farmanesh, Arash Pourhabib, Balabhaskar Balasundaram, Austin Buchanan (2021). A Bayesian framework for functional calibration of expensive computational models through non-isometric matching. IISE Transactions.

PDF DOI

Zhuqi Miao, Balabhaskar Balasundaram (2020). An ellipsoidal bounding scheme for the quasi-clique number of a graph. INFORMS Journal on Computing.

PDF DOI

Farzaneh Nasirian, Foad Mahdavi Pajouh, Balabhaskar Balasundaram (2020). Detecting a most closeness-central clique in complex networks. European Journal of Operational Research.

PDF DOI

Juan Ma, Balabhaskar Balasundaram (2019). On the chance-constrained minimum spanning $k$-core problem. Journal of Global Optimization.

PDF DOI

Shuzhen Sun, Zhuqi Miao, Blaise Ratcliffe, Polly Campbell, Bret Pasch, Yousry A. El-Kassaby, Balabhaskar Balasundaram, Charles Chen (2019). SNP variable selection by generalized graph domination. PLoS ONE.

PDF DOI

Esmaeel Moradi, Balabhaskar Balasundaram (2018). Finding a maximum $k$-club using the $k$-clique formulation and canonical hypercube cuts. Optimization Letters.

PDF DOI

Yajun Lu, Esmaeel Moradi, Balabhaskar Balasundaram (2018). Correction to: Finding a maximum $k$-club using the $k$-clique formulation and canonical hypercube cuts. Optimization Letters.

PDF DOI

Zhuqi Miao, Balabhaskar Balasundaram (2017). Approaches for finding cohesive subgroups in large-scale social networks via maximum $k$-plex detection. Networks.

PDF DOI

Foad Mahdavi Pajouh, Esmaeel Moradi, Balabhaskar Balasundaram (2017). Detecting large risk-averse 2-clubs in graphs with random edge failures. Annals of Operations Research.

PDF DOI

Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Illya V. Hicks (2016). On the 2-club polytope of graphs. Operations Research.

PDF DOI

Juan Ma, Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Vladimir Boginski (2016). The minimum spanning $k$-core problem with bounded CVaR under probabilistic edge failures. INFORMS Journal on Computing.

PDF DOI

Zhuqi Miao, Balabhaskar Balasundaram, Eduardo L. Pasiliao (2014). An exact algorithm for the maximum probabilistic clique problem. Journal of Combinatorial Optimization.

PDF DOI

Foad Mahdavi Pajouh, Zhuqi Miao, Balabhaskar Balasundaram (2014). A branch-and-bound approach for maximum quasi-cliques. Annals of Operations Research.

PDF DOI

Svyatoslav Trukhanov, Chitra Balasubramaniam, Balabhaskar Balasundaram, Sergiy Butenko (2013). Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations. Computational Optimization and Applications.

PDF DOI

Sergiy Butenko, Oleksandra Yezerska, Balabhaskar Balasundaram (2013). Variable objective search. Journal of Heuristics.

PDF DOI

Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Oleg A. Prokopyev (2013). On characterization of maximal independent sets via quadratic optimization. Journal of Heuristics.

PDF DOI

Marco Carvalho, Alexey Sorokin, Vladimir Boginski, Balabhaskar Balasundaram (2013). Topology design for on-demand dual-path routing in wireless networks. Optimization Letters.

PDF DOI

Juan Ma, Balabhaskar Balasundaram (2013). Solving chance-constrained spanning $k$-core problem via decomposition and integer programming. Proceedings of the 2013 Industrial and Systems Engineering Research Conference (ISERC 2013).

PDF

Balabhaskar Balasundaram, Foad Mahdavi Pajouh (2013). Graph theoretic clique relaxations and applications. Handbook of Combinatorial Optimization.

PDF DOI

Foad Mahdavi Pajouh, Dahai Xing, Yingjue Zhou, Sharethram Hariharan, Balabhaskar Balasundaram, Tieming Liu, Ramesh Sharda (2013). A specialty steel bar company uses analytics to determine available-to-promise dates. INFORMS Journal on Applied Analytics.

PDF DOI

Foad Mahdavi Pajouh, Balabhaskar Balasundaram (2012). On inclusionwise maximal and maximum cardinality $k$-clubs in graphs. Discrete Optimization.

PDF DOI

Trevor Grout, Yang Hong, Jeffrey Basara, Balabhaskar Balasundaram, Zhenyu Kong, Satish T. S. Bukkapatnam (2012). Significant winter weather events and associated socioeconomic impacts (federal aid expenditures) across Oklahoma: 2000-2010. Weather, Climate, and Society.

PDF DOI

Zhuqi Miao, Balabhaskar Balasundaram (2012). Cluster detection in large-scale social networks using $k$-plexes. Proceedings of the 2012 Industrial and Systems Engineering Research Conference (ISERC 2012).

PDF

Foad Mahdavi Pajouh, Balabhaskar Balasundaram (2011). Gradient-type methods. Wiley Encyclopedia of Operations Research and Management Science.

PDF DOI

Balabhaskar Balasundaram, Sergiy Butenko, Illya V. Hicks (2011). Clique relaxations in social network analysis: The maximum $k$-plex problem. Operations Research.

PDF DOI

Balabhaskar Balasundaram, Shyam S. Chandramouli, Svyatoslav Trukhanov (2010). Approximation algorithms for finding and partitioning unit-disk graphs into co-$k$-plexes. Optimization Letters.

PDF DOI

Balabhaskar Balasundaram, Sergiy Butenko (2009). Optimization problems in unit-disk graphs. Encyclopedia of Optimization.

PDF DOI

Peerapol Sittivijan, Manjunath Kamath, Balabhaskar Balasundaram (2009). Models for clustering commodities into logistical families. Proceedings of the 2009 International Conference on Value Chain Sustainability (ICOVACS 2009).

Balabhaskar Balasundaram (2008). Cohesive subgroup model for graph-based text mining. Proceedings of the 2008 IEEE International Conference on Automation Science and Engineering (CASE 2008).

PDF DOI

Balabhaskar Balasundaram, Sergiy Butenko (2008). Network clustering. Analysis of Biological Networks.

PDF DOI

Balabhaskar Balasundaram (2007). Graph theoretic generalizations of clique: Optimization and extensions.

PDF

Balabhaskar Balasundaram, Sergiy Butenko (2006). On a polynomial fractional formulation for independence number of a graph. Journal of Global Optimization.

PDF DOI

Balabhaskar Balasundaram, Sergiy Butenko (2006). Graph domination, coloring and cliques in telecommunications. Handbook of Optimization in Telecommunications.

PDF DOI

Balabhaskar Balasundaram, Sergiy Butenko, Svyatoslav Trukhanov (2005). Novel approaches for analyzing biological networks. Journal of Combinatorial Optimization.

PDF DOI

Balabhaskar Balasundaram, Sergiy Butenko (2005). Constructing test functions for global optimization using continuous formulations of graph problems. Journal of Optimization Methods and Software.

PDF DOI

G. Srinivasan, B. Balasundaram, V. Karthik (2001). Minimizing squared deviation of completion times about a common due date - algorithms and heuristics. Proceedings of the Ist International Conference on Logistics and Supply Chain Management.

PDF