Skip Navigation

Dr. K. Thulasiraman

Skip Side Navigation
K. Thulasiraman of the School of Computer Science

K. Thulasiraman

Office:  DEH 210


PhD, (EE), Indian Institute of Technology, 1968
MS, (EE), University of Madras,1965
BE, (EE), University of Madras, 1963

Professor and Hitachi Chair, University of Oklahoma
Professor and Chair, (ECE) Concordia University
Professor, (CS) Indian Institute of Technology
Visiting Professor, University of Karlsruhe, Germany
Visiting Professor, Tokyo Institute of Technology
Associate Professor

Applied graph theory, combinatorial optimization and algorithms emphasizing applications in a broad spectrum of areas ranging from classical circuit theory to modern areas such as optical networks, fault diagnosis, testing and tolerance etc.

Dr. Krishnaiyan Thulasiraman is professor and the Hitachi Chair in Computer Science at the University of Oklahoma. He received his Bachelor’s and Master’s degrees in Electrical Engineering from the College of Engineering, Guindy (now Anna University, Chennai), India and the PhD in Electrical Engineering from the Indian Institute of Technology Madras, India. Prior to joining OU in 1994 he had served on the faculty at Concordia University , Montreal, Canada and the IIT Madras. Dr. Thulasiraman has held visiting positions at the University of Illinois, Urbana-Champaign, Tokyo Institute of Technology, Chuo University, Tokyo and the University of Karlsruhe, Germany. He has published extensively in archival journals and co-authored two books on graph theory and algorithms. Dr. Thulasiraman has performed more than $2M funded research and has participated in inter-university collaborative projects totaling more than $3M.


Chair Professor in CS, National Chiao Tung University, Taiwan, Summer 2011, supported by the National Science Council of Taiwan.

Endowed Sateesh Kumar Singh Chair Professor, Department of Computer Science, SCSVMV ( Sankara) University, Kanchipuram, India, Summer 2009.

Distinguished Alumnus Award, Indian Institute of Technology Madras, India, 2008.
IEEE Circuits and Systems Society Technical Achievement ( Life Time) Award, 2006.
Fellow of the American Association for Advancement of Science (AAAS), 2008.
Endowed Goplakrishnan Chair in CSE , IIT, Madras, Dec 04-05-Jan and Summer “05.
Elected member of the European Academy of Sciences, 2002. IEEE Circuits and Systems Society Golden Jubilee Medal, 1999. Fellow of the IEEE, 1990 for “Contributions to Applications of
Graph Theory.” Senior Fellow of the Japan Society for the Promotion of Science,
1988. Guest Professorship of the German National Science Foundation,
Univ. of Karlsruhe, Fall 1990. Hitachi Chair in Computer Science, University of Oklahoma, 1994-present.


NeTS: Small Collaborative Research: Cross Layer Survivability to Cascading Failures in Layered Networks, Begin Date: 8/1/11, End Date: 6/30/14, Sponsor: NSF Total: $500 K; Collaboration with Arizona State University and University of Florida.

NSF ITR collaborative grant with Arizona State University, “Fault Tolerance in WDM Optical Networks: Multiple Failure Recovery and Protection Interoperability,” $325/162K, 2003-2007.

NSF Medium ITR Collaborative Grant in collaboration with the University of Illinois, Urbana-Champaign “Diagnosis and Assessment of Faults, Misbehavior and Threats in Distributed Systems and Networks,” $700K/140K, 2004-2009.


K. Thulasiraman (Editor in Chief), S. Arumugam, Andreas Brandstaedt and Takao Nishizeki, “Handbook of Graph Theory, Combinatorial Optimization and Algorithms” CRC Press 2015. 1250 pages.

“Graphs: Theory and Algorithms”, Wiley Inter-science, 1992, 460 pages (wtih M.N.S. Swamy).

Zhili Zhou, Tachun Lin, K. Thulasiraman, GuoliangXue an SartajSahni, “Cross Layer Survivability in Layered Networks under Multiple Cross Layer Metrics”, IEEE/OSA Journal of Optical Communications and Networking (JOCN), VOL. 7, June, 2015 (pp. 540 - 553).

"Circuits/Cutsets Duality and a Unified Algorithmic Framework for Survivable Logical Topology Design in IP-over-WDM Optical Networks", IEEE INFOCOM 2009, April 2009 (with Muhammad Javed and Guoliang (Larry) Xue).
"Polynomial Time Approximation Algorithms for Multi-Constrained QoS Routing", IEEE/ACM Trans. on Networking Vol. 16 (2008), pp. 656-669.
(with Weiyi Zhang, Guoliang Xue, Jian Tang and Krishnaiyan Thulasiraman),"Faster Algorithms for Constructing Recovery Trees Enhancing QoP and QoS" IEEE/ACM Transactions on Networking,16, 2008, pp. 642-655 (with Guoliang Xue, Weiyi Zhang and Jian Tang).
"Finding a path subject to many additive QoS constraints" IEEE/ACM Trans. on Networking, 15, February, 2007, pp.201- 211 (with Guoliang Xue, Arunabha Sen, Weiyi Zhang and Jian Tang).
"QoS Routing in Communication Networks: Approximation Algorithms Based on the Primal Simplex Method of Linear Programming", IEEE Transactions on Computers, July 2006, pp.815 - 829 (wtih Ying Xiao and Guoliang Xue).