World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
45
Citations
8189
World Ranking
7209
National Ranking
3149

Overview

S. S. Ravi is affiliated with the University of Virginia in the United States. Their research spans multiple disciplines, with a strong focus on computer science and physics and astronomy. Within these broader fields, their work concentrates on subfields such as statistical and nonlinear physics, artificial intelligence, management science and operations research, computer networks and communications, and electrical and electronic engineering.

The scientist's research covers several main topics, including:

  • Complex Network Analysis Techniques
  • Opinion Dynamics and Social Influence
  • Game Theory and Applications
  • Machine Learning and Algorithms
  • Machine Learning and Data Classification
  • Auction Theory and Applications
  • Human Mobility and Location-Based Analysis

Recent papers authored or co-authored by S. S. Ravi highlight diverse areas of study and publication venues. Selected works include:

  • "Making Existing Clusterings Fairer: Algorithms, Complexity Results and Insights," 2020, Proceedings of the AAAI Conference on Artificial Intelligence
  • "Networked experiments and modeling for producing collective identity in a group of human subjects using an iterative abduction framework," 2020, Social Network Analysis and Mining
  • "Fundamental limitations on efficiently forecasting certain epidemic measures in network models," 2022, Proceedings of the National Academy of Sciences
  • "CSonNet: An Agent-Based Modeling Software System for Discrete Time Simulation," 2021, 2021 Winter Simulation Conference (WSC)
  • "Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability," 2020, Proceedings of the AAAI Conference on Artificial Intelligence

S. S. Ravi frequently publishes in venues such as:

  • Proceedings of the AAAI Conference on Artificial Intelligence
  • arXiv (Cornell University)
  • Social Network Analysis and Mining
  • 2021 Winter Simulation Conference (WSC)
  • Studies in computational intelligence

Collaboration is a notable aspect of S. S. Ravi's work. Regular co-authors include Madhav Marathe, Daniel J. Rosenkrantz, Chris J. Kuhlman, Anil Vullikanti, and Richard E. Stearns. This network suggests active engagement in interdisciplinary research teams.

Best Publications

  • Simple heuristics for unit disk graphs

    Madhav V. Marathe;H. Breu;Harry B. Hunt;S. S. Ravi

  • Algorithmic aspects of topology control problems for ad hoc networks

    Errol L. Lloyd;Rui Liu;Madhav V. Marathe;Ram Ramanathan

  • Clustering with Constraints: Feasibility Issues and the k-Means Algorithm.

    Ian Davidson;S. S. Ravi

  • NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs

    Harry B Hunt;Madhav V Marathe;Venkatesh Radhakrishnan;S.S Ravi

  • Agglomerative hierarchical clustering with constraints: theoretical and empirical results

    Ian Davidson;S. S. Ravi

  • HEURISTIC AND SPECIAL CASE ALGORITHMS FOR DISPERSION PROBLEMS

    S. S. Ravi;Daniel J. Rosenkrantz;Giri Kumar Tayi

  • Spanning Trees---Short or Small

    R. Ravi;R. Sundaram;M. V. Marathe;D. J. Rosenkrantz

  • Bicriteria Network Design Problems

    Madhav V Marathe;R Ravi;Ravi Sundaram;S.S Ravi

  • Models and approximation algorithms for channel assignment in radio networks

    Sven O. Krumke;Madhav V. Marathe;S. S. Ravi

  • Many birds with one stone: multi-objective approximation algorithms

    R. Ravi;M. V. Marathe;S. S. Ravi;D. J. Rosenkrantz

  • Compression of trajectory data: a comprehensive evaluation and new approach

    Jonathan Muckell;Paul W. Olsen;Jeong-Hyon Hwang;Catherine T. Lawson

  • Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems

    R. Ravi;Madhav V. Marathe;S. S. Ravi;Daniel J. Rosenkrantz

  • SQUISH: an online approach for GPS trajectory compression

    Jonathan Muckell;Jeong-Hyon Hwang;Vikram Patil;Catherine T. Lawson

  • Discovery of association rules in medical data.

    Srinivas Doddi;Achla Marathe;S. S. Ravi;David C. Torney

  • Deferred updates and data placement in distributed databases

    P. Chundi;D.J. Rosenkrantz;S.S. Ravi

  • Observations on self-stabilizing graph algorithms for anonymous networks

    Sandeep Kumar Shukla;Daniel J. Rosenkrantz;S. S. Ravi

  • A PMU Placement Scheme Considering Realistic Costs and Modern Trends in Relaying

    Anamitra Pal;Anil Kumar S. Vullikanti;S. S. Ravi

  • Complexity of reachability problems for finite discrete dynamical systems

    Christopher L. Barrett;Harry B. Hunt;Madhav V. Marathe;S. S. Ravi

  • Using instance-level constraints in agglomerative hierarchical clustering: theoretical and empirical results

    Ian Davidson;S. S. Ravi

  • Examining political mobilization of online communities through e-petitioning behavior in We the People

    Catherine L Dumas;Daniel LaManna;Teresa M Harrison;SS Ravi

  • Spanning trees short or small

    R. Ravi;R. Sundaram;Madhav V. Marathe;S. S. Ravi

Frequent Co-Authors

Madhav V. Marathe
Madhav V. Marathe University of Virginia
Daniel J. Rosenkrantz
Daniel J. Rosenkrantz University of Virginia
Richard Edwin Stearns
Richard Edwin Stearns University at Albany, State University of New York
R. Ravi
R. Ravi Carnegie Mellon University
Christopher L. Barrett
Christopher L. Barrett University of Virginia
Ian Davidson
Ian Davidson University of California, Davis
Ravi Sundaram
Ravi Sundaram Northeastern University
Haibo Zeng
Haibo Zeng Nanjing University of Science and Technology
Peter Widmayer
Peter Widmayer ETH Zurich
Reinhard Laubenbacher
Reinhard Laubenbacher University of Florida

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 online options for studying Computer Science in the USA opens a world of flexible, affordable, and accessible opportunities for students at all stages. Many learners ask, what masters program should I do to stay in demand and maximize career prospects. Computer Science continues to be a top choice, offering high employability and strong earning potential.

For those beginning their academic journey or looking to upskill quickly, pursuing an associate's degree online can be a strategic move. These programs typically take just two years and provide foundational knowledge to launch your tech career or transfer to a four-year program later.

Budget concerns are common, but you can find cheap online college classes without sacrificing quality. These affordable paths make it easier for students to begin or continue their education, regardless of financial background.

Admission requirements also vary. You can find online colleges that accept 2.0 GPA, making advanced education more attainable if your academic record is less than perfect. No matter your background, online degrees can unlock new career pathways and opportunities in the computing field.

Best Scientists Citing S. S. Ravi

Trending Scientists

Recently Published Articles