|
Balabhaskar “Baski” Balasundaram |
|
|
|
I received my Bachelor’s degree in Mechanical Engineering from the Indian Institute of Technology-Madras in 2002. In the fall of that year, I joined Texas A&M University to pursue a Ph.D. in Industrial & Systems Engineering, where I work with Prof. Sergiy Butenko. My research interests include combinatorial optimization, graph theory, algorithms and complexity with applications in military, telecommunication, transportation, computational biology and chemistry. My earlier work dealt with continuous fractional formulations of the maximum independent set problem and their characterization. Towards my thesis, I am working on graph theoretic generalizations of the maximum clique problem that has applications in social network analysis as well as clustering and graph based data mining applications. Specifically, I am investigating a distance based clique relaxation called k-clique, a diameter based relaxation called k-club and a degree based relaxation called k-plex. Please refer my C.V. for a detailed list of publications, conference presentations and other relevant information.