PUBLICATIONS

Min Xu, Kshirasagar Naik, and Krishnaiyan Thulasiraman,” *Fault Tolerance of Hypercube Like Networks: Spanning Laceability Under Edge Faults*,”** Theoratical Computer Science 835 (2020) 44-57.**

Dhruv Sharma, Chenxi Lin , Xiaochuan Luoc , Di Wu , Krishnaiya Thulasiraman , John N. Jiang,” *Advanced Techniques of Power System Restoration and Practical Applications in Transmission Grids*,”** Electric Power Systems Research, Volume 182, May 2020.**

Dhruv Sharma, Krishnaiya Thulasiraman, Di Wu and John N. Jiang, “*A Network Science Based k means++ Clustering Method for Power Systems Network Equivalence*,” **Computational Social Networks (2019)**

Ali Zeydi Abdiana, Krishnaiyan Thulasiramanb, Kewen Zhaoc, "*The Spectral Characterization of the Connected Multicone Graphs Kw ▽ mKn,n**,*" **AKCE Journal of Graphs and Combinatrics, 2019.**

Ravishankar Ravindran, Changcheng Huang, Krishnaiyan Thulasiraman, and Tachun Lin, “*Topology Abstraction Service for IP VPNs: Core Network Partitioning for Resource Sharing*,” **American Journal of Operations Research, Vol. 8, No. 3, May 2018 (pp. 167 - 202)**. **See also** Ravishankar Ravindran, Changcheng Huang and Krishnaiyan Thulasiraman, "*VPN Topology Abstraction Service using Centralized Core Capacity Sharing Scheme*",** IEEE ANTS 2009, Dec. 2009. **Ravi Ravindran, Changcheng Huang and Krishnaiyan Thulasiraman, “*Managed Dynamic VPN Service: Core Capacity Sharing Schemes for Improved VPN Performance*,” **IEEE International Conference on Communications, 2007.**

Krishnaiyan Thulasiraman and Mamta Yadav, “*Network Science meets Circuit Theory: Resistance Distance, Kirchhoff Index/Nework Criticality and Foster’s Theorems with Unification and Generalization*,” **IEEE Transactions on Circuits and Systems**.

B. Jayaram ,S. Arumugam and K. Thulasiraman, “*Dominator Sequences in Bipartite Graphs*," **Theoretical Computer Science, Vol 694, September 2017, pp. 34-41.**

Min Xu, Krishnaiyan Thulasiraman, Qiang Zhu, "*Conditional Diagnosability of Class.of Matching Composition Networks under the Comparison Model*," **Theoretical Computer Science 674 (2017) pp 53-62.**

Di Wu , Feng Ma, Milad Javadi , Krishnaiya Thulasiraman , Ettore Bompard , John N. Jiang, “*A Study of the Impacts of Flow Direction and Electrical Constraints on Vulnerability Assessment of Power Grid using Electrical Betweenness Measure*s,” **Physica A: Statistical Mechanics and Its Applications, Volume 466, 15 January 2017, Pages 295-309.**

K. Thulasiraman and Ming Shan Su, “*Diagnosis in a Network of Processors: Centralized and Distributed Models and Algorithms*,” **Journal of Combinatorial Mathematics and Combinatorial Computing.** **Also an invited talk** by K. Thulasiraman , “Sysem Level Diagnosis: Graph Models and Centralized and Decentralized Algorithms,” at the **National Conference on Discrete Matheamtics and Theoretical Computer Science, Kalasalingam University, India, Jan. 2012.
**

Zhili Zhou, Tachun Lin, Krishnaiyan Thulasiraman, and Guoliang Xue, “*Novel Survivable Logical Topology Routing by Logical Protecting Spanning Trees in IP-over-WDM Networks*,” **IEEE/ACM Transactions on Networking (ToN), Vol. 25, No. 3, Jun. 2017 (pp. 1673 - 1685).** **Also in Proc. of 4th 4th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), Oct. 3 - 5, 2012 (pp. 650 - 656), (Runner-up of the Best Paper Award). **[St. Petersburg, Russia]

Zhili Zhou, Tachun Lin, and Krishnaiyan Thulasiraman, “*Survivable Cloud Network Design Against Multiple Failures Through Protecting Spanning Trees*,” **IEEE/OSA Journal of Lightwave Technology (JLT), Vol. 35, No. 2, Jan. 2017 (pp. 288 - 298).**

Lavanya, B. Jayaram , S, Arumugam and K. Thulasiraman, "*Virtual Topologies for Topology Abstraction Service for IP VPNs*" **Networks 2016, Montreal, September 26-28, 2016. **

Zhili Zhou, Tachun Lin, Krishnaiyan Thulasiraman, Guoliang Xue, and Sartaj Sahni, *“Cross-Layer Network Survivability Under Multiple Cross-Layer Metrics*,” **IEEE/OSA Journal of Optical Communications and Networking (JOCN), Vol. 7, Iss. 6/JUNE 2015 (pp. 540 - 553).**

B. Jayaram, S. Arumugam and K. Thulasiraman, "*Independent Dominator Sequence Number of a Graphs*," **Procedia Computer Science Elsevier Publishing Company, December 2015.' Volume 74, 2015, Pages 43-46 .**

Zhili Zhou, Tachun Lin, Krishnaiyan Thulasiraman, “*Survivable Cloud Network Mapping with Multiple Failures*,” **Proc. of IEEE International Conference on Communications (ICC), Jun. 8 - 12, 2015 (pp. 7113 - 7118).** [London, UK]

Ying Xiao, K. Thulasiraman and Guoliang Xue and Mamta Yadav, “*QoS Routing Under Multiple Additive Constraints: A Generalization of the LARAC Algorithm*”, **IEEE Transactions on Emerging Topics in Computing, May 2015; Also see** “*GEN-LARAC: A Generalized Approach for the Constrained Shortest Path Problem Under Multiple Additive Constraints*”, Presented at **ISAAC (International Symposium on Algorithms and Computation), Sanya, China, December 2005. Appeared in Springer Verlag Lecture Notes in Computer Science Series (LNCS-3827). **

