Academic Qualifications

Ph.D., Industrial Engineering, Texas A&M University, College Station, 2007

Bachelor of Technology, Mechanical Engineering, Indian Institute of Technology-Madras, India, 2002 

Professional Experience

Assistant Professor, Industrial Engineering and Management, Oklahoma State University (since 2007)

Instructor, Industrial and Systems Engineering, Texas A&M University (2006 -- 2007)

Teaching and Research Interests

• Combinatorial Optimization

• Mathematical Programming

• Graph-based Data Mining and Clustering

• Social and Biological Network Analysis

Selected Publications

Refereed Journal Articles

F. Mahdavi and B. Balasundaram. A variable neighborhood search heuristic for k-clubs
in graphs. In preparation.

F. Mahdavi and B. Balasundaram. On inclusionwise maximal and maximum cardinality
k-clubs in graphs. In preparation.

S. Trukhanov, B. Balasundaram and S. Butenko. Generalization of Ostergard’s algorithm
and an application to the maximum weight k-plex problem. In preparation.

B. Balasundaram, S. Butenko, and I. V. Hicks. Clique relaxations in social network
analysis: The maximum k-plex problem. To appear in Operations Research.

B. Balasundaram, S. S. Chandramouli and S. Trukhanov. Approximation algorithms
for finding and partitioning unit-disk graphs into co-k-plexes. Optimization Letters,
Online first at http://www.springerlink.com/content/982p67k474467738/.

B. Balasundaram and S. Butenko. On a polynomial fractional formulation for independence
number of a graph. Journal of Global Optimization, 35(3):405–421, 2006.

B. Balasundaram, S. Butenko and S. Trukhanov. Novel approaches for analyzing
biological networks. Journal of Combinatorial Optimization, 10(1):23–39, 2005.

B. Balasundaramand S. Butenko. Constructing test functions for global optimization
using continuous formulations of graph problems. Journal of Optimization Methods
and Software, 20(4-5):439–452, 2005.

Refereed Book Chapters

B. Balasundaram and S. Butenko. Optimization problems in unit-disk graphs. In: C.
A. Floudas and P. M. Pardalos (Eds) Encyclopedia of Optimization, 2nd Edition, pages
2832-2844. Springer, 2009.

B. Balasundaram and S. Butenko. Network clustering. In: B. H. Junker and F. Schreiber (Eds) Analysis of Biological Networks, pages 113-138.Wiley,2008.

B. Balasundaram and S. Butenko. Graph domination, coloring and cliques in telecommunications. In: M. G. C. Resende and P. M. Pardalos (Eds) Handbook of Optimization in Telecommunications, pages 865–890. Springer, 2006.

Awards, Honors and Professional Society Memberships

Pritsker Doctoral Dissertation Award (2^nd place), Institute of Industrial Engineers, May 2008.

George Kunze Prize, Texas A&M University, April 2007 (University-wide).

Senator Phil Gramm Doctoral Fellowship, Texas A&M University, April 2007 (University-wide).

Distinguished Graduate Student Award for Excellence in Teaching, Association of Former Students of Texas A&M University, March 2007 (University-wide).

Graduate Student Research and Presentation Grant, Association of Former Students and the Office of Graduate Studies of Texas A&M University, Sep 2005.

For further information, please visit my personal website.