Srinivasa Rao Arikati

Publication Activity (10 Years)

Years Active: 1990-2001
Publications (10 Years): 0

Publications

Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe
Approximation algorithms for maximum two-dimensional pattern matching. Theor. Comput. Sci. 255 (1-2) (2001)
Srinivasa Rao Arikati, Kurt Mehlhorn
A Correctness Certificate for the Stoer-Wagner Min-Cut Algorithm. Inf. Process. Lett. 70 (5) (1999)
Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis
All-Pairs Min-Cut in Sparse Networks. J. Algorithms 29 (1) (1998)
Srinivasa Rao Arikati, Ravi Varadarajan
A signature based approach to regularity extraction. ICCAD (1997)
Srinivasa Rao Arikati, Anil Maheshwari, Christos D. Zaroliagis
Efficient Computation of Implicit Representations of Sparse Graphs. Discret. Appl. Math. 78 (1-3) (1997)
Srinivasa Rao Arikati, Anil Maheshwari
Realizing Degree Sequences in Parallel. SIAM J. Discret. Math. 9 (2) (1996)
Srinivasa Rao Arikati, Uri N. Peled
A Polynomial Algorithm for the Parity Path Problem on Perfectly orientable Graphs. Discret. Appl. Math. 65 (1-3) (1996)
Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe
Approximation Algorithms for Maximum Two-Dimensional Pattern Matching. CPM (1996)
Srinivasa Rao Arikati, Danny Z. Chen, L. Paul Chew, Gautam Das, Michiel H. M. Smid, Christos D. Zaroliagis
Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane. ESA (1996)
Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis
All-Pairs Min-Cut in Sparse Networks. FSTTCS (1995)
Srinivasa Rao Arikati, Anil Maheshwari, Christos D. Zaroliagis
Saving Bits Made Easy. CCCG (1994)
Srinivasa Rao Arikati, Anil Maheshwari
Realizing Degree Sequences in Parallel. ISAAC (1994)
Srinivasa Rao Arikati, Anil Maheshwari
An O(n) Algorithm for Realizing Degree Sequences. FSTTCS (1994)
Srinivasa Rao Arikati, Uri N. Peled
A Linear Algorithm for the Group Path Problem on Chordal Graphs. Discret. Appl. Math. 44 (1-3) (1993)
Srinivasa Rao Arikati, C. Pandu Rangan
An efficient algorithm for finding a two-pair, and its applications. Discret. Appl. Math. 31 (1) (1991)
Srinivasa Rao Arikati, C. Pandu Rangan, Glenn K. Manacher
Efficient Reduction for Path Problems on Circular-Arc Graphs. BIT 31 (2) (1991)
Srinivasa Rao Arikati, C. Pandu Rangan
Linear Algorithm for Optimal Path Cover Problem on Interval Graphs. Inf. Process. Lett. 35 (3) (1990)