default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSubhash Suri
Person information
- affiliation: University of California, Santa Barbara, Department of Computer Science
- affiliation: Washington University in St. Louis, Computer Science
- affiliation: Johns Hopkins University, Baltimore, Department of Rlectrical Engineering and Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c174]Nathan Wachholz, Subhash Suri:
Spanning Tree, Matching, and TSP for Moving Points: Complexity and Regret. CCCG 2023: 1-7- [c173]Chinmay Sonar, Subhash Suri, Jie Xue:
Fault Tolerance in Euclidean Committee Selection. ESA 2023: 95:1-95:14 - [e6]Pat Morin
, Subhash Suri:
Algorithms and Data Structures - 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 - August 2, 2023, Proceedings. Lecture Notes in Computer Science 14079, Springer 2023, ISBN 978-3-031-38905-4 [contents] - [i23]Chinmay Sonar, Subhash Suri, Jie Xue:
Fault Tolerance in Euclidean Committee Selection. CoRR abs/2308.07268 (2023) - 2022
- [j103]Neeraj Kumar, Stavros Sintos, Subhash Suri:
The maximum exposure problem. Comput. Geom. 104: 101861 (2022) - [j102]John Hershberger, Subhash Suri, Hakan Yildiz:
A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane. SIAM J. Comput. 51(3): 1296-1340 (2022) - [j101]Pankaj K. Agarwal, Hsien-Chih Chang, Subhash Suri, Allen Xiao, Jie Xue:
Dynamic Geometric Set Cover and Hitting Set. ACM Trans. Algorithms 18(4): 40:1-40:37 (2022) - [c172]Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue:
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles. SoCG 2022: 52:1-52:14 - [c171]Chinmay Sonar, Subhash Suri, Jie Xue:
Multiwinner Elections under Minimax Chamberlin-Courant Rule in Euclidean Space. IJCAI 2022: 475-481 - [c170]Timothy M. Chan, Qizheng He, Subhash Suri, Jie Xue:
Dynamic Geometric Set Cover, Revisited. SODA 2022: 3496-3528 - [i22]Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue:
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles. CoRR abs/2203.08193 (2022) - [i21]Chinmay Sonar, Subhash Suri, Jie Xue:
Multiwinner Elections under Minimax Chamberlin-Courant Rule in Euclidean Space. CoRR abs/2205.13598 (2022) - 2021
- [c169]Daniel Lokshtanov, Subhash Suri, Jie Xue:
Efficient Algorithms for Least Square Piecewise Polynomial Regression. ESA 2021: 63:1-63:15 - [c168]Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue:
An ETH-Tight Algorithm for Multi-Team Formation. FSTTCS 2021: 28:1-28:9 - [c167]Úrsula Hébert-Johnson, Chinmay Sonar, Subhash Suri, Vaishali Surianarayanan:
Anonymity-Preserving Space Partitions. ISAAC 2021: 32:1-32:16 - [c166]Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri:
A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane. SODA 2021: 822-839 - [i20]Neeraj Kumar, Stavros Sintos, Subhash Suri:
The Maximum Exposure Problem. CoRR abs/2102.03455 (2021) - [i19]Timothy M. Chan, Qizheng He, Subhash Suri, Jie Xue:
Dynamic Geometric Set Cover, Revisited. CoRR abs/2111.01196 (2021) - 2020
- [j100]John Hershberger, Neeraj Kumar, Subhash Suri:
Shortest Paths in the Plane with Obstacle Violations. Algorithmica 82(7): 1813-1832 (2020) - [j99]Thomas Schibler, Subhash Suri:
K-dominance in multidimensional data: Theory and applications. Comput. Geom. 87: 101594 (2020) - [j98]Sayan Bandyapadhyay, Neeraj Kumar, Subhash Suri, Kasturi R. Varadarajan:
Improved approximation bounds for the minimum constraint removal problem. Comput. Geom. 90: 101650 (2020) - [c165]Daniel Lokshtanov, Chinmay Sonar, Subhash Suri, Jie Xue:
Fair Covering of Points by Balls. CCCG 2020: 26-32 - [c164]Pankaj K. Agarwal, Hsien-Chih Chang, Subhash Suri, Allen Xiao, Jie Xue:
Dynamic Geometric Set Cover and Hitting Set. SoCG 2020: 2:1-2:15 - [i18]Pankaj K. Agarwal, Hsien-Chih Chang, Subhash Suri, Allen Xiao, Jie Xue:
Dynamic geometric set cover and hitting set. CoRR abs/2003.00202 (2020) - [i17]Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri:
A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane. CoRR abs/2011.14463 (2020)
2010 – 2019
- 2019
- [j97]Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri:
Approximating dominating set on intersection graphs of rectangles and L-frames. Comput. Geom. 82: 32-44 (2019) - [c163]Neeraj Kumar, Stavros Sintos, Subhash Suri:
The Maximum Exposure Problem. APPROX-RANDOM 2019: 19:1-19:20 - [c162]Thomas Schibler, Ambuj K. Singh, Subhash Suri:
On Multi-Dimensional Team Formation. CCCG 2019: 146-152 - 2018
- [j96]Frank Hoffmann, Klaus Kriegel, Subhash Suri, Kevin Verbeek, Max Willert:
Tight bounds for conflict-free chromatic guarding of orthogonal art galleries. Comput. Geom. 73: 24-34 (2018) - [j95]Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos, Subhash Suri:
Range-max queries on uncertain data. J. Comput. Syst. Sci. 94: 118-134 (2018) - [j94]Matthew Cieslak, Tegan Brennan, Wendy Meiring, Lukas J. Volz, Clint Greene, Alexander Asturias, Subhash Suri, Scott T. Grafton:
Analytic tractography: A closed-form solution for estimating local white matter connectivity with diffusion MRI. NeuroImage 169: 473-484 (2018) - [c161]Sayan Bandyapadhyay, Neeraj Kumar, Subhash Suri, Kasturi R. Varadarajan:
Improved Approximation Bounds for the Minimum Constraint Removal Problem. APPROX-RANDOM 2018: 2:1-2:19 - [c160]Matthew Cieslak, Wendy Meiring, Tegan Brennan, Clint Greene, Lukas J. Volz, Jean M. Vettel, Subhash Suri, Scott T. Grafton:
Compositional measures of diffusion anisotropy and asymmetry. ISBI 2018: 123-126 - [c159]Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri:
Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames. MFCS 2018: 37:1-37:15 - [c158]Pankaj K. Agarwal, Neeraj Kumar, Stavros Sintos, Subhash Suri:
Computing Shortest Paths in the Plane with Removable Obstacles. SWAT 2018: 5:1-5:15 - [r3]Chiranjeeb Buragohain, Subhash Suri:
Quantiles on Streams. Encyclopedia of Database Systems (2nd ed.) 2018 - [i16]Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri:
Approximating Dominating Set on Intersection Graphs of L-frames. CoRR abs/1803.06216 (2018) - 2017
- [j93]Pankaj K. Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yildiz, Wuzhou Zhang:
Convex Hulls Under Uncertainty. Algorithmica 79(2): 340-367 (2017) - [j92]Thomas C. van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp, Peter Markfelder, Alexander Ravsky, Subhash Suri, Alexander Wolff:
Block Crossings in Storyline Visualizations. J. Graph Algorithms Appl. 21(5): 873-913 (2017) - [j91]Martin Fink, John Hershberger, Nirman Kumar, Subhash Suri:
Hyperplane separability and convexity of probabilistic point sets. J. Comput. Geom. 8(2): 32-57 (2017) - [c157]John Hershberger, Neeraj Kumar, Subhash Suri:
Shortest Paths in the Plane with Obstacle Violations. ESA 2017: 49:1-49:14 - [c156]Thomas Schibler, Subhash Suri:
K-Dominance in Multidimensional Data: Theory and Applications. ESA 2017: 65:1-65:13 - [c155]Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos, Subhash Suri:
Efficient Algorithms for k-Regret Minimizing Sets. SEA 2017: 7:1-7:23 - [i15]Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos, Subhash Suri:
Efficient Algorithms for k-Regret Minimizing Sets. CoRR abs/1702.01446 (2017) - 2016
- [j90]Fangqiu Han, Subhash Suri, Xifeng Yan:
Observability of Lattice Graphs. Algorithmica 76(2): 474-489 (2016) - [j89]Kevin Verbeek, Subhash Suri:
Metric embedding, hyperbolic space, and social networks. Comput. Geom. 59: 1-12 (2016) - [j88]Subhash Suri, Kevin Verbeek:
On the Most Likely Voronoi Diagram and Nearest Neighbor Searching. Int. J. Comput. Geom. Appl. 26(3-4): 151-166 (2016) - [c154]Martin Fink, Subhash Suri:
Boundary Labeling with Obstacles. CCCG 2016: 86-92 - [c153]Martin Fink, Neeraj Kumar, Subhash Suri:
Counting Convex k-gons in an Arrangement of Line Segments. CCCG 2016: 155-160 - [c152]Martin Fink, John Hershberger, Nirman Kumar, Subhash Suri:
Hyperplane Separability and Convexity of Probabilistic Point Sets. SoCG 2016: 38:1-38:16 - [c151]Nirman Kumar, Benjamin Raichel, Subhash Suri, Kevin Verbeek:
Most Likely Voronoi Diagrams in Higher Dimensions. FSTTCS 2016: 31:1-31:14 - [c150]Thomas C. van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp, Peter Markfelder, Alexander Ravsky, Subhash Suri, Alexander Wolff:
Block Crossings in Storyline Visualizations. GD 2016: 382-398 - [c149]Martin Fink, John Hershberger, Subhash Suri, Kevin Verbeek:
Bundled Crossings in Embedded Graphs. LATIN 2016: 454-468 - [c148]Nirman Kumar, Subhash Suri:
Containment and Evasion in Stochastic Point Data. LATIN 2016: 576-589 - [c147]Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos, Subhash Suri:
Range-Max Queries on Uncertain Data. PODS 2016: 465-476 - [i14]Thomas C. van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp, Peter Markfelder, Alexander Ravsky, Subhash Suri, Alexander Wolff:
Block Crossings in Storyline Visualizations. CoRR abs/1609.00321 (2016) - 2015
- [j87]Hakan Yildiz, Subhash Suri:
Computing Klee's Measure of Grounded Boxes. Algorithmica 71(2): 307-329 (2015) - [j86]Kyle Klein, Subhash Suri:
Pursuit Evasion on Polyhedral Surfaces. Algorithmica 73(4): 730-747 (2015) - [j85]Kyle Klein, Subhash Suri:
Capture bounds for visibility-based pursuit evasion. Comput. Geom. 48(3): 205-220 (2015) - [c146]Martin Fink, Subhash Suri:
Tradeoffs between Bends and Displacement in Anchored Graph Drawing. CCCG 2015 - [c145]Frank Hoffmann, Klaus Kriegel, Subhash Suri, Kevin Verbeek, Max Willert:
Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries. SoCG 2015: 421-435 - [c144]Jonathan Sun, Matthew Cieslak, Scott T. Grafton, Subhash Suri:
A reeb graph approach to tractography. SIGSPATIAL/GIS 2015: 58:1-58:4 - [c143]Sylvester David Eriksson-Bique, John Hershberger, Valentin Polishchuk, Bettina Speckmann, Subhash Suri, Topi Talvitie, Kevin Verbeek, Hakan Yildiz:
Geometric k Shortest Paths. SODA 2015: 1616-1625 - [i13]Fangqiu Han, Subhash Suri, Xifeng Yan:
Observability of Lattice Graphs. CoRR abs/1505.02224 (2015) - 2014
- [j84]Andreas Bärtschi, Subhash Suri:
Conflict-Free Chromatic Art Gallery Coverage. Algorithmica 68(1): 265-283 (2014) - [j83]Andreas Bärtschi, Subhash Suri:
Erratum to: Conflict-Free Chromatic Art Gallery Coverage. Algorithmica 68(1): 284-285 (2014) - [j82]Luca Foschini, John Hershberger, Subhash Suri:
On the Complexity of Time-Dependent Shortest Paths. Algorithmica 68(4): 1075-1097 (2014) - [j81]Pegah Kamousi, Timothy M. Chan, Subhash Suri:
Closest pair and the post office problem for stochastic points. Comput. Geom. 47(2): 214-223 (2014) - [j80]Shaunak Dattaprasad Bopardikar, Subhash Suri:
k-Capture in multiagent pursuit evasion, or the lion and the hyenas. Theor. Comput. Sci. 522: 13-23 (2014) - [c142]Kevin Verbeek, Subhash Suri:
Metric Embedding, Hyperbolic Space, and Social Networks. SoCG 2014: 501 - [c141]Pankaj K. Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yildiz, Wuzhou Zhang:
Convex Hulls under Uncertainty. ESA 2014: 37-48 - [c140]Subhash Suri, Kevin Verbeek:
On the Most Likely Voronoi Diagramand Nearest Neighbor Searching. ISAAC 2014: 338-350 - [c139]Kyle Klein, Subhash Suri:
Trackability with Imprecise Localization. WAFR 2014: 215-231 - [i12]Pankaj K. Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yildiz, Wuzhou Zhang:
Convex Hulls under Uncertainty. CoRR abs/1406.6599 (2014) - 2013
- [j79]Yang Li, Pegah Kamousi, Fangqiu Han, Shengqi Yang, Xifeng Yan, Subhash Suri:
Memory Efficient Minimum Substring Partitioning. Proc. VLDB Endow. 6(3): 169-180 (2013) - [c138]Kyle Klein, Subhash Suri:
Capture bounds for visibility-based pursuit evasion. SoCG 2013: 329-338 - [c137]John Hershberger, Subhash Suri, Hakan Yildiz:
A near-optimal algorithm for shortest paths among curved obstacles in the plane. SoCG 2013: 359-368 - [c136]Subhash Suri, Kevin Verbeek, Hakan Yildiz:
On the Most Likely Convex Hull of Uncertain Points. ESA 2013: 791-802 - [c135]Kyle Klein, Subhash Suri:
Pursuit Evasion on Polyhedral Surfaces. ISAAC 2013: 284-294 - [c134]Pegah Kamousi, Subhash Suri:
Euclidean Traveling Salesman Tours through Stochastic Neighborhoods. ISAAC 2013: 644-654 - [i11]Kyle Klein, Subhash Suri:
Trackability with Imprecise Localization. CoRR abs/1312.6573 (2013) - 2012
- [j78]Deepak Bhadauria, Kyle Klein, Volkan Isler, Subhash Suri:
Capturing an evader in polygonal environments with obstacles: The full visibility case. Int. J. Robotics Res. 31(10): 1176-1189 (2012) - [j77]Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer:
Reconstructing visibility graphs with simple robots. Theor. Comput. Sci. 444: 52-59 (2012) - [c133]Kyle Klein, Subhash Suri:
Catch Me If You Can: Pursuit and Capture in Polygonal Environments with Obstacles. AAAI 2012: 2010-2016 - [c132]Subhash Suri:
Geometric Computing over Uncertain Data. ALGOSENSORS 2012: 4-5 - [c131]Hakan Yildiz, Subhash Suri:
On Klee's measure problem for grounded boxes. SCG 2012: 111-120 - [c130]Andreas Bärtschi, Subhash Suri:
Conflict-free Chromatic Art Gallery Coverage. STACS 2012: 160-171 - [i10]Yang Li, Pegah Kamousi, Fangqiu Han, Shengqi Yang, Xifeng Yan, Subhash Suri:
Memory Efficient De Bruijn Graph Construction. CoRR abs/1207.3532 (2012) - 2011
- [j76]Jaspreet Singh, Rajesh Kumar, Upamanyu Madhow, Subhash Suri, Richard E. Cagley:
Multiple-Target Tracking With Binary Proximity Sensors. ACM Trans. Sens. Networks 8(1): 5:1-5:26 (2011) - [c129]Kyle Klein, Subhash Suri:
Complete Information Pursuit Evasion in Polygonal Environments. AAAI 2011: 1120-1125 - [c128]Pegah Kamousi, Subhash Suri:
Stochastic Minimum Spanning Trees and Related Problems. ANALCO 2011: 107-116 - [c127]Hakan Yildiz, John Hershberger, Subhash Suri:
A Discrete and Dynamic Version of Klee's Measure Problem. CCCG 2011 - [c126]Pegah Kamousi, Timothy M. Chan, Subhash Suri:
Stochastic minimum spanning trees in euclidean spaces. SCG 2011: 65-74 - [c125]Hakan Yildiz, Luca Foschini, John Hershberger, Subhash Suri:
The Union of Probabilistic Boxes: Maintaining the Volume. ESA 2011: 591-602 - [c124]Frank C. Uyeda, Luca Foschini, Fred Baker, Subhash Suri, George Varghese:
Efficiently Measuring Bandwidth at All Time Scales. NSDI 2011 - [c123]Luca Foschini, John Hershberger, Subhash Suri:
On the Complexity of Time-Dependent Shortest Paths. SODA 2011: 327-341 - [c122]Pegah Kamousi, Timothy M. Chan, Subhash Suri:
Closest Pair and the Post Office Problem for Stochastic Points. WADS 2011: 548-559 - [i9]Shaunak Dattaprasad Bopardikar, Subhash Suri:
k-Capture in Multiagent Pursuit Evasion, or the Lion and the Hyenas. CoRR abs/1108.1561 (2011) - [i8]Kyle Klein, Subhash Suri:
Capturing an Evader in Polygonal Environments: A Complete Information Game. CoRR abs/1110.4838 (2011) - 2010
- [c121]Chiranjeeb Buragohain, Luca Foschini, Subhash Suri:
Untangling the Braid: Finding Outliers in a Set of Streams. ALENEX 2010: 159-172 - [c120]Kyle Klein, Subhash Suri:
Robot kabaddi. CCCG 2010: 79-82 - [c119]Sorabh Gandhi, Luca Foschini, Subhash Suri:
Space-efficient online approximation of time series data: Streams, amnesia, and out-of-order. ICDE 2010: 924-935 - [c118]Kyle Klein, Subhash Suri:
Multiagent Pursuit Evasion, or Playing Kabaddi. WAFR 2010: 89-104
2000 – 2009
- 2009
- [j75]Nisheeth Shrivastava, Raghuraman Mudumbai, Upamanyu Madhow, Subhash Suri:
Target tracking with binary proximity sensors. ACM Trans. Sens. Networks 5(4): 30:1-30:33 (2009) - [j74]Sorabh Gandhi, Subhash Suri, Emo Welzl:
Catching elephants with mice: Sparse sampling for monitoring sensor networks. ACM Trans. Sens. Networks 6(1): 1:1-1:27 (2009) - [c117]Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu:
GAMPS: compressing multi sensor data by grouping and amplitude scaling. SIGMOD Conference 2009: 771-784 - [c116]Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer:
Reconstructing Visibility Graphs with Simple Robots. SIROCCO 2009: 87-99 - [e5]Sándor P. Fekete, Stefan Fischer, Martin A. Riedmiller, Subhash Suri:
Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009. Dagstuhl Seminar Proceedings 09371, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents] - [e4]Bhaskar Krishnamachari, Subhash Suri, Wendi Rabiner Heinzelman, Urbashi Mitra:
Distributed Computing in Sensor Systems, 5th IEEE International Conference, DCOSS 2009, Marina del Rey, CA, USA, June 8-10, 2009. Proceedings. Lecture Notes in Computer Science 5516, Springer 2009, ISBN 978-3-642-02084-1 [contents] - [r2]Chiranjeeb Buragohain, Subhash Suri:
Quantiles on Streams. Encyclopedia of Database Systems 2009: 2235-2240 - [i7]Sándor P. Fekete, Stefan Fischer, Martin A. Riedmiller, Subhash Suri:
09371 Abstracts Collection - Algorithmic Methods for Distributed Cooperative Systems. Algorithmic Methods for Distributed Cooperative Systems 2009 - [i6]Chiranjeeb Buragohain, Luca Foschini, Subhash Suri:
Untangling the Braid: Finding Outliers in a Set of Streams. CoRR abs/0907.2951 (2009) - 2008
- [j73]Anshul Kothari, Subhash Suri, Yunhong Zhou:
Bandwidth-Constrained Allocation in Grid Computing. Algorithmica 52(4): 487-501 (2008) - [j72]Sorabh Gandhi, Chiranjeeb Buragohain, Lili Cao, Haitao Zheng, Subhash Suri:
Towards real-time dynamic spectrum auctions. Comput. Networks 52(4): 879-897 (2008) - [j71]Kimaya Mittal, Elizabeth M. Belding, Subhash Suri:
A game-theoretic analysis of wireless access point selection by mobile users. Comput. Commun. 31(10): 2049-2062 (2008) - [j70]John Hershberger, Subhash Suri:
Adaptive sampling for geometric problems over data streams. Comput. Geom. 39(3): 191-208 (2008) - [j69]Subhash Suri, Elias Vicari, Peter Widmayer:
Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry. Int. J. Robotics Res. 27(9): 1055-1067 (2008) - [j68]John Hershberger, Nisheeth Shrivastava, Subhash Suri:
Summarizing spatial data streams using ClusterHulls. ACM J. Exp. Algorithmics 13 (2008) - [j67]Shashidhar Mysore, Banit Agrawal, Rodolfo Neuber, Timothy Sherwood, Nisheeth Shrivastava, Subhash Suri:
Formulating and implementing profiling over adaptive ranges. ACM Trans. Archit. Code Optim. 5(1): 2:1-2:32 (2008) - [j66]Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth:
Detecting cuts in sensor networks. ACM Trans. Sens. Networks 4(2): 10:1-10:25 (2008) - [c115]Sorabh Gandhi, Rajesh Kumar, Subhash Suri:
Target Counting under Minimal Sensing: Complexity and Approximations. ALGOSENSORS 2008: 30-42 - [c114]Jan Brunner, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer:
Simple Robots in Polygonal Environments: A Hierarchy. ALGOSENSORS 2008: 111-124 - [c113]Xia Zhou, Sorabh Gandhi, Subhash Suri, Haitao Zheng:
eBay in the Sky: strategy-proof wireless spectrum auctions. MobiCom 2008: 2-13 - [c112]John Hershberger, Subhash Suri:
Simplified Planar Coresets for Data Streams. SWAT 2008: 5-16 - [c111]Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer:
Angle Optimization in Target Tracking. SWAT 2008: 65-76 - 2007
- [j65]Subhash Suri, Csaba D. Tóth, Yunhong Zhou:
Selfish Load Balancing and Atomic Congestion Games. Algorithmica 47(1): 79-96 (2007) - [j64]Divyakant Agrawal, Amr El Abbadi, Subhash Suri:
Attribute-based access to distributed data over P2P networks. Int. J. Comput. Sci. Eng. 3(2): 112-123 (2007) - [j63]John Hershberger, Subhash Suri, Amit M. Bhosle:
On the difficulty of some shortest path problems. ACM Trans. Algorithms 3(1): 5:1-5:15 (2007) - [j62]John Hershberger, Matthew Maxel, Subhash Suri:
Finding the k shortest simple paths: A new algorithm and its implementation. ACM Trans. Algorithms 3(4): 45 (2007) - [c110]Subhash Suri, Elias Vicari, Peter Widmayer:
Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry. AAAI 2007: 1114-1120 - [c109]Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer:
Counting Targets with Mobile Sensors in an Unknown Environment. ALGOSENSORS 2007: 32-45 - [c108]Chiranjeeb Buragohain, Subhash Suri, Csaba D. Tóth, Yunhong Zhou:
Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks. COCOON 2007: 210-221 - [c107]Chiranjeeb Buragohain, Nisheeth Shrivastava, Subhash Suri:
Space Efficient Streaming Algorithms for the Maximum Error Histogram. ICDE 2007: 1026-1035 - [c106]Sorabh Gandhi, John Hershberger, Subhash Suri:
Approximate isocontours and spatial summaries for sensor networks. IPSN 2007: 400-409 - [c105]Jaspreet Singh, Upamanyu Madhow, Rajesh Kumar, Subhash Suri, Richard E. Cagley:
Tracking multiple targets using binary proximity sensors. IPSN 2007: 529-538 - [c104]Sorabh Gandhi, Subhash Suri, Emo Welzl:
Catching elephants with mice: sparse sampling for monitoring sensor networks. SenSys 2007: 261-274 - [e3]Subhash Suri, Roger Wattenhofer, Peter Widmayer:
Geometry in Sensor Networks, 09.04. - 13.04.2007. Dagstuhl Seminar Proceedings 07151, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - [i5]Subhash Suri, Roger Wattenhofer, Peter Widmayer:
07151 Abstracts Collection -- Geometry in Sensor Networks. Geometry in Sensor Networks 2007 - 2006
- [j61]John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth:
Adaptive Spatial Partitioning for Multidimensional Data Streams. Algorithmica 46(1): 97-117 (2006) - [j60]Florin Baboescu, Priyank Ramesh Warkhede, Subhash Suri, George Varghese:
Fast packet classification for two-dimensional conflict-free filters. Comput. Networks 50(11): 1831-1842 (2006) - [j59]Subhash Suri, Csaba D. Tóth, Yunhong Zhou:
Range Counting over Multidimensional Data Streams. Discret. Comput. Geom. 36(4): 633-655 (2006) - [j58]Tuomas Sandholm, Subhash Suri:
Side constraints and non-price attributes in markets. Games Econ. Behav. 55(2): 321-330 (2006) - [c103]John Hershberger, Nisheeth Shrivastava, Subhash Suri:
Summarizing Spatial Data Streams Using ClusterHulls. ALENEX 2006: 26-40 - [c102]Shashidhar Mysore, Banit Agrawal, Timothy Sherwood, Nisheeth Shrivastava, Subhash Suri:
Profiling over Adaptive Ranges. CGO 2006: 147-158 - [c101]Chiranjeeb Buragohain, Sorabh Gandhi, John Hershberger, Subhash Suri:
Contour Approximation in Sensor Networks. DCOSS 2006: 356-371 - [c100]John Hershberger, Nisheeth Shrivastava, Subhash Suri:
Cluster Hull: A Technique for Summarizing Spatial Data Streams. ICDE 2006: 138 - [c99]Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri:
Distributed Navigation Algorithms for Sensor Networks. INFOCOM 2006 - [c98]Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri:
Search-quality Tradeoffs for Routing in Non-ideal Wireless Networks. SECON 2006: 10-19 - [c97]Nisheeth Shrivastava, Raghuraman Mudumbai, Upamanyu Madhow, Subhash Suri:
Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms. SenSys 2006: 251-264 - 2005
- [j57]Jack Snoeyink, Subhash Suri, George Varghese:
A lower bound for multicast key distribution. Comput. Networks 47(3): 429-441 (2005) - [j56]Anshul Kothari, David C. Parkes, Subhash Suri:
Approximately-strategyproof and tractable multiunit auctions. Decis. Support Syst. 39(1): 105-121 (2005) - [j55]Amit P. Jardosh, Elizabeth M. Belding-Royer, Kevin C. Almeroth, Subhash Suri:
Real-world environment models for mobile network evaluation. IEEE J. Sel. Areas Commun. 23(3): 622-632 (2005) - [j54]Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine:
CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions. Manag. Sci. 51(3): 374-390 (2005) - [j53]John Hershberger, Subhash Suri, Csaba D. Tóth:
Binary Space Partitions of Orthogonal Subdivisions. SIAM J. Comput. 34(6): 1380-1397 (2005) - [c96]Anshul Kothari, Subhash Suri, Yunhong Zhou:
Interval Subset Sum and Uniform-Price Auction Clearing. COCOON 2005: 608-620 - [c95]Divyakant Agrawal, Amr El Abbadi, Subhash Suri:
Attribute-Based Access to Distributed Data over P2P Networks. DNIS 2005: 244-263 - [c94]Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri:
Power aware routing for sensor databases. INFOCOM 2005: 1747-1757 - [c93]Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth:
Detecting cuts in sensor networks. IPSN 2005: 210-217 - [c92]John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth:
Space complexity of hierarchical heavy hitters in multi-dimensional data streams. PODS 2005: 338-347 - [i4]Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri:
Distributed Navigation Algorithms for Sensor Networks. CoRR abs/cs/0512060 (2005) - 2004
- [j52]Priyank Ramesh Warkhede, Subhash Suri, George Varghese:
Multiway range trees: scalable IP lookup with fast updates. Comput. Networks 44(3): 289-303 (2004) - [j51]Samphel Norden, Milind M. Buddhikot, Marcel Waldvogel, Subhash Suri:
Routing bandwidth-guaranteed paths with restoration in label-switched networks . Comput. Networks 46(2): 197-218 (2004) - [j50]Subhash Suri:
Guest Editor's Foreword. Discret. Comput. Geom. 31(1): 1 (2004) - [c91]Anshul Kothari, Tuomas Sandholm, Subhash Suri:
Solving Combinatorial Exchanges: Optimality via a Few Partial Bids. AAMAS 2004: 1418-1419 - [c90]Anshul Kothari, Subhash Suri, Csaba D. Tóth, Yunhong Zhou:
Congestion Games, Load Balancing, and Price of Anarchy. CAAN 2004: 13-27 - [c89]Subhash Suri, Csaba D. Tóth, Yunhong Zhou:
Range counting over multidimensional data streams. SCG 2004: 160-169 - [c88]John Hershberger, Subhash Suri, Csaba D. Tóth:
Binary space partitions of orthogonal subdivisions. SCG 2004: 230-238 - [c87]Subhash Suri, Csaba D. Tóth, Yunhong Zhou:
Uncoordinated Load Balancing and Congestion Games in P2P Systems. IPTPS 2004: 123-130 - [c86]John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth:
Adaptive Spatial Partitioning for Multidimensional Data Streams. ISAAC 2004: 522-533 - [c85]John Hershberger, Subhash Suri:
Adaptive Sampling for Geometric Problems over Data Streams. PODS 2004: 252-262 - [c84]Nisheeth Shrivastava, Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri:
Medians and beyond: new aggregation techniques for sensor networks. SenSys 2004: 239-249 - [c83]Subhash Suri, Csaba D. Tóth, Yunhong Zhou:
Selfish load balancing and atomic congestion games. SPAA 2004: 188-195 - [r1]Joseph O'Rourke, Subhash Suri:
Polygons. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 583-606 - [i3]Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri:
Power Aware Routing for Sensor Databases. CoRR abs/cs/0412118 (2004) - [i2]Nisheeth Shrivastava, Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri:
Medians and Beyond: New Aggregation Techniques for Sensor Networks. CoRR cs.DC/0408039 (2004) - 2003
- [j49]Tuomas Sandholm, Subhash Suri:
BOB: Improved winner determination in combinatorial auctions and generalizations. Artif. Intell. 145(1-2): 33-58 (2003) - [j48]Subhash Suri, Tuomas Sandholm, Priyank Ramesh Warkhede:
Compressing Two-Dimensional Routing Tables. Algorithmica 35(4): 287-300 (2003) - [j47]Subhash Suri, Marcel Waldvogel, Daniel Bauer, Priyank Ramesh Warkhede:
Profile-based routing and traffic engineering. Comput. Commun. 26(4): 351-365 (2003) - [j46]Yunhong Zhou, Subhash Suri:
Geometric permutations of balls with bounded size disparity. Comput. Geom. 26(1): 3-20 (2003) - [j45]Meir Katchalski, Subhash Suri, Yunhong Zhou:
A Constant Bound for Geometric Permutations of Disjoint Unit Balls. Discret. Comput. Geom. 29(2): 161-173 (2003) - [c82]John Hershberger, Matthew Maxel, Subhash Suri:
Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation. ALENEX 2003: 26-36 - [c81]Amit P. Jardosh, Elizabeth M. Belding-Royer, Kevin C. Almeroth, Subhash Suri:
Towards realistic mobility models for mobile ad hoc networks. MobiCom 2003: 217-229 - [c80]Anshul Kothari, Divyakant Agrawal, Abhishek Gupta, Subhash Suri:
Range Addressable Network: A P2P Cache Architecture for Data Ranges. Peer-to-Peer Computing 2003: 14-22 - [c79]Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri:
A Game Theoretic Framework for Incentives in P2P Systems. Peer-to-Peer Computing 2003: 48-56 - [c78]Anshul Kothari, David C. Parkes, Subhash Suri:
Approximately-strategyproof and tractable multi-unit auctions. EC 2003: 166-175 - [c77]Anshul Kothari, Tuomas Sandholm, Subhash Suri:
Solving combinatorial exchanges: optimality via a few partial bids. EC 2003: 236-237 - [c76]John Hershberger, Subhash Suri:
Binary space partitions for 3D subdivisions. SODA 2003: 100-108 - [c75]John Hershberger, Subhash Suri, Amit M. Bhosle:
On the Difficulty of Some Shortest Path Problems. STACS 2003: 343-354 - [c74]Anshul Kothari, Subhash Suri, Yunhong Zhou:
Bandwidth-Constrained Allocation in Grid Computing. WADS 2003: 67-78 - [i1]Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri:
A Game Theoretic Framework for Incentives in P2P Systems. CoRR cs.GT/0310039 (2003) - 2002
- [j44]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:
Algorithmic issues in modeling motion. ACM Comput. Surv. 34(4): 550-572 (2002) - [j43]Youngsu Chae, Katherine Guo, Milind M. Buddhikot, Subhash Suri, Ellen W. Zegura:
Silo, rainbow, and caching token: schemes for scalable, fault tolerant stream caching. IEEE J. Sel. Areas Commun. 20(7): 1328-1344 (2002) - [j42]Yunhong Zhou, Subhash Suri:
Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions. SIAM J. Comput. 31(5): 1339-1357 (2002) - [j41]Pankaj K. Agarwal, Therese Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides:
Curvature-Constrained Shortest Paths in a Convex Polygon. SIAM J. Comput. 31(6): 1814-1851 (2002) - [c73]Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine:
Winner determination in combinatorial auction generalizations. AAMAS 2002: 69-76 - [c72]John Hershberger, Subhash Suri:
Erratum to "Vickrey Pricing and Shortest Paths: What is an Edge Worth?". FOCS 2002: 809- - [c71]Tuomas Sandholm, Subhash Suri:
Market Clearing with Supply and Demand Curves. ISAAC 2002: 600-611 - [e2]Ferran Hurtado, Vera Sacristán, Chandrajit Bajaj, Subhash Suri:
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, Spain, June 5-7, 2002. ACM 2002, ISBN 1-58113-504-1 [contents] - 2001
- [j40]Leonidas J. Guibas, John Hershberger, Subhash Suri, Li Zhang:
Kinetic Connectivity for Unit Disks. Discret. Comput. Geom. 25(4): 591-610 (2001) - [c70]Yunhong Zhou, Subhash Suri:
Geometric permutations of balls with bounded size disparity. CCCG 2001: 177-180 - [c69]John Hershberger, Subhash Suri:
Vickrey Prices and Shortest Paths: What is an Edge Worth?. FOCS 2001: 252-259 - [c68]Subhash Suri, George Varghese, Priyank Ramesh Warkhede:
Multiway range trees: scalable IP lookup with fast updates. GLOBECOM 2001: 1610-1614 - [c67]Samphel Norden, Milind M. Buddhikot, Marcel Waldvogel, Subhash Suri:
Routing Bandwidth Guaranteed Paths with Restoration in Label Switched Networks. ICNP 2001: 71-81 - [c66]Lili Qiu, George Varghese, Subhash Suri:
Fast Firewall Implementations for Software and Hardware-Based Routers. ICNP 2001: 241-250 - [c65]Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine:
CABOB: A Fast Optimal Algorithm for Combinatorial Auctions. IJCAI 2001: 1102-1108 - [c64]Tuomas Sandholm, Subhash Suri:
Market Clearability. IJCAI 2001: 1145-1151 - [c63]Jack Snoeyink, Subhash Suri, George Varghese:
A Lower Bound for Multicast Key Distribution. INFOCOM 2001: 422-431 - [c62]Priyank Ramesh Warkhede, Subhash Suri, George Varghese:
Fast Packet Classification for Two-Dimensional Conflict-Free Filters. INFOCOM 2001: 1434-1443 - [c61]Subhash Suri, Marcel Waldvogel, Priyank Ramesh Warkhede:
Profile-Based Routing: A New Framework for MPLS Traffic Engineering. QofIS 2001: 138-157 - [c60]Lili Qiu, George Varghese, Subhash Suri:
Fast firewall implementations for software-based and hardware-based routers. SIGMETRICS/Performance 2001: 344-345 - [c59]John Hershberger, Subhash Suri:
Simplified kinetic connectivity for rectangles and hypercubes. SODA 2001: 158-167 - [c58]Yunhong Zhou, Subhash Suri:
Shape sensitive geometric permutations. SODA 2001: 234-243 - 2000
- [j39]Leonidas J. Guibas, John Hershberger, Subhash Suri:
Morphing Simple Polygons. Discret. Comput. Geom. 24(1): 1-34 (2000) - [j38]Sally A. Goldman, Jyoti Parwatikar, Subhash Suri:
Online Scheduling with Hard Deadlines. J. Algorithms 34(2): 370-389 (2000) - [j37]Adam Smith, Subhash Suri:
Rectangular Tiling in Multidimensional Arrays. J. Algorithms 37(2): 451-467 (2000) - [c57]Tuomas Sandholm, Subhash Suri:
Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations. AAAI/IAAI 2000: 90-97 - [c56]Leonidas J. Guibas, John Hershberger, Subhash Suri, Li Zhang:
Kinetic connectivity for unit disks. SCG 2000: 331-340 - [c55]Yunhong Zhou, Subhash Suri:
Collision Detection Using Bounding Boxes: Convexity Helps. ESA 2000: 437-448 - [c54]Hari Adiseshu, Subhash Suri, Guru M. Parulkar:
Detecting and Resolving Packet Filter Conflicts. INFOCOM 2000: 1203-1212 - [c53]Yunhong Zhou, Subhash Suri:
Algorithms for minimum volume enclosing simplex in R3. SODA 2000: 500-509 - [c52]Subhash Suri, Tuomas Sandholm, Priyank Ramesh Warkhede:
Optimal Flow Aggregation. SWAT 2000: 462-475
1990 – 1999
- 1999
- [j36]Yunhong Zhou, Subhash Suri:
Analysis of a bounding box heuristic for object intersection. J. ACM 46(6): 833-857 (1999) - [j35]John Hershberger, Subhash Suri:
An Optimal Algorithm for Euclidean Shortest Paths in the Plane. SIAM J. Comput. 28(6): 2215-2256 (1999) - [j34]Subhash Suri, Philip M. Hubbard, John F. Hughes:
Analyzing bounding boxes for object intersection. ACM Trans. Graph. 18(3): 257-277 (1999) - [c51]John Hershberger, Subhash Suri:
Kinetic Connectivity of Rectangles. SCG 1999: 237-246 - [c50]Milind M. Buddhikot, Subhash Suri, Marcel Waldvogel:
Space Decomposition Techniques for Fast Layer-4 Switching. Protocols for High-Speed Networks 1999: 25-42 - [c49]Venkatachary Srinivasan, Subhash Suri, George Varghese:
Packet Classification Using Tuple Space Search. SIGCOMM 1999: 135-146 - [c48]Adam Smith, Subhash Suri:
Rectangular Tiling in Multi-dimensional Arrays. SODA 1999: 786-794 - [c47]Yunhong Zhou, Subhash Suri:
Analysis of a Bounding Box Heuristic for Object Intersection. SODA 1999: 830-839 - [c46]Subhash Suri, George Varghese:
Packet Filtering in High Speed Networks. SODA 1999: 969-970 - 1998
- [j33]John Hershberger, Subhash Suri:
Practical methods for approximating shortest paths on a convex polytope in R3. Comput. Geom. 10(1): 31-46 (1998) - [j32]Pankaj K. Agarwal, Marc J. van Kreveld, Subhash Suri:
Label placement by maximum independent set in rectangles. Comput. Geom. 11(3-4): 209-218 (1998) - [j31]Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki:
Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. J. ACM 45(5): 863-890 (1998) - [j30]Pankaj K. Agarwal, Subhash Suri:
Surface Approximation and Geometric Partitions. SIAM J. Comput. 27(4): 1016-1035 (1998) - [c45]Pankaj K. Agarwal, Therese Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides:
Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract). SCG 1998: 392-401 - [c44]Venkatachary Srinivasan, George Varghese, Subhash Suri, Marcel Waldvogel:
Fast and Scalable Layer Four Switching. SIGCOMM 1998: 191-202 - [c43]Subhash Suri, Philip M. Hubbard, John F. Hughes:
Collision Detection in Aspect and Scale Bounded Polyhedra. SODA 1998: 127-136 - 1997
- [j29]John Hershberger, Subhash Suri:
Finding a Shortest Diagonal of a Simple Polygon in Linear Time. Comput. Geom. 7: 149-160 (1997) - [j28]Joseph S. B. Mitchell, David M. Mount, Subhash Suri:
Query-Sensitive Ray Shooting. Int. J. Comput. Geom. Appl. 7(4): 317-347 (1997) - [j27]J. Andrew Fingerhut, Subhash Suri, Jonathan S. Turner:
Designing Least-Cost Nonblocking Broadband Networks. J. Algorithms 24(2): 287-309 (1997) - [j26]John Hershberger, Subhash Suri:
Matrix Searching with the Shortest-Path Metric. SIAM J. Comput. 26(6): 1612-1634 (1997) - [c42]Pankaj K. Agarwal, Marc J. van Kreveld, Subhash Suri:
Label placement by maximum independent set in rectangles. CCCG 1997 - [c41]John Hershberger, Subhash Suri:
Efficient Breakout Routing in Printed Circuit Boards. SCG 1997: 460-462 - [c40]Subhash Suri, George Varghese, Girish P. Chandranmenon:
Leap Forward Virtual Clock: A New Fair Queueing Scheme with Guaranteed Delays and Throughput Fairness. INFOCOM 1997: 557-565 - [c39]Subhash Suri, George Varghese, Girish P. Chandranmenon:
Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delays and Throughput Fairness. PODC 1997: 281 - [c38]Sally A. Goldman, Jyoti Parwatikar, Subhash Suri:
On-line Scheduling with Hard Deadlines (Extended Abstract). WADS 1997: 258-271 - [c37]John Hershberger, Subhash Suri:
Efficient Breakout Routing in Printed Circuit Boards (Extended Abstract). WADS 1997: 462-471 - 1996
- [j25]Pankaj K. Agarwal, Subhash Suri:
Simple and Practical Geometric Algorithms. ACM Comput. Surv. 28(4es): 16 (1996) - [j24]John Hershberger, Subhash Suri:
Off-Line Maintenance of Planar Configurations. J. Algorithms 21(3): 453-475 (1996) - [c36]Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki:
Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. STOC 1996: 151-160 - [e1]Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri:
Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings. Lecture Notes in Computer Science 1178, Springer 1996, ISBN 3-540-62048-6 [contents] - 1995
- [j23]Joseph S. B. Mitchell, Subhash Suri:
Separation and Approximation of Polyhedral Objects. Comput. Geom. 5: 95-114 (1995) - [j22]Noga Alon, Sridhar Rajagopalan, Subhash Suri:
Long Non-Crossing Configurations in the Plane. Fundam. Informaticae 22(4): 385-394 (1995) - [j21]Esther M. Arkin, Joseph S. B. Mitchell, Subhash Suri:
Logarithmic-time link path queries in a simple polygon. Int. J. Comput. Geom. Appl. 5(4): 369-395 (1995) - [j20]John Hershberger, Subhash Suri:
A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk. J. Algorithms 18(3): 403-431 (1995) - [c35]Pankaj K. Agarwal, Boris Aronov, Subhash Suri:
Stabbing Triangulations by Lines in 3D. SCG 1995: 267-276 - [c34]Marshall W. Bern, David Eppstein, Leonidas J. Guibas, John Hershberger, Subhash Suri, Jan Wolter:
The Centroid of Points with Approximate Weights. ESA 1995: 460-472 - [c33]John Hershberger, Subhash Suri:
Morphing Binary Trees. SODA 1995: 396-404 - [c32]John Hershberger, Subhash Suri:
Practical Methods for Approximating Shortest Paths on a Convex Polytope in R3. SODA 1995: 447-456 - 1994
- [j19]Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri:
Can Visibility Graphs Be Represented Compactly?. Discret. Comput. Geom. 12: 347-365 (1994) - [j18]John Hershberger, Monika Rauch, Subhash Suri:
Data Structures for Two-Edge Connectivity in Planar Graphs. Theor. Comput. Sci. 130(1): 139-161 (1994) - [c31]Joseph S. B. Mitchell, David M. Mount, Subhash Suri:
Query-Sensitive Ray Shooting. SCG 1994: 359-368 - [c30]Subhash Suri, David Tipper, Gopal Meempat:
A Comparative Evaluation of Space Priority Strategies in ATM Networks. INFOCOM 1994: 516-523 - [c29]Pankaj K. Agarwal, Subhash Suri:
Surface Approximation and Geometric Partitions. SODA 1994: 24-33 - 1993
- [j17]Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri:
Selecting Distances in the Plane. Algorithmica 9(5): 495-514 (1993) - [j16]David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri:
Computing the Intersection-Depth of Polyhedra. Algorithmica 9(6): 518-533 (1993) - [c28]Noga Alon, Sridhar Rajagopalan, Subhash Suri:
Long Non-Crossing Configurations in the Plane. SCG 1993: 257-263 - [c27]Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri:
Can Visibility Graphs be Represented Compactly? SCG 1993: 338-347 - [c26]John Hershberger, Subhash Suri:
Efficient Computation of Euclidean Shortest Paths in the Plane. FOCS 1993: 508-517 - [c25]John Hershberger, Subhash Suri:
A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk. SODA 1993: 54-63 - [c24]John Hershberger, Subhash Suri:
Matrix searching with the shortest path metric. STOC 1993: 485-494 - 1992
- [j15]John Hershberger, Subhash Suri:
Applications of a Semi-Dynamic Convex Hull Algorithm. BIT 32(2): 249-267 (1992) - [j14]Clyde L. Monma, Subhash Suri:
Transitions in Geometric Minimum Spanning Trees. Discret. Comput. Geom. 8: 265-293 (1992) - [c23]Esther M. Arkin, Joseph S. B. Mitchell, Subhash Suri:
Optimal Link Path Queries in a Simple Polygon. SODA 1992: 269-279 - [c22]Joseph S. B. Mitchell, Subhash Suri:
Separation and Approximation of Polyhedral Objects. SODA 1992: 296-306 - [c21]John Hershberger, Monika Rauch, Subhash Suri:
Fully Dynamic 2-Edge-Connectivity in Planar Graphs. SWAT 1992: 233-244 - 1991
- [j13]Pankaj K. Agarwal, Jirí Matousek, Subhash Suri:
Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions. Comput. Geom. 1: 189-201 (1991) - [j12]Pankaj K. Agarwal, Alok Aggarwal, Boris Aronov, S. Rao Kosaraju, Baruch Schieber, Subhash Suri:
Computing external farthest neighbors for a simple polygon. Discret. Appl. Math. 31(2): 97-111 (1991) - [j11]David P. Dobkin, Subhash Suri:
Maintenance of Geometric Extrema. J. ACM 38(2): 275-298 (1991) - [j10]Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri:
Finding k Points with Minimum Diameter and Related Problems. J. Algorithms 12(1): 38-56 (1991) - [j9]John Hershberger, Subhash Suri:
Finding Tailored Partitions. J. Algorithms 12(3): 431-463 (1991) - [j8]Odile Marcotte, Subhash Suri:
Fast Matching Algorithms for Points on a Polygon. SIAM J. Comput. 20(3): 405-422 (1991) - [c20]Clyde L. Monma, Subhash Suri:
Transitions in Geometric Minimum Spanning Trees (Extended Abstract). SCG 1991: 239-249 - [c19]John Hershberger, Subhash Suri:
Offline Maintenance of Planar Configurations. SODA 1991: 32-41 - [c18]Pankaj K. Agarwal, Jirí Matousek, Subhash Suri:
Farthest Neighbours, Maximum Spanning Trees and Related Problems in Higher Dimensions. WADS 1991: 105-116 - 1990
- [j7]Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao:
Computing Euclidean Maximum Spanning Trees. Algorithmica 5(3): 407-419 (1990) - [j6]Alok Aggarwal, Subhash Suri:
Computing the Longest Diagonal of a Simple Polygon. Inf. Process. Lett. 35(1): 13-18 (1990) - [j5]Jörg-Rüdiger Sack, Subhash Suri:
An Optimal Algorithm for Detecting Weak Visibility of a Polygon. IEEE Trans. Computers 39(10): 1213-1219 (1990) - [j4]Subhash Suri:
On some link distance problems in a simple polygon. IEEE Trans. Robotics Autom. 6(1): 108-113 (1990) - [c17]Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri:
Selecting Distances in the Plane. SCG 1990: 321-331 - [c16]David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri:
Implicitly Searching Convolutions and Computing Depth of Collision. SIGAL International Symposium on Algorithms 1990: 165-180 - [c15]John Hershberger, Subhash Suri:
Applications of a Semi-Dynamic Convex Hull Algorithm. SWAT 1990: 380-392
1980 – 1989
- 1989
- [j3]Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap:
Finding Minimal Convex Nested Polygons. Inf. Comput. 83(1): 98-110 (1989) - [j2]Subhash Suri:
Computing Geodesic Furthest Neighbors in Simple Polygons. J. Comput. Syst. Sci. 39(2): 220-235 (1989) - [c14]John Hershberger, Subhash Suri:
Finding Tailored Partitions. SCG 1989: 255-265 - [c13]Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri:
Fining k Points with Minimum Spanning Trees and Related Problems. SCG 1989: 283-291 - [c12]Odile Marcotte, Subhash Suri:
On Geometric Matching. SCG 1989: 302-314 - [c11]Odile Marcotte, Subhash Suri:
Fast Matching Algorithms for Points on a Polygon (Extended Abstract). FOCS 1989: 60-65 - [c10]David P. Dobkin, Subhash Suri:
Dynamically Computing the Maxima of Decomposable Functions, with Applications. FOCS 1989: 488-493 - [c9]Alok Aggarwal, Shlomo Moran, Peter W. Shor, Subhash Suri:
Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version). WADS 1989: 115-134 - 1988
- [j1]William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap:
Computing the Link Center of a Simple Polygon. Discret. Comput. Geom. 3: 281-293 (1988) - [c8]Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao:
Computing Euclidean Maximum Spanning Trees. SCG 1988: 241-251 - [c7]Jörg-Rüdiger Sack, Subhash Suri:
An Optimal Algorithm for Detecting Weak Visibility of a Polygon (Preliminary Version). STACS 1988: 312-321 - 1987
- [c6]William J. Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap:
Computing the Link Center of a Simple Polygon. SCG 1987: 1-10 - [c5]Subhash Suri:
The All-Geodesic-Furthest Neighbor Problem for Simple Polygons. SCG 1987: 64-75 - [c4]Alok Aggarwal, Subhash Suri:
Fast Algorithms for Computing the Largest Empty Rectangle. SCG 1987: 278-290 - 1986
- [c3]Subhash Suri, Joseph O'Rourke:
Worst-Case Optimal Algorithms for Constructing Visibility Polygons with Holes. SCG 1986: 14-23 - 1985
- [c2]Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap:
Finding minimal convex nested polygons. SCG 1985: 296-304 - [c1]Joseph O'Rourke, Subhash Suri, Heather Booth:
Shortest Paths on Polyhedral Surfaces. STACS 1985: 243-254
Coauthor Index
[j102] [j100] [j91] [c157] [c152] [c149] [c143] [j82] [c137] [c127] [c125] [c123] [j70] [j68] [c112] [j63] [j62] [c106] [j61] [c103] [c101] [c100] [j53] [c92] [c88] [c86] [c85] [c82] [c76] [c75] [j44] [c72] [j40] [c69] [c59] [j39] [c56] [j35] [c51] [j33] [j29] [j26] [c41] [c37] [j24] [j20] [c34] [c33] [c32] [j18] [j16] [c26] [c25] [c24] [j15] [c21] [j9] [c19] [c16] [c15] [c14]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
