2012
217Catch Me If You Can: Pursuit and Capture in Polygonal Environments with Obstacles. Kyle Klein, Subhash Suri. AAAI 2012. Web SearchBibTeXDownload
216Geometric Computing over Uncertain Data. Subhash Suri. ALGOSENSORS 2012, 4-5. Web SearchBibTeXDownload
215Memory Efficient De Bruijn Graph Construction. Yang Li, Pegah Kamousi, Fangqiu Han, Shengqi Yang, Xifeng Yan, Subhash Suri. CoRR (abs/1207.3532) (2012). Web SearchBibTeXDownload
214Capturing an evader in polygonal environments with obstacles: The full visibility case. Deepak Bhadauria, Kyle Klein, Volkan Isler, Subhash Suri. I. J. Robotic Res. (31): 1176-1189 (2012). Web SearchBibTeXDownload
213Conflict-free Chromatic Art Gallery Coverage. Andreas Bärtschi, Subhash Suri. STACS 2012, 160-171. Web SearchBibTeXDownload
212On Klee's measure problem for grounded boxes. Hakan Yildiz, Subhash Suri. Symposium on Computational Geometry 2012, 111-120. Web SearchBibTeXDownload
211Reconstructing visibility graphs with simple robots. Davide Bilň, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer. Theor. Comput. Sci. (444): 52-59 (2012). Web SearchBibTeXDownload
2011
210Complete Information Pursuit Evasion in Polygonal Environments. Kyle Klein, Subhash Suri. AAAI 2011. Web SearchBibTeXDownload
209Stochastic Minimum Spanning Trees and Related Problems. Pegah Kamousi, Subhash Suri. ANALCO 2011, 107-116. Web SearchBibTeXDownload
208A Discrete and Dynamic Version of Klee's Measure Problem. Hakan Yildiz, John Hershberger, Subhash Suri. CCCG 2011. Web SearchBibTeXDownload
207Capturing an Evader in Polygonal Environments: A Complete Information Game. Kyle Klein, Subhash Suri. CoRR (abs/1110.4838) (2011). Web SearchBibTeXDownload
206k-Capture in Multiagent Pursuit Evasion, or the Lion and the Hyenas. Shaunak Dattaprasad Bopardikar, Subhash Suri. CoRR (abs/1108.1561) (2011). Web SearchBibTeXDownload
205The Union of Probabilistic Boxes: Maintaining the Volume. Hakan Yildiz, Luca Foschini, John Hershberger, Subhash Suri. ESA 2011, 591-602. Web SearchBibTeXDownload
204On the Complexity of Time-Dependent Shortest Paths. Luca Foschini, John Hershberger, Subhash Suri. SODA 2011, 327-341. Web SearchBibTeXDownload
203Stochastic minimum spanning trees in euclidean spaces. Pegah Kamousi, Timothy M. Chan, Subhash Suri. Symposium on Computational Geometry 2011, 65-74. Web SearchBibTeXDownload
202Multiple-Target Tracking With Binary Proximity Sensors. Jaspreet Singh, Rajesh Kumar, Upamanyu Madhow, Subhash Suri, Richard E. Cagley. TOSN (8): 5 (2011). Web SearchBibTeXDownload
201Closest Pair and the Post Office Problem for Stochastic Points. Pegah Kamousi, Timothy M. Chan, Subhash Suri. WADS 2011, 548-559. Web SearchBibTeXDownload
2010
200Untangling the Braid: Finding Outliers in a Set of Streams. Chiranjeeb Buragohain, Luca Foschini, Subhash Suri. ALENEX 2010, 159-172. Web SearchBibTeXDownload
199Robot kabaddi. Kyle Klein, Subhash Suri. CCCG 2010, 79-82. Web SearchBibTeXDownload
198Space-efficient online approximation of time series data: Streams, amnesia, and out-of-order. Sorabh Gandhi, Luca Foschini, Subhash Suri. ICDE 2010, 924-935. Web SearchBibTeXDownload
197Multiagent Pursuit Evasion, or Playing Kabaddi. Kyle Klein, Subhash Suri. WAFR 2010, 89-104. Web SearchBibTeXDownload
2009
196Untangling the Braid: Finding Outliers in a Set of Streams. Chiranjeeb Buragohain, Luca Foschini, Subhash Suri. CoRR (abs/0907.2951) (2009). Web SearchBibTeXDownload
195Quantiles on Streams. Chiranjeeb Buragohain, Subhash Suri. Encyclopedia of Database Systems 2009, 2235-2240. Web SearchBibTeXDownload
194GAMPS: compressing multi sensor data by grouping and amplitude scaling. Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu. SIGMOD Conference 2009, 771-784. Web SearchBibTeXDownload
193Reconstructing Visibility Graphs with Simple Robots. Davide Bilň, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer. SIROCCO 2009, 87-99. Web SearchBibTeXDownload
192Catching elephants with mice: Sparse sampling for monitoring sensor networks. Sorabh Gandhi, Subhash Suri, Emo Welzl. TOSN (6) (2009). Web SearchBibTeXDownload
191Target tracking with binary proximity sensors. Nisheeth Shrivastava, Raghuraman Mudumbai, Upamanyu Madhow, Subhash Suri. TOSN (5) (2009). Web SearchBibTeXDownload
2008
190Summarizing spatial data streams using ClusterHulls. John Hershberger, Nisheeth Shrivastava, Subhash Suri. ACM Journal of Experimental Algorithmics (13) (2008). Web SearchBibTeXDownload
189Bandwidth-Constrained Allocation in Grid Computing. Anshul Kothari, Subhash Suri, Yunhong Zhou. Algorithmica (52): 487-501 (2008). Web SearchBibTeXDownload
188Simple Robots in Polygonal Environments: A Hierarchy. Jan Brunner, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer. ALGOSENSORS 2008, 111-124. Web SearchBibTeXDownload
187Target Counting under Minimal Sensing: Complexity and Approximations. Sorabh Gandhi, Rajesh Kumar, Subhash Suri. ALGOSENSORS 2008, 30-42. Web SearchBibTeXDownload
186A game-theoretic analysis of wireless access point selection by mobile users. Kimaya Mittal, Elizabeth M. Belding, Subhash Suri. Computer Communications (31): 2049-2062 (2008). Web SearchBibTeXDownload
185Towards real-time dynamic spectrum auctions. Sorabh Gandhi, Chiranjeeb Buragohain, Lili Cao, Haitao Zheng, Subhash Suri. Computer Networks (52): 879-897 (2008). Web SearchBibTeXDownload
184Adaptive sampling for geometric problems over data streams. John Hershberger, Subhash Suri. Comput. Geom. (39): 191-208 (2008). Web SearchBibTeXDownload
183Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry. Subhash Suri, Elias Vicari, Peter Widmayer. I. J. Robotic Res. (27): 1055-1067 (2008). Web SearchBibTeXDownload
182eBay in the Sky: strategy-proof wireless spectrum auctions. Xia Zhou, Sorabh Gandhi, Subhash Suri, Haitao Zheng. MOBICOM 2008, 2-13. Web SearchBibTeXDownload
181Angle Optimization in Target Tracking. Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer. SWAT 2008, 65-76. Web SearchBibTeXDownload
180Simplified Planar Coresets for Data Streams. John Hershberger, Subhash Suri. SWAT 2008, 5-16. Web SearchBibTeXDownload
179Formulating and implementing profiling over adaptive ranges. Shashidhar Mysore, Banit Agrawal, Rodolfo Neuber, Timothy Sherwood, Nisheeth Shrivastava, Subhash Suri. TACO (5) (2008). Web SearchBibTeXDownload
178Detecting cuts in sensor networks. Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth. TOSN (4) (2008). Web SearchBibTeXDownload
2007
177Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry. Subhash Suri, Elias Vicari, Peter Widmayer. AAAI 2007, 1114-1120. Web SearchBibTeXDownload
176On the difficulty of some shortest path problems. John Hershberger, Subhash Suri, Amit M. Bhosle. ACM Transactions on Algorithms (3) (2007). Web SearchBibTeXDownload
175Finding the k shortest simple paths: A new algorithm and its implementation. John Hershberger, Matthew Maxel, Subhash Suri. ACM Transactions on Algorithms (3) (2007). Web SearchBibTeXDownload
174Selfish Load Balancing and Atomic Congestion Games. Subhash Suri, Csaba D. Tóth, Yunhong Zhou. Algorithmica (47): 79-96 (2007). Web SearchBibTeXDownload
173Counting Targets with Mobile Sensors in an Unknown Environment. Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer. ALGOSENSORS 2007, 32-45. Web SearchBibTeXDownload
172Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks. Chiranjeeb Buragohain, Subhash Suri, Csaba D. Tóth, Yunhong Zhou. COCOON 2007, 210-221. Web SearchBibTeXDownload
17107151 Abstracts Collection -- Geometry in Sensor Networks. Subhash Suri, Roger Wattenhofer, Peter Widmayer. Geometry in Sensor Networks 2007. Web SearchBibTeXDownload
170Space Efficient Streaming Algorithms for the Maximum Error Histogram. Chiranjeeb Buragohain, Nisheeth Shrivastava, Subhash Suri. ICDE 2007, 1026-1035. Web SearchBibTeXDownload
169Attribute-based access to distributed data over P2P networks. Divyakant Agrawal, Amr El Abbadi, Subhash Suri. IJCSE (3): 112-123 (2007). Web SearchBibTeXDownload
168Tracking multiple targets using binary proximity sensors. Jaspreet Singh, Upamanyu Madhow, Rajesh Kumar, Subhash Suri, Richard E. Cagley. IPSN 2007, 529-538. Web SearchBibTeXDownload
167Approximate isocontours and spatial summaries for sensor networks. Sorabh Gandhi, John Hershberger, Subhash Suri. IPSN 2007, 400-409. Web SearchBibTeXDownload
166Catching elephants with mice: sparse sampling for monitoring sensor networks. Sorabh Gandhi, Subhash Suri, Emo Welzl. SenSys 2007, 261-274. Web SearchBibTeXDownload
2006
165Summarizing Spatial Data Streams Using ClusterHulls. John Hershberger, Nisheeth Shrivastava, Subhash Suri. ALENEX 2006, 26-40. Web SearchBibTeXDownload
164Adaptive Spatial Partitioning for Multidimensional Data Streams. John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth. Algorithmica (46): 97-117 (2006). Web SearchBibTeXDownload
163Profiling over Adaptive Ranges. Shashidhar Mysore, Banit Agrawal, Timothy Sherwood, Nisheeth Shrivastava, Subhash Suri. CGO 2006, 147-158. Web SearchBibTeXDownload
162Fast packet classification for two-dimensional conflict-free filters. Florin Baboescu, Priyank Ramesh Warkhede, Subhash Suri, George Varghese. Computer Networks (50): 1831-1842 (2006). Web SearchBibTeXDownload
161Contour Approximation in Sensor Networks. Chiranjeeb Buragohain, Sorabh Gandhi, John Hershberger, Subhash Suri. DCOSS 2006, 356-371. Web SearchBibTeXDownload
160Range Counting over Multidimensional Data Streams. Subhash Suri, Csaba D. Tóth, Yunhong Zhou. Discrete & Computational Geometry (36): 633-655 (2006). Web SearchBibTeXDownload
159Side constraints and non-price attributes in markets. Tuomas Sandholm, Subhash Suri. Games and Economic Behavior (55): 321-330 (2006). Web SearchBibTeXDownload
158Cluster Hull: A Technique for Summarizing Spatial Data Streams. John Hershberger, Nisheeth Shrivastava, Subhash Suri. ICDE 2006, 138. Web SearchBibTeXDownload
157Distributed Navigation Algorithms for Sensor Networks. Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri. INFOCOM 2006. Cited by 16Web SearchBibTeXDownload
156Search-quality Tradeoffs for Routing in Non-ideal Wireless Networks. Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri. SECON 2006, 10-19. Web SearchBibTeXDownload
155Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms. Nisheeth Shrivastava, Raghuraman Mudumbai, Upamanyu Madhow, Subhash Suri. SenSys 2006, 251-264. Web SearchBibTeXDownload
2005
154Interval Subset Sum and Uniform-Price Auction Clearing. Anshul Kothari, Subhash Suri, Yunhong Zhou. COCOON 2005, 608-620. Web SearchBibTeXDownload
153A lower bound for multicast key distribution. Jack Snoeyink, Subhash Suri, George Varghese. Computer Networks (47): 429-441 (2005). Web SearchBibTeXDownload
152Distributed Navigation Algorithms for Sensor Networks. Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri. CoRR (abs/cs/0512060) (2005). Cited by 16Web SearchBibTeXDownload
151Approximately-strategyproof and tractable multiunit auctions. Anshul Kothari, David C. Parkes, Subhash Suri. Decision Support Systems (39): 105-121 (2005). Web SearchBibTeXDownload
150Attribute-Based Access to Distributed Data over P2P Networks. Divyakant Agrawal, Amr El Abbadi, Subhash Suri. DNIS 2005, 244-263. Cited by 6Web SearchBibTeXDownload
149Real-world environment models for mobile network evaluation. Amit P. Jardosh, Elizabeth M. Belding-Royer, Kevin C. Almeroth, Subhash Suri. IEEE Journal on Selected Areas in Communications (23): 622-632 (2005). Web SearchBibTeXDownload
148Power aware routing for sensor databases. Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri. INFOCOM 2005, 1747-1757. Cited by 28Web SearchBibTeXDownload
147Detecting cuts in sensor networks. Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth. IPSN 2005, 210-217. Web SearchBibTeXDownload
146CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions. Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine. Management Science (51): 374-390 (2005). Web SearchBibTeXDownload
145Space complexity of hierarchical heavy hitters in multi-dimensional data streams. John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth. PODS 2005, 338-347. Web SearchBibTeXDownload
144Binary Space Partitions of Orthogonal Subdivisions. John Hershberger, Subhash Suri, Csaba D. Tóth. SIAM J. Comput. (34): 1380-1397 (2005). Web SearchBibTeXDownload
2004
143Solving Combinatorial Exchanges: Optimality via a Few Partial Bids. Anshul Kothari, Tuomas Sandholm, Subhash Suri. AAMAS 2004, 1418-1419. Web SearchBibTeXDownload
142Congestion Games, Load Balancing, and Price of Anarchy. Anshul Kothari, Subhash Suri, Csaba D. Tóth, Yunhong Zhou. CAAN 2004, 13-27. Web SearchBibTeXDownload
141Routing bandwidth-guaranteed paths with restoration in label-switched networks . Samphel Norden, Milind M. Buddhikot, Marcel Waldvogel, Subhash Suri. Computer Networks (46): 197-218 (2004). Web SearchBibTeXDownload
140Multiway range trees: scalable IP lookup with fast updates. Priyank Ramesh Warkhede, Subhash Suri, George Varghese. Computer Networks (44): 289-303 (2004). Web SearchBibTeXDownload
139Medians and Beyond: New Aggregation Techniques for Sensor Networks. Nisheeth Shrivastava, Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri. CoRR (cs.DC/0408039) (2004). Web SearchBibTeXDownload
138Power Aware Routing for Sensor Databases. Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri. CoRR (abs/cs/0412118) (2004). Web SearchBibTeXDownload
137Guest Editor's Foreword. Sandip Das, Emden R. Gansner, Joe Kilian, Jon M. Kleinberg. Discrete & Computational Geometry (31): 1 (2004). Web SearchBibTeXDownload
136Uncoordinated Load Balancing and Congestion Games in P2P Systems. Subhash Suri, Csaba D. Tóth, Yunhong Zhou. IPTPS 2004, 123-130. Web SearchBibTeXDownload
135Adaptive Spatial Partitioning for Multidimensional Data Streams. John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth. ISAAC 2004, 522-533. Web SearchBibTeXDownload
134Adaptive Sampling for Geometric Problems over Data Streams. John Hershberger, Subhash Suri. PODS 2004, 252-262. Web SearchBibTeXDownload
133Medians and beyond: new aggregation techniques for sensor networks. Nisheeth Shrivastava, Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri. SenSys 2004, 239-249. Cited by 204Web SearchBibTeXDownload
132Selfish load balancing and atomic congestion games. Subhash Suri, Csaba D. Tóth, Yunhong Zhou. SPAA 2004, 188-195. Web SearchBibTeXDownload
131Binary space partitions of orthogonal subdivisions. John Hershberger, Subhash Suri, Csaba D. Tóth. Symposium on Computational Geometry 2004, 230-238. Web SearchBibTeXDownload
130Range counting over multidimensional data streams. Subhash Suri, Csaba D. Tóth, Yunhong Zhou. Symposium on Computational Geometry 2004, 160-169. Web SearchBibTeXDownload
2003
129Solving combinatorial exchanges: optimality via a few partial bids. Anshul Kothari, Tuomas Sandholm, Subhash Suri. ACM Conference on Electronic Commerce 2003, 236-237. Web SearchBibTeXDownload
128Approximately-strategyproof and tractable multi-unit auctions. Anshul Kothari, David C. Parkes, Subhash Suri. ACM Conference on Electronic Commerce 2003, 166-175. Web SearchBibTeXDownload
127Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation. John Hershberger, Matthew Maxel, Subhash Suri. ALENEX 2003, 26-36. Web SearchBibTeX
126Compressing Two-Dimensional Routing Tables. Subhash Suri, Tuomas Sandholm, Priyank Ramesh Warkhede. Algorithmica (35): 287-300 (2003). Web SearchBibTeXDownload
125BOB: Improved winner determination in combinatorial auctions and generalizations. Tuomas Sandholm, Subhash Suri. Artif. Intell. (145): 33-58 (2003). Web SearchBibTeXDownload
124Profile-based routing and traffic engineering. Subhash Suri, Marcel Waldvogel, Daniel Bauer, Priyank Ramesh Warkhede. Computer Communications (26): 351-365 (2003). Web SearchBibTeXDownload
123Geometric permutations of balls with bounded size disparity. Yunhong Zhou, Subhash Suri. Comput. Geom. (26): 3-20 (2003). Web SearchBibTeXDownload
122A Constant Bound for Geometric Permutations of Disjoint Unit Balls. Meir Katchalski, Subhash Suri, Yunhong Zhou. Discrete & Computational Geometry (29): 161-173 (2003). Web SearchBibTeXDownload
121Towards realistic mobility models for mobile ad hoc networks. Amit P. Jardosh, Elizabeth M. Belding-Royer, Kevin C. Almeroth, Subhash Suri. MOBICOM 2003, 217-229. Web SearchBibTeXDownload
120A Game Theoretic Framework for Incentives in P2P Systems. Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri. Peer-to-Peer Computing (cs.GT/0310039): 48-56 (2003). Cited by 184Web SearchBibTeXDownload
119Range Addressable Network: A P2P Cache Architecture for Data Ranges. Anshul Kothari, Divyakant Agrawal, Abhishek Gupta, Subhash Suri. Peer-to-Peer Computing 2003, 14-22. Cited by 21Web SearchBibTeXDownload
118Binary space partitions for 3D subdivisions. John Hershberger, Subhash Suri. SODA 2003, 100-108. Web SearchBibTeXDownload
117On the Difficulty of Some Shortest Path Problems. John Hershberger, Subhash Suri, Amit M. Bhosle. STACS 2003, 343-354. Web SearchBibTeXDownload
116Bandwidth-Constrained Allocation in Grid Computing. Anshul Kothari, Subhash Suri, Yunhong Zhou. WADS 2003, 67-78. Web SearchBibTeXDownload
2002
115Winner determination in combinatorial auction generalizations. Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine. AAMAS 2002, 69-76. Web SearchBibTeXDownload
114Algorithmic issues in modeling motion. 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. ACM Comput. Surv. (34): 550-572 (2002). Cited by 41Web SearchBibTeXDownload
113Erratum to "Vickrey Pricing and Shortest Paths: What is an Edge Worth?". John Hershberger, Subhash Suri. FOCS 2002, 809. Web SearchBibTeXDownload
112Market Clearing with Supply and Demand Curves. Tuomas Sandholm, Subhash Suri. ISAAC 2002, 600-611. Web SearchBibTeXDownload
111Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions. Yunhong Zhou, Subhash Suri. SIAM J. Comput. (31): 1339-1357 (2002). Web SearchBibTeXDownload
110Curvature-Constrained Shortest Paths in a Convex Polygon. Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides. SIAM J. Comput. (31): 1814-1851 (2002). Web SearchBibTeXDownload
2001
109Geometric permutations of balls with bounded size disparity. Yunhong Zhou, Subhash Suri. CCCG 2001, 177-180. Web SearchBibTeXDownload
108Kinetic Connectivity for Unit Disks. Leonidas J. Guibas, John Hershberger, Subhash Suri, Li Zhang. Discrete & Computational Geometry (25): 591-610 (2001). Web SearchBibTeXDownload
107Vickrey Prices and Shortest Paths: What is an Edge Worth?. John Hershberger, Subhash Suri. FOCS 2001, 252-259. Web SearchBibTeXDownload
106Routing Bandwidth Guaranteed Paths with Restoration in Label Switched Networks. Samphel Norden, Milind M. Buddhikot, Marcel Waldvogel, Subhash Suri. ICNP 2001, 71. Web SearchBibTeXDownload
105Fast Firewall Implementations for Software and Hardware-Based Routers. Lili Qiu, George Varghese, Subhash Suri. ICNP 2001, 241-250. Web SearchBibTeXDownload
104Market Clearability. Tuomas Sandholm, Subhash Suri. IJCAI 2001, 1145-1151. Web SearchBibTeX
103CABOB: A Fast Optimal Algorithm for Combinatorial Auctions. Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine. IJCAI 2001, 1102-1108. Web SearchBibTeX
102A Lower Bound for Multicast Key Distribution. Jack Snoeyink, Subhash Suri, George Varghese. INFOCOM 2001, 422-431. Web SearchBibTeXDownload
101Fast Packet Classification for Two-Dimensional Conflict-Free Filters. Priyank Ramesh Warkhede, Subhash Suri, George Varghese. INFOCOM 2001, 1434-1443. Web SearchBibTeXDownload
100Profile-Based Routing: A New Framework for MPLS Traffic Engineering. Subhash Suri, Marcel Waldvogel, Priyank Ramesh Warkhede. QofIS 2001, 138-157. Web SearchBibTeXDownload
99Fast firewall implementations for software-based and hardware-based routers. Lili Qiu, George Varghese, Subhash Suri. SIGMETRICS/Performance 2001, 344-345. Web SearchBibTeXDownload
98Simplified kinetic connectivity for rectangles and hypercubes. John Hershberger, Subhash Suri. SODA 2001, 158-167. Web SearchBibTeXDownload
97Shape sensitive geometric permutations. Yunhong Zhou, Subhash Suri. SODA 2001, 234-243. Web SearchBibTeXDownload
2000
96Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations. Tuomas Sandholm, Subhash Suri. AAAI/IAAI 2000, 90-97. Web SearchBibTeXDownload
95Morphing Simple Polygons. Leonidas J. Guibas, John Hershberger, Subhash Suri. Discrete & Computational Geometry (24): 1-34 (2000). Web SearchBibTeXDownload
94Collision Detection Using Bounding Boxes: Convexity Helps. Yunhong Zhou, Subhash Suri. ESA 2000, 437-448. Web SearchBibTeXDownload
93Detecting and Resolving Packet Filter Conflicts. Hari Adiseshu, Subhash Suri, Guru M. Parulkar. INFOCOM 2000, 1203-1212. Web SearchBibTeXDownload
92Rectangular Tiling in Multidimensional Arrays. Adam Smith, Subhash Suri. J. Algorithms (37): 451-467 (2000). Web SearchBibTeXDownload
91Online Scheduling with Hard Deadlines. Sally A. Goldman, Jyoti Parwatikar, Subhash Suri. J. Algorithms (34): 370-389 (2000). Web SearchBibTeXDownload
90Algorithms for minimum volume enclosing simplex in R3. Yunhong Zhou, Subhash Suri. SODA 2000, 500-509. Web SearchBibTeXDownload
89Optimal Flow Aggregation. Subhash Suri, Tuomas Sandholm, Priyank Ramesh Warkhede. SWAT 2000, 462-475. Web SearchBibTeXDownload
88Kinetic connectivity for unit disks. Leonidas J. Guibas, John Hershberger, Subhash Suri, Li Zhang. Symposium on Computational Geometry 2000, 331-340. Web SearchBibTeXDownload
1999
87Analyzing bounding boxes for object intersection. Subhash Suri, Philip M. Hubbard, John F. Hughes. ACM Trans. Graph. (18): 257-277 (1999). Web SearchBibTeXDownload
86Analysis of a bounding box heuristic for object intersection. Yunhong Zhou, Subhash Suri. J. ACM (46): 833-857 (1999). Web SearchBibTeXDownload
85Space Decomposition Techniques for Fast Layer-4 Switching. Milind M. Buddhikot, Subhash Suri, Marcel Waldvogel. Protocols for High-Speed Networks 1999, 25-42. Web SearchBibTeX
84An Optimal Algorithm for Euclidean Shortest Paths in the Plane. John Hershberger, Subhash Suri. SIAM J. Comput. (28): 2215-2256 (1999). Web SearchBibTeXDownload
83Packet Classification Using Tuple Space Search. Venkatachary Srinivasan, Subhash Suri, George Varghese. SIGCOMM 1999, 135-146. Web SearchBibTeXDownload
82Packet Filtering in High Speed Networks. Subhash Suri, George Varghese. SODA 1999, 969-970. Web SearchBibTeXDownload
81Rectangular Tiling in Multi-dimensional Arrays. Adam Smith, Subhash Suri. SODA 1999, 786-794. Web SearchBibTeXDownload
80Analysis of a Bounding Box Heuristic for Object Intersection. Yunhong Zhou, Subhash Suri. SODA 1999, 830-839. Web SearchBibTeXDownload
79Kinetic Connectivity of Rectangles. John Hershberger, Subhash Suri. Symposium on Computational Geometry 1999, 237-246. Web SearchBibTeXDownload
1998
78Label placement by maximum independent set in rectangles. Pankaj K. Agarwal, Marc J. van Kreveld, Subhash Suri. Comput. Geom. (11): 209-218 (1998). Web SearchBibTeXDownload
77Practical methods for approximating shortest paths on a convex polytope in R3. John Hershberger, Subhash Suri. Comput. Geom. (10): 31-46 (1998). Web SearchBibTeXDownload
76Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki. J. ACM (45): 863-890 (1998). Web SearchBibTeXDownload
75Surface Approximation and Geometric Partitions. Pankaj K. Agarwal, Subhash Suri. SIAM J. Comput. (27): 1016-1035 (1998). Web SearchBibTeXDownload
74Fast and Scalable Layer Four Switching. Venkatachary Srinivasan, George Varghese, Subhash Suri, Marcel Waldvogel. SIGCOMM 1998, 191-202. Web SearchBibTeXDownload
73Collision Detection in Aspect and Scale Bounded Polyhedra. Subhash Suri, Philip M. Hubbard, John F. Hughes. SODA 1998, 127-136. Web SearchBibTeXDownload
72Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract). Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides. Symposium on Computational Geometry 1998, 392-401. Web SearchBibTeXDownload
1997
71Label placement by maximum independent set in rectangles. Pankaj K. Agarwal, Marc J. van Kreveld, Subhash Suri. CCCG 1997. Web SearchBibTeX
70Finding a Shortest Diagonal of a Simple Polygon in Linear Time. John Hershberger, Subhash Suri. Comput. Geom. (7): 149-160 (1997). Web SearchBibTeXDownload
69Leap Forward Virtual Clock: A New Fair Queueing Scheme with Guaranteed Delays and Throughput Fairness. Subhash Suri, George Varghese, Girish P. Chandranmenon. INFOCOM 1997, 557-565. Web SearchBibTeX
68Query-Sensitive Ray Shooting. Joseph S. B. Mitchell, David M. Mount, Subhash Suri. Int. J. Comput. Geometry Appl. (7): 317-347 (1997). Web SearchBibTeXDownload
67Designing Least-Cost Nonblocking Broadband Networks. J. Andrew Fingerhut, Subhash Suri, Jonathan S. Turner. J. Algorithms (24): 287-309 (1997). Web SearchBibTeXDownload
66Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delays and Throughput Fairness. Subhash Suri, George Varghese, Girish P. Chandranmenon. PODC 1997, 281. Web SearchBibTeXDownload
65Matrix Searching with the Shortest-Path Metric. John Hershberger, Subhash Suri. SIAM J. Comput. (26): 1612-1634 (1997). Web SearchBibTeXDownload
64Efficient Breakout Routing in Printed Circuit Boards. John Hershberger, Subhash Suri. Symposium on Computational Geometry 1997, 460-462. Web SearchBibTeXDownload
63Efficient Breakout Routing in Printed Circuit Boards (Extended Abstract). John Hershberger, Subhash Suri. WADS 1997, 462-471. Web SearchBibTeXDownload
62On-line Scheduling with Hard Deadlines (Extended Abstract). Sally A. Goldman, Jyoti Parwatikar, Subhash Suri. WADS 1997, 258-271. Web SearchBibTeXDownload
1996
61Simple and Practical Geometric Algorithms. Pankaj K. Agarwal, Subhash Suri. ACM Comput. Surv. (28): 16 (1996). Web SearchBibTeXDownload
60Off-Line Maintenance of Planar Configurations. John Hershberger, Subhash Suri. J. Algorithms (21): 453-475 (1996). Web SearchBibTeXDownload
59Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki. STOC 1996, 151-160. Web SearchBibTeXDownload
1995
58Separation and Approximation of Polyhedral Objects. Joseph S. B. Mitchell, Subhash Suri. Comput. Geom. (5): 95-114 (1995). Web SearchBibTeXDownload
57The Centroid of Points with Approximate Weights. Marshall W. Bern, David Eppstein, Leonidas J. Guibas, John Hershberger, Subhash Suri, Jan Wolter. ESA 1995, 460-472. Web SearchBibTeXDownload
56Long Non-Crossing Configurations in the Plane. Noga Alon, Sridhar Rajagopalan, Subhash Suri. Fundam. Inform. (22): 385-394 (1995). Web SearchBibTeXDownload
55Logarithmic-time link path queries in a simple polygon. Esther M. Arkin, Joseph S. B. Mitchell, Subhash Suri. Int. J. Comput. Geometry Appl. (5): 369-395 (1995). Web SearchBibTeXDownload
54A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk. John Hershberger, Subhash Suri. J. Algorithms (18): 403-431 (1995). Web SearchBibTeXDownload
53Morphing Binary Trees. John Hershberger, Subhash Suri. SODA 1995, 396-404. Web SearchBibTeXDownload
52Practical Methods for Approximating Shortest Paths on a Convex Polytope in R³. John Hershberger, Subhash Suri. SODA 1995, 447-456. Web SearchBibTeX
51Practical Methods for Approximating Shortest Paths on a Convex Polytope in R3. John Hershberger, Subhash Suri. SODA 1995, 447-456. Web SearchBibTeXDownload
50Stabbing Triangulations by Lines in 3D. Pankaj K. Agarwal, Boris Aronov, Subhash Suri. Symposium on Computational Geometry 1995, 267-276. Web SearchBibTeXDownload
1994
49Can Visibility Graphs Be Represented Compactly?. Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri. Discrete & Computational Geometry (12): 347-365 (1994). Web SearchBibTeXDownload
48A Comparative Evaluation of Space Priority Strategies in ATM Networks. Subhash Suri, David Tipper, Gopal Meempat. INFOCOM 1994, 516-523. Web SearchBibTeX
47Surface Approximation and Geometric Partitions. Pankaj K. Agarwal, Subhash Suri. SODA 1994, 24-33. Web SearchBibTeXDownload
46Query-Sensitive Ray Shooting. Joseph S. B. Mitchell, David M. Mount, Subhash Suri. Symposium on Computational Geometry 1994, 359-368. Web SearchBibTeXDownload
45Data Structures for Two-Edge Connectivity in Planar Graphs. John Hershberger, Monika Rauch, Subhash Suri. Theor. Comput. Sci. (130): 139-161 (1994). Cited by 6Web SearchBibTeXDownload
1993
44Computing the Intersection-Depth of Polyhedra. David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri. Algorithmica (9): 518-533 (1993). Web SearchBibTeXDownload
43Selecting Distances in the Plane. Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri. Algorithmica (9): 495-514 (1993). Web SearchBibTeXDownload
42Efficient Computation of Euclidean Shortest Paths in the Plane. John Hershberger, Subhash Suri. FOCS 1993, 508-517. Web SearchBibTeXDownload
41A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk. John Hershberger, Subhash Suri. SODA 1993, 54-63. Web SearchBibTeXDownload
40Matrix searching with the shortest path metric. John Hershberger, Subhash Suri. STOC 1993, 485-494. Web SearchBibTeXDownload
39Long Non-Crossing Configurations in the Plane. Noga Alon, Sridhar Rajagopalan, Subhash Suri. Symposium on Computational Geometry 1993, 257-263. Web SearchBibTeXDownload
38Can Visibility Graphs be Represented Compactly?. Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri. Symposium on Computational Geometry 1993, 338-347. Web SearchBibTeXDownload
1992
37Applications of a Semi-Dynamic Convex Hull Algorithm. John Hershberger, Subhash Suri. BIT (32): 249-267 (1992). Web SearchBibTeX
36Transitions in Geometric Minimum Spanning Trees. Clyde L. Monma, Subhash Suri. Discrete & Computational Geometry (8): 265-293 (1992). Web SearchBibTeXDownload
35Separation and Approximation of Polyhedral Objects. Joseph S. B. Mitchell, Subhash Suri. SODA 1992, 296-306. Web SearchBibTeXDownload
34Optimal Link Path Queries in a Simple Polygon. Esther M. Arkin, Joseph S. B. Mitchell, Subhash Suri. SODA 1992, 269-279. Web SearchBibTeXDownload
33Fully Dynamic 2-Edge-Connectivity in Planar Graphs. John Hershberger, Monika Rauch, Subhash Suri. SWAT 1992, 233-244. Cited by 19Web SearchBibTeXDownload
1991
32Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions. Pankaj K. Agarwal, Jirí Matousek, Subhash Suri. Comput. Geom. (1): 189-201 (1991). Web SearchBibTeXDownload
31Computing external farthest neighbors for a simple polygon. Pankaj K. Agarwal, Alok Aggarwal, Boris Aronov, S. Rao Kosaraju, Baruch Schieber, Subhash Suri. Discrete Applied Mathematics (31): 97-111 (1991). Web SearchBibTeXDownload
30Maintenance of Geometric Extrema. David P. Dobkin, Subhash Suri. J. ACM (38): 275-298 (1991). Web SearchBibTeXDownload
29Finding k Points with Minimum Diameter and Related Problems. Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri. J. Algorithms (12): 38-56 (1991). Web SearchBibTeXDownload
28Finding Tailored Partitions. John Hershberger, Subhash Suri. J. Algorithms (12): 431-463 (1991). Web SearchBibTeXDownload
27Fast Matching Algorithms for Points on a Polygon. Odile Marcotte, Subhash Suri. SIAM J. Comput. (20): 405-422 (1991). Web SearchBibTeXDownload
26Offline Maintenance of Planar Configurations. John Hershberger, Subhash Suri. SODA 1991, 32-41. Web SearchBibTeXDownload
25Transitions in Geometric Minimum Spanning Trees (Extended Abstract). Clyde L. Monma, Subhash Suri. Symposium on Computational Geometry 1991, 239-249. Web SearchBibTeXDownload
24Farthest Neighbours, Maximum Spanning Trees and Related Problems in Higher Dimensions. Pankaj K. Agarwal, Jirí Matousek, Subhash Suri. WADS 1991, 105-116. Web SearchBibTeXDownload
1990
23Computing Euclidean Maximum Spanning Trees. Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao. Algorithmica (5): 407-419 (1990). Web SearchBibTeXDownload
22An Optimal Algorithm for Detecting Weak Visibility of a Polygon. Jörg-Rüdiger Sack, Subhash Suri. IEEE Trans. Computers (39): 1213-1219 (1990). Web SearchBibTeXDownload
21Computing the Longest Diagonal of a Simple Polygon. Alok Aggarwal, Subhash Suri. Inf. Process. Lett. (35): 13-18 (1990). Web SearchBibTeXDownload
20Implicitly Searching Convolutions and Computing Depth of Collision. David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri. SIGAL International Symposium on Algorithms 1990, 165-180. Web SearchBibTeXDownload
19Applications of a Semi-Dynamic Convex Hull Algorithm. John Hershberger, Subhash Suri. SWAT 1990, 380-392. Web SearchBibTeXDownload
18Selecting Distances in the Plane. Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri. Symposium on Computational Geometry 1990, 321-331. Web SearchBibTeXDownload
1989
17Fast Matching Algorithms for Points on a Polygon (Extended Abstract). Odile Marcotte, Subhash Suri. FOCS 1989, 60-65. Web SearchBibTeXDownload
16Dynamically Computing the Maxima of Decomposable Functions, with Applications. David P. Dobkin, Subhash Suri. FOCS 1989, 488-493. Web SearchBibTeXDownload
15Finding Minimal Convex Nested Polygons. Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap. Inf. Comput. (83): 98-110 (1989). Web SearchBibTeXDownload
14Computing Geodesic Furthest Neighbors in Simple Polygons. Subhash Suri. J. Comput. Syst. Sci. (39): 220-235 (1989). Web SearchBibTeXDownload
13Fining k Points with Minimum Spanning Trees and Related Problems. Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri. Symposium on Computational Geometry 1989, 283-291. Web SearchBibTeXDownload
12Finding Tailored Partitions. John Hershberger, Subhash Suri. Symposium on Computational Geometry 1989, 255-265. Web SearchBibTeXDownload
11On Geometric Matching. Odile Marcotte, Subhash Suri. Symposium on Computational Geometry 1989, 302-314. Web SearchBibTeXDownload
10Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version). Alok Aggarwal, Shlomo Moran, Peter W. Shor, Subhash Suri. WADS 1989, 115-134. Web SearchBibTeX
1988
9Computing the Link Center of a Simple Polygon. William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap. Discrete & Computational Geometry (3): 281-293 (1988). Web SearchBibTeXDownload
8An Optimal Algorithm for Detecting Weak Visibility of a Polygon (Preliminary Version). Jörg-Rüdiger Sack, Subhash Suri. STACS 1988, 312-321. Web SearchBibTeXDownload
7Computing Euclidean Maximum Spanning Trees. Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao. Symposium on Computational Geometry 1988, 241-251. Web SearchBibTeXDownload
1987
6Computing the Link Center of a Simple Polygon. William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap. Symposium on Computational Geometry 1987, 1-10. Web SearchBibTeXDownload
5The All-Geodesic-Furthest Neighbor Problem for Simple Polygons. Subhash Suri. Symposium on Computational Geometry 1987, 64-75. Web SearchBibTeXDownload
4Fast Algorithms for Computing the Largest Empty Rectangle. Alok Aggarwal, Subhash Suri. Symposium on Computational Geometry 1987, 278-290. Web SearchBibTeXDownload
1986
3Worst-Case Optimal Algorithms for Constructing Visibility Polygons with Holes. Subhash Suri, Joseph O'Rourke. Symposium on Computational Geometry 1986, 14-23. Web SearchBibTeXDownload
1985
2Shortest Paths on Polyhedral Surfaces. Joseph O'Rourke, Subhash Suri, Heather Booth. STACS 1985, 243-254. Web SearchBibTeXDownload
1Finding minimal convex nested polygons. Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap. Symposium on Computational Geometry 1985, 296-304. Web SearchBibTeXDownload
from DBLP and Google Scholar
References
1. ^ The ACM SIGMOD/PODS Conference: Providence, Rhode Island, USA, 2009 - Program: SIGMOD Accepted Papers - Retrieved 2009-11-21 - details
2. ^ The ACM SIGMOD/PODS Conference: Providence, Rhode Island, USA, 2009 - Organization: PODS Program Committee - Retrieved 2009-11-21 - details
3. ^ Lecture 7-18-11 UT Dallas Computer Science - Retrieved 2013-08-07 - details
Developed by the Database Group at the University of Wisconsin and Yahoo! Research