| 2026 | ICALP | Near-Optimal Dynamic Data Structures for Maximum Depth and Klee's Measure of Boxes. | Sujoy Bhore, Subhash Suri, Jie Xue, Xiongxin Yang, Jiumu Zhu |
| 2023 | ESA | Fault Tolerance in Euclidean Committee Selection. | Chinmay Sonar, Subhash Suri, Jie Xue |
| 2022 | IJCAI | Multiwinner Elections under Minimax Chamberlin-Courant Rule in Euclidean Space. | Chinmay Sonar, Subhash Suri, Jie Xue |
| 2022 | SODA | Dynamic Geometric Set Cover, Revisited. | Timothy M. Chan, Qizheng He, Subhash Suri, Jie Xue |
| 2021 | ESA | Efficient Algorithms for Least Square Piecewise Polynomial Regression. | Daniel Lokshtanov, Subhash Suri, Jie Xue |
| 2021 | ISAAC | Anonymity-Preserving Space Partitions. | rsula Hbert-Johnson, Chinmay Sonar, Subhash Suri, Vaishali Surianarayanan |
| 2021 | SODA | A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane. | Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri |
| 2018 | MFCS | Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames. | Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri |
| 2017 | ESA | Shortest Paths in the Plane with Obstacle Violations. | John Hershberger, Neeraj Kumar, Subhash Suri |
| 2017 | ESA | K-Dominance in Multidimensional Data: Theory and Applications. | Thomas Schibler, Subhash Suri |
| 2016 | GD | Block Crossings in Storyline Visualizations. | Thomas C. van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp, Peter Markfelder, Alexander Ravsky, Subhash Suri, Alexander Wolff |
| 2016 | LATIN | Bundled Crossings in Embedded Graphs. | Martin Fink, John Hershberger, Subhash Suri, Kevin Verbeek |
| 2016 | LATIN | Containment and Evasion in Stochastic Point Data. | Nirman Kumar, Subhash Suri |
| 2016 | PODS | Range-Max Queries on Uncertain Data. | Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos, Subhash Suri |
| 2015 | SODA | Geometric | Sylvester David Eriksson-Bique, John Hershberger, Valentin Polishchuk, Bettina Speckmann, Subhash Suri, Topi Talvitie, Kevin Verbeek, Hakan Yildiz |
| 2014 | ESA | Convex Hulls under Uncertainty. | Pankaj K. Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yildiz, Wuzhou Zhang |
| 2014 | ISAAC | On the Most Likely Voronoi Diagramand Nearest Neighbor Searching. | Subhash Suri, Kevin Verbeek |
| 2014 | WAFR | Trackability with Imprecise Localization. | Kyle Klein, Subhash Suri |
| 2013 | ESA | On the Most Likely Convex Hull of Uncertain Points. | Subhash Suri, Kevin Verbeek, Hakan Yildiz |
| 2013 | ISAAC | Euclidean Traveling Salesman Tours through Stochastic Neighborhoods. | Pegah Kamousi, Subhash Suri |
| 2013 | ISAAC | Pursuit Evasion on Polyhedral Surfaces. | Kyle Klein, Subhash Suri |
| 2012 | AAAI | Catch Me If You Can: Pursuit and Capture in Polygonal Environments with Obstacles. | Kyle Klein, Subhash Suri |
| 2012 | Algosensors | Geometric Computing over Uncertain Data. | Subhash Suri |
| 2012 | STACS | Conflict-free Chromatic Art Gallery Coverage. | Andreas Brtschi, Subhash Suri |
| 2011 | AAAI | Complete Information Pursuit Evasion in Polygonal Environments. | Kyle Klein, Subhash Suri |
| 2011 | ESA | The Union of Probabilistic Boxes: Maintaining the Volume. | Hakan Yildiz, Luca Foschini, John Hershberger, Subhash Suri |
| 2011 | NSDI | Efficiently Measuring Bandwidth at All Time Scales. | Frank C. Uyeda, Luca Foschini, Fred Baker, Subhash Suri, George Varghese |
| 2011 | SODA | On the Complexity of Time-Dependent Shortest Paths. | Luca Foschini, John Hershberger, Subhash Suri |
| 2011 | WADS | Closest Pair and the Post Office Problem for Stochastic Points. | Pegah Kamousi, Timothy M. Chan, Subhash Suri |
| 2010 | ALENEX | Untangling the Braid: Finding Outliers in a Set of Streams. | Chiranjeeb Buragohain, Luca Foschini, Subhash Suri |
| 2010 | ICDE | Space-efficient online approximation of time series data: Streams, amnesia, and out-of-order. | Sorabh Gandhi, Luca Foschini, Subhash Suri |
| 2010 | WAFR | Multiagent Pursuit Evasion, or Playing Kabaddi. | Kyle Klein, Subhash Suri |
| 2009 | SIGMOD | GAMPS: compressing multi sensor data by grouping and amplitude scaling. | Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu |
| 2009 | SIROCCO | Reconstructing Visibility Graphs with Simple Robots. | Davide Bil, Yann Disser, Mats Mihalk, Subhash Suri, Elias Vicari, Peter Widmayer |
| 2008 | Algosensors | Simple Robots in Polygonal Environments: A Hierarchy. | Jan Brunner, Mats Mihalk, Subhash Suri, Elias Vicari, Peter Widmayer |
| 2008 | Algosensors | Target Counting under Minimal Sensing: Complexity and Approximations. | Sorabh Gandhi, Rajesh Kumar, Subhash Suri |
| 2008 | MOBICOM | eBay in the Sky: strategy-proof wireless spectrum auctions. | Xia Zhou, Sorabh Gandhi, Subhash Suri, Haitao Zheng |
| 2007 | AAAI | Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry. | Subhash Suri, Elias Vicari, Peter Widmayer |
| 2007 | Algosensors | Counting Targets with Mobile Sensors in an Unknown Environment. | Beat Gfeller, Mats Mihalk, Subhash Suri, Elias Vicari, Peter Widmayer |
| 2007 | COCOON | Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks. | Chiranjeeb Buragohain, Subhash Suri, Csaba D. Tth, Yunhong Zhou |
| 2007 | ICDE | Space Efficient Streaming Algorithms for the Maximum Error Histogram. | Chiranjeeb Buragohain, Nisheeth Shrivastava, Subhash Suri |
| 2007 | SENSYS | Catching elephants with mice: sparse sampling for monitoring sensor networks. | Sorabh Gandhi, Subhash Suri, Emo Welzl |
| 2006 | ALENEX | Summarizing Spatial Data Streams Using ClusterHulls. | John Hershberger, Nisheeth Shrivastava, Subhash Suri |
| 2006 | CGO | Profiling over Adaptive Ranges. | Shashidhar Mysore, Banit Agrawal, Timothy Sherwood, Nisheeth Shrivastava, Subhash Suri |
| 2006 | DCOSS | Contour Approximation in Sensor Networks. | Chiranjeeb Buragohain, Sorabh Gandhi, John Hershberger, Subhash Suri |
| 2006 | ICDE | Cluster Hull: A Technique for Summarizing Spatial Data Streams. | John Hershberger, Nisheeth Shrivastava, Subhash Suri |
| 2006 | INFOCOM | Distributed Navigation Algorithms for Sensor Networks. | Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri |
| 2006 | SENSYS | Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms. | Nisheeth Shrivastava, Raghuraman Mudumbai, Upamanyu Madhow, Subhash Suri |
| 2006 | SECON | Search-quality Tradeoffs for Routing in Non-ideal Wireless Networks. | Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri |
| 2005 | COCOON | Interval Subset Sum and Uniform-Price Auction Clearing. | Anshul Kothari, Subhash Suri, Yunhong Zhou |
| 2005 | INFOCOM | Power aware routing for sensor databases. | Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri |
| 2005 | PODS | Space complexity of hierarchical heavy hitters in multi-dimensional data streams. | John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tth |
| 2004 | ISAAC | Adaptive Spatial Partitioning for Multidimensional Data Streams. | John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tth |
| 2004 | PODS | Adaptive Sampling for Geometric Problems over Data Streams. | John Hershberger, Subhash Suri |
| 2004 | SENSYS | Medians and beyond: new aggregation techniques for sensor networks. | Nisheeth Shrivastava, Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri |
| 2004 | SPAA | Selfish load balancing and atomic congestion games. | Subhash Suri, Csaba D. Tth, Yunhong Zhou |
| 2003 | ALENEX | Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation. | John Hershberger, Matthew Maxel, Subhash Suri |
| 2003 | MOBICOM | Towards realistic mobility models for mobile ad hoc networks. | Amit P. Jardosh, Elizabeth M. Belding-Royer, Kevin C. Almeroth, Subhash Suri |
| 2003 | SODA | Binary space partitions for 3D subdivisions. | John Hershberger, Subhash Suri |
| 2003 | STACS | On the Difficulty of Some Shortest Path Problems. | John Hershberger, Subhash Suri, Amit M. Bhosle |
| 2003 | WADS | Bandwidth-Constrained Allocation in Grid Computing. | Anshul Kothari, Subhash Suri, Yunhong Zhou |
| 2002 | FOCS | Erratum to "Vickrey Pricing and Shortest Paths: What is an Edge Worth?". | John Hershberger, Subhash Suri |
| 2002 | ISAAC | Market Clearing with Supply and Demand Curves. | Tuomas Sandholm, Subhash Suri |
| 2001 | FOCS | Vickrey Prices and Shortest Paths: What is an Edge Worth?. | John Hershberger, Subhash Suri |
| 2001 | GLOBECOM | Multiway range trees: scalable IP lookup with fast updates. | Subhash Suri, George Varghese, Priyank Ramesh Warkhede |
| 2001 | ICNP | Routing Bandwidth Guaranteed Paths with Restoration in Label Switched Networks. | Samphel Norden, Milind M. Buddhikot, Marcel Waldvogel, Subhash Suri |
| 2001 | ICNP | Fast Firewall Implementations for Software and Hardware-Based Routers. | Lili Qiu, George Varghese, Subhash Suri |
| 2001 | IJCAI | Market Clearability. | Tuomas Sandholm, Subhash Suri |
| 2001 | IJCAI | CABOB: A Fast Optimal Algorithm for Combinatorial Auctions. | Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine |
| 2001 | INFOCOM | A Lower Bound for Multicast Key Distribution. | Jack Snoeyink, Subhash Suri, George Varghese |
| 2001 | INFOCOM | Fast Packet Classification for Two-Dimensional Conflict-Free Filters. | Priyank Ramesh Warkhede, Subhash Suri, George Varghese |
| 2001 | SODA | Simplified kinetic connectivity for rectangles and hypercubes. | John Hershberger, Subhash Suri |
| 2001 | SODA | Shape sensitive geometric permutations. | Yunhong Zhou, Subhash Suri |
| 2001 | SIGMETRICS | Fast firewall implementations for software-based and hardware-based routers. | Lili Qiu, George Varghese, Subhash Suri |
| 2000 | AAAI | Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations. | Tuomas Sandholm, Subhash Suri |
| 2000 | ESA | Collision Detection Using Bounding Boxes: Convexity Helps. | Yunhong Zhou, Subhash Suri |
| 2000 | INFOCOM | Detecting and Resolving Packet Filter Conflicts. | Hari Adiseshu, Subhash Suri, Guru M. Parulkar |
| 2000 | SODA | Algorithms for minimum volume enclosing simplex in R | Yunhong Zhou, Subhash Suri |
| 1999 | SODA | Rectangular Tiling in Multi-dimensional Arrays. | Adam Smith, Subhash Suri |
| 1999 | SODA | Packet Filtering in High Speed Networks. | Subhash Suri, George Varghese |
| 1999 | SODA | Analysis of a Bounding Box Heuristic for Object Intersection. | Yunhong Zhou, Subhash Suri |
| 1999 | SIGCOMM | Packet Classification Using Tuple Space Search. | Venkatachary Srinivasan, Subhash Suri, George Varghese |
| 1998 | SODA | Collision Detection in Aspect and Scale Bounded Polyhedra. | Subhash Suri, Philip M. Hubbard, John F. Hughes |
| 1998 | SIGCOMM | Fast and Scalable Layer Four Switching. | Venkatachary Srinivasan, George Varghese, Subhash Suri, Marcel Waldvogel |
| 1997 | INFOCOM | Leap Forward Virtual Clock: A New Fair Queueing Scheme with Guaranteed Delays and Throughput Fairness. | Subhash Suri, George Varghese, Girish P. Chandranmenon |
| 1997 | PODC | Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delays and Throughput Fairness. | Subhash Suri, George Varghese, Girish P. Chandranmenon |
| 1997 | WADS | On-line Scheduling with Hard Deadlines (Extended Abstract). | Sally A. Goldman, Jyoti Parwatikar, Subhash Suri |
| 1997 | WADS | Efficient Breakout Routing in Printed Circuit Boards (Extended Abstract). | John Hershberger, Subhash Suri |
| 1996 | STOC | Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. | Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki |
| 1995 | ESA | The Centroid of Points with Approximate Weights. | Marshall W. Bern, David Eppstein, Leonidas J. Guibas, John Hershberger, Subhash Suri, Jan Wolter |
| 1995 | SODA | Morphing Binary Trees. | John Hershberger, Subhash Suri |
| 1995 | SODA | Practical Methods for Approximating Shortest Paths on a Convex Polytope in R | John Hershberger, Subhash Suri |
| 1994 | INFOCOM | A Comparative Evaluation of Space Priority Strategies in ATM Networks. | Subhash Suri, David Tipper, Gopal Meempat |
| 1994 | SODA | Surface Approximation and Geometric Partitions. | Pankaj K. Agarwal, Subhash Suri |
| 1993 | FOCS | Efficient Computation of Euclidean Shortest Paths in the Plane | John Hershberger, Subhash Suri |
| 1993 | SODA | A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk. | John Hershberger, Subhash Suri |
| 1993 | STOC | Matrix searching with the shortest path metric. | John Hershberger, Subhash Suri |
| 1992 | SODA | Optimal Link Path Queries in a Simple Polygon. | Esther M. Arkin, Joseph S. B. Mitchell, Subhash Suri |
| 1992 | SODA | Separation and Approximation of Polyhedral Objects. | Joseph S. B. Mitchell, Subhash Suri |
| 1991 | SODA | Offline Maintenance of Planar Configurations. | John Hershberger, Subhash Suri |
| 1991 | WADS | Farthest Neighbours, Maximum Spanning Trees and Related Problems in Higher Dimensions. | Pankaj K. Agarwal, Jir Matousek, Subhash Suri |
| 1989 | FOCS | Dynamically Computing the Maxima of Decomposable Functions, with Applications | David P. Dobkin, Subhash Suri |
| 1989 | FOCS | Fast Matching Algorithms for Points on a Polygon (Extended Abstract) | Odile Marcotte, Subhash Suri |
| 1989 | WADS | Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version). | Alok Aggarwal, Shlomo Moran, Peter W. Shor, Subhash Suri |
| 1988 | STACS | An Optimal Algorithm for Detecting Weak Visibility of a Polygon (Preliminary Version). | Jrg-Rdiger Sack, Subhash Suri |
| 1985 | STACS | Shortest Paths on Polyhedral Surfaces. | Joseph O'Rourke, Subhash Suri, Heather Booth |