Selected Recent Publications
2023
-
Fault Tolerance in Euclidean Committee Selection.
Chinmay Sonar, Subhash Suri and Jie Xue.
European Symposium on Algorithms
(ESA 2023), Amsterdam, Sept 4-6, 2023.
-
Spanning Tree, Matching, and TSP for Moving Points: Complexity and Regret.
Nathan Wachholz and Subhash Suri.
35nd Annual Canadian Conference on Computational Geometry (CCCG), Montreal, Canada, Aug 2-4, 2023.
2022
-
Multiwinner Elections under Minimax Chamberlin-Courant Rule in Euclidean Space.
Chinmay Sonar, Subhash Suri and Jie Xue.
31st International Joint Conference on Artificial Intelligence
(IJCAI 2022), Vienna, Austria, July 23--29, 2022.
-
A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane.
John Hershberger, Subhash Suri and Hakan Yıldız.
SIAM Journal of Computing, Vol 51 (4), 2022.
-
Dynamic geometric set cover and hitting set.
Pankaj K. Agarwal, Hsien-Chih Chang, Subhash Suri, Allen Xiao and Jie Xue.
To appear in ACM Transactions on Algorithms, July 2022.
-
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles.
Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri and Jie Xue.
Symposium on Computational Geometry (SoCG), Berlin, Germany, June 7--10 2022.
-
The Maximum Exposure Problem.
Neeraj Kumar, Stavros Sintos and Subhash Suri.
Computational Geometty, Vol. 104, June 2022.
-
Dynamic Geometric Set Cover, Revisited.
Timothy M. Chan, Qizheng He, Subhash Suri and Jie Xue.
Symposium on Discrete Algorithms (SODA), 2022.
2021
-
An ETH-tight Algorithm for Multi-Team Formation
Daniel Lokshtanov, Saket Saurabh, Subhash Suri and Jie Xue.
41st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2021.
-
Anonymity-Preserving Space Partitions
Ursula Hebert-Johnson, Chinmay Sonar, Subhash Suri and Vaishali Surianarayanan.
32nd International Symposium on Algorithms and Computation (ISAAC), 2021.
-
Efficient Algorithms for Least Square Piecewise Polynomial Regression
Daniel Lokshtanov, Subhash Suri and Jie Xue.
European Symposium on Algorithms (ESA), 2021.
-
A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane.
Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh and Subhash Suri.
Symposium on Discrete Algorithms (SODA), 2021.
2020
-
Dynamic geometric set cover and hitting set.
Pankaj K. Agarwal, Hsien-Chih Chang, Subhash Suri, Allen Xiao and Jie Xue.
Symposium on Computational Geometry (SoCG), Zurich, Switzerland, June 23-26, 2020.
-
Fair Covering of Points by Balls.
Daniel Lokshtanov, Chinmay Sonar, Subhash Suri, Jie Xue.
32nd Canadian Conference on Computational Geometry (CCCG), 2020.
-
Shortest Paths in the Plane with Obstacle Violations.
John Hershberger, Neeraj Kumar and Subhash Suri.
Algorithmica 82(7), 1813-1832, 20209.
-
Improved Approximation Bounds for the Minimum Constraint Removal Problem.
Sayan Bandyapadhyay, Neeraj Kumar, Subhash Suri and Kasturi Varadarajan.
Computational Geometry: Theory and Applications, Vol 90, April 2020.
-
K-Dominance in Multidimensional Data: Theory and Applications.
Thomas Schibler and Subhash Suri.
Invited paper in Special Issue of Computational Geometry: Theory and Applications,
Vol 87, Elsevier, 2020.
2019
-
The Maximum Exposure Problem.
Neeraj Kumar, Stavros Sintos and Subhash Suri.
Proc. of APPROX'19: Int. Conference on Approximation Algorithms for Combinatorial
Optimization Problems, MIT, Boston, Sept. 20-22, 2019.
-
On Multi-Dimensional Team Formation.
Thomas Schibler, Ambuj Singh and Subhash Suri.
Proc. of CCCG'19: 31st Canadian Conference in Computational Geometry,
Edmonton, Alberta, Canada, August 8-10, 2019.
-
Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames.
Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri.
Computational Geometry: Theory and Applications, Vol. 82, pp. 32-44, 2019.
2018
-
Tight Bounds for Conflict-free Chromatic Guarding of Orthogonal Art Galleries.
Frank Hoffmann, Klaus Kriegel, Subhash Suri, Kevin Verbeek, Max Willert.
Computational Geometry: Theory and Applications, Elsevier, 73, 24-34, 2018.
-
Improved Approximation Bounds for the Minimum Constraint Removal Problem.
Sayan Bandyapadhyay, Neeraj Kumar, Subhash Suri and Kasturi Varadarajan.
Proc. of APPROX '18, Aug 20-22,
Princeton, USA.
-
Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames.
Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri.
Proc. of 43rd International Symposium on Mathematical Foundations of Computer Science
(MFCS), Liverppol, UK, 2018.
-
Computing Shortest Paths in the Plane with Removable Obstacles.
Pankaj Agarwal, Neeraj Kumar, Stavros Sintos and Subhash Suri.
Proc. of SWAT'18, June 18-20, Malmo, Sweden.
-
Range-Max Queries on Uncertain Data.
Pankaj Agarwal, Nirman Kumar, Stavros Sintos and Subhash Suri.
Invited paper in special issue of Journal of Computer and System Sciences, Vol. 94, June 2018.
-
Analytic Tractography: A closed-form solution for estimating local white matter
connectivity with diffusion MRI.
M. Cieslak, T. Brennan, W. Meiring, L. Volz, C. Greene, A. Asturias, S. Suri, S. T. Grafton.
NeuroImage, Vol. 169, 473-484, 2018.
-
Compositional measures of diffusion anisotropy and asymmetry.
M. Cieslak, W. Meiring, T. Brennan, L. Volz, C. Greene, J. Vettel, S. Suri, S. T. Grafton.
Proc. of IEEE International Symposium on Biomedical Imaging, 2018.
2017
-
Convex Hulls under Uncertainty.
Pankaj Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yildiz and Wuzhou Zhang.
Algorithmica 79(2), 340-367, 2017.
-
Hyperplane Separability and Convexity of Probabilistic Point Sets.
Martin Fink, John Hershberger, Nirman Kumar and Subhash Suri.
Invited paper in special issue of Journal of Computational Geometry, 2017.
-
K-Dominance in Multidimensional Data: Theory and Applications.
Thomas Schibler and Subhash Suri.
25th Annual European Symposium on Algorithms (ESA), Vienna, Sept 4-8, 2017.
-
Shortest Paths in the Plane with Obstacle Violations.
John Hershberger, Neeraj Kumar and Subhash Suri.
25th Annual European Symposium on Algorithms (ESA), Vienna, Sept 4-8, 2017.
-
A Closed-form Solution for Calculating Local White Matter Connectivity with Diffusion MRI.
M. Cieslak, T. Brennan, L. Volz, A. Asturias, W. Meiring, S.Suri and S. Grafton.
Annual Meeting of OHBM (Organization for Human Brain Mapping), Vancouver, June 25-29, 2017.
-
Efficient Algorithms for K-Regret Minimizing Sets.
Pankaj Agarwal, Nirman Kumar, Stavros Sintos and Subhash Suri.
16th International Symposium on Experimental Algorithms, King's College, London, June 21-23, 2017.
-
K-Dominance in Multidimensional Data.
Thomas Schibler and Subhash Suri.
European Workshop on Computational Geometry, Malmo, Sweden, April 5-7, 2017.
2016
-
Most Likely Voronoi Diagrams in Higher Dimensions.
Nirman Kumar, Benjamin Raichel, Subhash Suri and Kevin Verbeek.
36th Foundations of Software Technology and Theoretical Computer Science Conference ,
Chennai, India, Dec. 13-15, 2016.
-
Metric Embedding, Hyperbolic Space, and Social Networks.
Kevin Verbeek and Subhash Suri.
Computational Geometry: Theory and Applications, Elseview, Dec 2016.
-
Block Crossings in Storyline Visualizations. Best Paper Award.
Thomas C. Van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp, Peter Markfelder,
Alex Ravsky, Subhash Suri and Alexander Wolff.
24th International Symposium on Graph Drawing and Network Visualization,
Athens, Greece, Sept 19-21, 2016.
-
Counting Convex k-gons in an Arrangement of Line Segments.
Martin Fink, Neeraj Kumar and Subhash Suri.
28th Canadian Conference on
Computational Geometry (CCCG '16), Vancouver, Canada, Aug 3-5, 2016.
-
Boundary Labeling with Obstacles.
Martin Fink and Subhash Suri.
28th Canadian Conference on
Computational Geometry (CCCG '16), Vancouver, Canada, Aug 3-5, 2016.
-
Range-Max Queries on Uncertain Data.
Pankaj Agarwal, Nirman Kumar, Stavros Sintos and Subhash Suri.
Symposium on Principles of Database Systems (PODS), San Francisco, CA,
June 26-July 1, 2016.
-
Hyperplane Separability and Convexity of Probabilistic Point Sets.
Martin Fink, John Hershberger, Nirman Kumar and Subhash Suri.
Symposium on Computational
Geometry (SoCG), Boston, MA, June 14-18, 2016.
-
On the Most Likely Voronoi Diagram and Nearest Neighbor Searching.
Subhash Suri and Kevin Verbeek.
International Journal of Computational Geometry and Applications, 2016.
-
Containment and Evasion in Stochastic Point Data.
Nirman Kumar and Subhash Suri.
Theoretical Informatics Symposium LATIN, Ensenada, Mexico, Apr 11-15, 2016.
-
Bundled Crossings in Embedded Graphs.
Martin Fink, John Hershberger, Nirman Kumar and Subhash Suri.
Theoretical Informatics Symposium LATIN, Ensenada, Mexico, Apr 11-15, 2016.
-
Separability and Convexity of Probabilistic Point Sets.
Martin Fink, John Hershberger, Nirman Kumar and Subhash Suri.
EuroCG '16, Lugano, Switzerland,
Mar 30--Apr 1, 2016.
2015
-
A Reeb Graph Approach to Tractography.
Jonathan Sun, Matthew Cieslak, Scott Grafton and Subhash Suri.
ACM SIGSPATIAL, Nov 3-6, 2015.
-
Observability of Lattice Graphs.
Fangqiu Han, Subhash Suri and Xifeng Yan.
Algorithmica, Aug 2015.
-
Tradeoffs between Bends and Displacement in Anchored Graph Drawing.
Martin Fink and Subhash Suri.
27th Canadian Conference on Computational Geometry
(CCCG '15), Kingston, Canada, Aug 10-12, 2015.
-
Tight Bounds for Conflict-free Chromatic Guarding of Orthogonal Art Galleries.
Frank Hoffmann, Klaus Kriegel, Subhash Suri, Kevin Verbeek and Max Willert.
31th Annual Symposium on Computational Geometry (SoCG '15),
Eindhoven, The Netherlands, June 22-25, 2015.
-
Pursuit Evasion on Polyhedral Surfaces.
Kyle Klein and Subhash Suri.
Algorithmica, 73(4), pp. 730-747,
Special Issue on Selected Papers from ISAAC'13, Dec 2015.
-
Chromatic Guarding of Orthogonal Polygons with Orthogonal Visibility.
Frank Hoffmann, Klaus Kriegel, Subhash Suri, Kevin Verbeek and Max Willert.
EuroCG '15,
Ljubljana, Slovenia, March 15-18, 2015.
-
Geometric K Shortest Paths.
S. Eriksson-Bique, J. Hershberger, V. Polishchuk, B. Speckmann, S. Suri, T. Talvitie,
K. Verbeek and H. Yildiz.
26th Symposium on Discrete Algorithms (SODA '15),
San Diego, CA, Jan 4-6, 2015.
-
Capture bounds for Visibility-Based Pursuit Evasion.
Kyle Klein and Subhash Suri.
Computational Geometry: Theory and Applications, 48(3), pp. 205-220, 2015.
2014
-
On the Most Likely Voronoi Diagram and Nearest Neighbor Searching.
Subhash Suri and Kevin Verbeek.
25th International Symposium on Algorithms and Computation (ISAAC 2014),
Jeonju, Korea, Dec 15-17, 2014.
-
Convex Hulls under Uncertainty.
Pankaj Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yildiz and Wuzhou Zhang.
22nd Annual European Symposium on Algorithms (ESA '14),
Wroclaw, Poland, Sept 8-10, 2014.
-
Trackability with Imprecise Localization.
Kyle Klein and Subhash Suri.
11th International Workshop on the Algorithmic Foundations of Robotics (WAFR '14),
Istanbul, Turkey, August 3 - 5, 2014.
-
Metric Embedding, Hyperbolic Space, and Social Networks.
Kevin Verbeek and Subhash Suri.
30th Annual ACM Symposium on Computational Geometry (SoCG '14),
Kyoto, Japan, June 8 - 11, 2014.
-
K-Capture in Multiagent Pursuit Evasion, or the Lion and the Hyenas.
Shaunak Bopardikar and Subhash Suri.
Theoretical Computer Science (TCS), 2014.
2013
-
Pursuit Evasion on Polyhedral Surfaces.
Kyle Klein and Subhash Suri.
24th International Symposium on Algorithms and Computation (ISAAC 2013),
Hong Kong, Dec 16-18, 2013.
-
Euclidean Traveling Salesman Tours through Stochastic Neighborhoods.
Pegah Kamousi and Subhash Suri.
24th International Symposium on Algorithms and Computation (ISAAC 2013),
Hong Kong, Dec 16-18, 2013.
-
On the Most Likely Convex Hull of Uncertain Points.
Subhash Suri, Kevin Verbeek and Hakan Yıldız.
21st Annual European Symposium on Algorithms (ESA '13),
Sophia Antipolis, France, Sep 2-6, 2013.
-
Computing Klee's Measure of Grounded Boxes.
Hakan Yıldız and Subhash Suri.
Algorithmica 2013.
-
Capture Bounds for Visibility-Based Pursuit Evasion.
Kyle Klein and and Subhash Suri.
29th ACM Symposium on Computational Geometry (SoCG '13),
Rio de Janeiro, Brazil, June 17 - 20, 2013.
-
A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles
in the Plane.
John Hershberger, Subhash Suri and Hakan Yıldız.
29th ACM Symposium on Computational Geometry (SoCG '13),
Rio de Janeiro, Brazil, June 17 - 20, 2013.
-
Memory Efficient Minimum Substring Partitioning.
Yang Li, Pegah Kamousi, Fangqiu Han, Shengqi Yang, Xifeng Yan,
Subhash Suri.
39th International Conference on Very Large Databases (VLDB '13),
Trento, Italy, Aug 26-30, 2013.
-
Conflict-free Chromatic Art Gallery Coverage.
Andreas Baertschi and Subhash Suri.
Algorithmica, Springer online January 2013.
-
On the Complexity of Time-Dependent Shortest Paths.
Luca Foschini, John Hershberger and Subhash Suri.
Algorithmica, Springer online Nov 2012.
-
Closest Pair and the Post Office Problem for Stochastic Points.
Pegah Kamousi, Timothy Chan, and Subhash Suri.
Computational Geometry: Theory and Applications, Elseview online Oct 2012.
2012
-
Capturing an Evader in Polygonal Environments with Obstacles:
The Full Visibility Case.
Deepak Bhadauria, Kyle Klein, Volkan Isler, and Subhash Suri.
International Journal of Robotics Research, 31(10),
1176-1189, 2012.
-
Reconstructing Visibility Graphs with Simple Robots.
Davide Bilo, Yann Disser, Matus Mihalak, Subhash Suri, Elias Vicari and
Peter Widmayer.
Theoretical Computer Science (TCS), 52-59, 2012.
-
Catch me if you can: Pursuit and Capture in Polygonal Environments
with Obstacles.
Kyle Klein and Subhash Suri.
26th Annual Conference on Artificial Intelligence (AAAI '12),
Toronto, Canada, July 22-26, 2012.
-
On Klee's Measure Problem for Grounded Boxes.
Hakan Yıldız and Subhash Suri.
28th ACM Symposium on Computational Geometry (SoCG '12),
Chapel Hill, NC, June 16 - 20, 2012.
-
Conflict-free Chromatic Art Gallery Coverage.
Andreas Baertschi and Subhash Suri.
29th Symposium on Theoretical Aspects of Computer Science (STACS '12),
Paris, France, Feb 29 - Mar 3, 2012.
2011
-
Complete Information Pursuit Evasion in Polygonal Environments.
Kyle Klein and Subhash Suri.
25th Conference on Artificial Intelligence (AAAI '11),
San Francisco, CA, Aug 7-11, 2011.
-
Stochastic Minimum Spanning Trees in Euclidean Spaces.
Pegah Kamousi, Timothy Chan, and Subhash Suri.
27th Annual Symposium on Computational Geometry (SoCG) '11,
Paris, France, June 13-15, 2011.
-
Multiple-Target Tracking With Binary Proximity Sensors.
Jaspreet Singh, Rajesh Kumar, Upamanyu Madhow, Subhash Suri, and
Richard Cagley.
ACM Transactions on Sensor Networks 8(1), 2011.
-
The Union of Probabilistic Boxes: Maintaining the Volume.
Hakan Yildiz, Luca Foschini, John Hershberger and Subhash Suri.
19th Annual European Symposium on Algorithms
(ESA '11), Saarbrucken, Germany, Sep 5-9, 2011.
-
Closest Pair and the Post Office Problem for Stochastic Points.
Pegah Kamousi, Timothy Chan, and Subhash Suri.
12th International Symposium on Algorithms and
Data Structures (WADS) '11,
Brooklyn, NY, Aug 15-17, 2011.
-
A Discrete and Dynamic Version of Klee’s Measure Problem.
Hakan Yildiz, John Hershberger and Subhash Suri.
23rd Canadian Conference on Computational Geometry
(CCCG '11), Toronto, Canada, Aug 10-12, 2011.
-
Efficiently Measuring Bandwidth at All Time Scales.
Frank Uyeda, Luca Foschini, Subhash Suri and George Varghese.
NSDI '11,
Boston, MA, Mar 30--April 1, 2011.
-
On the Complexity of Time-Dependent Shortest Paths.
Luca Foschini, John Hershberger and Subhash Suri.
22nd ACM SODA '11,
San Francisco, CA, Jan 23-25, 2011.
-
Stochastic Minimum Spanning Trees and Related Problems.
Pegah Kamousi and Subhash Suri.
ANALCO '11,
San Francisco, CA, Jan 22, 2011.
2010
-
Multiagent Pursuit Evasion, or Playing Kabaddi.
Kyle Klein and Subhash Suri.
International Workshop on Algorithmic Foundations of Robotics (WAFR),
Singapore, Dec 13-15, 2010.
-
Robot Kabaddi.
Kyle Klein and Subhash Suri.
22nd Canadian Conference on Computational Geometry (CCCG),
Winnipeg, August 9-11, 2010.
-
Space-efficient Online Approximation of Time Series Data:
Streams, Amnesia, and Out-of-order.
Sorabh Gandhi, Luca Foschini and Subhash Suri.
26th ICDE, Long Beach, CA, March 1-6, 2010.
-
Untangling the Braid: Finding Outliers in a Set of Streams.
Chiranjeeb Buragohain, Luca Foschini and Subhash Suri.
ALENEX 2010, SODA Workshop on Algorithm Engineering & Experiments,
Austin, TX, Jan 2010.
2009
-
Catching Elephants with Mice: Sparse Sampling for Monitoring Sensor
Networks
Sorabh Gandhi, Subhash Suri and Emo Welzl
ACM Transactions on Sensor Networks, 6(1), 2009.
-
GAMPS: Compressing Multi Sensor Data by Grouping and Amplitude Scaling.
Sorabh Gandhi, Suman Nath, Subhash Suri and Jie Liu.
ACM SIGMOD, Providence, RI, June 29 - July 2, 2009.
-
Reconstructing Visibility Graphs with Simple Robots.
Davide Bilo, Yann Disser, Matus Mihalak, Subhash Suri, Elias Vicari and
Peter Widmayer.
SIROCCO 2009
(16th International Colloquium on Structural Information
and Communication Complexity), Slovenia, May 25-27, 2009.
-
On the Limitations of Combinatorial Visibilities.
Davide Bilo, Yann Disser, Matus Mihalak, Subhash Suri, Elias Vicari and
Peter Widmayer.
25th European Workshop on Computational Geometry, Brussels, Belgium, Mar 16-18, 2009.
-
Target Tracking with Binary Proximity Sensors.
Nisheeth Shrivastava, R. Mudumbai, Upamanyu Madhow and Subhash Suri.
ACM Transactions on Sensor Networks, to appear 2009.
2008
-
eBay in the Sky: Strategy-Proof Wireless Spectrum Auctions.
Xia Zhou, Sorabh Gandhi, Subhash Suri and Heather Zheng.
ACM MobiCom, San Francisco, Sept 14-19, 2008.
-
Cluster Hull: A Technique for Summarizing Spatial Data Streams.
John Hershberger, Nisheeth Shrivastava and Subhash Suri.
ACM Journal of Experimental Algorithmics, Vol 13, 2008
-
Bandwidth-Constrained Allocation in Grid Computing
Anshul Kothari, Subhash Suri, and Yunhong Zhou
Algorithmica, Vol. 52, 487--501, 2008.
-
Formulating and implementing profiling over adaptive ranges
Shashi Mysore, Banit Agrawal, Tim Sherwood, Nisheeth Shrivastava
and Subhash Suri.
ACM Transactions on Architecture and Code Optimization , Vol. 5, 2008.
-
Simple Robots with Minimal Sensing:
From Local Visibility to Global Geometry
Subhash Suri, Elias Vicari, Peter Widmayer
International Journal of Robotics Research, Vol 27, Sept. 2008.
-
Target Counting under Minimal Sensing: Complexity and
Approximations.
Sorabh Gandhi, Rajesh Kumar and Subhash Suri.
ALGOSENSORS, Reykjavik, Iceland, July 2008.
-
Simple Robots in Polygonal Environments: A Hierarchy.
Jan Brunner, Matus Mihalak, Subhash Suri, Elias Vicari and Peter Widmayer.
ALGOSENSORS, Reykjavik, Iceland, July 2008.
-
Simplified Planar Coresets for Data Streams.
John Hershberger and Subhash Suri.
SWAT '08, Gothenburg, Sweden, July 2-4, 2008.
-
Angle Optimization in Target Tracking.
Beat Gfeller, Matus Mihalak, Subhash Suri, Elias Vicari and Peter Widmayer.
SWAT '08,
Gothenburg, Sweden, July 2-4, 2008.
-
A game-theoretic analysis of wireless access point selection by mobile users.
Kimaya Mittal, Elizabeth Belding and Subhash Suri.
Computer Communications (Elsevier), Vol 31, pp. 2049-2062, 2008.
-
Quantiles on Streams.
Chiranjeeb Buragohain and Subhash Suri
To appear in Encyclopedia of Database Systems,
2007, Springer.
-
Adaptive Sampling for Geometric Problems over Data Streams.
John Hershberger and Subhash Suri
To appears in Computational Geometry: Theory and Applications (Elsevier),
2008.
-
Detecting Cuts in Sensor Networks,
Nisheeth Shrivastava, Subhash Suri, and Csaba Toth
ACM Transactions on Sensor Networks, Vol. 4 (2), pp. 1--25, Mar 2008.
-
Towards Real-Time Dynamic Spectrum Auctions,
Sorabh Gandhi, Chiranjeeb Buragohain, Lili Cao, Heather Zheng and Subhash Suri.
Computer Networks (Special Issue on Cognitive Wireless Networks),
Vol. 52 (4), pp. 879--897, March 2008.
2007
-
Catching Elephants with Mice: Sparse Sampling for Monitoring Sensor
Networks
Sorabh Gandhi, Subhash Suri and Emo Welzl
5th ACM Conference on Embedded Networked Sensor Systems (SenSys) ,
Nov. 6-9, 2007, Sydney, Australia.
-
Attribute-based access to distributed data over P2P networks,
Divyakant Agrawal, Amr El Abbadi and Subhash Suri.
Int. J. Computational Science and Engineering, Vol. 3(2),
pp. 112--123, 2007.
-
Finding the k Shortest Simple Paths: A New Algorithm and its Implementation.
John Hershberger, Matthew Maxel and Subhash Suri.
To appear in ACM Transactions on Algorithms, 2007.
-
Simple Robots with Minimal Sensing:
From Local Visibility to Global Geometry
Subhash Suri, Elias Vicari, Peter Widmayer
22nd Conference on Artificial Intelligence (AAAI-07),
July 22-26, Vancouver, Canada.
-
Counting Targets with Mobile Sensors in an Unknown Environment
Beat Gfeller, Matus Mihalak, Subhash Suri, Elias Vicari and
Peter Widmayer
ALGOSENSORS, July 2007, Wroclaw, Poland.
-
Improved Throughput Bounds for Interference-aware
Routing in Wireless Networks
Chiranjeeb Buraagohain, Subhash Suri, Csaba Toth, Yunhong Zhou
13th Computing and Combinatorics Conference (COCOON-07),
July 16-19, Banff, Canada.
-
Approximate Isocontours and Spatial Summaries for Sensor Networks.
Sorabh Gandhi, John Hershberger, and Subhash Suri.
(Best Paper Award.)
IPSN '07, April 25-27, Cambridge, MA.
-
Tracking Multiple Targets Using Binary Proximity Sensors.
Jaspreet Singh, Rajesh Kumar, Upamanyu Madhow, Subhash Suri, and
Richard Cagley.
IPSN '07, April 25-27, Cambridge, MA.
-
A General Framework for Clearing Auction of Wireless Spectrum.
Sorabh Gandhi, Chiranjeeb Buragohain, Lili Cao, Haitao Zheng and
Subhash Suri.
(Best Student Paper Award.)
IEEE DySPAN'07,
April 17-20, Dublin, Ireland, 2007.
-
Space Efficient Streaming Algorithms for the Maximum Error Histogram.
Chiranjeeb Buragohain, Nisheeth Shrivastava and Subhash Suri.
IEEE ICDE '07, April 16-20, Istambul, Turkey, 2007.
-
Selfish Load Balancing and Atomic Congestion Games.
Subhash Suri, Csaba D. Toth, and Yunhong Zhou.
Algorithmica, Vol. 47(1), pages 79-96, Jan. 2007.
-
On the difficulty of some shortest path problems.
John Hershberger, Subhash Suri, Amit M. Bhosle.
ACM Transactions on Algorithms, Vol. 3(1), 2007.
2006
-
Target Tracking with Binary Proximity Sensors:
fundamental limits, minimal descriptions, and algorithms.
Nisheeth Shrivastava, R. Mudumbai, Upamanyu Madhow and Subhash Suri.
ACM SenSys '06, Nov. 1-3, Boulder, 2006.
-
Search-quality Tradeoffs for Routing in Non-ideal
Wireless Networks.
Chiranjeeb Buragohain, Divy Agrawal, and Subhash Suri.
IEEE SECON '06, Sept 25-28, Virginia.
-
Adaptive Spatial Partitioning for Multidimensional Data Streams.
John Hershberger, Nisheeth Shrivastava, Subhash Suri and Csaba Toth.
Algorithmica, Volume 46(1), pages 97-117, Sept 2006.
-
Contour Approximation in Sensor Networks.
Chiranjeeb Buragohain, Sorabh Gandhi, John Hershberger and Subhash
Suri.
DCOSS '06, June 18-20, San Francisco.
-
Distributed Navigation Algorithms for Sensor Networks.
Chiranjeeb Buragohain, Divy Agrawal and Subhash Suri.
INFOCOM '06, Apr 25-27, Barcelona.
-
Cluster Hull: A Technique for Summarizing Spatial Data Streams.
John Hershberger, Nisheeth Shrivastava and Subhash Suri.
ICDE'06, April 3-7, 2006, Atlanta.
-
Profiling over Adaptive Ranges.
Shashi Mysore, Banit Agrawal, Tim Sherwood, Nisheeth Shrivastava
and Subhash Suri.
4th Annual ACM/IEEE International Symposium on Code Generation
and Optimization, Mar 26-29, New York, NY.
Received the Best Paper Award.
-
Summarizing Spatial Data Streams Using ClusterHulls.
Nisheeth Shrivastava, John Hershberger, and Subhash Suri.
ALENEX '06, Jan 21-25, Miami.
Invited to Special Issue of ACM Journal of
Experimental Algorithms.
2005
- Fast Packet Classification for
Two-Dimensional Conflict-Free Filters.
Florin Baboescu, Priyank Warkhede, Subhash Suri, George Varghese.
Computer Networks, Aug. 2005.
-
Range Counting over Multidimensional Data Streams.
Subhash Suri, Csaba Toth and Yunhong Zhou.
Invited paper to Special Issue of Discrete and
Computational Geometry, 2005.
-
Interval Subset Sum and Uniform-Price Auction Clearing .
Anshul Kothari, Subhash Suri and Yunhong Zhou.
COCOON 2005, August 16-19, 2005, Kunming, China.
-
Space Complexity of Hierarchical Heavy Hitters in
Multi-Dimensional Data Streams.
John Hershberger, Nisheeth Shrivastava, Subhash Suri and Csaba Toth.
ACM PODS '05, June 13-15, Baltimore.
-
Fishing for Patterns in Data Streams.
John Hershberger, Nisheeth Shrivastava, Subhash Suri and Csaba Toth.
Workshop on Massive Geometric Data Sets, June 9, Pisa, Italy.
-
Summarizing Spatial Data Streams.
John Hershberger, Nisheeth Shrivastava and Subhash Suri.
Workshop on Massive Geometric Data Sets, June 9, Pisa, Italy.
-
Binary Space Partitions of Orthogonal Subdivisions.
John Hershberger, Subhash Suri and Csaba Toth.
To appear in SIAM J. of Computing, 2005.
-
Detecting Cuts in Sensor Networks.
Nisheeth Shrivastava, Subhash Suri and Csaba Toth.
IPSN '05, April 25-27, Los Angeles.
-
Power Aware Routing for Sensor Databases.
Chiranjeeb Buragohain, Divy Agrawal and Subhash Suri.
INFOCOM '05, Mar 13-17, Miami.
-
Attribute-Based Access to Distributed Data over P2P Networks.
Divy Agrawal, Amr El Abbadi and Subhash Suri.
Workshop on Databases in Networked Information Systems, Japan,
Mar 28-30, 2005.
2004
-
Adaptive Spatial Partitioning for Multidimensional Data Streams.
John Hershberger, Nisheeth Shrivastava, Subhash Suri and Csaba Toth.
ISAAC '04,
Dec. 20-22, Hong Kong.
-
Medians and Beyond: New Aggregation Techniques for Sensor
Networks.
Nisheeth Shrivastava, Chiranjeeb Buragohain, Divy Agrawal,
Subhash Suri.
ACM SenSys '04, Nov. 3-5, Baltimore, MD.
-
Congestion Games, Load Balancing, and Price of Anarchy.
Anshul Kothari, Subhash Suri, Csaba D. Toth, and Yunhong Zhou.
CAAN '04 (Workshop on Combinatorial and Algorithmic Aspects
of Networking), Aug 5-7, Banff, Alberta.
-
Selfish Load Balancing and Atomic Congestion Games..
Subhash Suri, Csaba Toth and Yunhong Zhou.
ACM SPAA '04 (Symp. on Parallelism in Algorithms & Architectures)
June 27--30, Barcelona.
-
Adaptive Sampling for Geometric Problems over Data Streams.
John Hershberger and Subhash Suri.
ACM PODS '04 (Symp. on Principles of Database Systems)
June 13-18, Paris, France.
-
Range Counting over Multidimensional Data Streams.
Subhash Suri, Csaba Toth and Yunhong Zhou.
ACM Symposium on Computational Geometry '04
June 9--11, New York.
-
Binary Space Partitions of Orthogonal Subdivisions.
John Hershberger, Subhash Suri and Csaba Toth.
ACM Symposium on Computational Geometry '04
June 9--11, New York.
-
Uncoordinated Load Balancing and Congestion Games in P2P
Systems.
Subhash Suri, Csaba Toth and Yunhong Zhou.
IPTPS '04 (3rd International Workshop on Peer-to-Peer Systems),
February 26-27, San Diego.
2003
-
Towards Realistic Mobility Models for Mobile Ad hoc Networks.
Amit Jardosh, Elizabeth Belding-Royer, Kevin Almeroth and
Subhash Suri.
Mobicom 2003, Sept. 14-19, San Diego.
-
A Game-Theoretic Framework for Incentives in P2P Systems.
Chiranjeeb Buragohain, Divy Agrawal and Subhash Suri.
IEEE P2P 2003 , Sept. 1-3, Linkoping, Sweden.
-
Range Addressable Network: A P2P Cache Architecture for Data
Ranges.
Anshul Kothari, Divy Agrawal, Abhishek Gupta and Subhash Suri.
IEEE P2P 2003 , Sept. 1-3, Linkoping, Sweden.
-
Bandwidth Constrained Allocation in Grid Computing.
Anshul Kothari, Subhash Suri, and Yunhong Zhou.
WADS 2003: July 30- Aug 1, Ottawa.
-
Convex Hulls and Related Problems in Data Streams.
John Hershberger and Subhash Suri.
MPDS 2003:
ACM SIGMOD/PODS Workshop on Management & Processing of
Data Streams, June 8, 2003.
-
Approximately-Strategyproof and Tractable Multi-Unit Auctions.
Anshul Kothari, David Parkes, and Subhash Suri.
ACM Conference on Electronic Commerce 2003, June 9-12, San Diego
-
Solving Combinatorial Exchanges: Optimality via a Few Partial Bids.
Anshul Kothari, Tuomas Sandholm and Subhash Suri.
ACM Conference on Electronic Commerce 2003 (poster),
June 9-12, San Diego
-
On the Difficulty of Some Shortest Path Problems.
John Hershberger, Subhash Suri and Amit Bhosle.
STACS-2003, Feb 27 - Mar 1, Berlin
-
Finding the K Shortest Simple Paths:
A New Algorithm and its Implementation.
John Hershberger, Matthew Maxel and Subhash Suri.
ALENEX 2003, Jan 11-14, Baltimore.
-
Binary Space Partitions for 3D Subdivisions.
John Hershberger and Subhash Suri.
SODA 2003, Jan 12-14, Baltimore.
2002
-
Winner Determination in Combinatorial Auction Generalizations.
Tuomas Sandholm, Subhash Suri, Andrew Gilpin and David Levine.
AAMAS-2002: Autonomous Agents and Multiagent Systems, Italy.
- Optimal Clearing of Supply/Demand Curves.
Tuomas Sandholm and Subhash Suri.
ISAAC: Proc. of 13th Annual International Symposium on Algorithms
and Computation, Vancouver, Canada, November 20-23, 2002.
- Algorithms for a Minimum Volume Simplex in Three Dimensions.
Yunhong Zhou and Subhash Suri.
SIAM Journal on Computing, Vol. 31 (5), pp. 1339--1357, 2002.
- Silo, Rainbow, and Caching Token: Schemes for Scalable
Fault-Tolerant Stream Caching.
Youngsu Chae, Katherine Guo, Milind M. Buddhikot,
Subhash Suri, and Ellen Zegura.
IEEE Journal on Selected Areas in Communications,
Vol. 20 (7), pp.~1328--1344, Sept 2002.
- CABOB: A Fast Optimal Algorithm for
Combinatorial Auctions.
Tuomas Sandholm, Subhash Suri, Andrew Gilpin and David Levine.
IJCAI-2001:
17th International Joint Conference on Artificial Intelligence
2001