| 2009 |
| 33 | EE | Yokesh Kumar,
Prosenjit Gupta:
External memory layout vs. schematic.
ACM Trans. Design Autom. Electr. Syst. 14(2): (2009) |
| 2008 |
| 32 | | Ravi Janardan,
Prosenjit Gupta,
Yokesh Kumar,
Michiel H. M. Smid:
Data Structures for Range-Aggregate Extent Queries.
CCCG 2008 |
| 31 | EE | Yokesh Kumar,
Ravi Janardan,
Prosenjit Gupta:
Efficient algorithms for reverse proximity query problems.
GIS 2008: 39 |
| 2007 |
| 30 | EE | Yokesh Kumar,
Prosenjit Gupta:
Reducing EPL Alignment Errors for Large VLSI Layouts.
ISQED 2007: 233-238 |
| 29 | EE | Yokesh Kumar,
Prosenjit Gupta:
An External Memory Circuit Validation Algorithm for Large VLSI Layouts.
ISVLSI 2007: 510-511 |
| 2006 |
| 28 | EE | R. Sharathkumar,
Prosenjit Gupta:
Range-Aggregate Proximity Detection for Design Rule Checking in VLSI Layouts.
CCCG 2006 |
| 27 | | Prosenjit Gupta:
Range-Aggregate Query Problems Involving Geometric Aggregation Operations.
Nord. J. Comput. 13(4): 294-308 (2006) |
| 2005 |
| 26 | EE | N. Madhusudhanan,
Prosenjit Gupta,
Abhijit Mitra:
Efficient Algorithms for Range Queries in Protein Sequence Analysis.
CCCG 2005: 146-149 |
| 25 | EE | Prosenjit Gupta,
Ravi Janardan,
Michiel H. M. Smid:
Efficient Non-intersection Queries on Aggregated Geometric Data.
COCOON 2005: 544-553 |
| 24 | EE | Prosenjit Gupta:
Algorithms for Range-Aggregate Query Problems Involving Geometric Aggregation Operations.
ISAAC 2005: 892-901 |
| 2004 |
| 23 | EE | Vamsikrishna Kundeti,
Prosenjit Gupta:
Efficient polygon enclosure algorithms for device extraction from VLSI layouts.
CCCG 2004: 82-85 |
| 22 | EE | Ravindranath Jampani,
Risivardhan Thonangi,
Prosenjit Gupta:
Overlaying Multiple Maps Efficiently.
CIT 2004: 263-272 |
| 1999 |
| 21 | | Jayanth Majhi,
Ravi Janardan,
Michiel H. M. Smid,
Prosenjit Gupta:
On some geometric optimization problems in layered manufacturing.
Comput. Geom. 12(3-4): 219-239 (1999) |
| 20 | | Jayanth Majhi,
Ravi Janardan,
Jörg Schwerdt,
Michiel H. M. Smid,
Prosenjit Gupta:
Minimizing support structures and trapped area in two-dimensional layered manufacturing.
Comput. Geom. 12(3-4): 241-267 (1999) |
| 19 | | Jayanth Majhi,
Prosenjit Gupta,
Ravi Janardan:
Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design.
Comput. Geom. 13(4): 229-252 (1999) |
| 18 | EE | Prosenjit Gupta,
Ravi Janardan,
Michiel H. M. Smid:
Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons.
Inf. Process. Lett. 69(1): 7-13 (1999) |
| 1997 |
| 17 | | Jayanth Majhi,
Ravi Janardan,
Michiel H. M. Smid,
Prosenjit Gupta:
On Some Geometric Optimization Problems in Layered Manufacturing.
WADS 1997: 136-149 |
| 16 | EE | Prosenjit Gupta,
Ravi Janardan,
Michiel H. M. Smid:
A Technique for Adding Range Restrictions to Generalized Searching Problems.
Inf. Process. Lett. 64(5): 263-269 (1997) |
| 15 | | Prosenjit Gupta,
Ravi Janardan,
Michiel H. M. Smid,
Bhaskar DasGupta:
The Rectangle Enclosure and Point-Dominance Problems Revisited.
Int. J. Comput. Geometry Appl. 7(5): 437-455 (1997) |
| 1996 |
| 14 | | Prosenjit Gupta,
Ravi Janardan,
Michiel H. M. Smid:
Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons.
CCCG 1996: 8-13 |
| 13 | | Jayanth Majhi,
Prosenjit Gupta,
Ravi Janardan:
Computing a Flattest, Undercut-Free Parting Line for a Convex Polyhedron, with Application to Mold Design.
WACG 1996: 109-120 |
| 12 | | Prosenjit Gupta,
Ravi Janardan,
Michiel H. M. Smid:
Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems.
Comput. Geom. 6: 1-19 (1996) |
| 11 | | Prosenjit Gupta,
Ravi Janardan,
Michiel H. M. Smid:
Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects.
Comput. Geom. 6: 371-391 (1996) |
| 10 | EE | Prosenjit Gupta,
Ravi Janardan,
Jayanth Majhi,
Tony C. Woo:
Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC machining.
Computer-Aided Design 28(8): 577-587 (1996) |
| 1995 |
| 9 | EE | Prosenjit Gupta,
Ravi Janardan,
Michiel H. M. Smid,
Bhaskar DasGupta:
The Rectangle Enclosure and Point-Dominance Problems Revisited.
Symposium on Computational Geometry 1995: 162-171 |
| 8 | | Prosenjit Gupta,
Ravi Janardan,
Jayanth Majhi,
Tony C. Woo:
Efficient Geometric Algorithms for Workpiece Orientation in 4- and 5-Axis NC-Machining.
WADS 1995: 171-182 |
| 7 | | Prosenjit Gupta,
Ravi Janardan,
Michiel H. M. Smid:
Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems.
Comput. Geom. 5: 321-340 (1995) |
| 6 | | Prosenjit Gupta,
Ravi Janardan,
Michiel H. M. Smid:
Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization.
J. Algorithms 19(2): 282-317 (1995) |
| 1994 |
| 5 | | Prosenjit Gupta,
Ravi Janardan,
Michiel H. M. Smid:
Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects.
ESA 1994: 278-289 |
| 4 | | Prosenjit Gupta,
Ravi Janardan,
Michiel H. M. Smid:
On Intersection Searching Problems Involving Curved Objects.
SWAT 1994: 183-194 |
| 3 | EE | Prosenjit Gupta,
Ravi Janardan,
Michiel H. M. Smid:
Efficient Algorithms for Generalized Intersection Searching on Non-Iso-Oriented Objects.
Symposium on Computational Geometry 1994: 369-378 |
| 2 | | Al Borchers,
Prosenjit Gupta:
Extending the Quadrangle Inequality to Speed-Up Dynamic Programming.
Inf. Process. Lett. 49(6): 287-290 (1994) |
| 1993 |
| 1 | | Prosenjit Gupta,
Ravi Janardan,
Michiel H. M. Smid:
Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization.
WADS 1993: 361-372 |