G. Srinivasaraghavan
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| The complexity of finding certain trees in tournaments Lecture Notes in Computer Science | 2023-01-18 | Paper |
| Tight bounds for finding degrees from the adjacency matrix LATIN '95: Theoretical Informatics | 2022-08-16 | Paper |
| ORTHOGONAL EDGE VISIBILITY GRAPHS OF POLYGONS WITH HOLES International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
| A new necessary condition for the vertex visibility graphs of simple polygons Discrete & Computational Geometry | 1994-08-10 | Paper |
Research outcomes over time
This page was built for person: G. Srinivasaraghavan
