| Year |
Citation |
Score |
| 2020 |
Bandyapadhyay S, Kumar N, Suri S, Varadarajan KR. Improved approximation bounds for the minimum constraint removal problem Computational Geometry: Theory and Applications. 90: 101650. DOI: 10.1016/J.Comgeo.2020.101650 |
0.463 |
|
| 2020 |
Schibler T, Suri S. K-dominance in multidimensional data: Theory and applications Computational Geometry: Theory and Applications. 87: 101594. DOI: 10.1016/J.Comgeo.2019.101594 |
0.357 |
|
| 2020 |
Hershberger J, Kumar N, Suri S. Shortest Paths in the Plane with Obstacle Violations Algorithmica. 82: 1813-1832. DOI: 10.1007/S00453-020-00673-Y |
0.381 |
|
| 2019 |
Bandyapadhyay S, Maheshwari A, Mehrabi S, Suri S. Approximating dominating set on intersection graphs of rectangles and L-frames Computational Geometry: Theory and Applications. 82: 32-44. DOI: 10.1016/J.Comgeo.2019.04.004 |
0.387 |
|
| 2017 |
Cieslak M, Brennan T, Meiring W, Volz LJ, Greene C, Asturias A, Suri S, Grafton ST. Analytic tractography: A closed-form solution for estimating local white matter connectivity with diffusion MRI. Neuroimage. PMID 29274744 DOI: 10.1016/J.Neuroimage.2017.12.039 |
0.318 |
|
| 2017 |
Dijk TCv, Fink M, Fischer N, Lipp F, Markfelder P, Ravsky A, Suri S, Wolff A. Block Crossings in Storyline Visualizations Journal of Graph Algorithms and Applications. 21: 873-913. DOI: 10.7155/Jgaa.00443 |
0.392 |
|
| 2017 |
Fink M, Hershberger J, Kumar N, Suri S. Hyperplane separability and convexity of probabilistic point sets Journal of Computational Geometry. 8: 32-57. DOI: 10.20382/Jocg.V8I2A3 |
0.479 |
|
| 2017 |
Agarwal PK, Kumar N, Sintos S, Suri S. Range-max queries on uncertain data Journal of Computer and System Sciences. 94: 118-134. DOI: 10.1016/J.Jcss.2017.09.006 |
0.466 |
|
| 2016 |
Kumar N, Suri S. Containment and evasion in stochastic point data Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9644: 576-589. DOI: 10.1007/978-3-662-49529-2_43 |
0.31 |
|
| 2015 |
Hoffmann F, Kriegel K, Suri S, Verbeek K, Willert M. Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries Leibniz International Proceedings in Informatics, Lipics. 34: 421-435. DOI: 10.1016/J.Comgeo.2018.01.003 |
0.437 |
|
| 2015 |
Klein K, Suri S. Capture bounds for visibility-based pursuit evasion Computational Geometry: Theory and Applications. 48: 205-220. DOI: 10.1016/J.Comgeo.2014.10.002 |
0.763 |
|
| 2015 |
Klein K, Suri S. Pursuit Evasion on Polyhedral Surfaces Algorithmica. DOI: 10.1007/S00453-015-9988-7 |
0.753 |
|
| 2015 |
Han F, Suri S, Yan X. Observability of Lattice Graphs Algorithmica. DOI: 10.1007/S00453-015-0049-Z |
0.387 |
|
| 2015 |
Yıldız H, Suri S. Computing Klee’s Measure of Grounded Boxes Algorithmica. 71: 307-329. DOI: 10.1007/S00453-013-9797-9 |
0.738 |
|
| 2014 |
Suri S, Verbeek K. On the most likely voronoi diagram and nearest neighbor searching Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8889: 338-350. DOI: 10.1142/S0218195916600025 |
0.454 |
|
| 2014 |
Bopardikar SD, Suri S. K-Capture in multiagent pursuit evasion, or the lion and the hyenas Theoretical Computer Science. 522: 13-23. DOI: 10.1016/J.Tcs.2013.12.001 |
0.334 |
|
| 2014 |
Verbeek K, Suri S. Metric embedding, hyperbolic space, and social networks Proceedings of the Annual Symposium On Computational Geometry. 501-510. DOI: 10.1016/J.Comgeo.2016.08.003 |
0.429 |
|
| 2014 |
Kamousi P, Chan TM, Suri S. Closest pair and the post office problem for stochastic points Computational Geometry: Theory and Applications. 47: 214-223. DOI: 10.1016/J.Comgeo.2012.10.010 |
0.764 |
|
| 2014 |
Agarwal PK, Har-Peled S, Suri S, YIldIz H, Zhang W. Convex hulls under uncertainty Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8737: 37-48. DOI: 10.1007/S00453-016-0195-Y |
0.736 |
|
| 2014 |
Bärtschi A, Suri S. Erratum to: Conflict-Free Chromatic Art Gallery Coverage Algorithmica. 68: 284-285. DOI: 10.1007/S00453-013-9852-6 |
0.404 |
|
| 2014 |
Bärtschi A, Suri S. Conflict-free chromatic art gallery coverage Algorithmica. 68: 265-283. DOI: 10.1007/S00453-012-9732-5 |
0.427 |
|
| 2014 |
Foschini L, Hershberger J, Suri S. On the complexity of time-dependent shortest paths Algorithmica. 68: 1075-1097. DOI: 10.1007/S00453-012-9714-7 |
0.378 |
|
| 2013 |
Kamousi P, Suri S. Euclidean traveling salesman tours through stochastic neighborhoods Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8283: 644-654. DOI: 10.1007/978-3-642-45030-3_60 |
0.733 |
|
| 2013 |
Li Y, Kamousi P, Han F, Yang S, Yan X, Suri S. Memory efficient minimum substring partitioning Proceedings of the Vldb Endowment. 6: 169-180. |
0.737 |
|
| 2012 |
Bhadauria D, Klein K, Isler V, Suri S. Capturing an evader in polygonal environments with obstacles: The full visibility case International Journal of Robotics Research. 31: 1176-1189. DOI: 10.1177/0278364912452894 |
0.752 |
|
| 2012 |
Yildiz H, Suri S. On Klee's measure problem for grounded boxes Proceedings of the Annual Symposium On Computational Geometry. 111-120. DOI: 10.1145/2261250.2261267 |
0.336 |
|
| 2012 |
Bilò D, Disser Y, Mihalák M, Suri S, Vicari E, Widmayer P. Reconstructing visibility graphs with simple robots Theoretical Computer Science. 444: 52-59. DOI: 10.1016/J.Tcs.2012.01.008 |
0.32 |
|
| 2011 |
Kamousi P, Chan TM, Suri S. Stochastic minimum spanning trees in Euclidean spaces Proceedings of the Annual Symposium On Computational Geometry. 65-74. DOI: 10.1145/1998196.1998206 |
0.781 |
|
| 2011 |
Singh J, Kumar R, Madhow U, Suri S, Cagley R. Multiple-target tracking with binary proximity sensors Acm Transactions On Sensor Networks. 8. DOI: 10.1145/1993042.1993047 |
0.307 |
|
| 2011 |
Kamousi P, Suri S. Stochastic minimum spanning trees and related problems 8th Workshop On Analytic Algorithmics and Combinatorics 2011, Analco 2011. 107-116. |
0.771 |
|
| 2010 |
Gandhi S, Foschini L, Suri S. Space-efficient online approximation of time series data: Streams, amnesia, and out-of-order Proceedings - International Conference On Data Engineering. 924-935. DOI: 10.1109/ICDE.2010.5447930 |
0.306 |
|
| 2009 |
Gandhi S, Suri S, Welzl E. Catching elephants with mice: Sparse sampling for monitoring sensor networks Acm Transactions On Sensor Networks. 6. DOI: 10.1145/1653760.1653761 |
0.575 |
|
| 2009 |
Shrivastava N, Mudumbai R, Madhow U, Suri S. Target tracking with binary proximity sensors Acm Transactions On Sensor Networks. 5. DOI: 10.1145/1614379.1614382 |
0.571 |
|
| 2008 |
Suri S, Vicari E, Widmayer P. Simple robots with minimal sensing: From local visibility to global geometry International Journal of Robotics Research. 27: 1055-1067. DOI: 10.1177/0278364908095833 |
0.332 |
|
| 2008 |
Hershberger J, Shrivastava N, Suri S. Summarizing spatial data streams using ClusterHulls Journal of Experimental Algorithmics. 13. DOI: 10.1145/1412228.1412238 |
0.634 |
|
| 2008 |
Mysore S, Agrawal B, Neuber R, Sherwood T, Shrivastava N, Suri S. Formulating and implementing profiling over adaptive ranges Transactions On Architecture and Code Optimization. 5. DOI: 10.1145/1369396.1369398 |
0.576 |
|
| 2008 |
Shrivastava N, Suri S, Tóth CD. Detecting cuts in sensor networks Acm Transactions On Sensor Networks. 4. DOI: 10.1145/1340771.1340776 |
0.588 |
|
| 2008 |
Gandhi S, Buragohain C, Cao L, Zheng H, Suri S. Towards real-time dynamic spectrum auctions Computer Networks. 52: 879-897. DOI: 10.1016/J.Comnet.2007.11.003 |
0.574 |
|
| 2008 |
Hershberger J, Suri S. Adaptive sampling for geometric problems over data streams Computational Geometry: Theory and Applications. 39: 191-208. DOI: 10.1016/J.Comgeo.2006.10.004 |
0.405 |
|
| 2008 |
Kothari A, Suri S, Zhou Y. Bandwidth-constrained allocation in grid computing Algorithmica (New York). 52: 487-501. DOI: 10.1007/S00453-007-9085-7 |
0.326 |
|
| 2007 |
Hershberger J, Maxel M, Suri S. Finding the k shortest simple paths: A new algorithm and its implementation Acm Transactions On Algorithms. 3. DOI: 10.1145/1290672.1290682 |
0.4 |
|
| 2007 |
Hershberger J, Suri S, Bhosle A. On the difficulty of some shortest path problems Acm Transactions On Algorithms. 3. DOI: 10.1145/1186810.1186815 |
0.451 |
|
| 2007 |
Suri S, Tóth CD, Zhou Y. Selfish load balancing and atomic congestion games Algorithmica (New York). 47: 79-96. DOI: 10.1007/S00453-006-1211-4 |
0.363 |
|
| 2006 |
Baboescu F, Warkhede P, Suri S, Varghese G. Fast packet classification for two-dimensional conflict-free filters Computer Networks. 50: 1831-1842. DOI: 10.1016/J.Comnet.2005.08.004 |
0.356 |
|
| 2006 |
Suri S, Toth CD, Zhou Y. Range counting over multidimensional data streams Discrete and Computational Geometry. 36: 633-655. DOI: 10.1007/S00454-006-1269-4 |
0.421 |
|
| 2006 |
Hershberger J, Shrivastava N, Suri S, Toth CD. Adaptive spatial partitioning for multidimensional data streams Algorithmica (New York). 46: 97-117. DOI: 10.1007/S00453-006-0070-3 |
0.593 |
|
| 2005 |
Sandholm T, Suri S, Gilpin A, Levine D. CABOB: A fast optimal algorithm for winner determination in combinatorial auctions Management Science. 51: 374-390. DOI: 10.1287/Mnsc.1040.0336 |
0.433 |
|
| 2005 |
Hershberger J, Suri S, Tóth CD. Binary space partitions of orthogonal subdivisions Siam Journal On Computing. 34: 1380-1397. DOI: 10.1137/S0097539704445706 |
0.387 |
|
| 2005 |
Kothari A, Suri S, Zhou Y. Interval subset sum and uniform-price auction clearing Lecture Notes in Computer Science. 3595: 608-620. |
0.309 |
|
| 2004 |
Warkhede P, Suri S, Varghese G. Multiway range trees: scalable IP lookup with fast updates Computer Networks. 44: 289-303. DOI: 10.1016/J.Comnet.2003.09.004 |
0.318 |
|
| 2003 |
Suri S, Waldvogel M, Bauer D, Warkhede PR. Profile-based routing and traffic engineering Computer Communications. 26: 351-365. DOI: 10.1016/S0140-3664(02)00154-8 |
0.387 |
|
| 2003 |
Sandholm T, Suri S. BOB: improved winner determination in combinatorial auctions and generalizations Artificial Intelligence. 145: 33-58. DOI: 10.1016/S0004-3702(03)00015-8 |
0.376 |
|
| 2003 |
Katchalski M, Suri S, Zhou Y. A Constant Bound for Geometric Permutations of Disjoint Unit Balls Discrete and Computational Geometry. 29: 161-173. DOI: 10.1007/S00454-002-2828-Y |
0.371 |
|
| 2003 |
Suri S, Sandholm T, Warkhede PR. Compressing Two-Dimensional Routing Tables Algorithmica. 35: 287-300. DOI: 10.1007/S00453-002-1000-7 |
0.374 |
|
| 2002 |
Zhou Y, Suri S. Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions Siam Journal On Computing. 31: 1339-1357. DOI: 10.1137/S0097539799363992 |
0.41 |
|
| 2002 |
Agarwal PK, Biedl T, Lazard S, Robbins S, Suri S, Whitesides S. Curvature-constrained shortest paths in a convex polygon Siam Journal On Computing. 31: 1814-1851. DOI: 10.1137/S0097539700374550 |
0.445 |
|
| 2001 |
Guibas L, Hershberger J, Suri S, Zhang L. Kinetic Connectivity for Unit Disks Discrete & Computational Geometry. 25: 591-610. DOI: 10.1007/S00454-001-0015-1 |
0.405 |
|
| 2001 |
Suri S, Waldvogel M, Warkhede PR. Profile-Based Routing: A New Framework for MPLS Traffic Engineering Lecture Notes in Computer Science. 138-157. DOI: 10.1007/3-540-45412-8_11 |
0.385 |
|
| 2000 |
Smith A, Suri S. Rectangular Tiling in Multidimensional Arrays Journal of Algorithms. 37: 451-467. DOI: 10.1006/Jagm.2000.1109 |
0.42 |
|
| 1999 |
Suri S, Hubbard PM, Hughes JF. Analyzing bounding boxes for object intersection Acm Transactions On Graphics. 18: 257-277. DOI: 10.1145/336414.336423 |
0.418 |
|
| 1999 |
Hershberger J, Suri S. An Optimal Algorithm for Euclidean Shortest Paths in the Plane Siam Journal On Computing. 28: 2215-2256. DOI: 10.1137/S0097539795289604 |
0.479 |
|
| 1998 |
Bshouty NH, Goldman SA, Mathias HD, Suri S, Tamaki H. Noise-tolerant distribution-free learning of general geometric concepts Journal of the Acm (Jacm). 45: 863-890. DOI: 10.1145/290179.290184 |
0.326 |
|
| 1998 |
Agarwal PK, Suri S. Surface Approximation and Geometric Partitions Siam Journal On Computing. 27: 1016-1035. DOI: 10.1137/S0097539794269801 |
0.444 |
|
| 1998 |
Agarwal PK, Kreveld Mv, Suri S. Label placement by maximum independent set in rectangles Computational Geometry: Theory and Applications. 11: 209-218. DOI: 10.1016/S0925-7721(98)00028-5 |
0.409 |
|
| 1998 |
Hershberger J, Suri S. Practical methods for approximating shortest paths on a convex polytope in R3 Computational Geometry: Theory and Applications. 10: 31-46. DOI: 10.1016/S0925-7721(97)00004-7 |
0.453 |
|
| 1997 |
Mitchell JSB, Mount DM, Suri S. Query-Sensitive Ray Shooting International Journal of Computational Geometry and Applications. 7: 317-347. DOI: 10.1142/S021819599700020X |
0.368 |
|
| 1997 |
Hershberger J, Suri S. Matrix Searching with the Shortest-Path Metric Siam Journal On Computing. 26: 1612-1634. DOI: 10.1137/S0097539793253577 |
0.458 |
|
| 1997 |
Hershberger J, Suri S. Finding a shortest diagonal of a simple polygon in linear time Computational Geometry: Theory and Applications. 7: 149-160. DOI: 10.1016/0925-7721(95)00032-1 |
0.441 |
|
| 1997 |
Fingerhut JA, Suri S, Turner JS. Designing Least-Cost Nonblocking Broadband Networks Journal of Algorithms. 24: 287-309. DOI: 10.1006/Jagm.1997.0866 |
0.302 |
|
| 1996 |
Agarwal PK, Suri S. Simple and practical geometric algorithms Acm Computing Surveys. 28: 16. DOI: 10.1145/242224.242244 |
0.315 |
|
| 1996 |
Hershberger J, Suri S. Off-Line Maintenance of Planar Configurations Journal of Algorithms. 21: 453-475. DOI: 10.1006/Jagm.1996.0054 |
0.422 |
|
| 1995 |
Alon N, Rajagopalan S, Suri S. Long Non-Crossing Configurations In The Plane Fundamenta Informaticae. 22: 385-394. DOI: 10.3233/Fi-1995-2245 |
0.351 |
|
| 1995 |
Arkin EM, Mitchell JSB, Suri S. Logarithmic-Time Link Path Queries In A Simple Polygon International Journal of Computational Geometry and Applications. 5: 369-395. DOI: 10.1142/S0218195995000234 |
0.438 |
|
| 1995 |
Mitchell JSB, Suri S. Separation and approximation of polyhedral objects Computational Geometry: Theory and Applications. 5: 95-114. DOI: 10.1016/0925-7721(95)00006-U |
0.438 |
|
| 1994 |
Hershberger J, Rauch M, Suri S. Data structures for two-edge connectivity in planar graphs Theoretical Computer Science. 130: 139-161. DOI: 10.1016/0304-3975(94)90156-2 |
0.422 |
|
| 1994 |
Agarwal PK, Alon N, Aronov B, Suri S. Can visibility graphs Be represented compactly? Discrete &Amp; Computational Geometry. 12: 347-365. DOI: 10.1007/Bf02574385 |
0.36 |
|
| 1993 |
Dobkin D, Hershberger J, Kirkpatrick D, Suri S. Computing the intersection-depth of polyhedra Algorithmica. 9: 518-533. DOI: 10.1007/Bf01190153 |
0.401 |
|
| 1993 |
Agarwal PK, Aronov B, Sharir M, Suri S. Selecting distances in the plane Algorithmica. 9: 495-514. DOI: 10.1007/Bf01187037 |
0.423 |
|
| 1992 |
Hershberger J, Suri S. Applications of a semi-dynamic convex hull algorithm Bit. 32: 249-267. DOI: 10.1007/Bf01994880 |
0.427 |
|
| 1991 |
Bienstock D, Chung F, Fredman ML, Schäffer AA, Shor PW, Suri S. A note on finding a strict saddlepoint American Mathematical Monthly. 98: 418-419. DOI: 10.2307/2323858 |
0.34 |
|
| 1991 |
Dobkin D, Suri S. Maintenance of geometric extrema Journal of the Acm. 38: 275-298. DOI: 10.1145/103516.103518 |
0.312 |
|
| 1991 |
Marcotte O, Suri S. Fast matching algorithms for points on a polygon Siam Journal On Computing. 20: 405-422. DOI: 10.1137/0220026 |
0.481 |
|
| 1991 |
Agarwal KP, Matousek J, Suri S. Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions Computational Geometry: Theory and Applications. 1: 189-201. DOI: 10.1016/0925-7721(92)90001-9 |
0.44 |
|
| 1991 |
Aggarwal A, Imai H, Katoh N, Suri S. Finding k points with minimum diameter and related problems Journal of Algorithms. 12: 38-56. DOI: 10.1016/0196-6774(91)90022-Q |
0.437 |
|
| 1991 |
Hershberger J, Suri S. Finding tailored partitions Journal of Algorithms. 12: 431-463. DOI: 10.1016/0196-6774(91)90013-O |
0.417 |
|
| 1990 |
Aggarwal A, Suri S. Computing the longest diagonal of a simple polygon Information Processing Letters. 35: 13-18. DOI: 10.1016/0020-0190(90)90167-V |
0.439 |
|
| 1990 |
Monma C, Paterson M, Suri S, Yao F. Computing euclidean maximum spanning trees Algorithmica. 5: 407-419. DOI: 10.1007/Bf01840396 |
0.495 |
|
| 1989 |
Aggarwal A, Booth H, O'Rourke J, Suri S, Yap CK. Finding minimal convex nested polygons Information and Computation. 83: 98-110. DOI: 10.1016/0890-5401(89)90049-7 |
0.446 |
|
| 1989 |
Suri S. Computing geodesic furthest neighbors in simple polygons Journal of Computer and System Sciences. 39: 220-235. DOI: 10.1016/0022-0000(89)90045-7 |
0.466 |
|
| 1986 |
Suri S. A linear time algorithm with minimum link paths inside a simple polygon Graphical Models \/Graphical Models and Image Processing \/Computer Vision, Graphics, and Image Processing. 35: 99-110. DOI: 10.1016/0734-189X(86)90127-1 |
0.388 |
|
| Show low-probability matches. |