K. Thulasiraman

RESEARCH INTERESTS

Graph theory, combinatorial optimization, algorithms and applications in a variety of areas in CS and EE, electrical networks, VLSI physical design, systems level testing, communication protocol testing, parallel/distributed computing, telecommunication network planning, and interconnection networks.

BIOGRAPHY

Dr. Krishnaiyan Thulasiraman holds the Hitachi Chair and is Professor in the School of Computer Science at the University of Oklahoma, Norman, where he has been since 1994. He received his PhD in electrical engineering from the Indian Institute of Technology, Madras, India in 1968. Prior to joining the University of Oklahoma, Dr. Thulasiraman was professor (1981-1994) and chair (1993-1994) of the ECE Department in Concordia University, Montreal, Canada. He was on the faculty in the EE and CS departments of the IIT, Madras during 1965-1981 and served as professor in CS from 1977.

His research interests have been in graph theory, combinatorial optimization, and algorithms and applications in a variety of areas in CS and EE: electrical networks, VLSI physical design, systems level testing, communication protocol testing, parallel/distributed computing, telecommunication network planning, interconnection networks, etc. He has published more than 100 papers in archival journals, coauthored two text books Graphs, Networks, and Algorithms (1981) and Graphs: Theory and Algorithms (1992), both published by Wiley Inter-Science, and two chapters in the Handbook of Circuits and Filters (CRC and IEEE, 1995).

Dr. Thulasiraman has received more than $1 million in direct costs of research grants from Nortel Networks and national and state research agencies in Canada. Dr. Thulasiraman has received several awards and honors, including: IEEE Circuits and Systems Society Golden Jubilee Medal (1999), Fellow of the IEEE (1990), Senior Research Fellowship of the Japan Society for Promotion of Science (1988), and Distinguished Professorship of the German National Science Foundation (1990). He has also held visiting positions at the Tokyo Institute of Technology and at the University of Karlsruhe, Germany. Dr. Thulasiraman has been Vice President (Administration) of the IEEE Circuits and Systems Society (1998, 1999), Technical Program Chair of the IEEE International Symposium on Circuits and Systems (1993, 1999), Co-Guest Editor of a special issue on "Computational Graph Theory: Algorithms and Applications" (IEEE Transactions on Circuits and Systems, March 1988), Associate Editor of the IEEE Transactions on Circuits and Systems (1989-91, 1999-2001), and Founding Regional Editor of the Journal of Circuits, Systems, and Computers (since 1990).

Selected Publications

K. Thulasiraman and M. N. Swamy, “Graphs: Theory and Algorithms”, Wiley-Inter-science, 1992 (420 Pages)

M. N. Swamy and K. Thulasiraman, "Graphs, Networks and Algorithms", Wiley-Inter-science, 1981 (590 Pages).

Ying Xiao, K.Thulasiraman and Guoliang Xue, " Constrained Shortest Link-Disjoint Paths Selction: A Network Programming Based Approach", To appear in IEEE Transactions on Circuits and Systems.

Guoliang Xue,Li Chen and K. Thulasiraman, "Quality of Service and Quality of Protection Issues in Preplanned Recovery Schemes Using Redundant Trees", IEEE Journal on Selected Areas in Communications (JSAC),Vol.21, pp.1332-1345, October 2003.

T. Ramalingom, A.Das and K. Thulasiraman, " A Matroid Theoretic Approach to an Assignment Problem in Communication Protocol Testing"", IEEE Transactions on Computers, Vol. 49, pp. 317-330, April, 2000.