All Stories

  1. Finding conserved low‐diameter subgraphs in social and biological networks

    Article • Networks, August 2024, Wiley

    Dr Baski Balasundaram

  2. Development and optimization of expected cross value for mate selection problems

    Article • Heredity, July 2024, Springer Science + Business Media

    Dr Baski Balasundaram

  3. First passage time interdiction in Markov chains

    Article • Operations Research Letters, May 2024, Elsevier

    Dr Baski Balasundaram

  4. On atomic cliques in temporal graphs

    Article • Optimization Letters, February 2023, Springer Science + Business Media

    Dr Baski Balasundaram

  5. On Fault-Tolerant Low-Diameter Clusters in Graphs

    Article • INFORMS Journal on Computing, November 2022, INFORMS

    Dr Baski Balasundaram

  6. Interdicting Low-Diameter Cohesive Subgroups in Large-Scale Social Networks

    Article • INFORMS Journal on Optimization, July 2022, INFORMS

    Dr Baski Balasundaram

  7. Graph signatures: Identification and optimization

    Article • European Journal of Operational Research, February 2022, Elsevier

    Dr Baski Balasundaram

  8. A Bayesian framework for functional calibration of expensive computational models through non-isometric matching

    Article • IISE Transactions, July 2020, Taylor & Francis

    Dr Baski Balasundaram

  9. An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph

    Article • INFORMS Journal on Computing, July 2020, INFORMS

    Dr Baski Balasundaram

  10. Detecting a most closeness-central clique in complex networks

    Article • European Journal of Operational Research, June 2020, Elsevier

    Dr Baski Balasundaram

  11. SNP variable selection by generalized graph domination

    Article • PLOS One, January 2019, PLOS

    Dr Baski Balasundaram

  12. On the chance-constrained minimum spanning k-core problem

    Article • Journal of Global Optimization, October 2018, Springer Science + Business Media

    Dr Baski Balasundaram

  13. Correction to: Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts

    Article • Optimization Letters, June 2018, Springer Science + Business Media

    Dr Baski Balasundaram

  14. Approaches for finding cohesive subgroups in large-scale social networks via maximumk-plex detection

    Article • Networks, May 2017, Wiley

    Dr Baski Balasundaram

  15. On the 2-Club Polytope of Graphs

    Article • Operations Research, December 2016, INFORMS

    Dr Baski Balasundaram

  16. Detecting large risk-averse 2-clubs in graphs with random edge failures

    Article • Annals of Operations Research, August 2016, Springer Science + Business Media

    Dr Baski Balasundaram

  17. The Minimum Spanning k-Core Problem with Bounded CVaR Under Probabilistic Edge Failures

    Article • INFORMS Journal on Computing, May 2016, INFORMS

    Juan Ma, Dr Baski Balasundaram

  18. Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts

    Article • Optimization Letters, November 2015, Springer Science + Business Media

    Dr Baski Balasundaram

  19. An exact algorithm for the maximum probabilistic clique problem

    Article • Journal of Combinatorial Optimization, January 2014, Springer Science + Business Media

    Dr Baski Balasundaram

  20. A Specialty Steel Bar Company Uses Analytics to Determine Available-to-Promise Dates

    Article • INFORMS Journal on Applied Analytics, December 2013, INFORMS

    Dr Baski Balasundaram

  21. Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations

    Article • Computational Optimization and Applications, March 2013, Springer Science + Business Media

    Dr Baski Balasundaram

  22. Graph Theoretic Clique Relaxations and Applications

    Article • January 2013, Springer Science + Business Media

    Dr Baski Balasundaram

  23. A branch-and-bound approach for maximum quasi-cliques

    Article • Annals of Operations Research, November 2012, Springer Science + Business Media

    Dr Baski Balasundaram

  24. On inclusionwise maximal and maximum cardinality k-clubs in graphs

    Article • Discrete Optimization, May 2012, Elsevier

    Dr Baski Balasundaram

  25. Topology design for on-demand dual-path routing in wireless networks

    Article • Optimization Letters, February 2012, Springer Science + Business Media

    Dr Baski Balasundaram

  26. Significant Winter Weather Events and Associated Socioeconomic Impacts (Federal Aid Expenditures) across Oklahoma: 2000–10

    Article • Weather Climate and Society, January 2012, American Meteorological Society

    Dr Baski Balasundaram

  27. Variable objective search

    Article • Journal of Heuristics, June 2011, Springer Science + Business Media

    Dr Baski Balasundaram

  28. On characterization of maximal independent sets via quadratic optimization

    Article • Journal of Heuristics, June 2011, Springer Science + Business Media

    Dr Baski Balasundaram

  29. Gradient-Type Methods

    Article • February 2011, Wiley

    Dr Baski Balasundaram

  30. Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem

    Article • Operations Research, February 2011, INFORMS

    Dr Baski Balasundaram

  31. Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes

    Article • Optimization Letters, September 2009, Springer Science + Business Media

    Dr Baski Balasundaram

  32. Cohesive subgroup model for graph-based text mining

    Article • August 2008, Institute of Electrical & Electronics Engineers (IEEE)

    Dr Baski Balasundaram

  33. Optimization Problems in Unit-Disk Graphs

    Article • January 2008, Springer Science + Business Media

    Dr Baski Balasundaram

  34. Network Clustering

    Article • August 2007, Wiley

    Dr Baski Balasundaram

  35. On a Polynomial Fractional Formulation for Independence Number of a Graph

    Article • Journal of Global Optimization, July 2006, Springer Science + Business Media

    Dr Baski Balasundaram

  36. Constructing test functions for global optimization using continuous formulations of graph problems

    Article • Optimization Methods and Software, August 2005, Taylor & Francis

    Dr Baski Balasundaram

  37. Novel Approaches for Analyzing Biological Networks

    Article • Journal of Combinatorial Optimization, August 2005, Springer Science + Business Media

    Dr Baski Balasundaram

  38. Graph Domination, Coloring and Cliques in Telecommunications

    Article • Springer Science + Business Media

    Dr Baski Balasundaram