next up previous
Next : To Appear in Refereed Journals  Up : Publications  Previous : Publications

APPEARED IN REFEREED JOURNALS

  1. V. Guruswami, C. PANDU RANGAN, M.S. Chang, G.J. Chang and C.K. Wong, The Kr-Packing Problem, Computing Vol. 66, pp. 79-89 (2001).
  2. Lakshminarayanan Subramanian, Muralidhar Talupur, Kamala Krithivasan and C. PANDU RANGAN, On the Generative Power of Simple H Systems, Journal of Automata, Languages and Combinatorics Vol. 5, pp. 457-473 (2000).
  3. D. Arun Kumar and C. PANDU RANGAN, Approximation Algorithms for the Traveling Salesman Problem with Range Condition, Theoretical Informatics and Applications, Vol. 34, pp. 173-181 (2000).
  4. Ravi Kant, S. Felsner, C. PANDU RANGAN and D.Wagnar, The Complexity of Partial Order Properties Order, Vol. 17, pp. 179-193 (2000).
  5. V. Guruswami and C. PANDU RANGAN, Algorithmic aspects of clique traversal and clique independent set, Discrete Applied Mathematics, Vol.100, pp. 183-202 (2000).
  6. A.Arvind, C. PANDU RANGAN, Symmetric Min-Max heap: A simpler data structure for double-ended priority queue, Information Processing Letters, Vol. 69, pp. 197-199 (1999).
  7. C. PANDU RANGAN, K. R. Parthasarathy, V. Prakash, On The g-Centroidal Problem in Special Classes of Perfect Graphs, Ars Combinatorica, Vol. 84, 267-278 (1998).
  8. D.G. Kirkpatrick, K. Madhukar, C. PANDU RANGAN, A.Srinivasan, Partial and Perfect Path Covers of Cographs. Discrete Applied Mathematics, Vol. 89, pp. 143-153 (1998).
  9. V. Prakash, K.R. Parthasarathy, C. PANDU RANGAN, The Deuchet Conjecture, Int Jl of Pure and Applied Maths, Vol. 29, pp. 447-459 (1998).
  10. M.S. Chang, P. Nagavamsi, C. PANDU RANGAN, Weighted Irredundance in Interval Graphs, Inform. Proc. Letters, Vol. 66, pp. 65-70 (1998).
  11. V. Guruswami and C.PANDU RANGAN, A natural family of optimization problem with arbitrary small approximation thresholds. Inform. Proc. Letters, Vol. 68, pp. 241-248 (1998).
  12. G.Venkatesan, U.Rotics, M.S.Madan Lal, J.A.Makovsky, C.PANDU RANGAN, Restrictions of Minimum Spanners Problem, Information and Computation, Vol. 136, pp. 143-164 (1997).
  13. K.S. Easwarakumar, S.V. Krishnan, C. PANDU RANGAN, S. Seshadri, Optimal Parallel algorithm for finding stambitus of a Planar Biconnected Graphs, Algorithmica, Vol. 15, pp. 242-255 (1996).
  14. C.R. Satyan, C. PANDU RANGAN, The Parity Path Problem on some subclasses of Perfect Graphs, Discrete Applied Maths, Vol. 68, pp. 293-302 (1996).
  15. R.F.M. Aranha, C. PANDU RANGAN, An efficient Distributed algorithm for centering of a spanning tree of a biconnected graph, Information Proc Letters, Vol. 59, pp.145-150 (1996).
  16. V. Balachandran, P. Nagavamsi, C. PANDU RANGAN, Clique Traversal and Clique Independance of Comparability Graphs, Information Processing Letters, Vol. 58, pp. 181-184 (1996).
  17. M.S. Madanlal, G. Venkatesan, C. PANDU RANGAN, Tree 3-Spanners on Interval, Permutation and Regular bipartite Graphs, Inform. Proc. Letters, Vol. 59, pp. 97-120 (1996).
  18. V. Balachandran, C. PANDU RANGAN, All-Pairs-shortest-length on Strongly Chordal graphs, Discrete Applied Mathematics, Vol. 69, pp. 169-182 (1996).
  19. G. Venkatesan, C. PANDU RANGAN, Approximate Triclique Coloring For Register Allocation. Inform. Proc. Letters, Vol. 60, pp. 249-253 (1996).
  20. K. Arvind, V. Kamakoti, C. PANDU RANGAN, Efficient parallel Algorithms on Permutation Graphs, Jl of Parallel and Distributed Computing, Vol. 26, pp. 116-124 (1995).
  21. G. Srikrishna, C. PANDU RANGAN, Optimal Parallel Algorithms for Path Problems on Planar Graphs, Theoretical Computer Science, Vol. 145, pp. 27-43 (1995).
  22. K. Madhukar, D. Pavan Kumar, C. PANDU RANGAN, R. Sundar, Systematic Design of an Algorithm for Biconnected Components. Science of Programming., Vol. 25, pp. 63-77 (1995).
  23. C.P. Gopalakrishnan, C. PANDU RANGAN, A Linear Algorithm for the Two Path Problem on Permutation Graphs, Discussions Mathematica - Graph Theory Vol. 15, pp.147-166 (1995).
  24. C.P. Gopalakrishnan, C. PANDU RANGAN, Edge Disjoint Paths in Permutation Graphs, Discussiones Mathematicae - Graph Theory, Vol. 15, pp. 59-72 (1995).
  25. C.P. Gopalakrishnan, C.R. Satyan, C. PANDU RANGAN, Efficient Algorithms for Minimal Disjoint Path Problems on Chordal Graphs. Discussiones Mathematicae - Graph Theory, Vol. 15, pp. 119-145 (1995).
  26. C.R. Satyan, C. PANDU RANGAN, Feedback Vertex Set Problem on Cocomparability Graphs, Networks, Vol. 26, pp. 101-111 (1995).
  27. Anand Srinivasan, K. Madhukar, P. Nagavamsi, C. PANDU RANGAN, M.S. Chang, Edge Domination on Bipartite Permutation Graphs and Cotriangulation Graphs. Information Processing Letters, Vol. 56, pp. 165-171 (1995).
  28. R.F.M. Aranha, C. PANDU RANGAN, An Efficient Distributed Algorithm for st-numbering the Vertices of a Biconnected Graph. Journal of Universal Computer Science, Vol. 1, pp. 629-647 (1995).
  29. V. Kamakoti, Kamala Krithivasan, C. PANDU RANGAN, Efficient Randomized Algorithm for the Closest Pair Problem on Colored Point Sets, Nordic Jl of Computing Vol. 2, pp. 28-40 (1995).
  30. S. Mahesh, C. Siva Rama Murthy, C. PANDU RANGAN, T. Gonsalves, Modeling and Simulation of Dynamic Job Scheduling in Multiprocessor Systems, International JL Computer Math, Vol. 58, pp. 221-247 (1995).
  31. S. Mahesh, C. Siva Rama Murthy, C. PANDU RANGAN, Efficient Dynamic Job Scheduling Algorithms for Multiprocessor Systems, IEICE Transactions on Information and Systems, Vol. E78-D, pp. 3-12 (1995).
  32. Y.B. Balayogan, C. PANDU RANGAN, Efficient Parallel Algorithms on Interval Graphs, RAIRO Theoretical Informatics and Applications, Vol. 29, pp. 451-470 (1995).
  33. G.J. Chang, C. PANDU RANGAN, C.R. Satyan, Weighted Independent Perfect Domination On Weighted Cocomparability graphs, Discrete Applied Maths, Vol. 63, pp. 215-222 (1995).
  34. S. Mahesh, C. Siva Rama Murthy, C. PANDU RANGAN, Performance Bounds for Static Multiprocessor Scheduling of Multi-task Jobs, Parallel Processing Letters, Vol. 5, pp. 343-355 (1995).
  35. K.S. Easwarakumar, C. PANDU RANGAN, G.A. Cheston, A Linear Algorithm for Centering a Spanning Tree of a Biconnected Graph, Information Processing Letters, Vol. 51, pp. 121-124 (1994).
  36. Ravi Sundaram, Karan Sher Singh, C. PANDU RANGAN, Treewidth of a Circular Arc Graph, SIAM Jl of Discrete Maths, Vol. 7, pp. 647-655 (1994).
  37. M. Nivat, GDS. Ramkumar, C. PANDU RANGAN, A. Saoudi, R. Sundaram, Efficient Parallel Shuffle Recognition Parallel Processing Letters, Vol. 4, pp. 455-463 (1994).
  38. P.B. Ramprasad, C. PANDU RANGAN, Linear Algorithm for All Bidirectional Edges of A Planar Graph, Algorithmica, Vol. 9, pp. 199-216 (1993).
  39. R. Srikant, Ravi Sundaram, Karan Sher Singh, C. PANDU RANGAN, Optimal Path Cover Problem on Block Graphs and Bipartite Permutation Graphs, Theoretical Computer Science, Vol. 115, pp. 351-357 (1993).
  40. K.S. Easwarakumar, C. PANDU RANGAN, An Algorithm for MIS of an 1-CUB, CSI JL on Computers and Informatics, Vol. 21, pp. 27-35 (1993).
  41. A. Raman, C. PANDU RANGAN, A Unified Approach to Parallel Algorithms for Domatic Partition Problem on Some Classes of Perfect Graphs, Parallel Processing Letters, Vol. 3, pp. 233-241 (1993).
  42. V. Kamakoti, C. PANDU RANGAN, Efficient Transitive Reduction on Permutation Graphs and its Applications, CSI JL on Computer Science and Informatics, Vol. 23, No. 3, pp. 52-59 (1993).
  43. R. Ravi, C. PANDU RANGAN, M. Marate, An Optimal Algorithm to solve All Pair Shortest Path Problem on Interval Graphs, Networks, Vol. 22, pp. 22-35 (1992).
  44. K. Arvind, C. PANDU RANGAN, Connected Domination and Steiner Set Problems on Permutation Graphs, Information Processing Letters, Vol. 41, pp. 215-220 (1992).
  45. Govindan Ramesh, C. PANDU RANGAN, An O(n log n ) algorithm for a maximum location problem, Discrete Applied Maths, Vol. 36, pp. 203-205 (1992).
  46. V. Kamakoti, C. PANDU RANGAN, An Optimal Algorithm for Reconstructing a Binary Tree, Information Processing Letters, Vol. 42, pp. 113-115 (1992).
  47. R. Ravi, C. PANDU RANGAN, M. Marathe, Generalized Vertex Covering in Interval Graphs, Discrete Applied Maths, Vol. 39, pp. 87-93 (1992).
  48. Srinivasa Rao Arikati, C. PANDU RANGAN, G.K. Manacher, Efficient Reduction For Path Problems on Circular-Arc Graphs, BIT, Vol. 31, pp. 182-193 (1991).
  49. A. Srinivasan, C. PANDU RANGAN, Efficient Algorithms for the minimum weighted dominating clique problem on permutation graphs, Theoretical Computer Science, Vol. 91, pp. 1-21 (1991).
  50. R. Mahesh, C. PANDU RANGAN, Arvind Srinivasan, On Finding the Minimum Bandwidth Of Interval Graph, Information and Computation, Vol. 95, pp. 218-225 (1991).
  51. Srinivasa R. Arikati, C. PANDU RANGAN, An efficient algorithm for finding a two-pair and its applications, Discrete Applied Maths, Vol. 31, pp. 71-74 (1991).
  52. G. Ramalingam, C. PANDU RANGAN, New Sequential and Parallel Algorithms for Recognising Interval Graphs, Information Processing Letters, Vol. 34, pp. 215-219 (1990).
  53. S. Sudarsan, C. PANDU RANGAN, A Fast Algorithm for Computing Sparse Visibility Graphs, Algorithmica, Vol. 5, pp. 201-214 (1990).
  54. Srinivasa Rao Arikati, C. PANDU RANGAN, Linear Algorithm for Optimal Path cover problem on Interval Graphs, Information Processing Letters, Vol. 35, pp. 149-153 (1990).
  55. A. Srinivasa Rao, C. PANDU RANGAN, Linear Algorithm for domatic number problem on Interval Graphs, Information Processing Letters, Vol. 33, pp. 29-33 (1989).
  56. A. Srinivasa Rao, C. PANDU RANGAN, Optimal Parallel Algorithms On Circular Arc Graphs, Information Processing Letters, Vol. 33, pp. 147-156 (1989).
  57. S. Venkatasubramanian, Kamala Krithivasan, C. PANDU RANGAN, Algorithms For Weighted Graph Problems On The Modified Cellular Graph Automation, Informatique Technique at Applications/ Theoretical Informatics and applications, Vol. 23, pp. 251-279 (1989).
  58. G. Ramalingam, C. PANDU RANGAN, Total Domination in Interval Graphs Revisited, Information Processing Letters, Vol. 27, pp. 17-21 (1988).
  59. G.Ramalingam, C. PANDU RANGAN, A Unified Approach to Domination Problems on Interval Graphs, Information Processing Letters, Vol. 27, pp. 271-274 (1988).
  60. C. PANDU RANGAN, N. Meenakshi, Matrix Transposition In a Magnetic Bubble Memory, Intern. Jl. Computer. Math, Vol. 26, pp 11-27 (1988).
  61. Kiran Kumar, C. PANDU RANGAN, New Linear Space Algorithm for the LCS Problem, Acta Informatica, Vol. 24, pp. 353-362 (1987).
  62. C. PANDU RANGAN, On the Minimum Number of Additions Required to Compute a Quadratic Form, JL of Algorithms, Vol. 4, pp. 282-285 (1983).

next up previous
Next : To Appear in Refereed Journals  Up : Publications  Previous : Publications

E.Boopal (Prof.CPR)
Wed Aug 5 15:36:01 IST 2008