default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSrinivasa Rao Arikati
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2001
[j10]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)
1990 – 1999
- 1999
- [j9]Srinivasa Rao Arikati, Kurt Mehlhorn:
A Correctness Certificate for the Stoer-Wagner Min-Cut Algorithm. Inf. Process. Lett. 70(5): 251-254 (1999) - 1998
- [j8]Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis
:
All-Pairs Min-Cut in Sparse Networks. J. Algorithms 29(1): 82-110 (1998) - 1997
- [j7]Srinivasa Rao Arikati, Anil Maheshwari, Christos D. Zaroliagis:
Efficient Computation of Implicit Representations of Sparse Graphs. Discret. Appl. Math. 78(1-3): 1-16 (1997) - [c7]Srinivasa Rao Arikati, Ravi Varadarajan:
A signature based approach to regularity extraction. ICCAD 1997: 542-545 - 1996
- [j6]Srinivasa Rao Arikati, Uri N. Peled:
A Polynomial Algorithm for the Parity Path Problem on Perfectly orientable Graphs. Discret. Appl. Math. 65(1-3): 5-20 (1996) - [j5]Srinivasa Rao Arikati, Anil Maheshwari:
Realizing Degree Sequences in Parallel. SIAM J. Discret. Math. 9(2): 317-338 (1996) - [c6]Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe:
Approximation Algorithms for Maximum Two-Dimensional Pattern Matching. CPM 1996: 348-360 - [c5]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 - 1995
- [c4]Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis:
All-Pairs Min-Cut in Sparse Networks. FSTTCS 1995: 363-376 - 1994
- [c3]Srinivasa Rao Arikati, Anil Maheshwari, Christos D. Zaroliagis:
Saving Bits Made Easy. CCCG 1994: 140-146 - [c2]Srinivasa Rao Arikati, Anil Maheshwari:
An O(n) Algorithm for Realizing Degree Sequences. FSTTCS 1994: 125-136 - [c1]Srinivasa Rao Arikati, Anil Maheshwari:
Realizing Degree Sequences in Parallel. ISAAC 1994: 261-269 - 1993
- [j4]Srinivasa Rao Arikati, Uri N. Peled:
A Linear Algorithm for the Group Path Problem on Chordal Graphs. Discret. Appl. Math. 44(1-3): 185-190 (1993) - 1991
- [j3]Srinivasa Rao Arikati, C. Pandu Rangan, Glenn K. Manacher:
Efficient Reduction for Path Problems on Circular-Arc Graphs. BIT 31(2): 181-193 (1991) - [j2]Srinivasa Rao Arikati, C. Pandu Rangan:
An efficient algorithm for finding a two-pair, and its applications. Discret. Appl. Math. 31(1): 71-74 (1991) - 1990
- [j1]Srinivasa Rao Arikati, C. Pandu Rangan:
Linear Algorithm for Optimal Path Cover Problem on Interval Graphs. Inf. Process. Lett. 35(3): 149-153 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
