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