The SCEAS System
| |||||||

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

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |