Srinivasa Rao Arikati

According to our database, Srinivasa Rao Arikati authored at least 14 papers between 1990 and 1999.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1999

A Correctness Certificate for the Stoer-Wagner Min-Cut Algorithm.

Srinivasa Rao Arikati, Kurt Mehlhorn

Inf. Process. Lett., 1999

1997

Efficient Computation of Implicit Representations of Sparse Graphs.

Srinivasa Rao Arikati, Anil Maheshwari, Christos D. Zaroliagis

Discret. Appl. Math., 1997

A signature based approach to regularity extraction.

Srinivasa Rao Arikati, Ravi Varadarajan

Proceedings of the 1997 IEEE/ACM International Conference on Computer-Aided Design, 1997

1996

A Polynomial Algorithm for the Parity Path Problem on Perfectly orientable Graphs.

Srinivasa Rao Arikati, Uri N. Peled

Discret. Appl. Math., 1996

Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane.

Srinivasa Rao Arikati, Danny Z. Chen, L. Paul Chew, Gautam Das, Michiel H. M. Smid, Christos D. Zaroliagis

Proceedings of the Algorithms, 1996

Approximation Algorithms for Maximum Two-Dimensional Pattern Matching.

Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe

Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

1995

All-Pairs Min-Cut in Sparse Networks.

Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

1994

Realizing Degree Sequences in Parallel.

Srinivasa Rao Arikati, Anil Maheshwari

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

An O(n) Algorithm for Realizing Degree Sequences.

Srinivasa Rao Arikati, Anil Maheshwari

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

Saving Bits Made Easy.

Srinivasa Rao Arikati, Anil Maheshwari, Christos D. Zaroliagis

Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993

A Linear Algorithm for the Group Path Problem on Chordal Graphs.

Srinivasa Rao Arikati, Uri N. Peled

Discret. Appl. Math., 1993

1991

An efficient algorithm for finding a two-pair, and its applications.

Srinivasa Rao Arikati, C. Pandu Rangan

Discret. Appl. Math., 1991

Efficient Reduction for Path Problems on Circular-Arc Graphs.

Srinivasa Rao Arikati, C. Pandu Rangan, Glenn K. Manacher

BIT, 1991

1990

Linear Algorithm for Optimal Path Cover Problem on Interval Graphs.

Srinivasa Rao Arikati, C. Pandu Rangan

Inf. Process. Lett., 1990