Efficient Algorithms for Generalized Intersection Searching on Non-Iso-Oriented Objects. - Prosenjit Gupta; Ravi Janardan; Michiel H. M. Smid (SCG, 1994)

On Intersection Searching Problems Involving Curved Objects. - Prosenjit Gupta; Ravi Janardan; Michiel H. M. Smid (SWAT, 1994)

Extending the Quadrangle Inequality to Speed-Up Dynamic Programming. - Al Borchers; Prosenjit Gupta (Inf. Process. Lett., 1994)

Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. - Prosenjit Gupta; Ravi Janardan; Michiel H. M. Smid (J. Algorithms, 1995)

Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC machining. - Prosenjit Gupta; Ravi Janardan; Jayanth Majhi; Tony C. Woo (Comput. Aided Des., 1996)

Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems. - Prosenjit Gupta; Ravi Janardan; Michiel H. M. Smid (Comput. Geom., 1996)

Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects. - Prosenjit Gupta; Ravi Janardan; Michiel H. M. Smid (Comput. Geom., 1996)

The Rectangle Enclosure and Point-Dominance Problems Revisited. - Prosenjit Gupta; Ravi Janardan; Michiel H. M. Smid; Bhaskar DasGupta (Int. J. Comput. Geom. Appl., 1997)

A Technique for Adding Range Restrictions to Generalized Searching Problems. - Prosenjit Gupta; Ravi Janardan; Michiel H. M. Smid (Inf. Process. Lett., 1997)

Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design. - Jayanth Majhi; Prosenjit Gupta; Ravi Janardan (Comput. Geom., 1999)

On some geometric optimization problems in layered manufacturing. - Jayanth Majhi; Ravi Janardan; Michiel H. M. Smid; Prosenjit Gupta (Comput. Geom., 1999)

Minimizing support structures and trapped area in two-dimensional layered manufacturing. - Jayanth Majhi; Ravi Janardan; Jörg Schwerdt; Michiel H. M. Smid; Prosenjit Gupta (Comput. Geom., 1999)

Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. - Prosenjit Gupta; Ravi Janardan; Michiel H. M. Smid (Inf. Process. Lett., 1999)

Efficient polygon enclosure algorithms for device extraction from VLSI layouts. - Vamsikrishna Kundeti; Prosenjit Gupta (CCCG, 2004)

Overlaying Multiple Maps Efficiently. - Ravindranath Jampani; Risivardhan Thonangi; Prosenjit Gupta (CIT, 2004)

Computational Geometry. - Prosenjit Gupta; Ravi Janardan; Michiel H. M. Smid (Handbook of Data Structures and Applications, 2004)

Efficient Algorithms for Range Queries in Protein Sequence Analysis. - N. Madhusudhanan; Prosenjit Gupta; Abhijit Mitra (CCCG, 2005)

Algorithms for Range-Aggregate Query Problems Involving Geometric Aggregation Operations. - Prosenjit Gupta (ISAAC, 2005)

Range-Aggregate Proximity Detection for Design Rule Checking in VLSI Layouts. - R. Sharathkumar; Prosenjit Gupta (CCCG, 2006)

Optimal Algorithms for Some Polygon Enclosure Problems for VLSI Layout Analysis. - Vamsikrishna Kundeti; Prosenjit Gupta (J. Math. Model. Algorithms, 2006)

Range-Aggregate Query Problems Involving Geometric Aggregation Operations. - Prosenjit Gupta (Nord. J. Comput., 2006)

Reducing EPL Alignment Errors for Large VLSI Layouts. - Yokesh Kumar; Prosenjit Gupta (ISQED, 2007)

An External Memory Circuit Validation Algorithm for Large VLSI Layouts. - Yokesh Kumar; Prosenjit Gupta (ISVLSI, 2007)

Efficient algorithms for reverse proximity query problems. - Yokesh Kumar; Ravi Janardan; Prosenjit Gupta (GIS, 2008)

Data Structures for Reporting Extension Violations in a Query Range. - Ananda Swarup Das; Prosenjit Gupta; Kannan Srinathan (CCCG, 2009)

Data Structures for Range Aggregation by Categories. - Saladi Rahul; Prosenjit Gupta; K. S. Rajan (CCCG, 2009)

