Linear Algorithm for Optimal Path Cover Problem on Interval Graphs. - Srinivasa Rao Arikati; C. Pandu Rangan (Inf. Process. Lett., 1990)

Efficient Reduction for Path Problems on Circular-Arc Graphs. - Srinivasa Rao Arikati; C. Pandu Rangan; Glenn K. Manacher (BIT, 1991)

An efficient algorithm for finding a two-pair, and its applications. - Srinivasa Rao Arikati; C. Pandu Rangan (Discret. Appl. Math., 1991)

A Linear Algorithm for the Group Path Problem on Chordal Graphs. - Srinivasa Rao Arikati; Uri N. Peled (Discret. Appl. Math., 1993)

Saving Bits Made Easy. - Srinivasa Rao Arikati; Anil Maheshwari; Christos D. Zaroliagis (CCCG, 1994)

An O(n) Algorithm for Realizing Degree Sequences. - Srinivasa Rao Arikati; Anil Maheshwari (FSTTCS, 1994)

Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane. - Srinivasa Rao Arikati; Danny Z. Chen; L. Paul Chew; Gautam Das 001; Michiel H. M. Smid; Christos D. Zaroliagis (ESA, 1996)

A Polynomial Algorithm for the Parity Path Problem on Perfectly orientable Graphs. - Srinivasa Rao Arikati; Uri N. Peled (Discret. Appl. Math., 1996)

Realizing Degree Sequences in Parallel. - Srinivasa Rao Arikati; Anil Maheshwari (SIAM J. Discret. Math., 1996)

A signature based approach to regularity extraction. - Srinivasa Rao Arikati; Ravi Varadarajan (ICCAD, 1997)

Efficient Computation of Implicit Representations of Sparse Graphs. - Srinivasa Rao Arikati; Anil Maheshwari; Christos D. Zaroliagis (Discret. Appl. Math., 1997)

All-Pairs Min-Cut in Sparse Networks. - Srinivasa Rao Arikati; Shiva Chaudhuri; Christos D. Zaroliagis (J. Algorithms, 1998)

A Correctness Certificate for the Stoer-Wagner Min-Cut Algorithm. - Srinivasa Rao Arikati; Kurt Mehlhorn (Inf. Process. Lett., 1999)

Approximation algorithms for maximum two-dimensional pattern matching. - Srinivasa Rao Arikati; Anders Dessmark; Andrzej Lingas; Madhav V. Marathe (Theor. Comput. Sci., 2001)