Guoliang Xue, Ravi Gottapu, Xi Fang, Gabriel Silva, Dejun Yang, and Krishnaiyan Thulasiraman,”*A Polynomial-Time Algorithm for Computing Disjoint Lightpath Pairs in Minimum Isolated-Failure-Immune WDM Optical Networks,*” **IEEE/ACM Transactions on Networking 22(2):470-483, 2014.**

Tachun Lin, Zhili Zhou, Krishnaiyan Thulasiraman, Guoliang Xue, Sartaj Sahni, “*Unified Mathematical Programming Frameworks for Survivable Logical Topology Routing in IP-over-WDM Optical Networks*,”** IEEE/OSA Journal of Optical Communications and Networking (JOCN), Vol. 6, Iss. 2/FEBRUARY, 2014 (pp. 190 - 203). **

Tachun Lin, Zhili Zhou, Krishnaiyan Thulasiraman, Guoliang Xue, “*Optimum Logical Topology Routing in an IP-over-WDM Optical Network and Physical Link Failure Localization: An Integrated Approach*,” **Proc. of 5th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), Sep. 10 - 12, 2013 (pp. 82 - 88)**. [Almaty, Kazakhstan]

Ziping Hu, Krishnaiyan Thulasiraman, Pramode K. Verma, “*Complex Networks: Traffic Dynamics, Network Performance, and Network Structure*,” **American Journal of Operations Research, Vol. 3, No. 1A, pp.187-195, Jan. 2013.**

Ziping Hu , Pramode K. Verma and K. Thulasiraman , “*Local Flow Distribution and Optimal Weighting Against Congestion and Cascading Failures in Weighted Complex Networks*,” **ECCS 13.**

Ziping Hu, Pramode K. Verma, Krishnaiyan Thulasiraman, “*Interplay Between Traffic Dynamics and Network Structure*,”** The IARIA 8th International Conference on Systems (ICONS), pp.202-206, Seville Spain, Jan. 27 - Feb. 1, 2013. **

Ravi Ravindran, Changchen Huang, and K. Thulasiraman, “*Toplogy Abstraction Service for IP VPN**s*,” **IEEE Trans. on Parallel and Distributed Systems. Jan. 2013 (vol. 24 no. 1), pp. 184-197. **See also Ravi Ravindran, Changcheng Huang and K. Thulasiraman, “Topology Abstraction as VPN Service,”** ICC 2005, Seoul, May 2005**

Zhili Zhou, Tachun Lin, Krishnaiyan Thulasiraman, “*Upper-layer Survivability in Layered Networks with Lower-layer Capacity*,”** IIE ISERC, May 19 - 23, 2012. [Orlando, FL, USA**

Y. Xiao, K. Thulasiraman, Xi Fang, D.Wang and G. Xue, “*Computing a Most Probable Delay Constrained Path: NP-Hardness and Approximation Schemes*," **IEEE Trans. Computers, Vol.61, May 2012, pp. 738-744. Also in **"*Approximation and Heuristic Algorithms for Delay Constrained Paths Selection under Inaccurate State Information*",** Proc. The First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (Qshine) 2004, Dallas, pp. 130-137.**

Krishnaiyan Thulasiraman, Tachun Lin, Zhili Zhou, “*Robustness of Logical Topology Mapping Algorithms for Survivability against Multiple Failures in an IP-Over-WDM Optical Network*,”** Communication Systems and Networks (COMSNETS), Jan. 3 - 7, 2012.** [Bangalore, India]

Tachun Lin, Zhili Zhou, Krishnaiyan Thulasiraman, “*Logical Topology Survivability in IP-over-WDM Networks: Survivable Lightpath Routing for Maximum Logical Topology Capacity and Minimum Spare Capacity Requirements*,” **8th International Workshop on the Design of Reliable Communication Networks (DRCN), Oct. 10 - 12, 2011 (pp. 1 - 8), (Runner-up of the Best Paper Award).**[Krakow, Poland] .

Krishnaiyan Thulasiraman, Muhammad Javed and Guoliang (Larry) Xue, *"Primal Meets Dual: A Generalized Theory of Logical Topology Survivability in IP-over-WDM Optical Networks*", Second International Conference on Communication Systems and Networks, Jan. 2010.

Krishnaiyan Thulasiraman, Tachun Lin, Muhammad Javed, and Guoliang (Larry) Xue, “*Logical Topology Augmentation for Guaranteed Survivability under Multiple Failures in IP-over-WDM Optical Networks*,” **Optical Switching and Networking, Vol 7, Issue 4, Dec. 2010 (pp. 206-214). Also see** *“Logical Topology Augmentation for Guaranteed Survivability under Multiple Failures in IP-over-WDM Optical Networks*,” **IEEE Advanced Networks and Telecommunication Systems (ANTS) 2009, Dec. 14-16, 2009. **[New Delhi, India]

Krishnaiyan Thulasiraman, Muhammad Javed and Guoliang (Larry) Xue, "*Primal Meets Dual: A Generalized Theory of Logical Topology Survivability in IP-over-WDM Optical Networks*", **Second International Conference on Communication Systems and Networks, Jan. 2010.**

Ravishankar Ravindran, Changcheng Huang and Krishnaiyan Thulasiraman, "*VPN Topology Abstraction Service using Centralized Core Capacity Sharing Scheme*", **IEEE ANTS 2009, Dec. 2009.**

Min Xu, Krishnaiyan Thulasiraman, and Xiao-Dong Hu, "*Conditional Diagnosability of Matching Composition Networks Under the PMC Model*," IEEE Transactions on Circuit and Systems - Express Brief Vol. 56, No. 11, November 2009.

Krishnaiyan Thulasiraman, Muhammad Javed, Tachun Lin and Guoliang (Larry) Xue, "*Logical Topology Augmentation for Guaranteed Survivability under Multiple Failures in IP-over-WDM Optical Networks*", IEEE ANTS 2009, Dec. 2009.

Krishnaiyan Thulasiraman, Muhammad Javed and Guoliang (Larry) Xue, *"**Circuits/Cutsets Duality and a Unified Algorithmic Framework for Survivable Logical Topology Design in IP-over-WDM Optical Networks*",** INFOCOM 2009, April 2009.**

Muhammad Javed , Krishnaiyan Thulasiraman and Guoliang (Larry) Xue, *"**Logical Topology Design for IP-over-WDM Networks: A Hybrid Approach for Minimum Protection Capacity*",** ICCCN, Aug. 2008.**

Min Xu, Krishnaiyan Thulasiraman and Xiao-Dong Hu, “*Identifying Codes of Cycles of Odd orders*” **European Journal of Combinatorics**, February 2008, pp.1717-1720.

Muhammad Javed , Krishnaiyan Thulasiraman and Guoliang (Larry) Xue, "*Lightpaths Routing for Single Link Failure Survivability in IP-over-WDM Networks*",** Journal Of Communication and Networks. Dec. 2007 9:394-401.**

Guoliang Xue, Weiyi Zhang, Tie Wang, and Krishnaiyan Thulasiraman ,"* On the Partial path Protection Scheme for WDM Optical Networks and Polynomial Time Computability of Primary and Secondary Paths *", Journal of Industrial and Management Optimization, Vol. 3, No. 4, Nov. 2007.

Guoliang Xue, Weiyi Zhang, Jian Tang and
Krishnaiya Thulasiraman,"*Polynomial
Time Approximation Algorithms for Multi-Constrained QoS Routing*",
Accepted for Publication in **IEEE/ACM Transactions on Networking 2007.**

Weiyi Zhang, Guoliang Xue, Jian Tang and
Krishnaiyan Thulasiraman,"*Faster
Algorithms for Constructing Recovery Trees Enhancing QoP and QoS*",
Accepted for Publication in **IEEE/ACM Transactions on Networking 2007.**

Dong Xiang, Kaiwei Li, Hideo Fujiwara and Krishnaiyan Thulasiraman, “*Constraining Transition Propagation for Low Power Scan Testing Using a Two-Stage Scan Architecture*”, **IEEE Transactions on**** Circuits and Systems**, Part II: Briefs, May 2007, pp. 450-454.

Guoliang Xue, Arunabha Sen, Weiyi Zhang, Jian Tang, and Krishnaiyan Thulasiraman, "*Finding a path subject to many additive QoS constraints*" *IEEE/ACM Transactions on Networking,* Vol. 15, February, 2007, pp.201- 211*.*

K. Thulairaman, Min Xu, Ying Xiao and Xiaodong Hu, "*Vertex Identifying Codes for Fault Isolation in Communication Networks*", Proceedings of the **International Conference on Discrete Mathematics and Applications** (ICDM 2006), Bangalore, December 2006.

Muhammad Javed, Krishnaiyan Thulasiraman, Matthew Gaines and Guoliang Xue, "*Survivability Aware Routing of Logical Topologies:
On Thiran-Kurant Approach, Evaluation and Enhancements*", **IEEE Globecom 2006.**

Guoliang Xue, Weiyi Zhang, Jian Tang, and Krishnaiyan Thulasiraman, "*An Improved Algorithm for Optimal Lightpath Establishment on a Tree Topology*", **IEEE Journal of Selected Areas in Communication- Optical Communication Networks** (IEEE JSAC-OCN), Vol.24, August 2006, pp.45-56.

Ying Xiao, Krishnaiyan Thulasiraman and Guoliang Xue, "*QoS Routing in Communication Networks: Approximation Algorithms Based on the Primal Simplex Method of Linear Programming*", **IEEE Transactions on Computers, July 2006.** Also in Ying Xiao, K.Thulasiraman and Guoliang Xue, "*The Primal Simplex Approach to the QoS Routing Problem"*, **Proc. First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QShine) 2004, pp. 120-129**.

