World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
79
Citations
20692
World Ranking
1155
National Ranking
612

Research.com Recognitions

  • 2011 - Fellow of the American Association for the Advancement of Science (AAAS)
  • 2010 - ACM Fellow For algorithmic contributions in computational geometry, networks, and computational economics.
  • 2007 - ACM Distinguished Member

Overview

Subhash Suri is affiliated with the University of California, Santa Barbara in the United States. Their research focuses primarily within the broad field of Computer Science, with significant contributions to multiple subfields including Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics, Computer Vision and Pattern Recognition, Artificial Intelligence, and Signal Processing.

The scientist's main research topics encompass Computational Geometry and Mesh Generation, Complexity and Algorithms in Graphs, Robotic Path Planning Algorithms, Data Management and Algorithms, Advanced Graph Theory Research, Game Theory and Voting Systems, and Advanced Optimization Algorithms Research.

Subhash Suri has authored several recent papers, including the following notable examples:

  • Catch Me If You Can: Pursuit and Capture in Polygonal Environments with Obstacles, 2021, Proceedings of the AAAI Conference on Artificial Intelligence
  • Shortest Paths in the Plane with Obstacle Violations, 2020, Algorithmica
  • Dynamic Geometric Set Cover and Hitting Set, 2022, ACM Transactions on Algorithms
  • Improved approximation bounds for the minimum constraint removal problem, 2020, Computational Geometry
  • Dynamic Geometric Set Cover and Hitting Set, 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Frequent collaborators in their research include Jie Xue, Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, and Chinmay Sonar.

Subhash Suri's work has been published in various venues, with multiple papers appearing in publications such as Leibniz-Zentrum für Informatik (Schloss Dagstuhl), arXiv (Cornell University), Computational Geometry, SIAM Journal on Computing, and the Proceedings of the AAAI Conference on Artificial Intelligence.

The scientist has also authored a book titled Algorithms and Data Structures, published by Springer Science+Business Media in 2023.

Subhash Suri's contributions have been recognized through several professional distinctions. These include being named a Fellow of the American Association for the Advancement of Science (AAAS) in 2011, an ACM Fellow in 2010 for algorithmic contributions in computational geometry, networks, and computational economics, and an ACM Distinguished Member since 2007.

Best Publications

  • Fast and scalable layer four switching

    V. Srinivasan;G. Varghese;S. Suri;M. Waldvogel

  • Towards realistic mobility models for mobile ad hoc networks

    Amit Jardosh;Elizabeth M. Belding-Royer;Kevin C. Almeroth;Subhash Suri

  • Packet classification using tuple space search

    V. Srinivasan;S. Suri;G. Varghese

  • Medians and beyond: new aggregation techniques for sensor networks

    Nisheeth Shrivastava;Chiranjeeb Buragohain;Divyakant Agrawal;Subhash Suri

  • eBay in the Sky: strategy-proof wireless spectrum auctions

    Xia Zhou;Sorabh Gandhi;Subhash Suri;Haitao Zheng

  • CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions

    Tuomas Sandholm;Subhash Suri;Andrew Gilpin;David Levine

  • A game theoretic framework for incentives in P2P systems

    C. Buragohain;D. Agrawal;S. Suri

  • Detecting and resolving packet filter conflicts

    A. Hari;S. Suri;G. Parulkar

  • Finding the k shortest simple paths: A new algorithm and its implementation

    John Hershberger;Matthew Maxel;Subhash Suri

  • An Optimal Algorithm for Euclidean Shortest Paths in the Plane

    John Hershberger;Subhash Suri

  • A General Framework for Wireless Spectrum Auctions

    S. Gandhi;C. Buragohain;Lili Cao;Haitao Zheng

  • Vickrey prices and shortest paths: what is an edge worth?

    J. Hershberger;S. Suri

  • BOB: improved winner determination in combinatorial auctions and generalizations

    Tuomas Sandholm;Subhash Suri

  • Winner determination in combinatorial auction generalizations

    Tuomas Sandholm;Subhash Suri;Andrew Gilpin;David Levine

  • Label placement by maximum independent set in rectangles

    Pankaj K. Agarwal;Marc van Kreveld;Subhash Suri

  • Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms

    N. Shrivastava;R. Mudumbai U. Madhow;S. Suri

  • CABOB: a fast optimal algorithm for combinatorial auctions

    Tuomas Sandholm;Subhash Suri;Andrew Gilpin;David Levine

  • Leap forward virtual clock: a new fair queuing scheme with guaranteed delays and throughput fairness

    S. Suri;G. Varghese;G. Chandranmenon

  • Real-world environment models for mobile network evaluation

    A.P. Jardosh;E.M. Belding-Royer;K.C. Almeroth;S. Suri

  • Surface Approximation and Geometric Partitions

    Pankaj K. Agarwal;Subhash Suri

  • Tracking multiple targets using binary proximity sensors

    Jaspreet Singh;Upamanyu Madhow;Rajesh Kumar;Subhash Suri

Frequent Co-Authors

John Hershberger
John Hershberger Mentor Graphics
Tuomas Sandholm
Tuomas Sandholm Carnegie Mellon University
Pankaj K. Agarwal
Pankaj K. Agarwal Duke University
George Varghese
George Varghese University of California, Los Angeles
Divyakant Agrawal
Divyakant Agrawal University of California, Santa Barbara
David C. Parkes
David C. Parkes Harvard University
Joseph S. B. Mitchell
Joseph S. B. Mitchell Stony Brook University
Alok Aggarwal
Alok Aggarwal IBM (United States)
Leonidas J. Guibas
Leonidas J. Guibas Stanford University
Peter Widmayer
Peter Widmayer ETH Zurich

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring a career in computer science or related fields has never been more accessible, thanks to the flexibility and range of online degree options in the USA. For those just starting out, an online associate degree can be an excellent entry point. This pathway allows you to build foundational skills in computer science, often at a lower cost and with a shorter time commitment than a traditional four-year degree.

Budget is a major consideration for many students. Fortunately, there are many cheap online colleges that offer accredited programs without the high price tag. These schools make it possible to pursue a quality education without overwhelming student debt.

If your academic background isn’t perfect, don’t worry. Many online colleges that accept low gpa welcome applicants with less-than-ideal transcripts, giving more students a chance to succeed in this field.

Beyond computer science, these online pathways open doors to varied careers. For instance, you might wonder what jobs can you get with an environmental science degree. Both computer science and environmental science graduates discover diverse opportunities in research, technology, and applied sciences, making online learning a versatile choice.

Best Scientists Citing Subhash Suri

Trending Scientists