Srinivasa R. Arikati

Cadence Design Systems (United States) — United States

Computer Science · Physical Sciences

10h-index392citations22works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(8), Complexity and Algorithms in Graphs(8), graph theory and CDMA systems(6), Digital Image Processing Techniques(6), Computational Geometry and Mesh Generation(4)

Publications22 total

A correctness certificate for the Stoer–Wagner min-cut algorithm
Information Processing Letters·1999· 9 cited
The realization graph of a degree sequence with majorization gap 1 is Hamiltonian
Linear Algebra and its Applications·1999· 6 cited
All-Pairs Min-Cut in Sparse Networks
Journal of Algorithms·1998· 5 citedOpen Access
A signature based approach to regularity extraction
International Conference on Computer Aided Design·1997· 29 cited
Efficient computation of implicit representations of sparse graphs
Discrete Applied Mathematics·1997· 30 citedOpen Access
Realizing Degree Sequences in Parallel
SIAM Journal on Discrete Mathematics·1996Open Access
A polynomial algorithm for the parity path problem on perfectly orientable graphs
Discrete Applied Mathematics·1996· 14 cited
Approximation algorithms for maximum two-dimensional pattern matching
Lecture notes in computer science·1996· 3 citedOpen Access
Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
1996· 71 cited
Planar spanners and approximate shortest path queries among obstacles in the plane
Lecture notes in computer science·1996· 59 cited
All-pairs min-cut in sparse networks
Lecture notes in computer science·1995· 1 cited
Efficient computation of implicit representations of sparse graphs (revised version)
Max Planck Digital Library·1995· 1 citedOpen Access
Degree sequences and majorization
Linear Algebra and its Applications·1994· 19 cited
On the parallel complexity of degree sequence problems
MPG.PuRe (Max Planck Society)·1994Open Access
Saving Bits Made Easy.
Canadian Conference on Computational Geometry·1994
An O(n) algorithm for realizing degree sequences
Lecture notes in computer science·1994
Realizing degree sequences in parallel
Lecture notes in computer science·1994· 2 cited
A linear algorithm for the group path problem on chordal graphs
Discrete Applied Mathematics·1993· 12 cited
New results in algorithmic graph theory
Figshare·1993Open Access
Efficient reduction for path problems on circular-arc graphs
BIT Numerical Mathematics·1991· 11 cited
page 1 of 2Next →

Frequent Co-authors

Christos Zaroliagis(7), Anil Maheshwari(5), Uri N. Peled(4), C. Pandu Rangan(3), Danny Z. Chen(2), L. Paul Chew(2), Gautam Das(2), Michiel Smid(2), Shiva Chaudhuri(2), Ravi Varadarajan(1), Glenn K. Manacher(1), Kurt Mehlhorn(1), Anders Dessmark(1), Andrzej Lingas(1), Madhav Marathe(1), Anil K. Maheshwari(1)