Ying Xiao, K. Thulasiraman and Guoliang Xue, "*Constrained Shortest Link-Disjoint Paths Selection:
A Network Programming Based Approach*",**IEEE Transactions in Circuits and Systems, Vol 53, May 2006, pp 1174-1187.**Also**, a Preliminary Version in Proc. Allerton Conference on Communication, Control and Computing**,** University of Illinois, Urabana Champaign, October 2004**.

Ying Xiao, C. Hadjicostis, and K.Thulasiraman, "*The d-Identifying Codes Problem for Vertex Identification in Graphs: Probablistic Analysis and an Approximation Algorithm*", Accepted for **COCOON 2006 (12th Annual International Computing and Combinatorics Conference), Taipei, August 2006.**

Ravi S. Ravindran, C. Huang, K.Thulasiraman, "*A Dynamic Managed VPN Service: Architecture And Algorithms", ***Accepted for the ICC International Conference on Communications 2006. **

Ying Xiao, K. Thulasiraman and Guoliang Xue, “*GEN-LARAC: A Generalized Approach for the Constrained Shortest Path Problem Under Multiple Additive Constraints*”, Presented at **ISAAC** (International Symposium on Algorithms and Computation), Sanya, China, December 2005. Appeared in **Springer Verlag Lecture Notes in Computer Science Series (LNCS-3827)**.

Ying Xiao, K. Thulasiraman and Guoliang Xue, *“The Constrained Shortest Path Problem: Algorithmic Approaches and an Algebraic Study with Generalization” ***AKCE International Journal of Graphs and Combinatorics 2, No 2 pp. 63-86, Nov 2005. **Also**, a Preliminary Version in Proc. Allerton Conference on Communication, Control and Computing, University of Illinois, Urbana-Champaign, October 2003.**

Dong Xiang, Jia-Guang Sun, Jie Wu and Krishnaiyan Thulasiraman, “*Fault Tolerant Routing in Meshes/Tori Using Planarly Constructed Fault Blocks*”, **ICPP 2005, Oslo**.

K. Thulasiraman, Ying Xiao and G. Guoliang Xue, “*Recent Advances in QoS Routing”*, **ISCAS 2005, Kobe, Japan**.

G. Xue, W. Zhang, J. Tang and K. Thulasiraman, “*Establishment of Survivable Connections in WDM Networks Using Partial Path Protection*” **ICC 2005.**

Weiyi Zhang, Guoliang Xue, Jiang Tang and K. Thulasiraman, “*Linear Time Construction of Redundant Trees for Recovery Schemes Enhancing QoP and QoS”*, **INFOCOM 2005, Miami, March 2005**.

Ying Xiao, K. Thulasiraman and Guoliang Xue, "*Approximation and Heuristic Algorithms for Delay Constrained Paths Selection under Inaccurate State Information",* **Proc. The First International Conference on Quality of Service in Heterogeneous Wired/Wiresless Networks (Qshine) 2004, Dallas, pp. 130-137**.

