| 2008 | ||
|---|---|---|
| 55 | Weiyi Zhang, Guoliang Xue, Jian Tang, Krishnaiyan Thulasiraman: Dynamic Wavelength Routing in WDM Networks under Multiple Signal Quality Constraints. GLOBECOM 2008: 2557-2561 | |
| 54 | Muhammad S. Javed, Krishnaiyan Thulasiraman, Guoliang Xue: Logical Topology Design for IP-over-WDM Networks: A Hybrid Approach for Minimum Protection Capacity. ICCCN 2008: 354-360 | |
| 53 | Min Xu, Krishnaiyan Thulasiraman, Xiao-Dong Hu: Identifying codes of cycles with odd orders. Eur. J. Comb. 29(7): 1717-1720 (2008) | |
| 52 | Weiyi Zhang, Guoliang Xue, Jian Tang, Krishnaiyan Thulasiraman: Faster algorithms for construction of recovery trees enhancing QoP and QoS. IEEE/ACM Trans. Netw. 16(3): 642-655 (2008) | |
| 51 | Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan Thulasiraman: Polynomial time approximation algorithms for multi-constrained QoS routing. IEEE/ACM Trans. Netw. 16(3): 656-669 (2008) | |
| 2007 | ||
| 50 | Ravi S. Ravindran, Changcheng Huang, Krishnaiyan Thulasiraman: Managed Dynamic VPN Service: Core Capacity Sharing Schemes For Improved VPN Performance. ICC 2007: 211-216 | |
| 49 | Guoliang Xue, Arunabha Sen, Weiyi Zhang, Jian Tang, Krishnaiyan Thulasiraman: Finding a path subject to many additive QoS constraints. IEEE/ACM Trans. Netw. 15(1): 201-211 (2007) | |
| 2006 | ||
| 48 | Ying Xiao, Christoforos N. Hadjicostis, Krishnaiyan Thulasiraman: The d-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm. COCOON 2006: 284-298 | |
| 47 | Muhammad S. Javed, Krishnaiyan Thulasiraman, Matthew A. Gaines, Guoliang Xue: Survivability Aware Routing of Logical Topologies: On Thiran-Kurant Approach, Enhancements and Evaluation. GLOBECOM 2006 | |
| 46 | Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan Thulasiraman: An improved algorithm for optimal lightpath establishment on a tree topology. IEEE Journal on Selected Areas in Communications 24(S-8): 45-56 (2006) | |
| 45 | Ying Xiao, Krishnaiyan Thulasiraman, Guoliang Xue: QoS Routing in Communication Networks: Approximation Algorithms Based on the Primal Simplex Method of Linear Programming. IEEE Trans. Computers 55(7): 815-829 (2006) | |
| 2005 | ||
| 44 | Dong Xiang, Jia-Guang Sun, Jie Wu, Krishnaiyan Thulasiraman: Fault-Tolerant Routing in Meshes/Tori Using Planarly Constructed Fault Blocks. ICPP 2005: 577-584 | |
| 43 | Weiyi Zhang, Guoliang Xue, Jian Tang, Krishnaiyan Thulasiraman: Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS. INFOCOM 2005: 2702-2710 | |
| 42 | Ying Xiao, Krishnaiyan Thulasiraman, Guoliang Xue: GEN-LARAC: A Generalized Approach to the Constrained Shortest Path Problem Under Multiple Additive Constraints. ISAAC 2005: 92-105 | |
| 41 | Krishnaiyan Thulasiraman, Ying Xiao, Guoliang Xue: Advances in QoS path(s) selection problem. ISCAS (1) 2005: 164-167 | |
| 2004 | ||
| 40 | Ying Xiao, Krishnaiyan Thulasiraman, Guoliang Xue: The Primal Simplex Approach to the QoS Routing Problem. QSHINE 2004: 120-129 | |
| 39 | Ying Xiao, Krishnaiyan Thulasiraman, Guoliang Xue: Approximation and Heuristic Algorithms for Delay Constrained Path Selection under Inaccurate State Information. QSHINE 2004: 130-137 | |
| 2003 | ||
| 38 | Krishnaiyan Thulasiraman, Ming-Shan Su, V. Goel: The multi-level paradigm for distributed fault detection in networks with unreliable processors. ISCAS (3) 2003: 862-865 | |
| 37 | T. Ramalingom, Krishnaiyan Thulasiraman, Anindya Das: Context independent unique state identification sequences for testing communication protocols modelled as extended finite state machines. Computer Communications 26(14): 1622-1633 (2003) | |
| 2002 | ||
| 36 | Guoliang Xue, Krishnaiyan Thulasiraman: Computing the Shortest Network under a Fixed Topology. IEEE Trans. Computers 51(9): 1117-1120 (2002) | |
| 35 | Min Ouyang, Michel Toulouse, Krishnaiyan Thulasiraman, Fred Glover, Jitender S. Deogun: Multilevel cooperative search for the circuit/hypergraphpartitioning problem. IEEE Trans. on CAD of Integrated Circuits and Systems 21(6): 685-693 (2002) | |
| 2000 | ||
| 34 | Min Ouyang, Michel Toulouse, Krishnaiyan Thulasiraman, Fred Glover, Jitender S. Deogun: Multilevel cooperative search: application to the circuit/hypergraph partitioning problem. ISPD 2000: 192-198 | |
| 33 | T. Ramalingom, Krishnaiyan Thulasiraman, Anindya Das: A Matroid-Theoretic Solution to an Assignment Problem in the Conformance Testing of Communication Protocols. IEEE Trans. Computers 49(4): 317-330 (2000) | |
| 32 | Michel Toulouse, Teodor Gabriel Crainic, Krishnaiyan Thulasiraman: Global optimization properties of parallel cooperative search algorithms: A simulation study. Parallel Computing 26(1): 91-112 (2000) | |
| 1999 | ||
| 31 | Michel Toulouse, Krishnaiyan Thulasiraman, Fred Glover: Multi-level Cooperative Search: A New Paradigm for Combinatorial Optimization and an Application to Graph Partitioning. Euro-Par 1999: 533-542 | |
| 30 | Krishnaiyan Thulasiraman, Anindya Das, Kaiyuan Huang, Vinod K. Agarwal: Correct diagnosis of almost all faulty units in a multiprocessor system. ISCAS (6) 1999: 161-164 | |
| 1998 | ||
| 29 | Kaiyuan Huang, Vinod K. Agarwal, Krishnaiyan Thulasiraman: Diagnosis of clustered faults and wafer testing. IEEE Trans. on CAD of Integrated Circuits and Systems 17(2): 136-148 (1998) | |
| 28 | Krishnaiyan Thulasiraman, Anindya Das, Kaiyuan Huang, Vinod K. Agarwal: Correct Diagnosis of Almost All Faulty Units in a Multiprocessor System. Journal of Circuits, Systems, and Computers 8(4): 473-481 (1998) | |
| 1996 | ||
| 27 | T. Ramalingom, Krishnaiyan Thulasiraman, Anindya Das: Context Independent Unique Sequences Generation for Protocol Testing. INFOCOM 1996: 1141-1148 | |
| 26 | T. Ramalingam, Anindya Das, Krishnaiyan Thulasiraman: Corrigendum to 'fault detection and diagnosis capabilities of test sequence selection methods based on the FSM model' : [Computer Comm. 18(1995) 113]. Computer Communications 19(2): 160 (1996) | |
| 25 | Jaroslav Opatrny, Dominique Sotteau, N. Srinivasan, Krishnaiyan Thulasiraman: DCC Linear Congruential Graphs: A New Class of Interconnection Networks. IEEE Trans. Computers 45(2): 156-164 (1996) | |
| 1995 | ||
| 24 | Sanjay Khanna, Shaodi Gao, Krishnaiyan Thulasiraman: Parallel hierarchical global routing for general cell layout. Great Lakes Symposium on VLSI 1995: 212- | |
| 23 | Abdelhakim Safir, Baher Haroun, Krishnaiyan Thulasiraman: Floorplanning with Datapath Optimization. ISCAS 1995: 41-44 | |
| 22 | T. Ramalingam, Anindya Das, Krishnaiyan Thulasiraman: Fault Detection and Diagnosis Capabilities of Test Sequence Selection Methods Based on the FSM Model. Computer Communications 18(2): 113-122 (1995) | |
| 21 | T. Ramalingam, Anindya Das, Krishnaiyan Thulasiraman: On Testing and Diagnosis of Communication Protocols Based on the FSM Model. Computer Communications 18(5): 329-337 (1995) | |
| 20 | Kaiyuan Huang, Vinod K. Agarwal, Laurence E. LaForge, Krishnaiyan Thulasiraman: A Diagnosis Algorithm for Constant Degree Structures and Its Application to VLSI Circuit Testing. IEEE Trans. Parallel Distrib. Syst. 6(4): 363-372 (1995) | |
| 1994 | ||
| 19 | Jens Lienig, Krishnaiyan Thulasiraman: GASBOR: A Genetic Algorithm for Switchbox Routing in Integrated Circuits. Evo Workshops 1994: 187-200 | |
| 18 | Michael Kaufmann, Shaodi Gao, Krishnaiyan Thulasiraman: On Steiner Minimal Trees in Grid Graphs and Its Application to VLSI Routing. ISAAC 1994: 351-359 | |
| 17 | Abdelhakim Safir, Baher Haroun, Krishnaiyan Thulasiraman: A Floorplanner driven by Structural & Timing Constraints. ISCAS 1994: 157-160 | |
| 16 | Jens Lienig, Krishnaiyan Thulasiraman: A New Genetic Algorithm for the Channel Routing Problem. VLSI Design 1994: 133-136 | |
| 15 | Anindya Das, Krishnaiyan Thulasiraman, Vinod K. Agarwal: Diagnosis of t/(t+1)-Diagnosable Systems. SIAM J. Comput. 23(5): 895-905 (1994) | |
| 1993 | ||
| 14 | Krishnaiyan Thulasiraman, Prasad R. Chalasani, M. A. Comeau: Parallel Network Dual Simplex Method on a Shared Memory Multiprocessor. SPDP 1993: 408-415 | |
| 13 | Krishnaiyan Thulasiraman, Prasad R. Chalasani, Parimala Thulasiraman, M. A. Comeau: Parallel Network Primal-Dual Method on a Shared Memory Multiprocessor and a Unified Approach to VLSI Layout Compaction and Wire Balancing. VLSI Design 1993: 242-245 | |
| 12 | Jens Lienig, Krishnaiyan Thulasiraman: A Genetic Algorithm for Channel Routing in VLSI Circuits. Evolutionary Computation 1(4): 293-311 (1993) | |
| 11 | Anindya Das, Krishnaiyan Thulasiraman, Vinod K. Agarwal, K. B. Lakshmanan: Multiprocessor Fault Diagnosis Under Local Constraints. IEEE Trans. Computers 42(8): 984-988 (1993) | |
| 10 | Anindya Das, Krishnaiyan Thulasiraman, K. B. Lakshmanan, Vinod K. Agarwal: Distributed Fault diagnosis of a Ring of Processors. Parallel Processing Letters 3: 195-204 (1993) | |
| 1992 | ||
| 9 | T. Ramalingam, Anindya Das, Krishnaiyan Thulasiraman: On Conformance Test and Fault Resolution of Protocols based on FSM Model. NETWORKS 1992: 211-222 | |
| 1990 | ||
| 8 | Anindya Das, Krishnaiyan Thulasiraman: Diagnosis of t/s-Diagnosable Systems. WG 1990: 193-205 | |
| 7 | V. Krishnamoorthy, Krishnaiyan Thulasiraman, M. N. S. Swamy: Incremental Distance and Diameter Sequences of a Graph: New Measures of Network Performance. IEEE Trans. Computers 39(2): 230- (1990) | |
| 1989 | ||
| 6 | Anindya Das, Krishnaiyan Thulasiraman, Vinod K. Agarwal, K. B. Lakshmanan: t/s-Diagnosable Systems: A Characterization and Diagnosis Algorithm. WG 1989: 34-45 | |
| 5 | K. B. Lakshmanan, Krishnaiyan Thulasiraman, M. A. Comeau: An Efficient Distributed Protocol for Finding Shortest Paths in Networks with Negative Weights. IEEE Trans. Software Eng. 15(5): 639-644 (1989) | |
| 4 | R. Jayakumar, Krishnaiyan Thulasiraman, M. N. S. Swamy: O(n2) algorithms for graph planarization. IEEE Trans. on CAD of Integrated Circuits and Systems 8(3): 257-267 (1989) | |
| 1988 | ||
| 3 | R. Jayakumar, Krishnaiyan Thulasiraman, M. N. S. Swamy: O(n²) Algorithms for Graph Planarization. WG 1988: 352-377 | |
| 1987 | ||
| 2 | K. B. Lakshmanan, Krishnaiyan Thulasiraman: On the Use of Synchronizers for Asynchronous Communication Networks. WDAG 1987: 257-277 | |
| 1 | K. B. Lakshmanan, N. Meenakshi, Krishnaiyan Thulasiraman: A Time-Optimal Message-Efficient Distributed Algorithm for Depth-First-Search. Inf. Process. Lett. 25(2): 103-109 (1987) | |