Prof. Narsingh Deo

Millican Chair Professor
Director, Center for Parallel Computation
University of Central Florida,
School of Electrical Engineering and Computer Science,
Harrris Engineering Center, Room 361
Ph: (407) 823 6336
e-mail : deo@cs.ucf.edu


       Selected List of Recent Publications

  1. Techniques for Analyzing Dynamic Random Graph Models of Web-like Networks: An Overview, NETWORKS, Vol. 51, July 2008, pp. 211-255 (with A. Cami)
  2. The Derivation and Use of a Scalable Model for Network Attack Identification and Path Prediction, Jour. Of Networks, Vol. 3 No. 4, April 2008, pp. 64-71 (with S. Nanda).
  3. Network Communities Based on Maximizing Average Degree, Congrssus Numeratium, Vol. 190, 2008, pp. 183-192 (with J. Scanlon).
  4. Attacks on Hard Instances of Graph Isomorphism, Jour. Combinatorial Mathematics and Combinatorial Computing, Vol. 64, 2008, pp. 203-226 (with G. Tener).
  5. Efficient Intrusion-Detection using Programmable Agents based on Attack Graph Patterns, Congressus Numeratium, Vol. 192, 2008, pp. 193-200 (with M. Vasudevan).
  6. A Study of the Sudoku Graph Family, Congressus Numeratium, Vol. 192, 2008, pp. 85-95 (with H. Yildirim, and M. S. Krishnamoorthy).
  7. Centrality Based Community Discovery, Congressus Numerantium, Vol 188, 2007, pp. 117-127 (with H. Balakrishnan).
  8. Efficient Techniques for Network Attack Identification, Congressus Numerantium, Vol 186, 2007, pp. 213-220 (with S. Nanda).
  9. Preferential Deletion in Dynamic Models of Web-like Networks Information Processing Letters, Vol. 102, 2007, pp. 156-162 (with A. Cami).
  10. A Highly Scalable Model for Network Attack Identification and Path Prediction, Proceedings of the IEEE SoutheastCon 2007, Richmond, VA, pp. 663 – 668, 2007 (with S. Nanda).
  11. Exploring Topological Properties of NMR Graphs, Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering, 2007, BIBE 2007, pp. 1304-1307 (with P. Micikevicius).
  12. Evolution in Web graphs Congressus Numerantium, Vol. 180 (2006), pp. 97-107 (with H. Balakrishnan).
  13. On the Complexity of Finding Optimal Global Alliances, Journal of Combinatorial Mathematics and Combinatorial Computing, Vol. 58 (2006), pp. 23-31 (with A. Cami, H. Balakrishnan, and R. Dutton).
  14. Linear-time Algorithms for Encoding Trees as Sequences of Node Labels, Congressus Numerantium, Vol 183 (2006), pp. 65-75 (with P. Micikevicius, S. Caminiti).
  15. Correlation model of worm propagation on scale-free networks Complexus, Vol.3, No. 1-3, pp 169 - 182, 2006 (with Z. Nikoloski and L. Kucera).
  16. Methods for Placing Data and Parity to Tolerate Two Disk Failures in Disk Arrays Using Complete Bipartite Graphs, Congressus Numerantium, Vol. 179 (2006), pp. 167 - 179 (with S. Nanda).
  17. Mining Parameters that Characterize Communities in Web-like Networks," Proc. IEEE International Conference on Granular Computing, May 10 - 12, 2006, Atlanta, GA, pp. 188 -193 (with A. Cami ).
  18. Detecting Communities using Bibliographic Metrics, Proc. IEEE International Conference on Granular Computing, May 10 - 12, 2006, Atlanta, GA, pp. 293-298 (with H. Balakrishnan).
  19. Discovering Communities in Complex Networks, Proc. 44th ACM Southeast Conference, March 10-12, 2006, Melbourne, FL, pp. pp 280-285 (with H. Balakrishnan).
  20. Biologically Inspired Detection of Overlapping Network Communities" Proc. 44th ACM Southeast Conference, March 10-12, 2006, Melbourne, FL (with Z. Nikoloski and L. Kucera).
  21. Evaluation of a Graph-based Topical Crawler," Proc. ICOMP'06, June 26-29, 2006, Las Vegas, Nevada, pp. 393-399 (with A. Cami ).
  22. Graphs, in Handbook of Data Structures and Applications (eds. D. P Mehta and S. Sahni), Chapman & Hall/CRC, 2005, pp. 4-1 to 4-25.
  23. A Graph Theoretic Algorithm for Placing Data and Parity to Tolerate Two Disk Failures in Disk Array Systems," Proc. 9th IEEE International Conference on Information Visualisation IV05, 6-8 July 2005, London, UK, pp. 542-549, (with S. Nanda).
  24. Degree-correlation of scale-free random graph process Proc. of the EuroComb 2005, Berlin, Sept. 5-9, 2005, pp. 239-245 (with Z. Nikoloski and L. Kucera)
  25. Correlation Epidemiological Model for the Propagation of Network Worms on Large Scale-free Graphs, Proc. The 1st. European Conf. on Complex Systems, Paris, Nov. 13-18, 2005 (with Z. Nikoloski and L. Kucera).
  26. Degree-Correlation of a Scale-free Random Graph Process, DMTCS Proceedings, 2005, Vol. AE (with Cluster Computing for Determining Three-Dimensional Protein Structure, The Jour. of Supercomputing, Vol 34, 2005, pp. 243-271 (with P. Micikevicius).
  27. One-Factors and Hamiltonian Paths in Modeling Data and Parity Placement in Disk Array Systems, Congressus Numerantium, Vol. 176, 2005, pp. 191-199 (with S. Nanda).
  28. Greedy Community-Mining based on Clustering Coefficient, Congressus Numerantium, Vol 172, 2005, pp. 161-176 (with A. Cami ).
  29. Implementation and Analysis of a Parallel Algorithm for Radiocoloring, Congressus Numerantium, Vol. 167, 2004, pp. 87-96 (with H. Balakrishnan).
  30. Compression of Vertex Transitive Graphs, Congressus Numerantium, Vol. 167, 2004, pp. 161-173 (with B. Litow and A. Cami).
  31. An Algorithm for a Two-Disk Fault-Tolerant Array with (Prime-1) Disks, Congressus Numerantium, Vol. 171, 2004, pp. 13-23 (with S. Nanda).
  32. Graph Compression and the Zeros of Polynomials, Information Processing Letters, Vol. 92, 2004, pp. 39-44 (with B. Litow).
  33. On the Expected Number of Level-i Nodes in a Random Labeled Tree, Bulletin of the ICA, Vol. 41, 2004, pp. 51-60 (with G. Agnarsson and P. Micikevicius).
  34. Graph-Theoretic Structure of the World Wide Web, a chapter in Information Technology: Principles and Applications (eds. A. K. Ray and T. Acharya), Prentice-Hall, India, 2004, pp. 169-203 (with P. Gupta).
  35. The Game of Cops-and-Robbers on Graphs: A Model for Quarantining Cyber Attacks, Congressus Numerantium Vol. 162, pp. 193-215, 2003 (with Z. Nikoloski).
  36. Expected Value of the Diameter of a Random Graph, Congressus Numerantium Vol. 161, pp. 211-221, 2003 (with Y.Zhang).
  37. Parallel Algorithm for Radiocoloring a Graph, Congressus Numerantium Vol. 160, pp. 193-204, 2003 (with H. Balakrishnan).
  38. Graph-Theoretic Analysis of the World Wide Web: New Directions and Challenges, Mathematica Contemporanea, Vol. 25, pp. 49-70, 2003 (with P.Gupta).
  39. Diameter of a Random Graph and Its Implications for the Web Graph, Congressus Numerantium Vol. 160, pp. 109-116, 2003 (with P. Gupta).
  40. Course-Grained Parallelization of Distance-Bound Smoothing for the Molecular Conformation Problem, Lecture Notes In Computer Science LNCS, Vol. 2571 (Eds. Das & Bhattacharya) Springer-Verlag, Berlin, 2002, pp. 55-66 (With P. Micikevicius).
  41. Random-Tree Diameter and the Diameter-Constrained MST, International Jour. Of Computer Mathematics, Vol. 79, No. 6, 2002, pp. 651-663 (with A. Abdalla)
  42. A New Encoding for Labeled Trees Employing a Stack and a Queue, Bulletin of the Institute of Combinatorics and Its Applications, Vol. 34, 2002, pp. 77-85 (with P. Micikevicius).
  43. Two Protocols for Multicast Communication, Congressus Numerantium, Vol. 151, pp. 145-159, Dec. 2001 (with N. Sankaranarayanan and F. Suraweera).
  44. Graph Theoretic Web Algorithms: An Overview, Lecture Notes In Computer Science LNCS Vol. 2060 (eds. Bohme & Unger) Springer-Verlag, Berlin, 2001, pp. 91-102 (with P.Gupta).
  45. Prufer-Like Codes for Labeled Trees, Congressus Numerantium, Vol. 151, Dec. 2001, pp. 65-73, (with P. Micikevicius).
  46. Sampling the Web Graph with Random Walks, Congressus Numerantium, Vol. 149, Dec. 2001, pp. 65-73, (with P. Gupta).
  47. Computing Diameter-Constrained Minimum Spanning Tree in Parallel, Lecture Notes in Computer Science [eds.Bongiovanni, Gambosi, and Petreschi] No. 1767, pp. 17-31 Springer-Verlag, New York, 2000, (with A. Abdalla).
  48. Forbidden Pairs Combinatorics, Australasian Journal of Combinatorics, Vol. 22, pp. 91-99, 2000, (with B. Litow).
  49. Generating Edge-Disjoint Sets of Quadruples in Parallel for the Molecular Conformation Problem, Congressus Numerantium, Vol. 143, pp. 81-96, 2000 (with P. Micikevicius).
  50. Heuristics to Compute a Diameter-Constrained MST, Congressus Numerantium, Vol. 144, pp. 161-182, 2000 (with A. Abdalla and P. Gupta.).
  51. Computational Experience with a Parallel Algorithm for Tetrangle Inequality Bound Smoothing, Bulletin of Mathematical Biology, Vol. 61, No. 5, pp. 987-1008, 1999, (with K. Rajan).
  52. A Parallel Algorithm for Bound-Smoothing, Proc. IPPS/SPDP. San Juan, Puerto Rico, April 12 - 16, pp. 645 - 652, 1999, (with K. Rajan).
  53. Memory-Efficient Enumeration of Constrained Spanning Trees, Information Processing Letters, Vol. 72, pp. 47-53, 1999, (with J. Nievergelt and A. Marzetta).
  54. Parallel Heuristics for the Diameter-Constrained MST Problem, Congressus Numerantium, Vol. 136 pp. 97-118, 1999, (with A. Abdalla and R. Franceschini).
  55. A Heuristic for a Leaf-Constrained Minimum Spanning Tree Problem, Congressus Numerantium, Vol. 141, pp. 61-72, 1999, (with P. Micikevicius).
  56. Constrained Spanning Tree Problems: Fast Approximate Methods and Parallel Computation, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, American Math Society, Vol. 40, pp. 191-217, 1998 (with N. Kumar).
  57. Load Balancing in Parallel Battlefield Management Simulation on Local- and Shared-Memory Architectures, Computer Systems: Science & Engineering, Vol. 13, No. 1, pp. 55-65, 1998 (with M. Medidi and S. Prasad).
  58. Parallel Dictionaries Using AVL Trees, Journal of Parallel and Distributed Computing, Vol. 48, No. 1, 1998 pp. 146-155 (with M. Medidi).
  59. Generating Random Trees and Connected Graphs in Parallel, Congressus Numerantium, Vol. 130, pp. 7-18, 1998, (with V. Kumar and N. Kumar).
  60. Parallel Algorithm for Generating Disjoint 2-(v, 4, 1) Packings, Congressus Numerantium, Vol. 131, pp. 5-18, 1998, (with K. Rajan).
  61. Computation of Constrained Spanning Trees; A Unified Approach, Network Optimization: Lecture Notes in Economics and Mathematical Systems [eds. Pardalos, Hearn, and Hager] No. 450, pp. 194-220, Springer-Verlag, New York, 1997.
  62. A Comparison of Two Parallel Algorithms for the Degree-Constrained Minimum Spanning Tree Problem, Congressus Numerantium, Vol. 123, pp. 15-32, 1997 (with L. Mao, N. Kumar, and S. Lang).
  63. Parallel Computation of a Diameter-Constrained MST and Related Problems, Congressus Numerantium, Vol. 126, pp. 131-155, 1997 (with A. Abdallah, N. Kumar and T. Terry).
  64. Parallel Tetrangle-Inequality Bound-Smoothing on a Cluster of Workstations, Congressus Numerantium, Vol. 124, pp. 211-220, 1997 (with K. Rajan, N. Kumar).
  65. Minimum-Weight Degree-Constrained Spanning Tree Problem: Heuristics and Implementation on an SIMD Parallel Machine, Parallel Computing, Vol. 22, pp. 369-382, March 1996 (with B. Boldon and N. Kumar).
  66. A New Parallel Heuristic for the Quadratic Assignment Problem, International Journal of Computers and Their Applications, Vol. 3, No. 3, pp. 130-137, 1996, (with N. Kumar).
  67. Empirical Study of an Improved Tetrangle-Inequality Bound-Smoothing Algorithm, Congressus Numerantium, Vol. 117, pp. 15-31, 1996 (with N. Kumar and R. Addanki).
  68. Parallel Implementation of a Steiner-Minimal-Tree Heuristic, Congressus Numerantium, Vol. 119, pp. 19-32, 1996 (with N. Kumar and T. Tolley).
  69. Metric Graphs Elastically Embeddable in the Place, Information Processing Letters, Vol. 55, No. 6, pp. 309-315, Sept. 1995 (with N. Nievergelt).
  70. Parallel Algorithms for Maximum Subsequence and Maximum Subarray, Parallel Processing Letters, Vol. 5, No. 3, pp. 367-373, Sept. 1995 (with K. Perumalla).
  71. Minimum-Length Fundamental Cycle Set: New Heuristics and an Empirical Study, Congressus Numerantium, Vol. 107, pp. 141-154, Dec. 1995 (with N. Kumar and J. Parsons)
  72. Algorithms for Merging and Sorting in Encyclopedia of Computer Science and Technology, eds. A. Kent and J. G. Williams, Vol. 29, pp. 19-44, Marcel Dekker, 1994.
  73. Classification of Recursive Networks, Congressus Numerantium, Vol. 98, 1994, pp. 67-80 (with R. K. Govindaraju and M. S. Krishnamoorthy).
  74. An Optimal Parallel Algorithm for Merging Using Multiselection, Information Processing Letters, Vol. 50, No. 2, pp. 81-87, 1994 (with A. Jain and M. Medidi).
  75. Parallel Construction of (a, b)-trees ,The Journal for Parallel and Distributed Computing, Vol. 23 No. 3, pp. 442-448, 1994 (with A. Jain and M. Medidi).
  76. Fibonacci Networks Fibonacci Quarterly, Vol. 32, No. 4, pp. 329-345, 1994 (with R. K. Govindaraju and M. S. Krishnamoorthy).
  77. Multidimensional Interval Graphs Congressus Numerantium, Vol. 102, pp. 45-46, 1994 (with N. Kumar).
  78. Parallel Dictionaries on AVL Trees, Proc. 8th International Parallel Processing Symposium, Cancun, Mexico, April 26-29, 1994, pp. 878-882 (with M. Medidi).
  79. Parallel Reliability Algorithms and Implementations, in New Trends in System Reliability Evaluation, ed. K. B. Misra, pp. 165-184, Elsevier Science Publishers, 1993.
  80. Reverse Binary Graphs, Mathematical and Computer Modeling, Vol. 17, No. 11, 1993, pp. 49-60 (with S. K. Das and S. Prasad).
  81. Algorithms for Merging and Sorting, in Encyclopedia of Computer Science and Technology, eds. A. Kent and J.G. Williams, Vol. 29, pp. 19-44, Marcel Dekker, 1993.
  82. On Finding Euler Tours in Parallel Parallel Processing Letters, Vol. 3, No. 3, Sept. 1993, pp. 223-232 (with E. N. Caceres, S. Sastry, and J. L. Szwarcfiter).
  83. The Knapsack Problem with Disjoint Multiple-Choice Constraints, Naval Research Logistics, Vol. 39, No. 2, pp. 213-227, 1992 (with V. Aggarwal and D. Sarkar).
  84. Parallel Algorithms for Terminal-Pair Reliability, IEEE Trans. on Reliability, Vol. 41, No. 2, pp. 201-209, 1992 (with M. Medidi).
  85. Parallel Heap: Improved and Simplified, Proc. Sixth International Parallel Processing Symposium, March 1992, Beverly Hills, CA (with S. Prasad).
  86. Construction of Height Balanced Trees in Parallel, Proc. 1992 International Conference on Parallel Processing, Vol. III, pp. 297-300, Aug. 1992 (with A. Jain and M. Medidi).
  87. Parallel Heap: An Optimal Parallel Priority Queue, The Journal of Supercomputing, Vol. 6, pp. 87-98, 1992 (with S. Prasad).
  88. Stirling Networks: A Versatile Combinatorial Topology for Multiprocessor Systems, Discrete Applied Mathematics, Vol. 38, pp. 119-146, 1992 (with S. K. Das and J. Ghosh).
  89. On Pascal Graphs, Congressus Numerantium, Vol. 90, pp. 141-150, 1992 (with R. Brigham and R. Dutton).
  90. Two EREW Algorithms for Parentheses Matching, Proc. Fifth International Parallel Processing Symposium,pp. 126-131, April, 1991, Anaheim, CA (with S. Prasad).
  91. Parallel Algorithms for Merging and Sorting, Information Sciences, Vol. 56, pp. 151-161, 1991 (with D. Sarkar).
  92. Reverse Binary Digraphs and Graphs, Journal of Combinatorics, Information & System Sciences, Vol. 16, No. 1, pp. 107-128, 1991 (with S. K. Das and S. Prasad).
  93. Division Digraphs and Graphs, Congressus Numerantium, Vol. 84, pp. 149-159, 1991 (with T. Wilson).
  94. Reverse Binary Digraphs, Congressus Numerantium, Vol. 71, pp. 53-66, 1990 (with S. K. Das and S. Prasad).
  95. Notes on Divide-and-Conquer Based Optimal Parallel Algorithms for Some Graph Problems on EREW PRAM Model, IEEE Trans on Circuits and Systems, Vol. CAS-37, pp. 962-965, 1990 (with S. K. Das).
  96. Parallel Graph Algorithms for Hypercube Computers, Parallel Computing, Vol. 13, pp. 143-158, 1990 (with S. K. Das and S. Prasad).
  97. Parallel Hungarian Algorithm, Computer Systems Science and Engineering, Vol. 5, pp. 131-136, 1990 (with S. K. Das).
  98. Estimating the Speedup in Parallel Parsing, IEEE Trans. on Software Engineering, Vol. 16, pp. 677-683, 1990 (with D. Sarkar).
  99. Parallel Heap, Proc. 1990 International Conference on Parallel Processing, Vol. 3, pp. 169-172, August 1990 (with S. Prasad).
  100. Two Minimum Spanning Forest Algorithms for Fixed-Size Hypercube Computer, Parallel Computing, Vol. 15, pp. 179-187, 1990 (with S. K. Das and S. Prasad).
  101. Forest-Based Parallel Graph Algorithms on Hypercube Computers, Proc. HCCA4 (Fourth Conference on Hypercube Concurrent Computers and Applications), pp. 395-398, March 6-8, 1989, Monterey, CA (with S. K. Das and S. Prasad).
  102. Data Structures for Parallel Computation, in Supercomputing: Computers and System Sciences, Vol. 62, 1989, pp. 341-355, Springer-Verlag.
  103. Toeplitz Networks and Their Properties, IEEE Trans. on Circuits and Systems, Vol. 36, No. 8, August 1989, pp. 1089-1092 (with M. S. Krishnamoorthy).
  104. An Eigenvector Characterization of Cospectral Graphs Having Cospectral Joins, Annals of New York Academy of Science, Vol. 555, 1989, pp. 159-166 (with Allen J. Schwenk and Frank Harary).
  105. Parallel Coloring of Graphs: Two Approximate Algorithms, International Journal of Computer Mathematics, Vol. 27, No. 3, pp. 147-158, 1989 (with S. K. Das).
  106. Gate Matrix Layout Revisited: Algorithmic Performance and Probabilistic Analysis, Springer-Verlag LNCS, Vol. 405, pp. 280-290, 1989 (with S. K. Das and S. Prasad).
  107. Parallel Algorithms for Parenthesis Matching and Generation of Random Balanced Sequences of Parentheses, Springer-Verlag LNCS, Vol. 297, pp. 970-984, 1988 (with D. Sarkar).
  108. Divide-and-Conquer-Based Optimal Parallel Algorithms for Some Graph Problems on EREW PRAM Model, IEEE Trans. Circuits and Systems, Vol. 35, No. 3, March 1988, pp. 312-322 (with S. K. Das).
  109. A Comparison of Terminal-Pair Reliability Algorithms, IEEE Trans. on Reliability, June 1988, Vol. 37, No. 2 , pp. 210-215 (with Y. B. Yoo).
  110. Parallel Algorithms and Architectures, The Journal of Supercomputing, Vol. 1, pp. 301-325, 1988 (with D. Buell, et. al.)
  111. On Certain Planar Coverings of Complete Graphs, Congressus Numerantium, Vol. 66, pp. 33-44, December 1988 (with D. Sarkar).
  112. Exact and Approximate Solutions for the Gate Matrix Layout Problem, IEEE Trans. CAD-ICS., Vol 6, No. 1, Jan. 1987, pp. 79-84 (with M. S. Krishnamoorthy and M. A. Langston).
  113. Rencontres Graphs: A Family of Bipartite Graphs, Fibonacci Quarterly, Vol. 25, August 1987, pp. 250-262 (with S. K. Das).
  114. An Optimal Parallel Parsing Algorithm for a Class of Block-Structured Languages, Proc. 1987 International Conference on Parallel Processing, August 1987, pp. 585-588 (with D. Sarkar).
  115. Square-Star Reduction and its Forbidden Graphs, Congressus Numerantium, Vol. 58, December 1987, pp. 277-290 (with S. K. Das).
  116. An Upper Bound for the Speedup of Parallel Branch-and-Bound Algorithms, BIT, Vol. 26, March 1986, pp. 35-43 (with M. J. Quinn).
  117. Stirling Graphs and Their Properties, Congressus Numerantium, Vol. 54, pp. 5-20, December 1986 (with S. K. Das).
  118. Estimating the Speedup in Parallel Parsing, Proc. 1986 International Conference on Parallel Processing, August, 1986, pp. 157-163 (with D. Sarkar).
  119. Shortest Path Algorithms: Taxonomy and Annotation, Networks, Vol. 14, 1984, pp. 275-323 (with C. Y. Pang).
  120. Parallel Graph Algorithms, ACM Computing Surveys, Vol. 16, No. 3, Sept. 1984, pp. 319-348 (with M. J. Quinn).
  121. The Ellipsoid Algorithms and the Graph Isomorphism Problem, Technique et Science Informatiques, Vol. 3, No. 5, 1984, pp. 327-333 (with G. M. Prabhu).
  122. A Perturbation for Testing Non-isomorphisms of Graphs, BIT, Vol. 24, 1984, pp. 302-307 (with G. M. Prabhu).
  123. Pascal Graphs and Their Properties, Fibonacci Quarterly, Vol. 21, 1983, pp. 203-214 (with M. J. Quinn).
  124. Algorithms for Generating Fundamental Cycles in a Graph, ACM Trans. on Mathematical Software, Vol. 8, No. 1, March 1982, pp. 26-42 (with M. S. Krishnamoorthy and G. M. Prabhu).
  125. Parallel Algorithms for the Single Source Shortest Path Problem, Computing, Vol. 29, pp. 31-49, 1982 (with P. Mateti).
  126. Parallel Algorithms for the Minimum Spanning Tree Problem, Proc. 1981 International Conf. of Parallel Processing, Aug. 25-28, 1981, pp. 188-189 (with Y. B. Yoo).
  127. Two Parallel Algorithms for Shortest Path Problems, Proc. 1980 International Conf. on Parallel Processing, Aug. 26-29, 1980, pp. 244-253 (with C. Y. Pang and R. E. Lord).
  128. Interference in Multiprocessor Systems with Localized Memory Access Probabilities, IEEE Trans. on Computers, Vol. C-28, No. 2, pp. 157-163, Feb. 1979 (with A. S. Sethi).
  129. Minimum-Length Fundamental-Cycle-Set, IEEE Trans. on Circuits and Systems, Vol. CAS-26, No. 10, Oct. 1979.
  130. Complexity of the Minimum Dummy Activities Problem in a PERT Network, Networks, Vol. 9, No. 3, 1979, pp. 189-194 (with M. S.. Krishnamoorthy).
  131. Node-Deletion NP-Complete Problems, SIAM Journal on Computing, Vol. 8, No. 4, pp. 619-625, Nov. 1979, (with M. S. Krishnamoorthy).
  132. Generalization of Line Graphs and Applications, Information Processing Letters, Vol. 6, No. 1, pp. 14-16, Feb. 1977 (with A. B.. Pai and M. S.. Krishnamoorthy).
  133. A New Algorithm for Digraph Isomorphism, BIT, Vol. 17, No. 1, 1977, pp. 16-30 (with J. M. Davis and R. E.. Lord).
  134. Note on Hopcroft and Tarjan's Planarity Algorithms, Jour. ACM, Vol. 23, No. 1, pp. 74-75, Jan. 1976.
  135. On Algorithms for Enumerating All Circuits of a Graph, SIAM J. Computing, Vol. 5, No. 1, p. 90-99, March 1976 (with P. Mateti).
  136. Tree Graphs and Tree Numbers, IEEE Trans. on Circuits and Systems, Vol. CAS-22, No. 1, pp. 60-61, Jan. 1975 (with M. S.. Krishnamoorthy).