|
PROFESSIONAL SOCIETY MEMBERSHIPS
VISITING SCIENTISTS/POST-DOCTORAL FELLOWS
ACADEMIC ADMINISTRATION/COMMITTEE MEMBERSHIPS
RESEARCH HISTORY |
||
My research has been primarily in Graphs, Networks, Algorithms and Applications. My earliest research (Master’s Thesis, 1965), was on the application of graph theory to the analysis of power networks – short circuit and load flow studies – using a network reduction –restoration technique. For my Ph. D. work (I.I.T., Madras, 1965-68), I pursued studies on application of graph theory to the n-port resistance network problem. At that time this problem – now considered classical – was engaging the attention of several leading circuit theorists – Guillemin, Lempel, Cederbaum, Frisch, Boesch, Biorci etc. My Ph. D. research and the research of my students (1972, 1975) resulted in several significant contributions to the n-port network problem. The contributions involved a good mix of graph theory, circuit theory and applied mathematics. During the period 1972 – 75, I also contributed to other topics in network theory such as active n-port network synthesis, network sensitivity theory, state variable analysis etc. It is very gratifying to recall that Abraham Lempel at Technion, Israel is considered a leader in Information Theory, Frisch at Columbia is one of the earliest researchers in telecommunication networks and founded the Network Analysis Corporation in the 1970’s and Frank Boesch founded in the 1970’s the prestigious journal “Networks” published by John Wiley. Late Professor Guillemin of MIT is considered the father of modern circuit theory. Professor Cederbaum, now in his 90’s and also at Technion, is one of the pioneering researchers in graph theoretic applications. During the period 1970 – 72, when I did my Post-Doctoral work at Concordia University, Montreal, Canada, I directed my research more towards algorithmic, structural and combinatorial issues in graph theory. The research in structural graph theory was then motivated by applications to reliability and vulnerability studies of communication networks. On my return to I.I.T. Madras in 1972, (after post-doctoral work) I was transferred to the Department of Computer Science and Engineering at the I.I.T. Since then my research has been primarily on Computational Graph Theory and Combinatorial Optimization with a focus on applications. As a founding faculty of the CS faculty at the IIT, I was involved in development of graduate curriculum in CS and building the research programs. I served as graduate program director for the eight years I served there. During the years 1975– 80, I spent a good deal of my time completing the book “Graph, Networks and Algorithms” (coauthored with M.N.S. Swamy of Concordia University and published by Wiley-Interscience, 1981). This book (about 600 pages long), consists of three parts. Part I contains a substantial amount of information on what my be called “Foundations of Graph Theory.” Part II develops a number of results in electrical network theory as extensions of results in graph theory. It also deals with several graph-theoretic results discovered by circuit theorists. Part III, on Algorithmic Graph Theory, gives a very detailed and rigorous account of a number of graph algorithms and their analysis. This book’s coverage thus spans three disciplines – graph theory, computer science, and electrical network and system theory. It has received very good reviews (attached at the end) from several noted scholars belonging to these disciplines. We carried out a substantial revision of this book. The new book titled “Graphs: Theory and Algorithms” appeared in February 1992. I believe that this book contained all the fundamentals of graph theory and algorithms that one would encounter in most applications. In 1981, I moved to Canada. After spending a year at the Technical University of Nova Scotia, Halifax and two years at the Industrial Engineering division of the Mechanical Engineering Department at Concordia, I moved to the Department of Electrical and Computer Engineering in 1984. Since then I have developed strong interests in inter-disciplinary research. While in Canada I have participated in the establishment of several interdisciplinary research centers. I am a Honorary /Founding Member, RESMIQ ( Formerly GRIAO), Institute for Microelectronics Research, Montreal, Canada, since 1992. I moved to the USA in Aug. 1994 as Hitachi Chair professor in the School of Computer Science at the University of Oklahoma, Norman. For my contributions to Graph Theory and Applications, I was elected in 1989 Fellow of the IEEE. I was awarded the Golden Jubilee Medal by the IEEE Circuits Society for Outstanding Contributions Circuits and Systems. More recently, I was elected member of the European Academy of Sciences “for an Outstanding and Lasting Contribution to the Development of Novel Algorithms and Computer Science Education”. Since 1982, the focus of my research has been on Graph Theory, Discrete Optimization and Computing emphasizing applications in the general area of Networks, Distributed/Parallel Systems and VLSI.
|