dblp.uni-trier.dewww.uni-trier.de

Srinivasa Rao Arikati Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2001
17EESrinivasa 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)
1999
16EESrinivasa Rao Arikati, Kurt Mehlhorn: A Correctness Certificate for the Stoer-Wagner Min-Cut Algorithm. Inf. Process. Lett. 70(5): 251-254 (1999)
1998
15 Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis: All-Pairs Min-Cut in Sparse Networks. J. Algorithms 29(1): 82-110 (1998)
1997
14EESrinivasa Rao Arikati, Ravi Varadarajan: A signature based approach to regularity extraction. ICCAD 1997: 542-545
13EESrinivasa Rao Arikati, Anil Maheshwari, Christos D. Zaroliagis: Efficient Computation of Implicit Representations of Sparse Graphs. Discrete Applied Mathematics 78(1-3): 1-16 (1997)
1996
12 Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe: Approximation Algorithms for Maximum Two-Dimensional Pattern Matching. CPM 1996: 348-360
11EESrinivasa 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
10EESrinivasa Rao Arikati, Uri N. Peled: A Polynomial Algorithm for the Parity Path Problem on Perfectly orientable Graphs. Discrete Applied Mathematics 65(1-3): 5-20 (1996)
9EESrinivasa Rao Arikati, Anil Maheshwari: Realizing Degree Sequences in Parallel. SIAM J. Discrete Math. 9(2): 317-338 (1996)
1995
8EESrinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis: All-Pairs Min-Cut in Sparse Networks. FSTTCS 1995: 363-376
1994
7 Srinivasa Rao Arikati, Anil Maheshwari, Christos D. Zaroliagis: Saving Bits Made Easy. CCCG 1994: 140-146
6EESrinivasa Rao Arikati, Anil Maheshwari: An O(n) Algorithm for Realizing Degree Sequences. FSTTCS 1994: 125-136
5EESrinivasa Rao Arikati, Anil Maheshwari: Realizing Degree Sequences in Parallel. ISAAC 1994: 261-269
1993
4EESrinivasa Rao Arikati, Uri N. Peled: A Linear Algorithm for the Group Path Problem on Chordal Graphs. Discrete Applied Mathematics 44(1-3): 185-190 (1993)
1991
3 Srinivasa Rao Arikati, C. Pandu Rangan, Glenn K. Manacher: Efficient Reduction for Path Problems on Circular-Arc Graphs. BIT 31(2): 182-193 (1991)
2EESrinivasa Rao Arikati, C. Pandu Rangan: An efficient algorithm for finding a two-pair, and its applications. Discrete Applied Mathematics 31(1): 71-74 (1991)
1990
1 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

1Shiva Chaudhuri [8] [15]
2Danny Z. Chen [11]
3L. Paul Chew [11]
4Gautam Das [11]
5Anders Dessmark [12] [17]
6Andrzej Lingas [12] [17]
7Anil Maheshwari [5] [6] [7] [9] [13]
8Glenn K. Manacher [3]
9Madhav V. Marathe [12] [17]
10Kurt Mehlhorn [16]
11Uri N. Peled [4] [10]
12C. Pandu Rangan (Chandrasekaran Pandu Rangan) [1] [2] [3]
13Michiel H. M. Smid [11]
14Ravi Varadarajan [14]
15Christos D. Zaroliagis [7] [8] [11] [13] [15]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)