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

G. Srinivasaraghavan

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

2000
5 G. Srinivasaraghavan, Asish Mukhopadhyay: Orthogonal Edge Visibility Graphs of Polygons with Holes. Int. J. Comput. Geometry Appl. 10(1): 79-102 (2000)
1995
4 R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan: Tight Bounds for Finding Degrees from the Adjacency Matrix. LATIN 1995: 49-59
1994
3 G. Srinivasaraghavan, Asish Mukhopadhyay: A New Necessary Condition for the Vertex Visibility Graphs of Simple Polygons. Discrete & Computational Geometry 12: 65-82 (1994)
1993
2 G. Srinivasaraghavan, Asish Mukhopadhyay: On the Notion of Completeness for Reconstruction Algorithms on Visibility Graphs. CCCG 1993: 315-320
1 R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan: The Complexity of Finding Certain Trees in Tournaments. WADS 1993: 142-150

Coauthor Index

1R. Balasubramanian [1] [4]
2Asish Mukhopadhyay [2] [3] [5]
3Venkatesh Raman [1] [4]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)