 | 2012 |
| 9 |  | Ananda Swarup Das,
Prosenjit Gupta,
Anil Kishore Kalavagattu,
Jatin Agarwal,
Kannan Srinathan,
Kishore Kothapalli:
Range Aggregate Maximal Points in the Plane.
WALCOM 2012: 52-63 |
| 2011 |
| 8 |  | Ananda Swarup Das,
Prosenjit Gupta,
Kannan Srinathan:
Detecting VLSI Layout, Connectivity Errors in a Query Window.
CCCG 2011 |
| 7 |  | Ananda Swarup Das,
Prosenjit Gupta,
Kannan Srinathan,
Kishore Kothapalli:
Finding Maximum Density Axes Parallel Regions for Weighted Point Sets.
CCCG 2011 |
| 6 |  | Anil Kishore Kalavagattu,
Ananda Swarup Das,
Kishore Kothapalli,
Kannan Srinathan:
On Finding Skyline Points for Range Queries in Plane.
CCCG 2011 |
| 5 |  | Saladi Rahul,
Ananda Swarup Das,
K. S. Rajan,
Kannan Srinathan:
Range-Aggregate Queries Involving Geometric Aggregation Operations.
WALCOM 2011: 122-133 |
| 4 |  | Ananda Swarup Das,
Prosenjit Gupta,
Kannan Srinathan:
Data Structures for Extension Violations in a Query Range.
J. Math. Model. Algorithms 10(1): 79-107 (2011) |
| 2009 |
| 3 |  | Ananda Swarup Das,
Prosenjit Gupta,
Kannan Srinathan:
Data Structures for Reporting Extension Violations in a Query Range.
CCCG 2009: 129-132 |
| 2008 |
| 2 |  | Ananda Swarup Das,
Jitu Kumar Keshri,
Kannan Srinathan,
Vaibhav Srivastava:
Privacy Preserving Shortest Path Computation in Presence of Convex Polygonal Obstacles.
ARES 2008: 446-451 |
| 2007 |
| 1 |  | Ananda Swarup Das,
Kannan Srinathan,
Ritesh Kumar Tiwari,
Vaibhav Srivastava:
Privacy Preserving Computation of Shortest Path in Presence of a Single Convex Polygonal Obstacle.
MDM 2007: 248-252 |