Srinivasa Rao Arikati

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2001
Approximation algorithms for maximum two-dimensional pattern matching.
Theor. Comput. Sci., 2001

1999
A Correctness Certificate for the Stoer-Wagner Min-Cut Algorithm.
Inf. Process. Lett., 1999

1998
All-Pairs Min-Cut in Sparse Networks.
J. Algorithms, 1998

1997
Efficient Computation of Implicit Representations of Sparse Graphs.
Discret. Appl. Math., 1997

A signature based approach to regularity extraction.
Proceedings of the 1997 IEEE/ACM International Conference on Computer-Aided Design, 1997

1996
Realizing Degree Sequences in Parallel.
SIAM J. Discret. Math., 1996

A Polynomial Algorithm for the Parity Path Problem on Perfectly orientable Graphs.
Discret. Appl. Math., 1996

Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane.
Proceedings of the Algorithms, 1996

1994
An O(n) Algorithm for Realizing Degree Sequences.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

Saving Bits Made Easy.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993
A Linear Algorithm for the Group Path Problem on Chordal Graphs.
Discret. Appl. Math., 1993

1991
An efficient algorithm for finding a two-pair, and its applications.
Discret. Appl. Math., 1991

Efficient Reduction for Path Problems on Circular-Arc Graphs.
BIT, 1991

1990
Linear Algorithm for Optimal Path Cover Problem on Interval Graphs.
Inf. Process. Lett., 1990


  Loading...