{"@attributes":{"name":"Balabhaskar Balasundaram","pid":"47\/237","n":"33"},"person":{"@attributes":{"key":"homepages\/47\/237","mdate":"2020-05-11"},"author":"Balabhaskar Balasundaram","url":"https:\/\/orcid.org\/0000-0002-3490-4257"},"r":[{"article":{"@attributes":{"key":"journals\/networks\/PanLBB24","mdate":"2025-05-09"},"author":["Hao Pan","Yajun Lu","Balabhaskar Balasundaram","Juan Sebastian Borrero"],"title":"Finding conserved low-diameter subgraphs in social and biological networks.","pages":"509-527","year":"2024","volume":"84","journal":"Networks","number":"4","ee":"https:\/\/doi.org\/10.1002\/net.22246","url":"db\/journals\/networks\/networks84.html#PanLBB24"}},{"article":{"@attributes":{"key":"journals\/orl\/DaemiBB24","mdate":"2024-07-19"},"author":["Niloufar Daemi","Juan Sebastian Borrero","Balabhaskar Balasundaram"],"title":"First passage time interdiction in Markov chains.","pages":"107111","year":"2024","volume":"54","journal":"Oper. Res. Lett.","ee":"https:\/\/doi.org\/10.1016\/j.orl.2024.107111","url":"db\/journals\/orl\/orl54.html#DaemiBB24"}},{"article":{"@attributes":{"key":"journals\/ol\/LuMSB23","mdate":"2024-10-06"},"author":["Yajun Lu","Zhuqi Miao","Parisa Sahraeian","Balabhaskar Balasundaram"],"title":"On atomic cliques in temporal graphs.","pages":"813-828","year":"2023","month":"May","volume":"17","journal":"Optim. Lett.","number":"4","ee":"https:\/\/doi.org\/10.1007\/s11590-023-01975-0","url":"db\/journals\/ol\/ol17.html#LuMSB23"}},{"article":{"@attributes":{"key":"journals\/eor\/BalasundaramBP22","mdate":"2025-05-31"},"author":["Balabhaskar Balasundaram","Juan Sebastian Borrero","Hao Pan"],"title":"Graph signatures: Identification and optimization.","pages":"764-775","year":"2022","volume":"296","journal":"Eur. J. Oper. Res.","number":"3","ee":"https:\/\/doi.org\/10.1016\/j.ejor.2021.03.051","url":"db\/journals\/eor\/eor296.html#BalasundaramBP22"}},{"article":{"@attributes":{"key":"journals\/informs\/LuSBB22","mdate":"2025-03-03"},"author":["Yajun Lu","Hosseinali Salemi","Balabhaskar Balasundaram","Austin Buchanan"],"title":"On Fault-Tolerant Low-Diameter Clusters in Graphs.","pages":"3181-3199","year":"2022","volume":"34","journal":"INFORMS J. Comput.","number":"6","ee":"https:\/\/doi.org\/10.1287\/ijoc.2022.1231","url":"db\/journals\/informs\/informs34.html#LuSBB22"}},{"article":{"@attributes":{"key":"journals\/informsjop\/DaemiBB22","mdate":"2024-03-16"},"author":["Niloufar Daemi","Juan Sebastian Borrero","Balabhaskar Balasundaram"],"title":"Interdicting Low-Diameter Cohesive Subgroups in Large-Scale Social Networks.","pages":"304-325","year":"2022","month":"July","volume":"4","journal":"INFORMS J. Optim.","number":"3","ee":"https:\/\/doi.org\/10.1287\/ijoo.2021.0068","url":"db\/journals\/informsjop\/informsjop4.html#DaemiBB22"}},{"inproceedings":{"@attributes":{"key":"conf\/inoc\/PanBB22","mdate":"2022-04-20"},"author":["Hao Pan","Balabhaskar Balasundaram","Juan Sebastian Borrero"],"title":"A Decomposition Branch-and-Cut Algorithm for the Maximum Cross-Graph k-Club Problem.","pages":"1-6","year":"2022","booktitle":"INOC","ee":"https:\/\/doi.org\/10.48786\/inoc.2022.04","crossref":"conf\/inoc\/2022","url":"db\/conf\/inoc\/inoc2022.html#PanBB22"}},{"article":{"@attributes":{"key":"journals\/iiset\/FarmaneshPBB21","mdate":"2021-06-15"},"author":["Babak Farmanesh","Arash Pourhabib","Balabhaskar Balasundaram","Austin Buchanan"],"title":"A Bayesian framework for functional calibration of expensive computational models through non-isometric matching.","pages":"352-364","year":"2021","volume":"53","journal":"IISE Trans.","number":"3","ee":"https:\/\/doi.org\/10.1080\/24725854.2020.1774688","url":"db\/journals\/iiset\/iiset53.html#FarmaneshPBB21"}},{"article":{"@attributes":{"key":"journals\/eor\/NasirianPB20","mdate":"2025-03-03"},"author":["Farzaneh Nasirian","Foad Mahdavi Pajouh","Balabhaskar Balasundaram"],"title":"Detecting a most closeness-central clique in complex networks.","pages":"461-475","year":"2020","volume":"283","journal":"Eur. J. Oper. Res.","number":"2","ee":"https:\/\/doi.org\/10.1016\/j.ejor.2019.11.035","url":"db\/journals\/eor\/eor283.html#NasirianPB20"}},{"article":{"@attributes":{"key":"journals\/informs\/MiaoB20","mdate":"2021-09-16"},"author":["Zhuqi Miao","Balabhaskar Balasundaram"],"title":"An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph.","pages":"763-778","year":"2020","volume":"32","journal":"INFORMS J. Comput.","number":"3","ee":"https:\/\/doi.org\/10.1287\/ijoc.2019.0922","url":"db\/journals\/informs\/informs32.html#MiaoB20"}},{"article":{"@attributes":{"key":"journals\/jgo\/MaB19","mdate":"2025-07-04"},"author":["Juan Ma","Balabhaskar Balasundaram"],"title":"On the chance-constrained minimum spanning k-core problem.","pages":"783-801","year":"2019","volume":"74","journal":"J. Glob. Optim.","number":"4","ee":["https:\/\/doi.org\/10.1007\/s10898-018-0714-2","https:\/\/www.wikidata.org\/entity\/Q129085392"],"url":"db\/journals\/jgo\/jgo74.html#MaB19"}},{"article":{"@attributes":{"key":"journals\/ol\/MoradiB18","mdate":"2020-07-03"},"author":["Esmaeel Moradi","Balabhaskar Balasundaram"],"title":"Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts.","pages":"1947-1957","year":"2018","volume":"12","journal":"Optim. Lett.","number":"8","ee":"https:\/\/doi.org\/10.1007\/s11590-015-0971-7","url":"db\/journals\/ol\/ol12.html#MoradiB18"}},{"article":{"@attributes":{"key":"journals\/ol\/LuMB18","mdate":"2020-10-26"},"author":["Yajun Lu","Esmaeel Moradi","Balabhaskar Balasundaram"],"title":"Correction to: Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts.","pages":"1959-1969","year":"2018","volume":"12","journal":"Optim. Lett.","number":"8","ee":"https:\/\/doi.org\/10.1007\/s11590-018-1273-7","url":"db\/journals\/ol\/ol12.html#LuMB18"}},{"article":{"@attributes":{"key":"journals\/anor\/PajouhMB17","mdate":"2020-08-13"},"author":["Foad Mahdavi Pajouh","Esmaeel Moradi","Balabhaskar Balasundaram"],"title":"Detecting large risk-averse 2-clubs in graphs with random edge failures.","pages":"55-73","year":"2017","volume":"249","journal":"Ann. Oper. Res.","number":"1-2","ee":"https:\/\/doi.org\/10.1007\/s10479-016-2279-0","url":"db\/journals\/anor\/anor249.html#PajouhMB17"}},{"article":{"@attributes":{"key":"journals\/networks\/MiaoB17","mdate":"2020-03-27"},"author":["Zhuqi Miao","Balabhaskar Balasundaram"],"title":"Approaches for finding cohesive subgroups in large-scale social networks via maximum -plex detection.","pages":"388-407","year":"2017","volume":"69","journal":"Networks","number":"4","ee":"https:\/\/doi.org\/10.1002\/net.21745","url":"db\/journals\/networks\/networks69.html#MiaoB17"}},{"article":{"@attributes":{"key":"journals\/informs\/MaPBB16","mdate":"2026-03-24"},"author":["Juan Ma","Foad Mahdavi Pajouh","Balabhaskar Balasundaram","Vladimir Boginski"],"title":"The Minimum Spanning -Core Problem with Bounded CVaR Under Probabilistic Edge Failures.","pages":"295-307","year":"2016","volume":"28","journal":"INFORMS J. Comput.","number":"2","ee":"https:\/\/doi.org\/10.1287\/ijoc.2015.0679","url":"db\/journals\/informs\/informs28.html#MaPBB16"}},{"article":{"@attributes":{"key":"journals\/ior\/PajouhBH16","mdate":"2025-03-03"},"author":["Foad Mahdavi Pajouh","Balabhaskar Balasundaram","Illya V. Hicks"],"title":"On the 2-Club Polytope of Graphs.","pages":"1466-1481","year":"2016","volume":"64","journal":"Oper. Res.","number":"6","ee":"https:\/\/doi.org\/10.1287\/opre.2016.1500","url":"db\/journals\/ior\/ior64.html#PajouhBH16"}},{"article":{"@attributes":{"key":"journals\/anor\/PajouhMB14","mdate":"2020-08-13"},"author":["Foad Mahdavi Pajouh","Zhuqi Miao","Balabhaskar Balasundaram"],"title":"A branch-and-bound approach for maximum quasi-cliques.","pages":"145-161","year":"2014","volume":"216","journal":"Ann. Oper. Res.","number":"1","ee":"https:\/\/doi.org\/10.1007\/s10479-012-1242-y","url":"db\/journals\/anor\/anor216.html#PajouhMB14"}},{"article":{"@attributes":{"key":"journals\/jco\/MiaoBP14","mdate":"2020-03-27"},"author":["Zhuqi Miao","Balabhaskar Balasundaram","Eduardo L. Pasiliao"],"title":"An exact algorithm for the maximum probabilistic clique problem.","pages":"105-120","year":"2014","volume":"28","journal":"J. Comb. Optim.","number":"1","ee":"https:\/\/doi.org\/10.1007\/s10878-013-9699-4","url":"db\/journals\/jco\/jco28.html#MiaoBP14"}},{"article":{"@attributes":{"key":"journals\/coap\/TrukhanovBBB13","mdate":"2020-07-14"},"author":["Svyatoslav Trukhanov","Chitra Balasubramaniam","Balabhaskar Balasundaram","Sergiy Butenko"],"title":"Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations.","pages":"113-130","year":"2013","volume":"56","journal":"Comput. Optim. Appl.","number":"1","ee":"https:\/\/doi.org\/10.1007\/s10589-013-9548-5","url":"db\/journals\/coap\/coap56.html#TrukhanovBBB13"}},{"article":{"@attributes":{"key":"journals\/heuristics\/PajouhBP13","mdate":"2025-03-03"},"author":["Foad Mahdavi Pajouh","Balabhaskar Balasundaram","Oleg A. Prokopyev"],"title":"On characterization of maximal independent sets via quadratic optimization.","pages":"629-644","year":"2013","volume":"19","journal":"J. Heuristics","number":"4","ee":"https:\/\/doi.org\/10.1007\/s10732-011-9171-5","url":"db\/journals\/heuristics\/heuristics19.html#PajouhBP13"}},{"article":{"@attributes":{"key":"journals\/heuristics\/ButenkoYB13","mdate":"2025-03-03"},"author":["Sergiy Butenko","Oleksandra Yezerska","Balabhaskar Balasundaram"],"title":"Variable objective search.","pages":"697-709","year":"2013","volume":"19","journal":"J. Heuristics","number":"4","ee":"https:\/\/doi.org\/10.1007\/s10732-011-9174-2","url":"db\/journals\/heuristics\/heuristics19.html#ButenkoYB13"}},{"article":{"@attributes":{"key":"journals\/interfaces\/PajouhXZHBLS13","mdate":"2021-10-14"},"author":["Foad Mahdavi Pajouh","Dahai Xing","Yingjue Zhou","Sharethram Hariharan","Balabhaskar Balasundaram","Tieming Liu","Ramesh Sharda"],"title":"A Specialty Steel Bar Company Uses Analytics to Determine Available-to-Promise Dates.","pages":"503-517","year":"2013","volume":"43","journal":"Interfaces","number":"6","ee":"https:\/\/doi.org\/10.1287\/inte.2013.0693","url":"db\/journals\/interfaces\/interfaces43.html#PajouhXZHBLS13"}},{"article":{"@attributes":{"key":"journals\/ol\/CarvalhoSBB13","mdate":"2026-03-24"},"author":["Marco Carvalho 0001","Alexey Sorokin","Vladimir Boginski","Balabhaskar Balasundaram"],"title":"Topology design for on-demand dual-path routing in wireless networks.","pages":"695-707","year":"2013","volume":"7","journal":"Optim. Lett.","number":"4","ee":"https:\/\/doi.org\/10.1007\/s11590-012-0453-0","url":"db\/journals\/ol\/ol7.html#CarvalhoSBB13"}},{"article":{"@attributes":{"key":"journals\/disopt\/PajouhB12","mdate":"2025-03-03"},"author":["Foad Mahdavi Pajouh","Balabhaskar Balasundaram"],"title":"On inclusionwise maximal and maximum cardinality k-clubs in graphs.","pages":"84-97","year":"2012","volume":"9","journal":"Discret. Optim.","number":"2","ee":"https:\/\/doi.org\/10.1016\/j.disopt.2012.02.002","url":"db\/journals\/disopt\/disopt9.html#PajouhB12"}},{"article":{"@attributes":{"key":"journals\/ior\/BalasundaramBH11","mdate":"2025-03-03"},"author":["Balabhaskar Balasundaram","Sergiy Butenko","Illya V. Hicks"],"title":"Clique Relaxations in Social Network Analysis: The Maximum -Plex Problem.","pages":"133-142","year":"2011","volume":"59","journal":"Oper. Res.","number":"1","ee":"https:\/\/doi.org\/10.1287\/opre.1100.0851","url":"db\/journals\/ior\/ior59.html#BalasundaramBH11"}},{"article":{"@attributes":{"key":"journals\/ol\/BalasundaramCT10","mdate":"2025-03-03"},"author":["Balabhaskar Balasundaram","Shyam Sundar Chandramouli","Svyatoslav Trukhanov"],"title":"Approximation algorithms for finding and partitioning unit-disk graphs into co--plexes.","pages":"311-320","year":"2010","volume":"4","journal":"Optim. Lett.","number":"3","ee":"https:\/\/doi.org\/10.1007\/s11590-009-0146-5","url":"db\/journals\/ol\/ol4.html#BalasundaramCT10"}},{"phdthesis":{"@attributes":{"key":"phd\/basesearch\/Balasundaram09","mdate":"2022-05-04"},"author":"Balabhaskar Balasundaram","title":"Graph theoretic generalizations of clique: optimization and extensions.","year":"2009","school":"Texas A&M University, College Station, USA","ee":["https:\/\/hdl.handle.net\/1969.1\/ETD-TAMU-1539","https:\/\/www.base-search.net\/Record\/3dcc28e641053a3d3c7e828829228b4be42fa132db07983b43c42c7f21a2742f"],"note":"base-search.net (fttexasamuniv:oai:oaktrust.library.tamu.edu:1969.1\/ETD-TAMU-1539)"}},{"incollection":{"@attributes":{"publtype":"encyclopedia","key":"reference\/opt\/BalasundaramB09","mdate":"2025-03-03"},"author":["Balabhaskar Balasundaram","Sergiy Butenko"],"title":"Optimization Problems in Unit-Disk Graphs.","pages":"2832-2844","year":"2009","booktitle":"Encyclopedia of Optimization","ee":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_486","crossref":"reference\/opt\/2009","url":"db\/reference\/opt\/opt2009.html#BalasundaramB09"}},{"article":{"@attributes":{"key":"journals\/jgo\/BalasundaramB06","mdate":"2025-03-03"},"author":["Balabhaskar Balasundaram","Sergiy Butenko"],"title":"On a Polynomial Fractional Formulation for Independence Number of a Graph.","pages":"405-421","year":"2006","volume":"35","journal":"J. Glob. Optim.","number":"3","ee":"https:\/\/doi.org\/10.1007\/s10898-005-5185-6","url":"db\/journals\/jgo\/jgo35.html#BalasundaramB06"}},{"incollection":{"@attributes":{"key":"books\/daglib\/p\/BalasundaramB06","mdate":"2025-03-03"},"author":["Balabhaskar Balasundaram","Sergiy Butenko"],"title":"Graph Domination, Coloring and Cliques in Telecommunications.","pages":"865-890","year":"2006","booktitle":"Handbook of Optimization in Telecommunications","ee":"https:\/\/doi.org\/10.1007\/978-0-387-30165-5_30","crossref":"books\/daglib\/0016906","url":"db\/books\/collections\/RP2006.html#BalasundaramB06"}},{"article":{"@attributes":{"key":"journals\/jco\/BalasundaramBT05","mdate":"2025-03-03"},"author":["Balabhaskar Balasundaram","Sergiy Butenko","Svyatoslav Trukhanov"],"title":"Novel Approaches for Analyzing Biological Networks.","pages":"23-39","year":"2005","volume":"10","journal":"J. Comb. Optim.","number":"1","ee":"https:\/\/doi.org\/10.1007\/s10878-005-1857-x","url":"db\/journals\/jco\/jco10.html#BalasundaramBT05"}},{"article":{"@attributes":{"key":"journals\/oms\/BalasundaramB05","mdate":"2025-03-03"},"author":["Balabhaskar Balasundaram","Sergiy Butenko"],"title":"Constructing test functions for global optimization using continuous formulations of graph problems.","pages":"439-452","year":"2005","volume":"20","journal":"Optim. Methods Softw.","number":"4-5","ee":"https:\/\/doi.org\/10.1080\/10556780500139641","url":"db\/journals\/oms\/oms20.html#BalasundaramB05"}}],"coauthors":{"@attributes":{"n":"30","nc":"1"},"co":[{"@attributes":{"c":"0"},"na":"Chitra Balasubramaniam"},{"@attributes":{"c":"0"},"na":"Vladimir Boginski"},{"@attributes":{"c":"0"},"na":"Juan Sebastian Borrero"},{"@attributes":{"c":"0"},"na":"Austin Buchanan"},{"@attributes":{"c":"0"},"na":"Sergiy Butenko"},{"@attributes":{"c":"0","n":"2"},"na":["Marco M. Carvalho","Marco Carvalho 0001"]},{"@attributes":{"c":"0"},"na":"Shyam Sundar Chandramouli"},{"@attributes":{"c":"0"},"na":"Niloufar Daemi"},{"@attributes":{"c":"0"},"na":"Babak Farmanesh"},{"@attributes":{"c":"0"},"na":"Sharethram Hariharan"},{"@attributes":{"c":"0"},"na":"Illya V. Hicks"},{"@attributes":{"c":"0"},"na":"Tieming Liu"},{"@attributes":{"c":"0"},"na":"Yajun Lu"},{"@attributes":{"c":"0"},"na":"Juan Ma"},{"@attributes":{"c":"0"},"na":"Zhuqi Miao"},{"@attributes":{"c":"0"},"na":"Esmaeel Moradi"},{"@attributes":{"c":"0"},"na":"Farzaneh Nasirian"},{"@attributes":{"c":"0"},"na":"Foad Mahdavi Pajouh"},{"@attributes":{"c":"0"},"na":"Hao Pan"},{"@attributes":{"c":"0"},"na":"Eduardo L. Pasiliao"},{"@attributes":{"c":"0"},"na":"Arash Pourhabib"},{"@attributes":{"c":"0"},"na":"Oleg A. Prokopyev"},{"@attributes":{"c":"0"},"na":"Parisa Sahraeian"},{"@attributes":{"c":"0"},"na":"Hosseinali Salemi"},{"@attributes":{"c":"0"},"na":"Ramesh Sharda"},{"@attributes":{"c":"0"},"na":"Alexey Sorokin"},{"@attributes":{"c":"0"},"na":"Svyatoslav Trukhanov"},{"@attributes":{"c":"0"},"na":"Dahai Xing"},{"@attributes":{"c":"0"},"na":"Oleksandra Yezerska"},{"@attributes":{"c":"0"},"na":"Yingjue Zhou"}]}}