| A bottleneck matching problem with edge-crossing constraints JG Carlsson, B Armbruster, S Rahul, H Bellam International Journal of Computational Geometry & Applications 25 (04), 245-261, 2015 | 29 | 2015 |
| Algorithms for range-skyline queries S Rahul, R Janardan Proceedings of the 20th International Conference on Advances in Geographic …, 2012 | 28 | 2012 |
| Improved Bounds for Orthogonal Point Enclosure Query and Point Location in Orthogonal Subdivisions in ℝ3 S Rahul Proceedings of the twenty-sixth annual ACM-SIAM Symposium on Discrete …, 2014 | 21 | 2014 |
| Orthogonal point location and rectangle stabbing queries in 3-d TM Chan, Y Nekrich, S Rahul, K Tsakalidis arXiv preprint arXiv:1805.08602, 2018 | 19 | 2018 |
| Computational geometry: Generalized (or colored) intersection searching P Gupta, R Janardan, S Rahul, M Smid Handbook of Data Structures and Applications, 1043-1058, 2018 | 19 | 2018 |
| On top-k range reporting in 2d space S Rahul, Y Tao Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2015 | 18 | 2015 |
| Efficient top-k indexing via general reductions S Rahul, Y Tao Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2016 | 17 | 2016 |
| Efficient Top-k Queries for Orthogonal Ranges S Rahul, P Gupta, R Janardan, KS Rajan WALCOM: Algorithms and Computation: 5th International Workshop, WALCOM 2011 …, 2011 | 17 | 2011 |
| Approximate range counting revisited S Rahul arXiv preprint arXiv:1512.01713, 2015 | 15 | 2015 |
| Range-aggregate queries involving geometric aggregation operations S Rahul, AS Das, KS Rajan, K Srinathan WALCOM: Algorithms and Computation: 5th International Workshop, WALCOM 2011 …, 2011 | 14 | 2011 |
| A General Technique for Top-Geometric Intersection Query Problems S Rahul, R Janardan IEEE Transactions on Knowledge and Data Engineering 26 (12), 2859-2871, 2014 | 13 | 2014 |
| New bounds for range closest-pair problems J Xue, Y Li, S Rahul, R Janardan arXiv preprint arXiv:1712.09749, 2017 | 10 | 2017 |
| Online and dynamic algorithms for geometric set cover and hitting set A Khan, A Lonkar, S Rahul, A Subramanian, A Wiese arXiv preprint arXiv:2303.09524, 2023 | 9 | 2023 |
| Active-learning a convex body in low dimensions S Har-Peled, M Jones, S Rahul Algorithmica 83, 1885-1917, 2021 | 7 | 2021 |
| Range closest-pair search in higher dimensions TM Chan, S Rahul, J Xue Computational Geometry 91, 101669, 2020 | 7 | 2020 |
| Orthogonal point location and rectangle stabbing queries in 3-d T Chan, Y Nekrich, S Rahul, K Tsakalidis Journal of Computational Geometry 13 (1), 399–428-399–428, 2022 | 6 | 2022 |
| A guide to designing top-k indexes S Rahul, Y Tao ACM SIGMOD Record 48 (2), 6-17, 2019 | 6 | 2019 |
| Range aggregate structures for colored geometric objects. S Rahul, H Bellam, P Gupta, K Rajan CCCG, 249-252, 2010 | 6 | 2010 |
| Approximate range counting revisited S Rahul Journal of Computational Geometry 12 (1), 40–69-40–69, 2021 | 5 | 2021 |
| Searching for the closest-pair in a query translate J Xue, Y Li, S Rahul, R Janardan arXiv preprint arXiv:1807.09498, 2018 | 4 | 2018 |
Ravi JanardanUniversity of Minnesota-Twin Cities在 umn.edu 的电子邮件经过验证
