default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBalabhaskar Balasundaram
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j28]Niloufar Daemi
, Juan Sebastian Borrero, Balabhaskar Balasundaram:
First passage time interdiction in Markov chains. Oper. Res. Lett. 54: 107111 (2024)- 2023
- [j27]Yajun Lu, Zhuqi Miao, Parisa Sahraeian, Balabhaskar Balasundaram:
On atomic cliques in temporal graphs. Optim. Lett. 17(4): 813-828 (2023) - 2022
- [j26]Balabhaskar Balasundaram, Juan Sebastian Borrero, Hao Pan:
Graph signatures: Identification and optimization. Eur. J. Oper. Res. 296(3): 764-775 (2022) - [j25]Yajun Lu, Hosseinali Salemi, Balabhaskar Balasundaram, Austin Buchanan:
On Fault-Tolerant Low-Diameter Clusters in Graphs. INFORMS J. Comput. 34(6): 3181-3199 (2022) - [j24]Niloufar Daemi, Juan Sebastian Borrero, Balabhaskar Balasundaram:
Interdicting Low-Diameter Cohesive Subgroups in Large-Scale Social Networks. INFORMS J. Optim. 4(3): 304-325 (2022) - [c1]Hao Pan, Balabhaskar Balasundaram, Juan Sebastian Borrero:
A Decomposition Branch-and-Cut Algorithm for the Maximum Cross-Graph k-Club Problem. INOC 2022: 1-6 - 2021
- [j23]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): 352-364 (2021) - 2020
- [j22]Farzaneh Nasirian, Foad Mahdavi Pajouh, Balabhaskar Balasundaram:
Detecting a most closeness-central clique in complex networks. Eur. J. Oper. Res. 283(2): 461-475 (2020) - [j21]Zhuqi Miao, Balabhaskar Balasundaram:
An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph. INFORMS J. Comput. 32(3): 763-778 (2020)
2010 – 2019
- 2019
- [j20]Juan Ma, Balabhaskar Balasundaram:
On the chance-constrained minimum spanning k-core problem. J. Glob. Optim. 74(4): 783-801 (2019) - 2018
- [j19]Esmaeel Moradi, Balabhaskar Balasundaram:
Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts. Optim. Lett. 12(8): 1947-1957 (2018) - [j18]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): 1959-1969 (2018) - 2017
- [j17]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): 55-73 (2017) - [j16]Zhuqi Miao, Balabhaskar Balasundaram:
Approaches for finding cohesive subgroups in large-scale social networks via maximum k-plex detection. Networks 69(4): 388-407 (2017) - 2016
- [j15]Juan Ma, Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Vladimir Boginski:
The Minimum Spanning k-Core Problem with Bounded CVaR Under Probabilistic Edge Failures. INFORMS J. Comput. 28(2): 295-307 (2016) - [j14]Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Illya V. Hicks:
On the 2-Club Polytope of Graphs. Oper. Res. 64(6): 1466-1481 (2016) - 2014
- [j13]Foad Mahdavi Pajouh, Zhuqi Miao, Balabhaskar Balasundaram:
A branch-and-bound approach for maximum quasi-cliques. Ann. Oper. Res. 216(1): 145-161 (2014) - [j12]Zhuqi Miao, Balabhaskar Balasundaram, Eduardo L. Pasiliao:
An exact algorithm for the maximum probabilistic clique problem. J. Comb. Optim. 28(1): 105-120 (2014) - 2013
- [j11]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): 113-130 (2013) - [j10]Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Oleg A. Prokopyev:
On characterization of maximal independent sets via quadratic optimization. J. Heuristics 19(4): 629-644 (2013) - [j9]Sergiy Butenko, Oleksandra Yezerska, Balabhaskar Balasundaram:
Variable objective search. J. Heuristics 19(4): 697-709 (2013) - [j8]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): 503-517 (2013) - [j7]Marco Carvalho, Alexey Sorokin, Vladimir Boginski, Balabhaskar Balasundaram:
Topology design for on-demand dual-path routing in wireless networks. Optim. Lett. 7(4): 695-707 (2013) - 2012
- [j6]Foad Mahdavi Pajouh, Balabhaskar Balasundaram:
On inclusionwise maximal and maximum cardinality k-clubs in graphs. Discret. Optim. 9(2): 84-97 (2012) - 2011
- [j5]Balabhaskar Balasundaram, Sergiy Butenko, Illya V. Hicks:
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem. Oper. Res. 59(1): 133-142 (2011) - 2010
- [j4]Balabhaskar Balasundaram, Shyam Sundar Chandramouli, Svyatoslav Trukhanov:
Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes. Optim. Lett. 4(3): 311-320 (2010)
2000 – 2009
- 2009
- [b1]Balabhaskar Balasundaram:
Graph theoretic generalizations of clique: optimization and extensions. Texas A&M University, College Station, USA, 2009 - [r1]Balabhaskar Balasundaram, Sergiy Butenko:
Optimization Problems in Unit-Disk Graphs. Encyclopedia of Optimization 2009: 2832-2844 - 2006
- [j3]Balabhaskar Balasundaram, Sergiy Butenko:
On a Polynomial Fractional Formulation for Independence Number of a Graph. J. Glob. Optim. 35(3): 405-421 (2006) - [p1]Balabhaskar Balasundaram, Sergiy Butenko:
Graph Domination, Coloring and Cliques in Telecommunications. Handbook of Optimization in Telecommunications 2006: 865-890 - 2005
- [j2]Balabhaskar Balasundaram, Sergiy Butenko, Svyatoslav Trukhanov:
Novel Approaches for Analyzing Biological Networks. J. Comb. Optim. 10(1): 23-39 (2005) - [j1]Balabhaskar Balasundaram, Sergiy Butenko:
Constructing test functions for global optimization using continuous formulations of graph problems. Optim. Methods Softw. 20(4-5): 439-452 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
