| 2001 |
|---|
| 17 | EE | Srinivasa Rao Arikati,
Anders Dessmark,
Andrzej Lingas,
Madhav V. Marathe:
Approximation algorithms for maximum two-dimensional pattern matching.
Theor. Comput. Sci. 255(1-2): 51-62 (2001) |
| 1999 |
|---|
| 16 | EE | Srinivasa Rao Arikati,
Kurt Mehlhorn:
A Correctness Certificate for the Stoer-Wagner Min-Cut Algorithm.
Inf. Process. Lett. 70(5): 251-254 (1999) |
| 1998 |
|---|
| 15 | | Srinivasa Rao Arikati,
Shiva Chaudhuri,
Christos D. Zaroliagis:
All-Pairs Min-Cut in Sparse Networks.
J. Algorithms 29(1): 82-110 (1998) |
| 1997 |
|---|
| 14 | EE | Srinivasa Rao Arikati,
Ravi Varadarajan:
A signature based approach to regularity extraction.
ICCAD 1997: 542-545 |
| 13 | EE | Srinivasa Rao Arikati,
Anil Maheshwari,
Christos D. Zaroliagis:
Efficient Computation of Implicit Representations of Sparse Graphs.
Discrete Applied Mathematics 78(1-3): 1-16 (1997) |
| 1996 |
|---|
| 12 | | Srinivasa Rao Arikati,
Anders Dessmark,
Andrzej Lingas,
Madhav V. Marathe:
Approximation Algorithms for Maximum Two-Dimensional Pattern Matching.
CPM 1996: 348-360 |
| 11 | | 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: 514-528 |
| 10 | EE | Srinivasa Rao Arikati,
Uri N. Peled:
A Polynomial Algorithm for the Parity Path Problem on Perfectly orientable Graphs.
Discrete Applied Mathematics 65(1-3): 5-20 (1996) |
| 9 | EE | Srinivasa Rao Arikati,
Anil Maheshwari:
Realizing Degree Sequences in Parallel.
SIAM J. Discrete Math. 9(2): 317-338 (1996) |
| 1995 |
|---|
| 8 | | Srinivasa Rao Arikati,
Shiva Chaudhuri,
Christos D. Zaroliagis:
All-Pairs Min-Cut in Sparse Networks.
FSTTCS 1995: 363-376 |
| 1994 |
|---|
| 7 | | Srinivasa Rao Arikati,
Anil Maheshwari,
Christos D. Zaroliagis:
Saving Bits Made Easy.
CCCG 1994: 140-146 |
| 6 | | Srinivasa Rao Arikati,
Anil Maheshwari:
An O(n) Algorithm for Realizing Degree Sequences.
FSTTCS 1994: 125-136 |
| 5 | | Srinivasa Rao Arikati,
Anil Maheshwari:
Realizing Degree Sequences in Parallel.
ISAAC 1994: 261-269 |
| 1993 |
|---|
| 4 | EE | Srinivasa Rao Arikati,
Uri N. Peled:
A Linear Algorithm for the Group Path Problem on Chordal Graphs.
Discrete Applied Mathematics 44(1-3): 185-190 (1993) |
| 1991 |
|---|
| 3 | | Srinivasa Rao Arikati,
C. Pandu Rangan,
Glenn K. Manacher:
Efficient Reduction for Path Problems on Circular-Arc Graphs.
BIT 31(2): 182-193 (1991) |
| 2 | EE | Srinivasa Rao Arikati,
C. Pandu Rangan:
An efficient algorithm for finding a two-pair, and its applications.
Discrete Applied Mathematics 31(1): 71-74 (1991) |
| 1990 |
|---|
| 1 | | Srinivasa Rao Arikati,
C. Pandu Rangan:
Linear Algorithm for Optimal Path Cover Problem on Interval Graphs.
Inf. Process. Lett. 35(3): 149-153 (1990) |
