Subhash Suri - RankMe

315 papers A* 61A 20B 26C 6Misc 6Journal 127Unranked 63

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	Approximation and Hardness of Polychromatic TSP. CCCG Thomas Schibler, Subhash Suri, Jie Xue
2025	J	`jnl`	Approximation and Hardness of Polychromatic TSP. CoRR Thomas Schibler, Subhash Suri, Jie Xue
2025	J	`jnl`	Dynamic Geometric Set Cover, Revisited. SIAM J. Comput. Timothy M. Chan, Qizheng He, Subhash Suri, Jie Xue
2025	A*	`conf`	Dynamic Maximum Depth of Geometric Objects. SoCG Subhash Suri, Jie Xue, Xiongxin Yang, Jiumu Zhu
2025	A*	`conf`	Embedding Graphs as Euclidean kNN-Graphs. SoCG Thomas Schibler, Subhash Suri, Jie Xue
2025	J	`jnl`	Embedding Graphs as Euclidean kNN-Graphs. CoRR Thomas Schibler, Subhash Suri, J. Xue
2023	B	`ed.`	Algorithms and Data Structures - 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 - August 2, 2023, Proceedings WADS Pat Morin, Subhash Suri
2023	A	`conf`	Fault Tolerance in Euclidean Committee Selection. ESA Chinmay Sonar, Subhash Suri, Jie Xue
2023	J	`jnl`	Fault Tolerance in Euclidean Committee Selection. CoRR Chinmay Sonar, Subhash Suri, Jie Xue
2023	—	`conf`	Spanning Tree, Matching, and TSP for Moving Points: Complexity and Regret. CCCG Nathan Wachholz, Subhash Suri
2022	J	`jnl`	A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane. SIAM J. Comput. John Hershberger, Subhash Suri, Hakan Yildiz
2022	J	`jnl`	Dynamic Geometric Set Cover and Hitting Set. ACM Trans. Algorithms Pankaj K. Agarwal, Hsien-Chih Chang, Subhash Suri, Allen Xiao, Jie Xue
2022	A*	`conf`	Dynamic Geometric Set Cover, Revisited. SODA Timothy M. Chan, Qizheng He, Subhash Suri, Jie Xue
2022	A*	`conf`	Multiwinner Elections under Minimax Chamberlin-Courant Rule in Euclidean Space. IJCAI Chinmay Sonar, Subhash Suri, Jie Xue
2022	J	`jnl`	Multiwinner Elections under Minimax Chamberlin-Courant Rule in Euclidean Space. CoRR Chinmay Sonar, Subhash Suri, Jie Xue
2022	A*	`conf`	Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles. SoCG Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue
2022	J	`jnl`	Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles. CoRR Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue
2022	J	`jnl`	The maximum exposure problem. Comput. Geom. Neeraj Kumar, Stavros Sintos, Subhash Suri
2021	A*	`conf`	A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane. SODA Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri
2021	—	`conf`	An ETH-Tight Algorithm for Multi-Team Formation. FSTTCS Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue
2021	B	`conf`	Anonymity-Preserving Space Partitions. ISAAC Úrsula Hébert-Johnson, Chinmay Sonar, Subhash Suri, Vaishali Surianarayanan
2021	J	`jnl`	Dynamic Geometric Set Cover, Revisited. CoRR Timothy M. Chan, Qizheng He, Subhash Suri, Jie Xue
2021	A	`conf`	Efficient Algorithms for Least Square Piecewise Polynomial Regression. ESA Daniel Lokshtanov, Subhash Suri, Jie Xue
2021	J	`jnl`	The Maximum Exposure Problem. CoRR Neeraj Kumar, Stavros Sintos, Subhash Suri
2020	J	`jnl`	A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane. CoRR Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri
2020	A*	`conf`	Dynamic Geometric Set Cover and Hitting Set. SoCG Pankaj K. Agarwal, Hsien-Chih Chang, Subhash Suri, Allen Xiao, Jie Xue
2020	J	`jnl`	Dynamic geometric set cover and hitting set. CoRR Pankaj K. Agarwal, Hsien-Chih Chang, Subhash Suri, Allen Xiao, Jie Xue
2020	—	`conf`	Fair Covering of Points by Balls. CCCG Daniel Lokshtanov, Chinmay Sonar, Subhash Suri, Jie Xue
2020	J	`jnl`	Improved approximation bounds for the minimum constraint removal problem. Comput. Geom. Sayan Bandyapadhyay, Neeraj Kumar, Subhash Suri, Kasturi R. Varadarajan
2020	J	`jnl`	K-dominance in multidimensional data: Theory and applications. Comput. Geom. Thomas Schibler, Subhash Suri
2020	J	`jnl`	Shortest Paths in the Plane with Obstacle Violations. Algorithmica John Hershberger, Neeraj Kumar, Subhash Suri
2019	J	`jnl`	Approximating dominating set on intersection graphs of rectangles and L-frames. Comput. Geom. Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri
2019	—	`conf`	On Multi-Dimensional Team Formation. CCCG Thomas Schibler, Ambuj K. Singh, Subhash Suri
2019	—	`conf`	The Maximum Exposure Problem. APPROX-RANDOM Neeraj Kumar, Stavros Sintos, Subhash Suri
2018	J	`jnl`	Analytic tractography: A closed-form solution for estimating local white matter connectivity with diffusion MRI. NeuroImage Matthew Cieslak, Tegan Brennan, Wendy Meiring, Lukas J. Volz, Clint Greene, Alexander Asturias, Subhash Suri, Scott T. Grafton
2018	J	`jnl`	Approximating Dominating Set on Intersection Graphs of L-frames. CoRR Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri
2018	B	`conf`	Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames. MFCS Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri
2018	—	`conf`	Compositional measures of diffusion anisotropy and asymmetry. ISBI Matthew Cieslak, Wendy Meiring, Tegan Brennan, Clint Greene, Lukas J. Volz, Jean M. Vettel, Subhash Suri, Scott T. Grafton
2018	—	`conf`	Computing Shortest Paths in the Plane with Removable Obstacles. SWAT Pankaj K. Agarwal, Neeraj Kumar, Stavros Sintos, Subhash Suri
2018	—	`conf`	Improved Approximation Bounds for the Minimum Constraint Removal Problem. APPROX-RANDOM Sayan Bandyapadhyay, Neeraj Kumar, Subhash Suri, Kasturi R. Varadarajan
2018	—	`ch.`	Quantiles on Streams. Encyclopedia of Database Systems (2nd ed.) Chiranjeeb Buragohain, Subhash Suri
2018	J	`jnl`	Range-max queries on uncertain data. J. Comput. Syst. Sci. Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos, Subhash Suri
2018	J	`jnl`	Tight bounds for conflict-free chromatic guarding of orthogonal art galleries. Comput. Geom. Frank Hoffmann, Klaus Kriegel, Subhash Suri, Kevin Verbeek, Max Willert
2017	J	`jnl`	Block Crossings in Storyline Visualizations. J. Graph Algorithms Appl. Thomas C. van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp, Peter Markfelder, Alexander Ravsky, Subhash Suri, Alexander Wolff
2017	J	`jnl`	Convex Hulls Under Uncertainty. Algorithmica Pankaj K. Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yildiz, Wuzhou Zhang
2017	B	`conf`	Efficient Algorithms for k-Regret Minimizing Sets. SEA Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos, Subhash Suri
2017	J	`jnl`	Efficient Algorithms for k-Regret Minimizing Sets. CoRR Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos, Subhash Suri
2017	J	`jnl`	Hyperplane separability and convexity of probabilistic point sets. J. Comput. Geom. Martin Fink, John Hershberger, Nirman Kumar, Subhash Suri
2017	A	`conf`	K-Dominance in Multidimensional Data: Theory and Applications. ESA Thomas Schibler, Subhash Suri
2017	A	`conf`	Shortest Paths in the Plane with Obstacle Violations. ESA John Hershberger, Neeraj Kumar, Subhash Suri
2016	A	`conf`	Block Crossings in Storyline Visualizations. GD Thomas C. van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp, Peter Markfelder, Alexander Ravsky, Subhash Suri, Alexander Wolff
2016	J	`jnl`	Block Crossings in Storyline Visualizations. CoRR Thomas C. van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp, Peter Markfelder, Alexander Ravsky, Subhash Suri, Alexander Wolff
2016	—	`conf`	Boundary Labeling with Obstacles. CCCG Martin Fink, Subhash Suri
2016	B	`conf`	Bundled Crossings in Embedded Graphs. LATIN Martin Fink, John Hershberger, Subhash Suri, Kevin Verbeek
2016	B	`conf`	Containment and Evasion in Stochastic Point Data. LATIN Nirman Kumar, Subhash Suri
2016	—	`conf`	Counting Convex k-gons in an Arrangement of Line Segments. CCCG Martin Fink, Neeraj Kumar, Subhash Suri
2016	A*	`conf`	Hyperplane Separability and Convexity of Probabilistic Point Sets. SoCG Martin Fink, John Hershberger, Nirman Kumar, Subhash Suri
2016	J	`jnl`	Metric embedding, hyperbolic space, and social networks. Comput. Geom. Kevin Verbeek, Subhash Suri
2016	—	`conf`	Most Likely Voronoi Diagrams in Higher Dimensions. FSTTCS Nirman Kumar, Benjamin Raichel, Subhash Suri, Kevin Verbeek
2016	J	`jnl`	Observability of Lattice Graphs. Algorithmica Fangqiu Han, Subhash Suri, Xifeng Yan
2016	J	`jnl`	On the Most Likely Voronoi Diagram and Nearest Neighbor Searching. Int. J. Comput. Geom. Appl. Subhash Suri, Kevin Verbeek
2016	A*	`conf`	Range-Max Queries on Uncertain Data. PODS Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos, Subhash Suri
2015	—	`conf`	A reeb graph approach to tractography. SIGSPATIAL/GIS Jonathan Sun, Matthew Cieslak, Scott T. Grafton, Subhash Suri
2015	J	`jnl`	Capture bounds for visibility-based pursuit evasion. Comput. Geom. Kyle Klein, Subhash Suri
2015	J	`jnl`	Computing Klee's Measure of Grounded Boxes. Algorithmica Hakan Yildiz, Subhash Suri
2015	A*	`conf`	Geometric SODA Sylvester David Eriksson-Bique, John Hershberger, Valentin Polishchuk, Bettina Speckmann, Subhash Suri, Topi Talvitie, Kevin Verbeek, Hakan Yildiz
2015	J	`jnl`	Observability of Lattice Graphs. CoRR Fangqiu Han, Subhash Suri, Xifeng Yan
2015	J	`jnl`	Pursuit Evasion on Polyhedral Surfaces. Algorithmica Kyle Klein, Subhash Suri
2015	A*	`conf`	Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries. SoCG Frank Hoffmann, Klaus Kriegel, Subhash Suri, Kevin Verbeek, Max Willert
2015	—	`conf`	Tradeoffs between Bends and Displacement in Anchored Graph Drawing. CCCG Martin Fink, Subhash Suri
2014	J	`jnl`	Closest pair and the post office problem for stochastic points. Comput. Geom. Pegah Kamousi, Timothy M. Chan, Subhash Suri
2014	J	`jnl`	Conflict-Free Chromatic Art Gallery Coverage. Algorithmica Andreas Bärtschi, Subhash Suri
2014	A	`conf`	Convex Hulls under Uncertainty. ESA Pankaj K. Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yildiz, Wuzhou Zhang
2014	J	`jnl`	Convex Hulls under Uncertainty. CoRR Pankaj K. Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yildiz, Wuzhou Zhang
2014	J	`jnl`	Erratum to: Conflict-Free Chromatic Art Gallery Coverage. Algorithmica Andreas Bärtschi, Subhash Suri
2014	A*	`conf`	Metric Embedding, Hyperbolic Space, and Social Networks. SoCG Kevin Verbeek, Subhash Suri
2014	J	`jnl`	On the Complexity of Time-Dependent Shortest Paths. Algorithmica Luca Foschini, John Hershberger, Subhash Suri
2014	B	`conf`	On the Most Likely Voronoi Diagramand Nearest Neighbor Searching. ISAAC Subhash Suri, Kevin Verbeek
2014	C	`conf`	Trackability with Imprecise Localization. WAFR Kyle Klein, Subhash Suri
2014	J	`jnl`	k-Capture in multiagent pursuit evasion, or the lion and the hyenas. Theor. Comput. Sci. Shaunak Dattaprasad Bopardikar, Subhash Suri
2013	A*	`conf`	A near-optimal algorithm for shortest paths among curved obstacles in the plane. SoCG John Hershberger, Subhash Suri, Hakan Yildiz
2013	A*	`conf`	Capture bounds for visibility-based pursuit evasion. SoCG Kyle Klein, Subhash Suri
2013	B	`conf`	Euclidean Traveling Salesman Tours through Stochastic Neighborhoods. ISAAC Pegah Kamousi, Subhash Suri
2013	J	`jnl`	Memory Efficient Minimum Substring Partitioning. Proc. VLDB Endow. Yang Li, Pegah Kamousi, Fangqiu Han, Shengqi Yang, Xifeng Yan, Subhash Suri
2013	A	`conf`	On the Most Likely Convex Hull of Uncertain Points. ESA Subhash Suri, Kevin Verbeek, Hakan Yildiz
2013	B	`conf`	Pursuit Evasion on Polyhedral Surfaces. ISAAC Kyle Klein, Subhash Suri
2013	J	`jnl`	Trackability with Imprecise Localization. CoRR Kyle Klein, Subhash Suri
2012	J	`jnl`	Capturing an evader in polygonal environments with obstacles: The full visibility case. Int. J. Robotics Res. Deepak Bhadauria, Kyle Klein, Volkan Isler, Subhash Suri
2012	A*	`conf`	Catch Me If You Can: Pursuit and Capture in Polygonal Environments with Obstacles. AAAI Kyle Klein, Subhash Suri
2012	A	`conf`	Conflict-free Chromatic Art Gallery Coverage. STACS Andreas Bärtschi, Subhash Suri
2012	C	`conf`	Geometric Computing over Uncertain Data. ALGOSENSORS Subhash Suri
2012	J	`jnl`	Memory Efficient De Bruijn Graph Construction CoRR Yang Li, Pegah Kamousi, Fangqiu Han, Shengqi Yang, Xifeng Yan, Subhash Suri
2012	—	`conf`	On Klee's measure problem for grounded boxes. SCG Hakan Yildiz, Subhash Suri
2012	J	`jnl`	Reconstructing visibility graphs with simple robots. Theor. Comput. Sci. Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
2011	—	`conf`	A Discrete and Dynamic Version of Klee's Measure Problem. CCCG Hakan Yildiz, John Hershberger, Subhash Suri
2011	J	`jnl`	Capturing an Evader in Polygonal Environments: A Complete Information Game CoRR Kyle Klein, Subhash Suri
2011	B	`conf`	Closest Pair and the Post Office Problem for Stochastic Points. WADS Pegah Kamousi, Timothy M. Chan, Subhash Suri
2011	A*	`conf`	Complete Information Pursuit Evasion in Polygonal Environments. AAAI Kyle Klein, Subhash Suri
2011	Misc	`conf`	Efficiently Measuring Bandwidth at All Time Scales. NSDI Frank C. Uyeda, Luca Foschini, Fred Baker, Subhash Suri, George Varghese
2011	J	`jnl`	Multiple-Target Tracking With Binary Proximity Sensors. ACM Trans. Sens. Networks Jaspreet Singh, Rajesh Kumar, Upamanyu Madhow, Subhash Suri, Richard E. Cagley
2011	A*	`conf`	On the Complexity of Time-Dependent Shortest Paths. SODA Luca Foschini, John Hershberger, Subhash Suri
2011	—	`conf`	Stochastic Minimum Spanning Trees and Related Problems. ANALCO Pegah Kamousi, Subhash Suri
2011	—	`conf`	Stochastic minimum spanning trees in euclidean spaces. SCG Pegah Kamousi, Timothy M. Chan, Subhash Suri
2011	A	`conf`	The Union of Probabilistic Boxes: Maintaining the Volume. ESA Hakan Yildiz, Luca Foschini, John Hershberger, Subhash Suri
2011	J	`jnl`	k-Capture in Multiagent Pursuit Evasion, or the Lion and the Hyenas CoRR Shaunak Dattaprasad Bopardikar, Subhash Suri
2010	C	`conf`	Multiagent Pursuit Evasion, or Playing Kabaddi. WAFR Kyle Klein, Subhash Suri
2010	—	`conf`	Robot kabaddi. CCCG Kyle Klein, Subhash Suri
2010	A*	`conf`	Space-efficient online approximation of time series data: Streams, amnesia, and out-of-order. ICDE Sorabh Gandhi, Luca Foschini, Subhash Suri
2010	A	`conf`	Untangling the Braid: Finding Outliers in a Set of Streams. ALENEX Chiranjeeb Buragohain, Luca Foschini, Subhash Suri
2009	—	`conf`	09371 Abstracts Collection - Algorithmic Methods for Distributed Cooperative Systems. Algorithmic Methods for Distributed Cooperative Systems Sándor P. Fekete, Stefan Fischer, Martin A. Riedmiller, Subhash Suri
2009	—	`ed.`	Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009 Algorithmic Methods for Distributed Cooperative Systems Sándor P. Fekete, Stefan Fischer, Martin A. Riedmiller, Subhash Suri
2009	J	`jnl`	Catching elephants with mice: Sparse sampling for monitoring sensor networks. ACM Trans. Sens. Networks Sorabh Gandhi, Subhash Suri, Emo Welzl
2009	B	`ed.`	Distributed Computing in Sensor Systems, 5th IEEE International Conference, DCOSS 2009, Marina del Rey, CA, USA, June 8-10, 2009. Proceedings DCOSS Bhaskar Krishnamachari, Subhash Suri, Wendi Rabiner Heinzelman, Urbashi Mitra
2009	—	`conf`	GAMPS: compressing multi sensor data by grouping and amplitude scaling. SIGMOD Conference Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu
2009	—	`ch.`	Quantiles on Streams. Encyclopedia of Database Systems Chiranjeeb Buragohain, Subhash Suri
2009	B	`conf`	Reconstructing Visibility Graphs with Simple Robots. SIROCCO Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
2009	J	`jnl`	Target tracking with binary proximity sensors. ACM Trans. Sens. Networks Nisheeth Shrivastava, Raghuraman Mudumbai, Upamanyu Madhow, Subhash Suri
2009	J	`jnl`	Untangling the Braid: Finding Outliers in a Set of Streams CoRR Chiranjeeb Buragohain, Luca Foschini, Subhash Suri
2008	J	`jnl`	A game-theoretic analysis of wireless access point selection by mobile users. Comput. Commun. Kimaya Mittal, Elizabeth M. Belding, Subhash Suri
2008	J	`jnl`	Adaptive sampling for geometric problems over data streams. Comput. Geom. John Hershberger, Subhash Suri
2008	—	`conf`	Angle Optimization in Target Tracking. SWAT Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
2008	J	`jnl`	Bandwidth-Constrained Allocation in Grid Computing. Algorithmica Anshul Kothari, Subhash Suri, Yunhong Zhou
2008	J	`jnl`	Detecting cuts in sensor networks. ACM Trans. Sens. Networks Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth
2008	J	`jnl`	Formulating and implementing profiling over adaptive ranges. ACM Trans. Archit. Code Optim. Shashidhar Mysore, Banit Agrawal, Rodolfo Neuber, Timothy Sherwood, Nisheeth Shrivastava, Subhash Suri
2008	C	`conf`	Simple Robots in Polygonal Environments: A Hierarchy. ALGOSENSORS Jan Brunner, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
2008	J	`jnl`	Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry. Int. J. Robotics Res. Subhash Suri, Elias Vicari, Peter Widmayer
2008	—	`conf`	Simplified Planar Coresets for Data Streams. SWAT John Hershberger, Subhash Suri
2008	J	`jnl`	Summarizing spatial data streams using ClusterHulls. ACM J. Exp. Algorithmics John Hershberger, Nisheeth Shrivastava, Subhash Suri
2008	C	`conf`	Target Counting under Minimal Sensing: Complexity and Approximations. ALGOSENSORS Sorabh Gandhi, Rajesh Kumar, Subhash Suri
2008	J	`jnl`	Towards real-time dynamic spectrum auctions. Comput. Networks Sorabh Gandhi, Chiranjeeb Buragohain, Lili Cao, Haitao Zheng, Subhash Suri
2008	A*	`conf`	eBay in the Sky: strategy-proof wireless spectrum auctions. MobiCom Xia Zhou, Sorabh Gandhi, Subhash Suri, Haitao Zheng
2007	—	`conf`	07151 Abstracts Collection -- Geometry in Sensor Networks. Geometry in Sensor Networks Subhash Suri, Roger Wattenhofer, Peter Widmayer
2007	—	`conf`	Approximate isocontours and spatial summaries for sensor networks. IPSN Sorabh Gandhi, John Hershberger, Subhash Suri
2007	J	`jnl`	Attribute-based access to distributed data over P2P networks. Int. J. Comput. Sci. Eng. Divyakant Agrawal, Amr El Abbadi, Subhash Suri
2007	Misc	`conf`	Catching elephants with mice: sparse sampling for monitoring sensor networks. SenSys Sorabh Gandhi, Subhash Suri, Emo Welzl
2007	C	`conf`	Counting Targets with Mobile Sensors in an Unknown Environment. ALGOSENSORS Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
2007	J	`jnl`	Finding the ACM Trans. Algorithms John Hershberger, Matthew Maxel, Subhash Suri
2007	—	`ed.`	Geometry in Sensor Networks, 09.04. - 13.04.2007 Geometry in Sensor Networks Subhash Suri, Roger Wattenhofer, Peter Widmayer
2007	Misc	`conf`	Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks. COCOON Chiranjeeb Buragohain, Subhash Suri, Csaba D. Tóth, Yunhong Zhou
2007	J	`jnl`	On the difficulty of some shortest path problems. ACM Trans. Algorithms John Hershberger, Subhash Suri, Amit M. Bhosle
2007	J	`jnl`	Selfish Load Balancing and Atomic Congestion Games. Algorithmica Subhash Suri, Csaba D. Tóth, Yunhong Zhou
2007	A*	`conf`	Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry. AAAI Subhash Suri, Elias Vicari, Peter Widmayer
2007	A*	`conf`	Space Efficient Streaming Algorithms for the Maximum Error Histogram. ICDE Chiranjeeb Buragohain, Nisheeth Shrivastava, Subhash Suri
2007	—	`conf`	Tracking multiple targets using binary proximity sensors. IPSN Jaspreet Singh, Upamanyu Madhow, Rajesh Kumar, Subhash Suri, Richard E. Cagley
2006	J	`jnl`	Adaptive Spatial Partitioning for Multidimensional Data Streams. Algorithmica John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth
2006	A*	`conf`	Cluster Hull: A Technique for Summarizing Spatial Data Streams. ICDE John Hershberger, Nisheeth Shrivastava, Subhash Suri
2006	B	`conf`	Contour Approximation in Sensor Networks. DCOSS Chiranjeeb Buragohain, Sorabh Gandhi, John Hershberger, Subhash Suri
2006	A*	`conf`	Distributed Navigation Algorithms for Sensor Networks. INFOCOM Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri
2006	J	`jnl`	Fast packet classification for two-dimensional conflict-free filters. Comput. Networks Florin Baboescu, Priyank Ramesh Warkhede, Subhash Suri, George Varghese
2006	A	`conf`	Profiling over Adaptive Ranges. CGO Shashidhar Mysore, Banit Agrawal, Timothy Sherwood, Nisheeth Shrivastava, Subhash Suri
2006	J	`jnl`	Range Counting over Multidimensional Data Streams. Discret. Comput. Geom. Subhash Suri, Csaba D. Tóth, Yunhong Zhou
2006	B	`conf`	Search-quality Tradeoffs for Routing in Non-ideal Wireless Networks. SECON Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri
2006	J	`jnl`	Side constraints and non-price attributes in markets. Games Econ. Behav. Tuomas Sandholm, Subhash Suri
2006	A	`conf`	Summarizing Spatial Data Streams Using ClusterHulls. ALENEX John Hershberger, Nisheeth Shrivastava, Subhash Suri
2006	Misc	`conf`	Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms. SenSys Nisheeth Shrivastava, Raghuraman Mudumbai, Upamanyu Madhow, Subhash Suri
2005	J	`jnl`	A lower bound for multicast key distribution. Comput. Networks Jack Snoeyink, Subhash Suri, George Varghese
2005	J	`jnl`	Approximately-strategyproof and tractable multiunit auctions. Decis. Support Syst. Anshul Kothari, David C. Parkes, Subhash Suri
2005	—	`conf`	Attribute-Based Access to Distributed Data over P2P Networks. DNIS Divyakant Agrawal, Amr El Abbadi, Subhash Suri
2005	J	`jnl`	Binary Space Partitions of Orthogonal Subdivisions. SIAM J. Comput. John Hershberger, Subhash Suri, Csaba D. Tóth
2005	J	`jnl`	CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions. Manag. Sci. Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine
2005	—	`conf`	Detecting cuts in sensor networks. IPSN Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth
2005	J	`jnl`	Distributed Navigation Algorithms for Sensor Networks CoRR Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri
2005	Misc	`conf`	Interval Subset Sum and Uniform-Price Auction Clearing. COCOON Anshul Kothari, Subhash Suri, Yunhong Zhou
2005	A*	`conf`	Power aware routing for sensor databases. INFOCOM Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri
2005	J	`jnl`	Real-world environment models for mobile network evaluation. IEEE J. Sel. Areas Commun. Amit P. Jardosh, Elizabeth M. Belding-Royer, Kevin C. Almeroth, Subhash Suri
2005	A*	`conf`	Space complexity of hierarchical heavy hitters in multi-dimensional data streams. PODS John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth
2004	A*	`conf`	Adaptive Sampling for Geometric Problems over Data Streams. PODS John Hershberger, Subhash Suri
2004	B	`conf`	Adaptive Spatial Partitioning for Multidimensional Data Streams. ISAAC John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth
2004	—	`conf`	Binary space partitions of orthogonal subdivisions. SCG John Hershberger, Subhash Suri, Csaba D. Tóth
2004	—	`conf`	Congestion Games, Load Balancing, and Price of Anarchy. CAAN Anshul Kothari, Subhash Suri, Csaba D. Tóth, Yunhong Zhou
2004	J	`jnl`	Guest Editor's Foreword. Discret. Comput. Geom. Subhash Suri
2004	J	`jnl`	Medians and Beyond: New Aggregation Techniques for Sensor Networks CoRR Nisheeth Shrivastava, Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri
2004	Misc	`conf`	Medians and beyond: new aggregation techniques for sensor networks. SenSys Nisheeth Shrivastava, Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri
2004	J	`jnl`	Multiway range trees: scalable IP lookup with fast updates. Comput. Networks Priyank Ramesh Warkhede, Subhash Suri, George Varghese
2004	—	`ch.`	Polygons. Handbook of Discrete and Computational Geometry, 2nd Ed. Joseph O'Rourke, Subhash Suri
2004	J	`jnl`	Power Aware Routing for Sensor Databases CoRR Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri
2004	—	`conf`	Range counting over multidimensional data streams. SCG Subhash Suri, Csaba D. Tóth, Yunhong Zhou
2004	J	`jnl`	Routing bandwidth-guaranteed paths with restoration in label-switched networks . Comput. Networks Samphel Norden, Milind M. Buddhikot, Marcel Waldvogel, Subhash Suri
2004	B	`conf`	Selfish load balancing and atomic congestion games. SPAA Subhash Suri, Csaba D. Tóth, Yunhong Zhou
2004	A	`conf`	Solving Combinatorial Exchanges: Optimality via a Few Partial Bids. AAMAS Anshul Kothari, Tuomas Sandholm, Subhash Suri
2004	—	`conf`	Uncoordinated Load Balancing and Congestion Games in P2P Systems. IPTPS Subhash Suri, Csaba D. Tóth, Yunhong Zhou
2003	J	`jnl`	A Constant Bound for Geometric Permutations of Disjoint Unit Balls. Discret. Comput. Geom. Meir Katchalski, Subhash Suri, Yunhong Zhou
2003	J	`jnl`	A Game Theoretic Framework for Incentives in P2P Systems CoRR Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri
2003	—	`conf`	A Game Theoretic Framework for Incentives in P2P Systems. Peer-to-Peer Computing Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri
2003	A*	`conf`	Approximately-strategyproof and tractable multi-unit auctions. EC Anshul Kothari, David C. Parkes, Subhash Suri
2003	J	`jnl`	BOB: Improved winner determination in combinatorial auctions and generalizations. Artif. Intell. Tuomas Sandholm, Subhash Suri
2003	B	`conf`	Bandwidth-Constrained Allocation in Grid Computing. WADS Anshul Kothari, Subhash Suri, Yunhong Zhou
2003	A*	`conf`	Binary space partitions for 3D subdivisions. SODA John Hershberger, Subhash Suri
2003	J	`jnl`	Compressing Two-Dimensional Routing Tables. Algorithmica Subhash Suri, Tuomas Sandholm, Priyank Ramesh Warkhede
2003	A	`conf`	Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation. ALENEX John Hershberger, Matthew Maxel, Subhash Suri
2003	J	`jnl`	Geometric permutations of balls with bounded size disparity. Comput. Geom. Yunhong Zhou, Subhash Suri
2003	A	`conf`	On the Difficulty of Some Shortest Path Problems. STACS John Hershberger, Subhash Suri, Amit M. Bhosle
2003	J	`jnl`	Profile-based routing and traffic engineering. Comput. Commun. Subhash Suri, Marcel Waldvogel, Daniel Bauer, Priyank Ramesh Warkhede
2003	—	`conf`	Range Addressable Network: A P2P Cache Architecture for Data Ranges. Peer-to-Peer Computing Anshul Kothari, Divyakant Agrawal, Abhishek Gupta, Subhash Suri
2003	A*	`conf`	Solving combinatorial exchanges: optimality via a few partial bids. EC Anshul Kothari, Tuomas Sandholm, Subhash Suri
2003	A*	`conf`	Towards realistic mobility models for mobile ad hoc networks. MobiCom Amit P. Jardosh, Elizabeth M. Belding-Royer, Kevin C. Almeroth, Subhash Suri
2002	J	`jnl`	Algorithmic issues in modeling motion. ACM Comput. Surv. Pankaj K. Agarwal, Leonidas J. Guibas, Herbert Edelsbrunner, Jeff Erickson, Michael Isard, Sariel Har-Peled, John Hershberger, Christian S. Jensen, Lydia E. Kavraki, Patrice Koehl, Ming C. Lin, Dinesh Manocha, Dimitris N. Metaxas, Brian Mirtich, David M. Mount, S. Muthukrishnan, Dinesh K. Pai, Elisha Sacks, Jack Snoeyink, Subhash Suri, Ouri Wolfson
2002	J	`jnl`	Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions. SIAM J. Comput. Yunhong Zhou, Subhash Suri
2002	J	`jnl`	Curvature-Constrained Shortest Paths in a Convex Polygon. SIAM J. Comput. Pankaj K. Agarwal, Therese Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides
2002	A*	`conf`	Erratum to "Vickrey Pricing and Shortest Paths: What is an Edge Worth?". FOCS John Hershberger, Subhash Suri
2002	B	`conf`	Market Clearing with Supply and Demand Curves. ISAAC Tuomas Sandholm, Subhash Suri
2002	—	`ed.`	Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, Spain, June 5-7, 2002 SCG Ferran Hurtado, Vera Sacristán, Chandrajit Bajaj, Subhash Suri
2002	J	`jnl`	Silo, rainbow, and caching token: schemes for scalable, fault tolerant stream caching. IEEE J. Sel. Areas Commun. Youngsu Chae, Katherine Guo, Milind M. Buddhikot, Subhash Suri, Ellen W. Zegura
2002	A	`conf`	Winner determination in combinatorial auction generalizations. AAMAS Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine
2001	A*	`conf`	A Lower Bound for Multicast Key Distribution. INFOCOM Jack Snoeyink, Subhash Suri, George Varghese
2001	A*	`conf`	CABOB: A Fast Optimal Algorithm for Combinatorial Auctions. IJCAI Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine
2001	B	`conf`	Fast Firewall Implementations for Software and Hardware-Based Routers. ICNP Lili Qiu, George Varghese, Subhash Suri
2001	A*	`conf`	Fast Packet Classification for Two-Dimensional Conflict-Free Filters. INFOCOM Priyank Ramesh Warkhede, Subhash Suri, George Varghese
2001	—	`conf`	Fast firewall implementations for software-based and hardware-based routers. SIGMETRICS/Performance Lili Qiu, George Varghese, Subhash Suri
2001	—	`conf`	Geometric permutations of balls with bounded size disparity. CCCG Yunhong Zhou, Subhash Suri
2001	J	`jnl`	Kinetic Connectivity for Unit Disks. Discret. Comput. Geom. Leonidas J. Guibas, John Hershberger, Subhash Suri, Li Zhang
2001	A*	`conf`	Market Clearability. IJCAI Tuomas Sandholm, Subhash Suri
2001	B	`conf`	Multiway range trees: scalable IP lookup with fast updates. GLOBECOM Subhash Suri, George Varghese, Priyank Ramesh Warkhede
2001	—	`conf`	Profile-Based Routing: A New Framework for MPLS Traffic Engineering. QofIS Subhash Suri, Marcel Waldvogel, Priyank Ramesh Warkhede
2001	B	`conf`	Routing Bandwidth Guaranteed Paths with Restoration in Label Switched Networks. ICNP Samphel Norden, Milind M. Buddhikot, Marcel Waldvogel, Subhash Suri
2001	A*	`conf`	Shape sensitive geometric permutations. SODA Yunhong Zhou, Subhash Suri
2001	A*	`conf`	Simplified kinetic connectivity for rectangles and hypercubes. SODA John Hershberger, Subhash Suri
2001	A*	`conf`	Vickrey Prices and Shortest Paths: What is an Edge Worth?. FOCS John Hershberger, Subhash Suri
2000	A*	`conf`	Algorithms for minimum volume enclosing simplex in R SODA Yunhong Zhou, Subhash Suri
2000	A	`conf`	Collision Detection Using Bounding Boxes: Convexity Helps. ESA Yunhong Zhou, Subhash Suri
2000	A*	`conf`	Detecting and Resolving Packet Filter Conflicts. INFOCOM Hari Adiseshu, Subhash Suri, Guru M. Parulkar
2000	—	`conf`	Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations. AAAI/IAAI Tuomas Sandholm, Subhash Suri
2000	—	`conf`	Kinetic connectivity for unit disks. SCG Leonidas J. Guibas, John Hershberger, Subhash Suri, Li Zhang
2000	J	`jnl`	Morphing Simple Polygons. Discret. Comput. Geom. Leonidas J. Guibas, John Hershberger, Subhash Suri
2000	J	`jnl`	Online Scheduling with Hard Deadlines. J. Algorithms Sally A. Goldman, Jyoti Parwatikar, Subhash Suri
2000	—	`conf`	Optimal Flow Aggregation. SWAT Subhash Suri, Tuomas Sandholm, Priyank Ramesh Warkhede
2000	J	`jnl`	Rectangular Tiling in Multidimensional Arrays. J. Algorithms Adam Smith, Subhash Suri
1999	J	`jnl`	An Optimal Algorithm for Euclidean Shortest Paths in the Plane. SIAM J. Comput. John Hershberger, Subhash Suri
1999	A*	`conf`	Analysis of a Bounding Box Heuristic for Object Intersection. SODA Yunhong Zhou, Subhash Suri
1999	J	`jnl`	Analysis of a bounding box heuristic for object intersection. J. ACM Yunhong Zhou, Subhash Suri
1999	J	`jnl`	Analyzing bounding boxes for object intersection. ACM Trans. Graph. Subhash Suri, Philip M. Hubbard, John F. Hughes
1999	—	`conf`	Kinetic Connectivity of Rectangles. SCG John Hershberger, Subhash Suri
1999	A*	`conf`	Packet Classification Using Tuple Space Search. SIGCOMM Venkatachary Srinivasan, Subhash Suri, George Varghese
1999	A*	`conf`	Packet Filtering in High Speed Networks. SODA Subhash Suri, George Varghese
1999	A*	`conf`	Rectangular Tiling in Multi-dimensional Arrays. SODA Adam Smith, Subhash Suri
1999	—	`conf`	Space Decomposition Techniques for Fast Layer-4 Switching. Protocols for High-Speed Networks Milind M. Buddhikot, Subhash Suri, Marcel Waldvogel
1998	A*	`conf`	Collision Detection in Aspect and Scale Bounded Polyhedra. SODA Subhash Suri, Philip M. Hubbard, John F. Hughes
1998	—	`conf`	Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract). SCG Pankaj K. Agarwal, Therese Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides
1998	A*	`conf`	Fast and Scalable Layer Four Switching. SIGCOMM Venkatachary Srinivasan, George Varghese, Subhash Suri, Marcel Waldvogel
1998	J	`jnl`	Label placement by maximum independent set in rectangles. Comput. Geom. Pankaj K. Agarwal, Marc J. van Kreveld, Subhash Suri
1998	J	`jnl`	Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. J. ACM Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki
1998	J	`jnl`	Practical methods for approximating shortest paths on a convex polytope in R3. Comput. Geom. John Hershberger, Subhash Suri
1998	J	`jnl`	Surface Approximation and Geometric Partitions. SIAM J. Comput. Pankaj K. Agarwal, Subhash Suri
1997	J	`jnl`	Designing Least-Cost Nonblocking Broadband Networks. J. Algorithms J. Andrew Fingerhut, Subhash Suri, Jonathan S. Turner
1997	B	`conf`	Efficient Breakout Routing in Printed Circuit Boards (Extended Abstract). WADS John Hershberger, Subhash Suri
1997	—	`conf`	Efficient Breakout Routing in Printed Circuit Boards. SCG John Hershberger, Subhash Suri
1997	J	`jnl`	Finding a Shortest Diagonal of a Simple Polygon in Linear Time. Comput. Geom. John Hershberger, Subhash Suri
1997	—	`conf`	Label placement by maximum independent set in rectangles. CCCG Pankaj K. Agarwal, Marc J. van Kreveld, Subhash Suri
1997	A*	`conf`	Leap Forward Virtual Clock: A New Fair Queueing Scheme with Guaranteed Delays and Throughput Fairness. INFOCOM Subhash Suri, George Varghese, Girish P. Chandranmenon
1997	A*	`conf`	Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delays and Throughput Fairness. PODC Subhash Suri, George Varghese, Girish P. Chandranmenon
1997	J	`jnl`	Matrix Searching with the Shortest-Path Metric. SIAM J. Comput. John Hershberger, Subhash Suri
1997	B	`conf`	On-line Scheduling with Hard Deadlines (Extended Abstract). WADS Sally A. Goldman, Jyoti Parwatikar, Subhash Suri
1997	J	`jnl`	Query-Sensitive Ray Shooting. Int. J. Comput. Geom. Appl. Joseph S. B. Mitchell, David M. Mount, Subhash Suri
1996	B	`ed.`	Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings ISAAC Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri
1996	A*	`conf`	Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. STOC Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki
1996	J	`jnl`	Off-Line Maintenance of Planar Configurations. J. Algorithms John Hershberger, Subhash Suri
1996	J	`jnl`	Simple and Practical Geometric Algorithms. ACM Comput. Surv. Pankaj K. Agarwal, Subhash Suri
1995	J	`jnl`	A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk. J. Algorithms John Hershberger, Subhash Suri
1995	J	`jnl`	Logarithmic-time link path queries in a simple polygon. Int. J. Comput. Geom. Appl. Esther M. Arkin, Joseph S. B. Mitchell, Subhash Suri
1995	J	`jnl`	Long Non-Crossing Configurations in the Plane. Fundam. Informaticae Noga Alon, Sridhar Rajagopalan, Subhash Suri
1995	A*	`conf`	Morphing Binary Trees. SODA John Hershberger, Subhash Suri
1995	A*	`conf`	Practical Methods for Approximating Shortest Paths on a Convex Polytope in R SODA John Hershberger, Subhash Suri
1995	J	`jnl`	Separation and Approximation of Polyhedral Objects. Comput. Geom. Joseph S. B. Mitchell, Subhash Suri
1995	—	`conf`	Stabbing Triangulations by Lines in 3D. SCG Pankaj K. Agarwal, Boris Aronov, Subhash Suri
1995	A	`conf`	The Centroid of Points with Approximate Weights. ESA Marshall W. Bern, David Eppstein, Leonidas J. Guibas, John Hershberger, Subhash Suri, Jan Wolter
1994	A*	`conf`	A Comparative Evaluation of Space Priority Strategies in ATM Networks. INFOCOM Subhash Suri, David Tipper, Gopal Meempat
1994	J	`jnl`	Can Visibility Graphs Be Represented Compactly?. Discret. Comput. Geom. Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri
1994	J	`jnl`	Data Structures for Two-Edge Connectivity in Planar Graphs. Theor. Comput. Sci. John Hershberger, Monika Rauch, Subhash Suri
1994	—	`conf`	Query-Sensitive Ray Shooting. SCG Joseph S. B. Mitchell, David M. Mount, Subhash Suri
1994	A*	`conf`	Surface Approximation and Geometric Partitions. SODA Pankaj K. Agarwal, Subhash Suri
1993	A*	`conf`	A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk. SODA John Hershberger, Subhash Suri
1993	—	`conf`	Can Visibility Graphs be Represented Compactly? SCG Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri
1993	J	`jnl`	Computing the Intersection-Depth of Polyhedra. Algorithmica David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri
1993	A*	`conf`	Efficient Computation of Euclidean Shortest Paths in the Plane FOCS John Hershberger, Subhash Suri
1993	—	`conf`	Long Non-Crossing Configurations in the Plane. SCG Noga Alon, Sridhar Rajagopalan, Subhash Suri
1993	A*	`conf`	Matrix searching with the shortest path metric. STOC John Hershberger, Subhash Suri
1993	J	`jnl`	Selecting Distances in the Plane. Algorithmica Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri
1992	J	`jnl`	Applications of a Semi-Dynamic Convex Hull Algorithm. BIT John Hershberger, Subhash Suri
1992	—	`conf`	Fully Dynamic 2-Edge-Connectivity in Planar Graphs. SWAT John Hershberger, Monika Rauch, Subhash Suri
1992	A*	`conf`	Optimal Link Path Queries in a Simple Polygon. SODA Esther M. Arkin, Joseph S. B. Mitchell, Subhash Suri
1992	A*	`conf`	Separation and Approximation of Polyhedral Objects. SODA Joseph S. B. Mitchell, Subhash Suri
1992	J	`jnl`	Transitions in Geometric Minimum Spanning Trees. Discret. Comput. Geom. Clyde L. Monma, Subhash Suri
1991	J	`jnl`	Computing external farthest neighbors for a simple polygon. Discret. Appl. Math. Pankaj K. Agarwal, Alok Aggarwal, Boris Aronov, S. Rao Kosaraju, Baruch Schieber, Subhash Suri
1991	J	`jnl`	Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions. Comput. Geom. Pankaj K. Agarwal, Jirí Matousek, Subhash Suri
1991	B	`conf`	Farthest Neighbours, Maximum Spanning Trees and Related Problems in Higher Dimensions. WADS Pankaj K. Agarwal, Jirí Matousek, Subhash Suri
1991	J	`jnl`	Fast Matching Algorithms for Points on a Polygon. SIAM J. Comput. Odile Marcotte, Subhash Suri
1991	J	`jnl`	Finding Tailored Partitions. J. Algorithms John Hershberger, Subhash Suri
1991	J	`jnl`	Finding k Points with Minimum Diameter and Related Problems. J. Algorithms Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri
1991	J	`jnl`	Maintenance of Geometric Extrema. J. ACM David P. Dobkin, Subhash Suri
1991	A*	`conf`	Offline Maintenance of Planar Configurations. SODA John Hershberger, Subhash Suri
1991	—	`conf`	Transitions in Geometric Minimum Spanning Trees (Extended Abstract). SCG Clyde L. Monma, Subhash Suri
1990	J	`jnl`	An Optimal Algorithm for Detecting Weak Visibility of a Polygon. IEEE Trans. Computers Jörg-Rüdiger Sack, Subhash Suri
1990	—	`conf`	Applications of a Semi-Dynamic Convex Hull Algorithm. SWAT John Hershberger, Subhash Suri
1990	J	`jnl`	Computing Euclidean Maximum Spanning Trees. Algorithmica Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao
1990	J	`jnl`	Computing the Longest Diagonal of a Simple Polygon. Inf. Process. Lett. Alok Aggarwal, Subhash Suri
1990	—	`conf`	Implicitly Searching Convolutions and Computing Depth of Collision. SIGAL International Symposium on Algorithms David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri
1990	J	`jnl`	On some link distance problems in a simple polygon. IEEE Trans. Robotics Autom. Subhash Suri
1990	—	`conf`	Selecting Distances in the Plane. SCG Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri
1989	J	`jnl`	Computing Geodesic Furthest Neighbors in Simple Polygons. J. Comput. Syst. Sci. Subhash Suri
1989	B	`conf`	Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version). WADS Alok Aggarwal, Shlomo Moran, Peter W. Shor, Subhash Suri
1989	A*	`conf`	Dynamically Computing the Maxima of Decomposable Functions, with Applications FOCS David P. Dobkin, Subhash Suri
1989	A*	`conf`	Fast Matching Algorithms for Points on a Polygon (Extended Abstract) FOCS Odile Marcotte, Subhash Suri
1989	J	`jnl`	Finding Minimal Convex Nested Polygons Inf. Comput. Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap
1989	—	`conf`	Finding Tailored Partitions. SCG John Hershberger, Subhash Suri
1989	—	`conf`	Fining SCG Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri
1989	—	`conf`	On Geometric Matching. SCG Odile Marcotte, Subhash Suri
1988	A	`conf`	An Optimal Algorithm for Detecting Weak Visibility of a Polygon (Preliminary Version). STACS Jörg-Rüdiger Sack, Subhash Suri
1988	—	`conf`	Computing Euclidean Maximum Spanning Trees. SCG Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao
1988	J	`jnl`	Computing the Link Center of a Simple Polygon. Discret. Comput. Geom. William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap
1987	—	`conf`	Computing the Link Center of a Simple Polygon. SCG William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap
1987	—	`conf`	Fast Algorithms for Computing the Largest Empty Rectangle. SCG Alok Aggarwal, Subhash Suri
1987	—	`conf`	The All-Geodesic-Furthest Neighbor Problem for Simple Polygons. SCG Subhash Suri
1986	—	`conf`	Worst-Case Optimal Algorithms for Constructing Visibility Polygons with Holes. SCG Subhash Suri, Joseph O'Rourke
1985	—	`conf`	Finding minimal convex nested polygons. SCG Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap
1985	A	`conf`	Shortest Paths on Polyhedral Surfaces. STACS Joseph O'Rourke, Subhash Suri, Heather Booth