Guoliang Xue, Li Chen and K. Thulasiraman, “*Quality of Service and Quality of Protection Issues in Preplanned recovery Schemes using Redundant Trees*” **IEEE Journal of Selected Areas in Communication (JSAC), Vol.21, October 2003, pp. 13432-1345. Also see Globecom 2002 and ICC 2002. **

R**.** Ravindran and K. Thulasiraman, "*QoS Routing in Communication Networks*", **Proc. of CIT 2002 Orissa, India. pp. 191-202.** See also R**.** Ravindran, K. Thulasiraman, G. Luo, K. Huang , A. Das and Guoliang Xue, *“QoS Routing in Communication Networks: Heuristics and Approximation Schemes with a Comparative Performance Study”,* **Special Session on Computational Graph Theory for Computer and Communication Systems at ISCAS, 2002.**

Min Quyang, M. Toulouse, K. Thulasiraman, F. Glover, and J. S. Deogun, *“MultiLevel Cooperative Search for the Circuit/Hypergraph Partitioning Problem*”,** IEEE Trans. on CAD of Integrated Circuits and Systems, vol.21, June 2002, pp. 685-693.** See also M. Toulouse, K. Thulasiraman and F. Glover, *“Multi-Level Cooperative Search*:* A New Paradigm for Combinatorial Optimization and an Application to Graph Partitioning**",* **International European Parallel Processing Conference, Vol. 1685, Lecture Notes in Computer Science, 1999, pp. 533-542.**

Ming Shan Su and K.Thulasiraman, “*A Scalable Online Multilevel Distributed Network Fault Detection/Monitoring System Based on the SNMP Protocol”*, **Proc.IEEE Globecom 2002.**

Guoliang Xue and K. Thulasiraman, “*Computing Shortest Network under a Fixed Topology*” ** IEEE Transactions on Computers, Vol. 51, September 2002, pp. 1117-1120.**

Ming Shan Su, “*Multilevel Adaptive Distributed Diagnosis for Fault Location in a Network of Processors and Design of a Distributed Network Fault Detection System Based on the SNMP Protocol*”, Based on the** Ph.D. thesis, School of Computer Science, University of Oklahoma, December 2001. **See also** Proceedings of the Allerton Conference on Communication, Control and Computing, October 2001.** See also K.Thulasiraman, Ming Shan Su and Vakul Goel, “*The Multilevel Paradigm for Distributed Fault Location in Networks with Unreliable Processors*”,** ISCAS 2003, Thailand.**

C. C. Lamb, L. S. DeBrunner, A. Das, and K. Thulasiraman, "*Distributed Diagnosis for Multiprocessor Systems using Extended Local Neighborhoods*", **IEEE Midwest Symposium on Circuits and Systems, August 2000**.

M. Toulouse, T. Crainic, and K. Thulasiraman, *“Global Optimization Properties of Parallel Cooperative Search Algorithms: A Simulation study”,* **Parallel Computing, Vol. 26, 2000, pp. 91-92.**

T. Ramalingom, A. Das and K. Thulasiraman, “*A Matroid–Theoretic Solution to* *an Assignment Problem in Communication Protocol Testing*”, **IEEE Trans. on Computers, 49(4):317-330**, **April 2000,**

Seth Noble, “*Development and Testing of a New Transport Protocol for Multimedia Application*”, **Ph.D. thesis, School of Computer Science, University of Oklahoma, 1999.**

K. Thulasiraman, K. Huang, A. Das, and V. K. Agarwal, “*Correct Diagnosis of Almost All Faulty Units in a Multiprocessor System*",** ISCAS 1999.**

M. Toulouse, T. G. Crainic, Sanso, and K. Thulasiraman, “*Self-Organization in Cooperative Tabu Search Algorithms”,* **IEEE International Conference on Systems, Man, and Cybernetics.**

K. Huang, V.K. Agarwal and K. Thulasiraman, “*Diagnosis of Clustered Faults and Wafer Testing*”, **IEEE Trans. on IC/CAD, Vol. 17, Feb. 1998, pp. 136-148. **See also K. Huang, V.K. Agarwal and K. Thulasiraman, *“Wafer Probing with Imperfect* *Comparison**”*, **Proc. Intl. Symp. on Fault Tolerant Computing, Boston, July 1992.**

C. C. Lamb, A. Das, K. Thulasiraman, L. Debrunner, J. Fagan, R. Sexton, *“Fault-tolerance Of The Global Navigation System, Using System-Level Diagnosis”*, **Asilomar Conference on Signals Systems and Computers, California, Nov. 1997.**

K. Thulasiraman, and A. Das, *“Networked Computing for the Max-Flow Problem”*, **World Multiconference on Systematics, Cybernetics and Informatics, Venezuela, July 1997.**

J. Opatrny, D. Sotteau, N. Srinivasan and K. Thulasiraman,* “DCC Linear Congruential Graphs: A New Class of Interconnection Networks”*, **IEEE Trans. Computers, Vol. 45, Feb. 1996, pp. 156-164.**

S. Gao, and K. Thulasiraman, "*An Improved Rectilinear Steiner Tree Algorithm for Terminals Located on a Convex Polygon*".

M. Kaufmann, S. Gao, and K. Thulasiraman, "*An Algorithm for Steiner Trees in Grid Graphs and its Application to Homotopic Routing*", **Journal of Circuits, Systems and Computers. Vol. 6, 1996, pp. 1-14.**

J. Lienig and K. Thulasiraman, *“GASBOR: A New Genetic Algorithm for Switch-Box Routing in Integrated Circuits”*, **Journal of Circuits, Systems and Computers. Vol. 6, 1996, pp. 356-373.** See also J. Lienig and K. Thulasiraman, *“GASBOR: A Genetic Algorithm for Switch-Box Routing in Integrated Circuits”*, **Proc. AI ‘94 Workshop on Evolutionary Computation, Armidale, Australia, 1994, pp. 199-212.**

T. Ramalingom, K. Thulasiraman and A. Das, “*Context Independent Unique State Identification Sequences for Testing Communication Protocols Modeled as Extended Finite State Machines” ***Computer Communication, Vol. 18, No. 5, 1995, pp. 329-337**.