Efficient Non-Intersection Queries on Aggregated Geometric Data. - Prosenjit Gupta; Ravi Janardan; Michiel H. M. Smid (Int. J. Comput. Geom. Appl., 2009)

Incremental analysis of large VLSI Layouts. - Akash Agrawal; Prosenjit Gupta (Integr., 2009)

External memory layout vs. schematic. - Yokesh Kumar; Prosenjit Gupta (ACM Trans. Design Autom. Electr. Syst., 2009)

Range aggregate structures for colored geometric objects. - Saladi Rahul; Haritha Bellam; Prosenjit Gupta; Krishnan Rajan (CCCG, 2010)

Detecting VLSI Layout, Connectivity Errors in a Query Window. - Ananda Swarup Das; Prosenjit Gupta; Kannan Srinathan (CCCG, 2011)

Finding Maximum Density Axes Parallel Regions for Weighted Point Sets. - Ananda Swarup Das; Prosenjit Gupta; Kannan Srinathan; Kishore Kothapalli (CCCG, 2011)

Efficient Top-k Queries for Orthogonal Ranges. - Saladi Rahul; Prosenjit Gupta; Ravi Janardan; Krishnan Sundara Rajan (WALCOM, 2011)

Data Structures for Range-Aggregation over Categories. - Saladi Rahul; Prosenjit Gupta; Krishnan Sundara Rajan (Int. J. Found. Comput. Sci., 2011)

Data Structures for Extension Violations in a Query Range. - Ananda Swarup Das; Prosenjit Gupta; Kannan Srinathan (J. Math. Model. Algorithms, 2011)

Range Aggregate Maximal Points in the Plane. - Ananda Swarup Das; Prosenjit Gupta; Anil Kishore Kalavagattu; Jatin Agarwal; Kannan Srinathan; Kishore Kothapalli (WALCOM, 2012)

Counting Maximal Points in a Query Orthogonal Rectangle. - Ananda Swarup Das; Prosenjit Gupta; Kannan Srinathan (WALCOM, 2013)

Colored top-K range-aggregate queries. - Biswajit Sanyal; Prosenjit Gupta; Subhashis Majumder (Inf. Process. Lett., 2013)

Top - K Query Retrieval of Combinations with Sum-of-Subsets Ranking. - Subhashis Majumder; Biswajit Sanyal; Prosenjit Gupta; Soumik Sinha; Shiladitya Pande; Wing-Kai Hon (COCOA, 2014)

Data structures for range-aggregate extent queries. - Prosenjit Gupta; Ravi Janardan; Yokesh Kumar; Michiel H. M. Smid (Comput. Geom., 2014)

On reporting the L1 metric closest pair in a query rectangle. - Ananda Swarup Das; Prosenjit Gupta; Kishore Kothapalli; Kannan Srinathan (Inf. Process. Lett., 2014)

Iterative Use of Weighted Voronoi Diagrams to Improve Scalability in Recommender Systems. - Joydeep Das; Subhashis Majumder; Debarshi Dutta; Prosenjit Gupta (PAKDD (1), 2015)

Reporting and counting maximal points in a query orthogonal rectangle. - Ananda Swarup Das; Prosenjit Gupta; Kishore Kothapalli; Kannan Srinathan (J. Discrete Algorithms, 2015)

Linear space adaptive data structures for planar range reporting. - Ananda Swarup Das; Prosenjit Gupta (Inf. Process. Lett., 2016)

Collaborative Recommendations using Hierarchical Clustering based on K-d Trees and Quadtrees. - Joydeep Das; Subhashis Majumder; Prosenjit Gupta; Kalyani Mali (Int. J. Uncertain. Fuzziness Knowl. Based Syst., 2019)

Efficient meta-data structure in top-k queries of combinations and multi-item procurement auctions. - Biswajit Sanyal; Subhashis Majumder; Wing-Kai Hon; Prosenjit Gupta (Theor. Comput. Sci., 2020)

Scalable recommendations using decomposition techniques based on Voronoi diagrams. - Joydeep Das; Subhashis Majumder; Prosenjit Gupta; Suman Datta (Inf. Process. Manag., 2021)