The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Subhash Suri: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tuomas Sandholm, Subhash Suri
    Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2000, pp:90-97 [Conf]
  2. John Hershberger, Matthew Maxel, Subhash Suri
    Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2003, pp:26-36 [Conf]
  3. Anshul Kothari, Tuomas Sandholm, Subhash Suri
    Solving Combinatorial Exchanges: Optimality via a Few Partial Bids. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2004, pp:1418-1419 [Conf]
  4. Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine
    Winner determination in combinatorial auction generalizations. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2002, pp:69-76 [Conf]
  5. Anshul Kothari, Subhash Suri, Csaba D. Tóth, Yunhong Zhou
    Congestion Games, Load Balancing, and Price of Anarchy. [Citation Graph (0, 0)][DBLP]
    CAAN, 2004, pp:13-27 [Conf]
  6. Pankaj K. Agarwal, Marc J. van Kreveld, Subhash Suri
    Label placement by maximum independent set in rectangles. [Citation Graph (0, 0)][DBLP]
    CCCG, 1997, pp:- [Conf]
  7. Yunhong Zhou, Subhash Suri
    Geometric permutations of balls with bounded size disparity. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:177-180 [Conf]
  8. Shashidhar Mysore, Banit Agrawal, Timothy Sherwood, Nisheeth Shrivastava, Subhash Suri
    Profiling over Adaptive Ranges. [Citation Graph (0, 0)][DBLP]
    CGO, 2006, pp:147-158 [Conf]
  9. Anshul Kothari, Subhash Suri, Yunhong Zhou
    Interval Subset Sum and Uniform-Price Auction Clearing. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:608-620 [Conf]
  10. Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri
    Can Visibility Graphs be Represented Compactly? [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:338-347 [Conf]
  11. Pankaj K. Agarwal, Boris Aronov, Subhash Suri
    Stabbing Triangulations by Lines in 3D. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:267-276 [Conf]
  12. Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri
    Selecting Distances in the Plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:321-331 [Conf]
  13. Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides
    Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:392-401 [Conf]
  14. Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri
    Fining k Points with Minimum Spanning Trees and Related Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:283-291 [Conf]
  15. Alok Aggarwal, Subhash Suri
    Fast Algorithms for Computing the Largest Empty Rectangle. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:278-290 [Conf]
  16. Subhash Suri
    The All-Geodesic-Furthest Neighbor Problem for Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:64-75 [Conf]
  17. Noga Alon, Sridhar Rajagopalan, Subhash Suri
    Long Non-Crossing Configurations in the Plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:257-263 [Conf]
  18. Leonidas J. Guibas, John Hershberger, Subhash Suri, Li Zhang
    Kinetic connectivity for unit disks. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:331-340 [Conf]
  19. John Hershberger, Subhash Suri
    Finding Tailored Partitions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:255-265 [Conf]
  20. John Hershberger, Subhash Suri
    Efficient Breakout Routing in Printed Circuit Boards. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:460-462 [Conf]
  21. John Hershberger, Subhash Suri
    Kinetic Connectivity of Rectangles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:237-246 [Conf]
  22. John Hershberger, Subhash Suri, Csaba D. Tóth
    Binary space partitions of orthogonal subdivisions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:230-238 [Conf]
  23. William 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:1-10 [Conf]
  24. Odile Marcotte, Subhash Suri
    On Geometric Matching. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:302-314 [Conf]
  25. Joseph S. B. Mitchell, David M. Mount, Subhash Suri
    Query-Sensitive Ray Shooting. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:359-368 [Conf]
  26. Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao
    Computing Euclidean Maximum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:241-251 [Conf]
  27. Clyde L. Monma, Subhash Suri
    Transitions in Geometric Minimum Spanning Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:239-249 [Conf]
  28. Subhash Suri, Joseph O'Rourke
    Worst-Case Optimal Algorithms for Constructing Visibility Polygons with Holes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:14-23 [Conf]
  29. Subhash Suri, Csaba D. Tóth, Yunhong Zhou
    Range counting over multidimensional data streams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:160-169 [Conf]
  30. Chiranjeeb Buragohain, Sorabh Gandhi, John Hershberger, Subhash Suri
    Contour Approximation in Sensor Networks. [Citation Graph (0, 0)][DBLP]
    DCOSS, 2006, pp:356-371 [Conf]
  31. Divyakant Agrawal, Amr El Abbadi, Subhash Suri
    Attribute-Based Access to Distributed Data over P2P Networks. [Citation Graph (0, 0)][DBLP]
    DNIS, 2005, pp:244-263 [Conf]
  32. Marshall W. Bern, David Eppstein, Leonidas J. Guibas, John Hershberger, Subhash Suri, Jan Wolter
    The Centroid of Points with Approximate Weights. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:460-472 [Conf]
  33. Yunhong Zhou, Subhash Suri
    Collision Detection Using Bounding Boxes: Convexity Helps. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:437-448 [Conf]
  34. David P. Dobkin, Subhash Suri
    Dynamically Computing the Maxima of Decomposable Functions, with Applications [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:488-493 [Conf]
  35. John Hershberger, Subhash Suri
    Vickrey Prices and Shortest Paths: What is an Edge Worth?. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:252-259 [Conf]
  36. John Hershberger, Subhash Suri
    Erratum to "Vickrey Pricing and Shortest Paths: What is an Edge Worth?". [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:809-0 [Conf]
  37. John Hershberger, Subhash Suri
    Efficient Computation of Euclidean Shortest Paths in the Plane [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:508-517 [Conf]
  38. Odile Marcotte, Subhash Suri
    Fast Matching Algorithms for Points on a Polygon (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:60-65 [Conf]
  39. John Hershberger, Nisheeth Shrivastava, Subhash Suri
    Cluster Hull: A Technique for Summarizing Spatial Data Streams. [Citation Graph (0, 0)][DBLP]
    ICDE, 2006, pp:138- [Conf]
  40. Samphel Norden, Milind M. Buddhikot, Marcel Waldvogel, Subhash Suri
    Routing Bandwidth Guaranteed Paths with Restoration in Label Switched Networks. [Citation Graph (0, 0)][DBLP]
    ICNP, 2001, pp:71-0 [Conf]
  41. Lili Qiu, George Varghese, Subhash Suri
    Fast Firewall Implementations for Software and Hardware-Based Routers. [Citation Graph (0, 0)][DBLP]
    ICNP, 2001, pp:241-250 [Conf]
  42. Tuomas Sandholm, Subhash Suri
    Market Clearability. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2001, pp:1145-1151 [Conf]
  43. Tuomas Sandholm, Subhash Suri, Andrew Gilpin, David Levine
    CABOB: A Fast Optimal Algorithm for Combinatorial Auctions. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2001, pp:1102-1108 [Conf]
  44. Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri
    Power aware routing for sensor databases. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2005, pp:1747-1757 [Conf]
  45. Hari Adiseshu, Subhash Suri, Guru M. Parulkar
    Detecting and Resolving Packet Filter Conflicts. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2000, pp:1203-1212 [Conf]
  46. Jack Snoeyink, Subhash Suri, George Varghese
    A Lower Bound for Multicast Key Distribution. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2001, pp:422-431 [Conf]
  47. Subhash Suri, David Tipper, Gopal Meempat
    A Comparative Evaluation of Space Priority Strategies in ATM Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1994, pp:516-523 [Conf]
  48. Subhash Suri, George Varghese, Girish P. Chandranmenon
    Leap Forward Virtual Clock: A New Fair Queueing Scheme with Guaranteed Delays and Throughput Fairness. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1997, pp:557-565 [Conf]
  49. Priyank Ramesh Warkhede, Subhash Suri, George Varghese
    Fast Packet Classification for Two-Dimensional Conflict-Free Filters. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2001, pp:1434-1443 [Conf]
  50. Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth
    Detecting cuts in sensor networks. [Citation Graph (0, 0)][DBLP]
    IPSN, 2005, pp:210-217 [Conf]
  51. Sorabh Gandhi, John Hershberger, Subhash Suri
    Approximate isocontours and spatial summaries for sensor networks. [Citation Graph (0, 0)][DBLP]
    IPSN, 2007, pp:400-409 [Conf]
  52. Jaspreet Singh, Upamanyu Madhow, Rajesh Kumar, Subhash Suri, Richard E. Cagley
    Tracking multiple targets using binary proximity sensors. [Citation Graph (0, 0)][DBLP]
    IPSN, 2007, pp:529-538 [Conf]
  53. Subhash Suri, Csaba D. Tóth, Yunhong Zhou
    Uncoordinated Load Balancing and Congestion Games in P2P Systems. [Citation Graph (0, 0)][DBLP]
    IPTPS, 2004, pp:123-130 [Conf]
  54. John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth
    Adaptive Spatial Partitioning for Multidimensional Data Streams. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:522-533 [Conf]
  55. Tuomas Sandholm, Subhash Suri
    Market Clearing with Supply and Demand Curves. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:600-611 [Conf]
  56. Amit P. Jardosh, Elizabeth M. Belding-Royer, Kevin C. Almeroth, Subhash Suri
    Towards realistic mobility models for mobile ad hoc networks. [Citation Graph (0, 0)][DBLP]
    MOBICOM, 2003, pp:217-229 [Conf]
  57. Anshul Kothari, Divyakant Agrawal, Abhishek Gupta, Subhash Suri
    Range Addressable Network: A P2P Cache Architecture for Data Ranges. [Citation Graph (0, 0)][DBLP]
    Peer-to-Peer Computing, 2003, pp:14-22 [Conf]
  58. Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri
    A Game Theoretic Framework for Incentives in P2P Systems. [Citation Graph (0, 0)][DBLP]
    Peer-to-Peer Computing, 2003, pp:48-56 [Conf]
  59. Milind M. Buddhikot, Subhash Suri, Marcel Waldvogel
    Space Decomposition Techniques for Fast Layer-4 Switching. [Citation Graph (0, 0)][DBLP]
    Protocols for High-Speed Networks, 1999, pp:25-42 [Conf]
  60. Subhash Suri, George Varghese, Girish P. Chandranmenon
    Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delays and Throughput Fairness. [Citation Graph (0, 0)][DBLP]
    PODC, 1997, pp:281- [Conf]
  61. John Hershberger, Subhash Suri
    Adaptive Sampling for Geometric Problems over Data Streams. [Citation Graph (0, 0)][DBLP]
    PODS, 2004, pp:252-262 [Conf]
  62. John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth
    Space complexity of hierarchical heavy hitters in multi-dimensional data streams. [Citation Graph (0, 0)][DBLP]
    PODS, 2005, pp:338-347 [Conf]
  63. Subhash Suri, Marcel Waldvogel, Priyank Ramesh Warkhede
    Profile-Based Routing: A New Framework for MPLS Traffic Engineering. [Citation Graph (0, 0)][DBLP]
    QofIS, 2001, pp:138-157 [Conf]
  64. Nisheeth Shrivastava, Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri
    Medians and beyond: new aggregation techniques for sensor networks. [Citation Graph (0, 0)][DBLP]
    SenSys, 2004, pp:239-249 [Conf]
  65. Nisheeth Shrivastava, Raghuraman Mudumbai, Upamanyu Madhow, Subhash Suri
    Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms. [Citation Graph (0, 0)][DBLP]
    SenSys, 2006, pp:251-264 [Conf]
  66. David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri
    Implicitly Searching Convolutions and Computing Depth of Collision. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:165-180 [Conf]
  67. Venkatachary Srinivasan, Subhash Suri, George Varghese
    Packet Classification Using Tuple Space Search. [Citation Graph (0, 0)][DBLP]
    SIGCOMM, 1999, pp:135-146 [Conf]
  68. Venkatachary Srinivasan, George Varghese, Subhash Suri, Marcel Waldvogel
    Fast and Scalable Layer Four Switching. [Citation Graph (0, 0)][DBLP]
    SIGCOMM, 1998, pp:191-202 [Conf]
  69. Anshul Kothari, David C. Parkes, Subhash Suri
    Approximately-strategyproof and tractable multi-unit auctions. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2003, pp:166-175 [Conf]
  70. Anshul Kothari, Tuomas Sandholm, Subhash Suri
    Solving combinatorial exchanges: optimality via a few partial bids. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2003, pp:236-237 [Conf]
  71. Lili Qiu, George Varghese, Subhash Suri
    Fast firewall implementations for software-based and hardware-based routers. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS/Performance, 2001, pp:344-345 [Conf]
  72. Pankaj K. Agarwal, Subhash Suri
    Surface Approximation and Geometric Partitions. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:24-33 [Conf]
  73. Esther M. Arkin, Joseph S. B. Mitchell, Subhash Suri
    Optimal Link Path Queries in a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:269-279 [Conf]
  74. John Hershberger, Subhash Suri
    Simplified kinetic connectivity for rectangles and hypercubes. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:158-167 [Conf]
  75. John Hershberger, Subhash Suri
    Binary space partitions for 3D subdivisions. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:100-108 [Conf]
  76. John Hershberger, Subhash Suri
    Offline Maintenance of Planar Configurations. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:32-41 [Conf]
  77. John Hershberger, Subhash Suri
    A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:54-63 [Conf]
  78. John Hershberger, Subhash Suri
    Morphing Binary Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:396-404 [Conf]
  79. John Hershberger, Subhash Suri
    Practical Methods for Approximating Shortest Paths on a Convex Polytope in R3. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:447-456 [Conf]
  80. Joseph S. B. Mitchell, Subhash Suri
    Separation and Approximation of Polyhedral Objects. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:296-306 [Conf]
  81. Adam Smith, Subhash Suri
    Rectangular Tiling in Multi-dimensional Arrays. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:786-794 [Conf]
  82. Subhash Suri, Philip M. Hubbard, John F. Hughes
    Collision Detection in Aspect and Scale Bounded Polyhedra. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:127-136 [Conf]
  83. Subhash Suri, George Varghese
    Packet Filtering in High Speed Networks. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:969-970 [Conf]
  84. Yunhong Zhou, Subhash Suri
    Algorithms for minimum volume enclosing simplex in R3. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:500-509 [Conf]
  85. Yunhong Zhou, Subhash Suri
    Shape sensitive geometric permutations. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:234-243 [Conf]
  86. Yunhong Zhou, Subhash Suri
    Analysis of a Bounding Box Heuristic for Object Intersection. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:830-839 [Conf]
  87. Subhash Suri, Csaba D. Tóth, Yunhong Zhou
    Selfish load balancing and atomic congestion games. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:188-195 [Conf]
  88. John Hershberger, Subhash Suri, Amit M. Bhosle
    On the Difficulty of Some Shortest Path Problems. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:343-354 [Conf]
  89. Joseph O'Rourke, Subhash Suri, Heather Booth
    Shortest Paths on Polyhedral Surfaces. [Citation Graph (0, 0)][DBLP]
    STACS, 1985, pp:243-254 [Conf]
  90. Jörg-Rüdiger Sack, Subhash Suri
    An Optimal Algorithm for Detecting Weak Visibility of a Polygon (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:312-321 [Conf]
  91. Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki
    Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:151-160 [Conf]
  92. John Hershberger, Subhash Suri
    Matrix searching with the shortest path metric. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:485-494 [Conf]
  93. John Hershberger, Monika Rauch, Subhash Suri
    Fully Dynamic 2-Edge-Connectivity in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:233-244 [Conf]
  94. John Hershberger, Subhash Suri
    Applications of a Semi-Dynamic Convex Hull Algorithm. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:380-392 [Conf]
  95. Subhash Suri, Tuomas Sandholm, Priyank Ramesh Warkhede
    Optimal Flow Aggregation. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:462-475 [Conf]
  96. Pankaj K. Agarwal, Jirí Matousek, Subhash Suri
    Farthest Neighbours, Maximum Spanning Trees and Related Problems in Higher Dimensions. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:105-116 [Conf]
  97. Alok Aggarwal, Shlomo Moran, Peter W. Shor, Subhash Suri
    Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:115-134 [Conf]
  98. Sally A. Goldman, Jyoti Parwatikar, Subhash Suri
    On-line Scheduling with Hard Deadlines (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:258-271 [Conf]
  99. John Hershberger, Subhash Suri
    Efficient Breakout Routing in Printed Circuit Boards (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:462-471 [Conf]
  100. Anshul Kothari, Subhash Suri, Yunhong Zhou
    Bandwidth-Constrained Allocation in Grid Computing. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:67-78 [Conf]
  101. Tuomas Sandholm, Subhash Suri
    BOB: Improved winner determination in combinatorial auctions and generalizations. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2003, v:145, n:1-2, pp:33-58 [Journal]
  102. Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri
    Selecting Distances in the Plane. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:5, pp:495-514 [Journal]
  103. David P. Dobkin, John Hershberger, David G. Kirkpatrick, Subhash Suri
    Computing the Intersection-Depth of Polyhedra. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:6, pp:518-533 [Journal]
  104. Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao
    Computing Euclidean Maximum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1990, v:5, n:3, pp:407-419 [Journal]
  105. Subhash Suri, Tuomas Sandholm, Priyank Ramesh Warkhede
    Compressing Two-Dimensional Routing Tables. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:35, n:4, pp:287-300 [Journal]
  106. John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth
    Adaptive Spatial Partitioning for Multidimensional Data Streams. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:46, n:1, pp:97-117 [Journal]
  107. John Hershberger, Subhash Suri
    Applications of a Semi-Dynamic Convex Hull Algorithm. [Citation Graph (0, 0)][DBLP]
    BIT, 1992, v:32, n:2, pp:249-267 [Journal]
  108. Samphel Norden, Milind M. Buddhikot, Marcel Waldvogel, Subhash Suri
    Routing bandwidth-guaranteed paths with restoration in label-switched networks . [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2004, v:46, n:2, pp:197-218 [Journal]
  109. Jack Snoeyink, Subhash Suri, George Varghese
    A lower bound for multicast key distribution. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2005, v:47, n:3, pp:429-441 [Journal]
  110. Priyank Ramesh Warkhede, Subhash Suri, George Varghese
    Multiway range trees: scalable IP lookup with fast updates. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2004, v:44, n:3, pp:289-303 [Journal]
  111. Florin Baboescu, Priyank Ramesh Warkhede, Subhash Suri, George Varghese
    Fast packet classification for two-dimensional conflict-free filters. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2006, v:50, n:11, pp:1831-1842 [Journal]
  112. Subhash Suri, Marcel Waldvogel, Daniel Bauer, Priyank Ramesh Warkhede
    Profile-based routing and traffic engineering. [Citation Graph (0, 0)][DBLP]
    Computer Communications, 2003, v:26, n:4, pp:351-365 [Journal]
  113. Pankaj K. Agarwal, Marc J. van Kreveld, Subhash Suri
    Label placement by maximum independent set in rectangles. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:11, n:3-4, pp:209-218 [Journal]
  114. Pankaj K. Agarwal, Jirí Matousek, Subhash Suri
    Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:189-201 [Journal]
  115. John Hershberger, Subhash Suri
    Finding a Shortest Diagonal of a Simple Polygon in Linear Time. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:7, n:, pp:149-160 [Journal]
  116. John Hershberger, Subhash Suri
    Practical methods for approximating shortest paths on a convex polytope in R3. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:1, pp:31-46 [Journal]
  117. Joseph S. B. Mitchell, Subhash Suri
    Separation and Approximation of Polyhedral Objects. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1995, v:5, n:, pp:95-114 [Journal]
  118. Yunhong Zhou, Subhash Suri
    Geometric permutations of balls with bounded size disparity. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:26, n:1, pp:3-20 [Journal]
  119. Nisheeth Shrivastava, Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri
    Medians and Beyond: New Aggregation Techniques for Sensor Networks [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  120. Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri
    A Game Theoretic Framework for Incentives in P2P Systems [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  121. 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. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 2002, v:34, n:4, pp:550-572 [Journal]
  122. Pankaj K. Agarwal, Subhash Suri
    Simple and Practical Geometric Algorithms. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1996, v:28, n:4es, pp:16- [Journal]
  123. Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri
    Can Visibility Graphs Be Represented Compactly?. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:12, n:, pp:347-365 [Journal]
  124. Leonidas J. Guibas, John Hershberger, Subhash Suri
    Morphing Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:1, pp:1-34 [Journal]
  125. Leonidas J. Guibas, John Hershberger, Subhash Suri, Li Zhang
    Kinetic Connectivity for Unit Disks. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:25, n:4, pp:591-610 [Journal]
  126. Meir Katchalski, Subhash Suri, Yunhong Zhou
    A Constant Bound for Geometric Permutations of Disjoint Unit Balls. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:29, n:2, pp:161-173 [Journal]
  127. William 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. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:281-293 [Journal]
  128. Clyde L. Monma, Subhash Suri
    Transitions in Geometric Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:265-293 [Journal]
  129. Subhash Suri
    Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:31, n:1, pp:1- [Journal]
  130. Subhash Suri, Csaba D. Tóth, Yunhong Zhou
    Range Counting over Multidimensional Data Streams. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:36, n:4, pp:633-655 [Journal]
  131. Anshul Kothari, David C. Parkes, Subhash Suri
    Approximately-strategyproof and tractable multiunit auctions. [Citation Graph (0, 0)][DBLP]
    Decision Support Systems, 2005, v:39, n:1, pp:105-121 [Journal]
  132. Noga Alon, Sridhar Rajagopalan, Subhash Suri
    Long Non-Crossing Configurations in the Plane. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1995, v:22, n:4, pp:385-394 [Journal]
  133. Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap
    Finding Minimal Convex Nested Polygons [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:83, n:1, pp:98-110 [Journal]
  134. Esther M. Arkin, Joseph S. B. Mitchell, Subhash Suri
    Logarithmic-time link path queries in a simple polygon. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:4, pp:369-395 [Journal]
  135. Joseph S. B. Mitchell, David M. Mount, Subhash Suri
    Query-Sensitive Ray Shooting. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:4, pp:317-347 [Journal]
  136. Alok Aggarwal, Subhash Suri
    Computing the Longest Diagonal of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:35, n:1, pp:13-18 [Journal]
  137. Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki
    Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1998, v:45, n:5, pp:863-890 [Journal]
  138. David P. Dobkin, Subhash Suri
    Maintenance of Geometric Extrema. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1991, v:38, n:2, pp:275-298 [Journal]
  139. Yunhong Zhou, Subhash Suri
    Analysis of a bounding box heuristic for object intersection. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1999, v:46, n:6, pp:833-857 [Journal]
  140. Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri
    Finding k Points with Minimum Diameter and Related Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:1, pp:38-56 [Journal]
  141. J. Andrew Fingerhut, Subhash Suri, Jonathan S. Turner
    Designing Least-Cost Nonblocking Broadband Networks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:24, n:2, pp:287-309 [Journal]
  142. Sally A. Goldman, Jyoti Parwatikar, Subhash Suri
    Online Scheduling with Hard Deadlines. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:34, n:2, pp:370-389 [Journal]
  143. John Hershberger, Subhash Suri
    Finding Tailored Partitions. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:3, pp:431-463 [Journal]
  144. John Hershberger, Subhash Suri
    A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:18, n:3, pp:403-431 [Journal]
  145. John Hershberger, Subhash Suri
    Off-Line Maintenance of Planar Configurations. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:21, n:3, pp:453-475 [Journal]
  146. Adam Smith, Subhash Suri
    Rectangular Tiling in Multidimensional Arrays. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:451-467 [Journal]
  147. Subhash Suri
    Computing Geodesic Furthest Neighbors in Simple Polygons. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:39, n:2, pp:220-235 [Journal]
  148. Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides
    Curvature-Constrained Shortest Paths in a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:6, pp:1814-1851 [Journal]
  149. Pankaj K. Agarwal, Subhash Suri
    Surface Approximation and Geometric Partitions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:1016-1035 [Journal]
  150. John Hershberger, Subhash Suri
    Matrix Searching with the Shortest-Path Metric. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:6, pp:1612-1634 [Journal]
  151. John Hershberger, Subhash Suri
    An Optimal Algorithm for Euclidean Shortest Paths in the Plane. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:2215-2256 [Journal]
  152. Odile Marcotte, Subhash Suri
    Fast Matching Algorithms for Points on a Polygon. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:3, pp:405-422 [Journal]
  153. Yunhong Zhou, Subhash Suri
    Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1339-1357 [Journal]
  154. John Hershberger, Subhash Suri, Amit M. Bhosle
    On the difficulty of some shortest path problems. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:1, pp:- [Journal]
  155. Jörg-Rüdiger Sack, Subhash Suri
    An Optimal Algorithm for Detecting Weak Visibility of a Polygon. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1990, v:39, n:10, pp:1213-1219 [Journal]
  156. John Hershberger, Monika Rauch, Subhash Suri
    Data Structures for Two-Edge Connectivity in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:130, n:1, pp:139-161 [Journal]
  157. Subhash Suri, Philip M. Hubbard, John F. Hughes
    Analyzing bounding boxes for object intersection. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Graph., 1999, v:18, n:3, pp:257-277 [Journal]
  158. Subhash Suri, Elias Vicari, Peter Widmayer
    Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:1114-1120 [Conf]
  159. Chiranjeeb Buragohain, Subhash Suri, Csaba D. Tóth, Yunhong Zhou
    Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:210-221 [Conf]
  160. Chiranjeeb Buragohain, Nisheeth Shrivastava, Subhash Suri
    Space Efficient Streaming Algorithms for the Maximum Error Histogram. [Citation Graph (0, 0)][DBLP]
    ICDE, 2007, pp:1026-1035 [Conf]
  161. Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri
    Distributed Navigation Algorithms for Sensor Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2006, pp:- [Conf]
  162. Subhash Suri, Csaba D. Tóth, Yunhong Zhou
    Selfish Load Balancing and Atomic Congestion Games. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:1, pp:79-96 [Journal]
  163. Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri
    Power Aware Routing for Sensor Databases [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]

  164. Untangling the Braid: Finding Outliers in a Set of Streams. [Citation Graph (, )][DBLP]


  165. Counting Targets with Mobile Sensors in an Unknown Environment. [Citation Graph (, )][DBLP]


  166. Simple Robots in Polygonal Environments: A Hierarchy. [Citation Graph (, )][DBLP]


  167. Target Counting under Minimal Sensing: Complexity and Approximations. [Citation Graph (, )][DBLP]


  168. Robot kabaddi. [Citation Graph (, )][DBLP]


  169. Finding minimal convex nested polygons. [Citation Graph (, )][DBLP]


  170. 07151 Abstracts Collection -- Geometry in Sensor Networks. [Citation Graph (, )][DBLP]


  171. Space-efficient online approximation of time series data: Streams, amnesia, and out-of-order. [Citation Graph (, )][DBLP]


  172. eBay in the Sky: strategy-proof wireless spectrum auctions. [Citation Graph (, )][DBLP]


  173. Catching elephants with mice: sparse sampling for monitoring sensor networks. [Citation Graph (, )][DBLP]


  174. GAMPS: compressing multi sensor data by grouping and amplitude scaling. [Citation Graph (, )][DBLP]


  175. Reconstructing Visibility Graphs with Simple Robots. [Citation Graph (, )][DBLP]


  176. Angle Optimization in Target Tracking. [Citation Graph (, )][DBLP]


  177. Simplified Planar Coresets for Data Streams. [Citation Graph (, )][DBLP]


  178. Bandwidth-Constrained Allocation in Grid Computing. [Citation Graph (, )][DBLP]


  179. Towards real-time dynamic spectrum auctions. [Citation Graph (, )][DBLP]


  180. A game-theoretic analysis of wireless access point selection by mobile users. [Citation Graph (, )][DBLP]


  181. Adaptive sampling for geometric problems over data streams. [Citation Graph (, )][DBLP]


  182. Distributed Navigation Algorithms for Sensor Networks [Citation Graph (, )][DBLP]


  183. Untangling the Braid: Finding Outliers in a Set of Streams [Citation Graph (, )][DBLP]


  184. Computing external farthest neighbors for a simple polygon. [Citation Graph (, )][DBLP]


Search in 0.049secs, Finished in 0.060secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002