A. Safir, B. Haroun, B. and K. Thulasiraman, "*Floorplanning with Datapath Optimization*",** ISCAS Vol 1, May 1995 pp. 41 - 44**

K. Huang, V. K. Agarwal and K. Thulasiraman, *“A Diagnosis Algorithm for Constant Degree Structures and Application to VLSI Circuit Testing”, * **IEEE Trans. on Parallel and Distributed Systems, Vol. 6, April 1995, pp. 363-372.**

R. P. Chalasani and K. Thulasiraman, *“Parallel Computing for Network Optimization: A Cluster Based Approach for the Dual Transshipment Problem”*, **Proc. Seventh IEEE Symposium on Parallel and Distributed Processing, San Antonio, 1995. pp. 66-73.**

T. Ramalingam, K. Thulasiraman and A. Das,* “On Testing and Diagnosis of Communication Protocols Based on the FSM Model”*, **Computer Communications, Vol. 18, No. 5, 1995, pp. 329-337. **

T. Ramalingam, K. Thulasiraman and A. Das,* “Fault Detection and Diagnosis Capabilities of Test Selection Methods for FSM-Based Protocols”*, **Computer Communications, Vol. 18, No. 2, 1995, pp. 113-122.**

T. Ramalingam, A. Das and K. Thulasiraman,* “A Unified Test Case Generation Method for the EFSM Model using Context Independent UIO Sequences”*, **Proceedings International Workshop on Protocol Test Systems, Evry, France, September 1995, pp. 289-306.**

S. Gao and K. Thulasiraman, *“A Parallel Algorithm for Floorplanning with Integrated Global Routing”,*

S. Khanna, S. Gao and K. Thulasiraman, *“Parallel Hierachical Global Routing for General Cell Layout”*, **Proceedings Fifth Great Lakes Symposium on VLSI, 1995, pp. 212-215.**

R. P. Chalasani, K. Thulasiraman and M. A. Comeau,* “Integrated VLSI Layout Computation and Wire Balancing on a Shared Memory Multiprocessor: Evaluation of a Parallel Algorithm”*, **Proc. International Symp. on Parallel Architectures, Algorithms and Networks, (ISPAN), December, 1994, Kanazawa, Japan, pp. 49-56.**

A. Das, K. Thulasiraman and V. K. Agarwal,* “Diagnosis of t/t+1-Dianosable Systems”*, **SIAM Journal on Computing, Vol. 23, October 1994, pp. 895-905.**

T. Ramalingam, A. Das and K. Thulasiraman, *“A Generalization of the Multiple UIO-Sequence Method of Test Selection for FSM-Based Protocols”*, **International Workshop on Protocol Test Systems, Tokyo, November 1994, pp. 209-224**.

J. Lienig and K. Thulasiraman, *“A Genetic Algorithm for Channel Routing in VLSI Circuits”*, **Evolutionary Computation, Vol. 1, No. 4, 1994, pp. 293-331.** Also see **Proc. Seventh Intl. Conf. on VLSI Design, Calcutta, January 1994, pp. 133-136.**

A. Safir, B. Haroun and K. Thulasiraman, *“A Floorplanner Driven by Structural and Timing Constraints”*, **Proc. IEEE Intl. Symp. Circuits and Systems, London, May 1994.**

M. K. Kaufmann, S. Gao and K. Thulasiraman,* “On Steiner Minimal Trees in Grid Graphs and Its Application to VLSI Routing”*, **Proc. 5th Intl. Symposium on Algorithms and Computations, 1994, pp. 351-359.**

K. Thulasiraman, R. P. Chalasani, P. Thulasiraman and M. A. Comeau, *“Parallel Network Primal-Dual Method on a Shared Memory Multiprocessor and A Unified Approach to VLSI Layout Compaction and Wire Balancing”*, **Proc. IEEE VLSI Design ‘93, Bombay, Jan. 1993.**

A. Das, K. Thulasiraman, V. K. Agarwal and K. B. Lakshmanan, *“Multiprocessor Fault Diagnosis Under Local Constraints”,* **IEEE Trans. on Computers, Vol. 42, No. 8, Aug. 1993, pp. 984-988.** Also see A. Das, K. Thulasiraman, K. B. Lakshmanan and V.K. Agarwal**, "***System Level Diagnosis with Local Constraints***", IEEE International Symp. on Circuits and Systems, Portland, Oregon, May 1989.**

T. Ramalingam, A. Das, and K. Thulasiraman, "*On Conformance Test and Fault Resolution of Protocols Based on FSM Model*", **Computer Networks, Architecture, and Applications, 1993, pp 211-222**

K. Thulasiraman, A. Das and V. K. Agrawal, *“Distributed Fault Diagnosis of a Ring of Processors”*, **Parallel Processing Letters, Vol. 3, No. 2, 1993, pp. 195-204**

K. Thulasiraman, R. P. Chalasani and M. A. Comeau,* “Parallel Network Dual Simplex Method on a Shared Memory Multiprocessor”*, **Proc. 5th IEEE Symp. on Parallel and Distributed Processing, Dallas, December 1993, pp. 408-415.**

K. Huang, A. Das, V. K. Agarwal and K. Thulasiraman, "*A Class of 2-Step Diagnosable Systems: Degree of Diagnosability and a Diagnosis Algorithm*", **ISCAS 1992.**

S. Srinivas, K. Thulasiraman and M.N.S. Swamy, *“A MIN-based Reconfigurable Architecture for de Bruijn Structures”,* **International Journal of High Speed Electronics, Vol. 3, 1992, pp. 279-296.**

Y. Zhao, L. Tao, K. Thulasiraman and M.N.S. Swamy, *“Simulated Annealing and Tabu Search Algorithms for Multiway Graph Partition”*, **Journal of Circuits, Systems and Computers, Vol. 2, No. 2, 1992, pp. 159-185.**

J. Lienig, K. Thulasiraman and M.N.S. Swamy, *“Routing Algorithms for Multi-Chip Modules”*, **Proc. European Design Automation Conf., Hamburg, 1992, pp. 286-291.**

B. Khasnabish, M. Ahmadi, M. Shridhar, and K. Thulasiraman, "*A Naturally Intelligent Lightwave Communication Network*", **GLOBECOM 1991 Phoenix, AZ **

