Your search returned the following 8 documents:

8. Approximation algorithms for maximum two-dimensional pattern matching
   Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, and Madhav V. Marathe
   Theoretical Computer Science 255 (1/2): 51-62, 2001
   
7. A correctness certificate for the Stoer-Wagner min-cut algorithm
   Srinivasa Rao Arikati and Kurt Mehlhorn
   Information Processing Letters 70 (5): 251-254, 1999
   [PDF: Download: Mehlhorn_a_1999_a.pdf] [PDF: Download: 141.pdf]
   
6. All-Pairs Min-Cut in Sparse Networks
   Srinivasa Rao Arikati, Shiva Chaudhuri, and Christos Zaroliagis
   Journal of Algorithms 29: 82-110, 1998
   
5. Efficient Computation of implicit representations of sparse graphs
   Srinivasa Rao Arikati, Anil Maheshwari, and Christos Zaroliagis
   Discrete Applied Mathematics 78 (1-3): 1-16, 1997
   
4. All-Pairs Min-Cut in Sparse Networks
   Srinivasa Rao Arikati, Shiva Chaudhuri, and Christos Zaroliagis
   In: Foundations of software technology and theoretical computer science (FSTTCS-95) : 15th conference, Bangalore, India, December, 18th - 20th, 1995, 363-376
   
3. Approximation algorithms for maximum two-dimensional pattern matching
   Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, and Madhav V. Marathe
   In: Combinatorial Pattern Matching: 7th Annual Symposium, CPM96, Laguna Beach, California, USA, June, 1996, 348-360
   
2. Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
   Srinivasa Rao Arikati, Danny Z. Chen, L. Paul Chew, Gautam Das, Michiel Smid, and Christos Zaroliagis
   In: Algorithms - ESA '96: 4th Annual European Symposium, Barcelona, September, 25th-27th, 1996, 514-528
   
1. Realizing degree sequences in parallel
   Srinivasa Rao Arikati and Anil Maheshwari
   SIAM Journal of Computing 9 (2): 317-338, 1996