☰

Krishnaiyan Thulasiraman - Publications

Affiliations: 
University of Oklahoma, Norman, OK, United States 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

84 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Xu M, Naik K, Thulasiraman K. Fault tolerance of hypercube like networks: Spanning laceability under edge faults Theoretical Computer Science. 835: 44-57. DOI: 10.1016/J.Tcs.2020.05.049  0.364
2020 Abdian AZ, Thulasiraman K, Zhao K. The spectral characterization of the connected multicone graphs Kw▽mKn,n Akce International Journal of Graphs and Combinatorics. 17: 606-613. DOI: 10.1016/J.Akcej.2019.03.013  0.364
2020 Abdian AZ, Beineke LW, Oboudi MR, Behmaram A, Thulasiraman K, Alikhani S, Zhao K. On the spectral determinations of the connected multicone graphs Kr▽sKt Akce International Journal of Graphs and Combinatorics. 17: 149-158. DOI: 10.1016/J.Akcej.2018.11.002  0.336
2019 Thulasiraman K, Yadav M, Naik K. Network Science Meets Circuit Theory: Resistance Distance, Kirchhoff Index, and Foster’s Theorems With Generalizations and Unification Ieee Transactions On Circuits and Systems I-Regular Papers. 66: 1090-1103. DOI: 10.1109/Tcsi.2018.2880601  0.405
2018 Ravindran R, Huang C, Thulasiraman K, Lin T. Topology Abstraction Service for IP VPNs: Core Network Partitioning for Resource Sharing American Journal of Operations Research. 8: 167-202. DOI: 10.4236/Ajor.2018.83011  0.36
2017 Zhou Z, Lin T, Thulasiraman K, Xue G. Novel Survivable Logical Topology Routing by Logical Protecting Spanning Trees in IP-Over-WDM Networks Ieee Acm Transactions On Networking. 25: 1673-1685. DOI: 10.1109/Tnet.2016.2639362  0.43
2017 Zhou Z, Lin T, Thulasiraman K. Survivable Cloud Network Design Against Multiple Failures Through Protecting Spanning Trees Journal of Lightwave Technology. 35: 288-298. DOI: 10.1109/Jlt.2016.2637352  0.373
2017 Xu M, Thulasiraman K, Zhu Q. Conditional diagnosability of a class of matching composition networks under the comparison model Theoretical Computer Science. 674: 43-52. DOI: 10.1016/J.Tcs.2017.02.010  0.395
2016 Xiao Y, Thulasiraman K, Xue G, Yadav M. QoS Routing under Multiple Additive Constraints: A Generalization of the LARAC Algorithm Ieee Transactions On Emerging Topics in Computing. 4: 242-251. DOI: 10.1109/Tetc.2015.2428654  0.418
2015 Zhou Z, Lin T, Thulasiraman K, Xue G, Sahni S. Cross-layer network survivability under multiple cross-layer metrics Journal of Optical Communications and Networking. 7: 540-553. DOI: 10.1364/Jocn.7.000540  0.374
2014 Lin T, Zhou Z, Thulasiraman K, Xue G, Sahni S. Unified mathematical programming frameworks for survivable logical topology routing in IP-over-WDM optical networks Journal of Optical Communications and Networking. 6: 190-203. DOI: 10.1364/Jocn.6.000190  0.377
2014 Xue G, Gottapu R, Fang X, Yang D, Thulasiraman K. A polynomial-time algorithm for computing disjoint lightpath pairs in minimum isolated-failure-immune WDM optical networks Ieee/Acm Transactions On Networking. 22: 470-483. DOI: 10.1109/Tnet.2013.2257180  0.473
2013 Hu Z, Thulasiraman K, Verma PK. Complex Networks: Traffic Dynamics, Network Performance, and Network Structure American Journal of Operations Research. 3: 187-195. DOI: 10.4236/Ajor.2013.31A018  0.378
2012 Xiao Y, Thulasiraman K, Fang X, Yang D, Xue G. Computing a most probable delay constrained path: NP-hardness and approximation schemes Ieee Transactions On Computers. 61: 738-744. DOI: 10.1109/Tc.2011.61  0.401
2012 Zhou Z, Lin T, Thulasiraman K, Xue G, Sahni S. Novel survivable logical topology routing in IP-over-WDM networks by logical protecting spanning tree set International Congress On Ultra Modern Telecommunications and Control Systems and Workshops. 650-656. DOI: 10.1109/ICUMT.2012.6459748  0.338
2012 Thulasiraman K, Lin T, Zhou Z, Xue G. Robustness of logical topology mapping algorithms for survivability against multiple failures in an IP-over-WDM optical network 2012 4th International Conference On Communication Systems and Networks, Comsnets 2012. DOI: 10.1109/COMSNETS.2012.6151344  0.303
2010 Thulasiraman K, Lin T, Javed M, Xue G. Logical topology augmentation for guaranteed survivability under multiple failures in IP-over-WDM optical networks Optical Switching and Networking. 7: 206-214. DOI: 10.1016/S9999-9994(10)20547-0  0.383
2009 Xu M, Thulasiraman K, Hu XD. Conditional diagnosability of matching composition networks under the PMC model Ieee Transactions On Circuits and Systems Ii: Express Briefs. 56: 875-879. DOI: 10.1109/Tcsii.2009.2030361  0.409
2009 Thulasiraman K, Javed MS, Xue G. Circuits/cutsets duality and a unified algorithmic framework for survivable logical topology design in IP-over-WDM optical networks Proceedings - Ieee Infocom. 1026-1034. DOI: 10.1109/INFCOM.2009.5062014  0.33
2008 Xue G, Zhang W, Tang J, Thulasiraman K. Polynomial time approximation algorithms for multi-constrained QoS routing Ieee/Acm Transactions On Networking. 16: 656-669. DOI: 10.1109/Tnet.2007.900712  0.383
2008 Zhang W, Xue G, Tang J, Thulasiraman K. Faster algorithms for construction of recovery trees enhancing QoP and QoS Ieee/Acm Transactions On Networking. 16: 642-655. DOI: 10.1109/Tnet.2007.900705  0.373
2007 Xue G, Zhang W, Wang T, Thulasiraman K. 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. 3: 625-643. DOI: 10.3934/Jimo.2007.3.625  0.401
2007 Javed M, Thulasiraman K, Xue G. Lightpaths routing for single link failure survivability in IP-over-WDM networks Journal of Communications and Networks. 9: 394-401. DOI: 10.1109/Jcn.2007.6182874  0.371
2006 Xiao Y, Thulasiraman K, Xue G. Constrained shortest link-disjoint paths selection: A network programming based approach Ieee Transactions On Circuits and Systems I: Regular Papers. 53: 1174-1187. DOI: 10.1109/Tcsi.2006.869907  0.369
2006 Xiao Y, Thulasiraman K, Xue G. QoS routing in communication networks: Approximation algorithms based on the primal simplex method of Linear Programming Ieee Transactions On Computers. 55: 815-829. DOI: 10.1109/Tc.2006.109  0.432
2006 Xue G, Zhang W, Tang J, Thulasiraman K. An improved algorithm for optimal lightpath establishment on a tree topology Ieee Journal On Selected Areas in Communications. 24: 45-56. DOI: 10.1109/Jsac-Ocn.2006.22605  0.444
2005 Xiao Y, Thulasiraman K, Xue G. GEN-LARAC: A generalized approach to the constrained shortest path problem under multiple additive constraints Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3827: 92-105. DOI: 10.1007/11602613_11  0.335
2004 Xiao Y, Thulasiraman K, Xue G. Approximation and heuristic algorithms for delay constrained path selection under inaccurate state information Proceedings - First International Conference On Quality of Service in Heterogeneous Wired/Wireless Networks, Qshine 2004. 130-137.  0.317
2003 Xue G, Chen L, Thulasiraman K. Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundant trees Ieee Journal On Selected Areas in Communications. 21: 1332-1345. DOI: 10.1109/Jsac.2003.816597  0.342
2002 Ouyang M, Toulouse M, Thulasiraman K, Glover F, Deogun JS. Multilevel cooperative search for the circuit/hypergraph partitioning problem Ieee Transactions On Computer-Aided Design of Integrated Circuits and Systems. 21: 685-693. DOI: 10.1109/Tcad.2002.1004312  0.326
2002 Xue G, Thulasiraman K. Computing the shortest network under a fixed topology Ieee Transactions On Computers. 51: 1117-1120. DOI: 10.1109/Tc.2002.1032632  0.419
2002 Xue G, Chen L, Thulasiraman K. Delay reduction in redundant trees for pre-planned protection against single link/node failure in 2-connected graphs Conference Record / Ieee Global Telecommunications Conference. 3: 2691-2695.  0.305
2002 Ravindran R, Thulasiraman K, Das A, Huang K, Luo G, Xue G. Quality of service routing: Heuristics and approximation schemes with a comparative evaluation Proceedings - Ieee International Symposium On Circuits and Systems. 3.  0.301
2000 Ramalingom T, Thulasiraman K, Das A. A matroid-theoretic solution to an assignment problem in the conformance testing of communication protocols Ieee Transactions On Computers. 49: 317-330. DOI: 10.1109/12.844345  0.378
1998 Huang K, Agarwal VK, Thulasiraman K. Diagnosis of clustered faults and wafer testing Ieee Transactions On Computer-Aided Design of Integrated Circuits and Systems. 17: 136-148. DOI: 10.1109/43.681263  0.318
1996 Lienig J, Thulasiraman K. Gasbor: A genetic algorithm approach for solving the switchbox routing problem Journal of Circuits, Systems and Computers. 6: 359-373. DOI: 10.1142/S0218126696000248  0.344
1996 Kaufmann M, Gao S, Thulasiraman K. An algorithm for Steiner trees in grid graphs and its application to homotopic routing Journal of Circuits, Systems and Computers. 6: 1-13. DOI: 10.1142/S0218126696000029  0.423
1996 Opatrny J, Sotteau D, Srinivasan N, Thulasiraman K. DCC linear congruential graphs: A new class of interconnection networks Ieee Transactions On Computers. 45: 156-164. DOI: 10.1109/12.485369  0.369
1995 Huang K, Agarwal VK, LaForge L, Thulasiraman K. A Diagnosis Algorithm for Constant Degree Structures and Its Application to VLSI Circuit Testing Ieee Transactions On Parallel and Distributed Systems. 6: 363-372. DOI: 10.1109/71.372790  0.349
1993 Lienig J, Thulasiraman K. A genetic algorithm for channel routing in vlsi circuits Evolutionary Computation. 1: 293-311. DOI: 10.1162/Evco.1993.1.4.293  0.32
1993 Das A, Thulasiraman K, Lakshmanan KB, Agarwal VK. Distributed Fault Diagnosis Of A Ring Of Processors Parallel Processing Letters. 3: 195-204. DOI: 10.1142/S0129626493000241  0.301
1993 Thulasiraman K, Chalasani RP, Comeau MA. Parallel network dual simplex method on a shared memory multiprocessor Proceedings of the 5th Ieee Symposium On Parallel and Distributed Processing. 408-415.  0.3
1992 TAO L, ZHAO Y, THULASIRAMAN K, SWAMY M. SIMULATED ANNEALING AND TABU SEARCH ALGORITHMS FOR MULTIWAY GRAPH PARTITION Journal of Circuits, Systems and Computers. 2: 159-185. DOI: 10.1142/S021812669200012X  0.367
1992 Lakshmanan KB, Thulasiraman K, Comeau MA. Efficient distributed protocol for finding shortest paths in networks with negative weights Ieee Transactions On Software Engineering. 639-644. DOI: 10.1109/32.24713  0.435
1990 Krishnamoorthy V, Thulasiraman K, Swamy MNS. Incremental Distance and Diameter Sequences of a Graph: New Measures of Network Performance Ieee Transactions On Computers. 39: 230-237. DOI: 10.1109/12.45208  0.345
1989 Jayakumar R, Thulasiraman K, Swamy MNS. 0(n2) Algorithms for Graph Planarization Ieee Transactions On Computer-Aided Design of Integrated Circuits and Systems. 8: 257-267. DOI: 10.1109/43.21845  0.41
1989 Lakshmanan KB, Thulasiraman K, Comeau MA. An Efficient Distributed Protocol for Finding Shortest Paths in Networks with Negative Weights Ieee Transactions On Software Engineering. 15: 639-644. DOI: 10.1109/32.24713  0.337
1989 Jayakumar R, Thulasiraman K, Swamy MNS. Mod-Char: An Implementation Of Char'S Spanning Tree Enumeration Algorithm And Its Complexity Analysis Ieee Transactions On Circuits and Systems. 36: 219-228. DOI: 10.1109/31.20199  0.397
1989 Krishnamoorthy V, Thulasiraman K, Swamy MNS. Minimum order graphs with specified diameter, connectivity, and regularity Networks. 19: 25-46. DOI: 10.1002/Net.3230190104  0.319
1988 Jayakumar R, Thulasiraman K, Swamy MNS. Planar Embedding: Linear-Time Algorithms for Vertex Placement Edge Ordering Ieee Transactions On Circuits and Systems. 35: 334-344. DOI: 10.1109/31.1746  0.301
1988 Comeau MA, Thulasiraman K. Structure of the Submarking-Reachability Problem and Network Programming Ieee Transactions On Circuits and Systems. 35: 89-100. DOI: 10.1109/31.1702  0.418
1987 Thulasiraman K, Comeau MA. Structure of the Reachability Problem for (0,1)-Capacitated Marked Graphs Ieee Transactions On Circuits and Systems. 34: 317-319. DOI: 10.1109/Tcs.1987.1086117  0.354
1987 Thulasiraman K, Comeau MA. Maximum-Weight Markings in Marked Graphs: Algorithms and Interpretations Based on the Simplex Method Ieee Transactions On Circuits and Systems. 34: 1535-1545. DOI: 10.1109/Tcs.1987.1086091  0.37
1987 Lakshmanan KB, Meenakshi N, Thulasiraman K. A time-optimal message-efficient distributed algorithm for depth-first-search Information Processing Letters. 25: 103-109. DOI: 10.1016/0020-0190(87)90228-6  0.414
1987 Thulasiraman K, Comeau MA. STRUCTURE OF THE SUBMARKING REACHABILITY PROBLEM AND NETWORK PROGRAMMING Proceedings - Ieee International Symposium On Circuits and Systems. 487-490.  0.304
1986 Thulasiraman K, Jayakumar R, Swamy MNS. On Maximal Planarization of Nonplanar Graphs Ieee Transactions On Circuits and Systems. 33: 843-844. DOI: 10.1109/Tcs.1986.1085997  0.398
1986 Thulasiraman K, Jayakumar R, Swamy MNS. PLANAR EMBEDDING: A LINEAR-TIME ALGORITHM FOR VERTEX PLACEMENT AND EDGE ORDERING Proceedings - Ieee International Symposium On Circuits and Systems. 780-783. DOI: 10.1109/31.1746  0.376
1985 Thulasiraman K. On description and realization of resistance n-port networks Ieee Transactions On Circuits and Systems. 32: 296-297. DOI: 10.1109/Tcs.1985.1085688  0.358
1985 Thulasiraman K, Naidu MGG, Reddy PS. SIMILARITY OF GRAPHS AND ENUMERATION OF DISSIMILAR Nth ORDER SYMMETRIC SIGN PATTERNS Canadian Electrical Engineering Journal. 10: 9-14. DOI: 10.1109/Ceej.1985.6593133  0.391
1985 Thulasiraman K, Comeau MA. MAXIMUM MARKINGS IN MARKED GRAPHS: AN ALGORITHM AND INTERPRETATIONS BASED ON THE NETWORK SIMPLEX METHOD Proceedings - Ieee International Symposium On Circuits and Systems. 479-482.  0.315
1984 Jayakumar R, Thulasiraman K, Swamy MN. Complexity of Computation of a Spanning Tree Enumeration Algorithm Ieee Transactions On Circuits and Systems. 31: 853-860. DOI: 10.1109/Tcs.1984.1085435  0.395
1984 Comeau MA, Thulasiraman K. ALGORITHMS ON MARKED DIRECTED GRAPHS Canadian Electrical Engineering Journal. 9: 72-79. DOI: 10.1109/Ceej.1984.6593125  0.412
1983 Comeau M, Thulasiraman K. On Determining a Computable Ordering of a Digital Network Proceedings of the Ieee. 71: 1323-1324. DOI: 10.1109/PROC.1983.12766  0.307
1983 Thulasiraman K, Jayakumar R, Swamy MNS. Graph-Theoretic Proof of a Network Theorem and Some Consequences Proceedings of the Ieee. 71: 771-772. DOI: 10.1109/PROC.1983.12664  0.322
1983 Thulasiraman K, Swamy MNS. THEOREM IN THE THEORY OF DETERMINANTS AND THE NUMBER OF SPANNING TREES IN A GRAPH Canadian Electrical Engineering Journal. 8: 147-152. DOI: 10.1109/Ceej.1983.6591843  0.406
1978 Thulasiraman K, Swamy MNS, Reddy PS. (n +p)-node realizability of Y-matrices of (n + 1)-node resistance n-port networks International Journal of Circuit Theory and Applications. 6: 253-263. DOI: 10.1002/Cta.4490060304  0.337
1977 Naidu MGG, Reddy PS, Thulasiraman K. On the number of conductances required for realizing Y and K matrices International Journal of Circuit Theory and Applications. 5: 219-225. DOI: 10.1002/Cta.4490050302  0.335
1976 Naidu MGG, Reddy PS, Thulasiraman K. (N + 2)-node resistive N-port realizability of Y-matrices Ieee Transactions On Circuits and Systems. 23: 254-261. DOI: 10.1109/Tcs.1976.1084216  0.37
1975 Naidu MG, Swamy MNS, Thulasiraman K. The n-Port Resistive Network Synthesis from Prescribed Sensitivity Coefficients Ieee Transactions On Circuits and Systems. 22: 482-485. DOI: 10.1109/Tcs.1975.1084083  0.391
1975 Naidu MGG, Reddy PS, Thulasiraman K. Synthesis of Resistive Networks from Third-Order Paramount Matrices Ieee Transactions On Circuits and Systems. 22: 937-943. DOI: 10.1109/Tcs.1975.1084001  0.358
1974 Ramamoorthy PA, Thulasiraman K, Murti VGK. Active RC n-Port Network Synthesis Using Nullators and Norators Ieee Transactions On Circuits and Systems. 206-209. DOI: 10.1109/Tcs.1974.1083841  0.397
1973 Swamy MNS, Bhushan C, Thulasiraman K. Sensitivity Invariants for Linear Time-Invariant Networks Ieee Transactions On Circuit Theory. 20: 21-24. DOI: 10.1109/Tct.1973.1083604  0.356
1972 Swamy MNS, Bhushan C, Thulasiraman K. Sensitivity Invariants for Nonlinear Networks Ieee Transactions On Circuit Theory. 19: 599-606. DOI: 10.1109/Tct.1972.1083544  0.315
1972 Swamy MNS, Bhushan C, Thulasiraman K. Bounds on the Sum of Element Sensitivity Magnitudes for Network Functions Ieee Transactions On Circuit Theory. 19: 502-504. DOI: 10.1109/Tct.1972.1083536  0.362
1972 Swamy MNS, Thulasiraman K. Realization of the A-Matrix of RLC Networks Ieee Transactions On Circuit Theory. 19: 515-518. DOI: 10.1109/Tct.1972.1083522  0.376
1972 Swamy MNS, Thulasiraman K. A Sufficient Condition for the Synthesis of the K-Matrix of n-Port Networks Ieee Transactions On Circuit Theory. 19: 378-380. DOI: 10.1109/Tct.1972.1083489  0.36
1972 Reddy PS, Thulasiraman K. Synthesis of (n + 2)-Node Resistive n-Port Networks Ieee Transactions On Circuit Theory. 19: 20-25. DOI: 10.1109/Tct.1972.1083389  0.404
1972 Swamy MNS, Bhushan C, Thulasiraman K. Simple sensitivity formulas in terms of immittance parameters Electronics Letters. 8: 153-155. DOI: 10.1049/El:19720112  0.358
1972 Swamy MNS, Bhushan C, Thulasiraman K. Sensitivity invariants for active lumped/distributed networks Electronics Letters. 8: 26-27. DOI: 10.1049/El:19720021  0.363
1970 Reddy PS, Murti VGK, Thulasiraman K. Realization of Modified Cut-Set Matrix and Applications Ieee Transactions On Circuit Theory. 17: 475-486. DOI: 10.1109/Tct.1970.1083184  0.419
1969 Thulasiraman K, Murti VGK. The Modified Circuit Matrix of an n-Vott Network and Its Applications Ieee Transactions On Circuit Theory. 16: 2-7. DOI: 10.1109/Tct.1969.1082879  0.392
1968 Murti VGK, Thulasiraman K. Synthesis of a Class of n-Port Networks Ieee Transactions On Circuit Theory. 15: 54-63. DOI: 10.1109/TCT.1968.1082770  0.331
1968 Easwaran C, Thulasiraman K. Synthesis of a class of resistive 3-port networks International Journal of Electronics. 24: 597-603. DOI: 10.1080/00207216808938060  0.37
1967 MURTI VGK, THULASIRAMAN K. Parallel Connection of n-Port Networks Proceedings of the Ieee. 55: 1216-1217. DOI: 10.1109/PROC.1967.5797  0.312
Show low-probability matches.