A. Das, K. Thulasiraman and V. K. Agarwal, *“Diagnosis of t/s-Diagnosable Systems”*, **Journal of Circuits, Systems and Computers, Vol. 1, No. 4, 1991, pp. 353-371.** See also **3rd Intl. Workshop on Graph-Theoretic Concepts in Computer Science, June 1990.**

V. Krishnamoorthy, K. Thulasiraman and M. N. S. Swamy, “*Incremental Distance and Diameter Sequences of a Graph: New Measures of Network Performance*”, **IEEE Transactions on Computers, Vol.39, Feb. 1990, pp.230-237.**

Y. C. Zhao, L. Tao, K. Thulasiraman and M. N. S. Swamy, *“An Efficient Simulated Annealing Algorithm for Graph Bisectioning ”*, **Proc. Canadian Conf. on Electrical and Comp. Engr., Ottawa, Canada, 1991.**

K. Thulasiraman, M. A. Comeau, R. P. Chalasani, A. Das and J. W. Atwood, *“On the Design of a Parallel Algorithm for VLSI Layout Compaction”*, **ISCAS 1990, New Orleans, May 1990.**

V. Krishnamoorthy, K. Thulasiraman and M. N. S. Swamy, *“Minimum Order Graphs with Specified Diameter, Connectivity and Regularity”*, **Networks Journal, Vol. 19, 1989, pp. 24-46.**

K. B. Lakshmanan, K. Thulasiraman and M. Comeau,* “An Efficient Distributed Protocol for the Single Source Shortest Path Problem In Networks with Negative Weights”*, **IEEE Trans. on Software Engineering, Vol. 15, May 1989, pp. 639-644.**

R. Jayakumar, K. Thulasiraman and M. N. S. Swamy,* “O(N2) Algorithms for Graph Planarization”*, **IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, Vol. CAD-8, March, 1989, pp. 257-267.**

R. Jayakumar, K. Thulasiraman and M. N. S. Swamy,* “MOD-CHAR: An Implementation of Char’s Spanning Tree Enumeration Algorithm and its Complexity Analysis ”*

P. Rioux, B. T. Smith, and K. Thulasiraman, "*A Simplex Solution to the Minimum Cost Nonsimultaneous Multicommodity Flow Problem*", **Center for Research on Transportation**. Based on “*Minimum Cost Sizing of Rearrangeable Networks with Multiperiod Demands*”, **Ph.D. thesis, Electrical and Computer Engineering, Concordia University, Montreal, Canada, Feb., 1988. (Co-supervisor: B.T. Smith, Ecole Polytechnic, Montreal).**

M. A .Comeau and K. Thulasiraman, *“Structure of the Submarking Reachability Problem and Network Programming”*, **IEEE Transactions on Circuits and Systems, Vol. CAS-35, Jan. 1988, pp. 89-100**. See also K. Thulasiraman and M. A. Comeau, *“Structure of the Submarking Reachability Problem and Network Programming”, ***Proc. IEEE Intl. Symp. on Circuits and Systems, Philadelphia, May 1987.**

K. Thulasiraman and M. A. Comeau, *“Structure of a Reachability Problem for (0,1) Capacitated Marked Graphs”,* **IEEE Trans. on Circuits and Systems, Vol. CAS-34, April 1987, pp. 430-431.**

K. Thulasiraman, R. Jayakumar and M. N. S. Swamy,* “Planar Embedding: Linear-Time Algorithms for Vertex Placement and Edge Ordering”,* **IEEE Trans. on Circuits and Systems, Vol. CAS-35, March 1988, pp. 334-344**. Also see **K. Thulasiraman, R. Jayakumar and M. N. S. Swamy, “**

K. B. Lakshmanan and K. Thulasiraman, "*On the Use of Synchronizers for Asynchronous Communication Networks*", **Workshop on Distributed Algorithms, Amsterdam July 1987**

Y. Kajitani, H. Miyayo, S. Ueno, and K. Thulasiraman, "*On the Optimal Synchronizer for Asynchronous Distributed Networks*", **Proc. Tech. Group on CAS, IEICE, Nov 1988.**

A. Das, K. B. Lakshmanan, K. Thulasiraman and V. K. Agarwal, *“Distributed Diagnosis for Regular Interconnected Systems”*, **Proc. 2nd Intl. Conference on Super Computing, Santa Clara, U.S.A., May 1987.**

K. Thulasiraman and M. A. Comeau, *“Maximum-Weight Markings in Marked Graphs: Algorithms and Interpretations Based on the Simplex Method”*, **IEEE Trans. on Circuits and Systems, Vol. CAS-34, December 1987, pp. 1535-1545.**Also see **IEEE International Symposium on Circuits and Systems, Kyoto, Japan, June 1985.**

K. B. Lakshmanan, N. Meenakshi and K. Thulasiraman, *“A Time-Optimal Message-Efficient Distributed Algorithm for Depth-First Search”*, **Information Processing Letters, Vol. 25, No. 2, May 1987, pp. 103-109.**

A. Das, K. B. Lakshmanan, K. Thulasiraman and V. K. Agarwal, *“Generalized Characterizations of Diagnosable Systems Based on Kohda’s Theorem”*, **Proc. 1987 Conference on Information Sciences and Systems, March 1987.**

M. A. Comeau, K. Thulasiraman and K. B. Lakshmanan, *“An Efficient Asynchronous Distributed Protocol to Test Feasibility of the Dual Transshipment Problem”,* **25th Allerton Conference on Communication, Control and Computing, University of Illinois, Urbana- Campaign, September 1987.**

K. Thulasiraman, R. Jayakumar and M. N. S. Swamy,* “On Maximal Planarization of Non-Planar Graphs”*, **IEEE Trans. on Circuits and Systems, Vol. CAS-33, Aug. 1986, pp. 843- 844.** Also see K. Thulasiraman, R. Jayakumar and M. N. S. Swamy, *“An Optimal Algorithm for Maximal Planarization of Non-Planar Graphs”,*** Proc. IEEE Intl. Symp. on Circuits and Systems, San Jose, May 1986.**

K. Thulasiraman and R. Jayakumar, *“Optimum Single-Row Routing with No Cross-Overs”,* **Canadian VLSI Conference, November 1985.**

K. Thulasiraman, P. S. Reddy and M. G. G. Naidu,* “Similarity of Graphs and Enumeration of Distinct nth Order Symmetric Sign Patterns”*, **Canadian Electrical Engineering Journal, Vol. 10, Jan. 1985, pp. 9-14.** See also **Proc. IEEE Intl.** **Symp. on Circuits and Systems, Rome, 1983.**

K. Thulasiraman, *“On Description and Realization of Resistance n-port Networks”,* **IEEE Trans. on Circuits and Systems, Vol. CAS-32, March 1985, pp. 296-297.**

J. Natesan, K. Thulasiraman and M. N. S. Swamy, *“Reliability and Availability Analysis of an n-unit Outdoor Power System Subject to Adjustable Repair Facility”*, **Microelectronics and Reliability, Vol. 24, 1984, pp. 1039-1043.**

R. Jayakumar, K. Thulasiraman and M. N. S. Swamy, “*Complexity of Computation of a Spanning Tree Enumeration Algorithm*”, **IEEE Transactions on Circuits and Systems, Vol. CAS-31, October 1984,pp.853-860**.Also see R. Jayakumar and K. Thulasiraman, *“Analysis of a Spanning Tree Enumeration Algorithm”,* **Springer Verlag Lecture Notes on Mathematics, Vol. 882, 1982, pp. 281-290.**

M. A. Comeau and K. Thulasiraman, *“Algorithms on Marked Directed Graphs”,* **Canadian Electrical Engg. Journal, Vol. 9, 1984, pp. 72-79. **Also see **Proc. IEEE Intl. Symp. on Circuits and Systems, Newport Beach, May 1983.**

K. Thulasiraman, “*A Combinatorial Problem in the Analysis of a Graph Algorithm and the Min-Tree Number of a Graph”,* **invited lecture at the South Asian Conference on Graph Theory, Singapore, May 1983.**

K. Thulasiraman, R. Jayakumar and M. N. S. Swamy, *“Graph Theoretic Proof of a Network Theorem and Some Consequences”*, **Proc. IEEE, June 1983, pp. 771-772.**

K. Thulasiraman and M. A. Comeau, *“On Determining a Computable Ordering of a Digital Network”*, **Proc. IEEE, Vol. 71, November 1983, pp. 1323-1324.**

K. Thulasiraman and M. N. S. Swamy, “*A Theorem in the Theory of Determinants and the Number of Spanning Trees of a Graph*”, **Canadian Electrical Engg. Journal, Vol. 8, 1983, pp. 147-52.**

P. K. Rajan and K. Thulasiraman, * “On an Extremal Problem in Graph Theory and Its Applications”*,** Proc. IEEE International Symposium on Circuits and Systems, Tokyo, July 1979, pp. 445-448**

K. Thulasiraman, M. N. S. Swamy and P. S. Reddy, *“(N+P)-node Realizability of Y-Matrices of (N+1)-node Resistance Networks”*, **International Journal of Circuit Theory and Applications, Vol. 6, 1978, pp. 253-263.**

P. S. Reddy and K. Thulasiraman, *“Synthesis of the K-Matrix of (N+3)-node Resistive n-port Networks”*, **Z. Elektr. Inform. U. Energietechnik, Leipzig, 1978, pp. 86-92.**

M. G. G. Naidu, P. S. Reddy and K. Thulasiraman, *“Continuously Equivalent Realizations of 3rd-order Paramount Matrices”*, **International Journal of Circuit Theory and Applications, Vol. 5, 1977, pp. 403-408.**

M. G. G. Naidu, P. S. Reddy and K. Thulasiraman, *“On the Number of Conductances Required for Realizing Y and K Matrices”*, **International Journal of Circuit Theory and Applications, Vol. 5, 1977, pp. 219-225.**

K. N. Venkataraman and K. Thulasiraman, * “An Algorithm for Coding Undirected Graphs”*, **IEEE International Symposium on Information Theory, Cornell University, August 1977.**

M. G. G. Naidu, P. S. Reddy and K. Thulasiraman, *“(n+2)-node Resistive n-port Realizability of Y-Matrices”*, **IEEE Trans.on Circuits and Systems, Vol. CAS-23, May 1976, pp. 254- 261.**

M. G. G. Naidu, P. S. Reddy and K. Thulasiraman, *“Synthesis of Resistive Networks from Third Order Paramount Matrices”*, **IEEE Trans.on Circuits and Systems, Vol. CAS-22, Dec. 1975, pp. 937-943.**

M. G. G. Naidu, K. Thulasiraman and M. N. S. Swamy, *“The n-port Resistive Network Synthesis from Prescribed Sensitivity Coefficients”*, **IEEE Trans. On Circuits and Systems, Vol. CAS-22, June 1975, pp. 482-485.**

P. S. Reddy and K. Thulasiraman, *“Analysis and Synthesis of the K and Y Matrices of Resistive n-port Networks”*, **Z. Elektri. Inform. U. Energietechnik, Leipzig 5, 1975, pp. 81-96.**

P. K. Rajan and K. Thulasiraman, “*K-Sets of a Graph and Vulnerability of Communication Nets”, Matrix and Tensor Quarterly*

P. K. Rajan and K.Thulasiraman, “ *K-Sets of a Graph and Vulnerability of Communication Nets”, Matrix and Tensor Quarterly*

P. A. Ramamoorthy and K. Thulasiraman*, "Active RC n-port Network Synthesis Using Nullators and Norators”*, **IEEE Trans. on Circuit Theory, Vol. CAS-21, March 1974, pp. 206-209.**

M. N. S. Swamy, C. Bhushan and K. Thulasiraman,* “Sensitivity Invariants for Linear Time- invariant Networks”*, **IEEE Trans. on Circuit Theory, Vol. CT-20, January 1973, pp. 21-24.**

P. A. Ramamoorthy, K. Sankar Rao and K. Thulasiraman, *“Synthesis of Rational Voltage Transfer Matrices Using Minimum Number of Capacitors with Operational Amplifiers”,* **Proc. IEEE International Symposium on Circuit Theory, April 1973, pp. 294-297.**

P. S. Reddy and K. Thulasiraman,* “Synthesis of (n+2)-node Resistive n-Port Networks”*, **IEEE Trans. on Circuit Theory, Vol. CT-19, January 1972, pp. 20-25. **Also see K. Thulasiraman and P. S. Reddy,* “Synthesis of (n+2)-node Resistive n-port Networks”*, **Proc. IEEE International Symposium on Circuit Theory, 1970.**

** **M. N. S. Swamy, C. Bhushan and K. Thulasiraman,*“Sensitivity Invariants for Nonlinear Networks”,* **IEEE Trans. on Circuit Theory, Vol. CT-19, November 1972, pp. 599-606.****.**

M. N. S. Swamy, C. Bhushan and K. Thulasiraman,*“Sensitivity Invariants for Active Lumped/Distributed Networks”,* **Electronics Letters, January 1972, pp. 26-27.** See also **ISCAS 1972**

M. N. S. Swamy, C. Bhushan and K. Thulasiraman,* “Simple Sensitivity Formulas in Terms of Immittance Parameters”*, **Electronics Letters, March 1972, pp. 153-154**.

M. N. S. Swamy and K. Thulasiraman, *“Inverse of a Non-Singular Submatrix of a Reduced Incidence Matrix”*, **Matrix and Tensor Quarterly, March 1972, pp. 106-108.**

M. N. S. Swamy, C. Bhushan and K. Thulasiraman,* “Bounds on the Sum of Element Sensitivity Magnitudes for Network Functions”*, **IEEE Trans. on Circuit Theory, Vol. CT-19, Sept. 1972, pp. 502-504.** See also M. N. S. Swamy, C. Bhushan and K. Thulasiraman, *“Bounds on the Sum of Element Sensitivity Magnitudes for Network Function ”*

M. N. S. Swamy, and K. Thulasiraman,* “A Sufficient Condition for the Synthesis of the K-Matrix of n-Port Networks”*, **IEEE Trans. on Circuit Theory, Vol. CT-19, July 1972, pp. 378-380.**

M. N. S. Swamy, and K. Thulasiraman, *“Realization of the A-Matrix of RLC Networks”*, **IEEE Trans. on Circuit Theory, Vol. CT-19, Sept. 1972, pp. 515-518.** See also M. N. S. Swamy, and K. Thulasiraman, *“Realization of the A-matrix of RLC Networks”*, **Proc. IEEE International Symposium on Circuit Theory, 1971.**

K. Thulasiraman and M. N. S. Swamy,* “Relationship Between Cutset and Node-Pair Transformation Matrices”*, **Electronics Letters, May 1971, pp. 276-277.**

K. Thulasiraman, and M. N. S. Swamy, *“On a Theorem in Graph Theory”*, **Matrix and Tensor Quarterly, September 1971, pp. 31-32.**

K. Thulasiraman and M. N. S. Swamy.* “Unimodular Property of Fundamental Cutset and Circuit Matrices”*, **Matrix and Tensor Quarterly, December 1971, pp. 65-67.**

P. S. Reddy and K. Thulasiraman, “*Synthesis of K-Matrix of (n+1)-node Resistive n-port Networks*”, **Proc. Asilomar Conference on Circuits and Systems, November pp. 588- 590, 1971. See also Proc. Asilomar Conference on Circuits and Systems, 1971.**

M. N. S. Swamy and K. Thulasiraman, *“Synthesis of Multivariable Networks”*, **Proc. Asilomar Conference on Circuits and Systems, November 1971, pp. 571-575.**

P. S. Reddy and K. Thulasiraman, *“Synthesis of the K-matrix of an N-port Network and its Application to Y-matrix Synthesis”, ***Proc. IEEE Intl. symp. on Circuit Theory, 1970.**

P. S. Reddy, V. G. K. Murti and K. Thulasiraman,* “Realization of Modified Cut-Set Matrix and Applications”*, **IEEE Trans. on Circuit Theory, Vol. CT-17, November 1970, pp. 475-486.** See also **Proc. IEEE Intl. Symp. on Circuit Theory, 1969.**

K. Thulasiraman and V. G. K. Murti, *“The Modified Circuit Matrix of an n-port Network and its Applications”*, **IEEE Trans. on Circuit Theory, Vol. CT-16, February 1969, pp. 2-7.**

K. Thulasiraman and V. G. K. Murti, *“Synthesis Application of the Modified Cutset Matrix*", **Proc. IEE, London, Vol. 115, Sept. 1968, pp. 1269-1274.**

K. Thulasiraman and V. G. K. Murti, *“The Modified Cutset Matrix of an n-port Network”*, **Proc. IEE London, Vol. 115, Sept. 1968, pp. 1263-1268.** See also **Proc. International Symposium on Circuit Theory, 1968.**

V. G. K. Murti and K. Thulasiraman, *“Synthesis of a Class n-port Networks”*, **IEEE Trans. on Circuit Theory, Vol. CT-15, March 1968, pp. 54-64.**

C. Eswaran and K. Thulasiraman, *“Synthesis of a Class of Resistive 3-port Networks”*, **International Journal of Electronics, 1968 Vol 24 pp. 597-603.**

K. Thulasiraman and V. G. K. Murti, *“Pseudo-Series Combination of n-port Networks”*, **Proc. IEEE, Vol. 56, June 1968, pp. 1143-1144**

K. Thulasiraman and V. G. K. Murti, *“Parallel Connection of n-port Networks”*, **Proc. IEEE, Vol. 55, July 1967, pp. 1216-1217.**

K. Thulasiraman and V. G. K. Murti, *“Comments on ‘On Equivalence of Resistive n-Port Networks"”*, **IEEE Trans. on Circuit Theory, Vol. CT-14, September 1967, pp. 357-359.**

S. Srinivasan, V. N. Sujeer and K. Thulasiraman,* “Application of Equivalence Technique in Linear Graph Theory to Restoration Process in a Power System”*, **Journal of the Institution of Engineers, (India), Vol. XLVII, No. 10, June 1967, pp. 526-543.**

S. Srinivasan, V. N. Sujeer and K. Thulasiraman, *“Application of Equivalence Technique in Linear Graph Theory to Reduction Process in a Power System”,* **Journal of the Institution of Engineers, (India), vol. XLVI, No. 12 June 1966, pp. 528-549**