World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
38
Citations
8102
World Ranking
10069
National Ranking
4247

Research.com Recognitions

  • 2003 - Fellow of the American Association for the Advancement of Science (AAAS)

Overview

Serge Plotkin is affiliated with Stanford University in the United States.

In 2003, Serge Plotkin was recognized as a Fellow of the American Association for the Advancement of Science (AAAS).

Best Publications

  • Fast approximation algorithms for fractional packing and covering problems

    Serge A. Plotkin;David B. Shmoys;Éva Tardos

  • Parallel symmetry-breaking in sparse graphs

    Andrew V. Goldberg;Serge A. Plotkin;Gregory E. Shannon

  • Set k-cover algorithms for energy efficient monitoring in wireless sensor networks

    Zoë Abrams;Ashish Goel;Serge Plotkin

  • Throughput-competitive on-line routing

    B. Awerbuch;Y. Azar;S. Plotkin

  • Network decomposition and locality in distributed computation

    B. Awerbuch;M. Luby;A.V. Goldberg;S.A. Plotkin

  • On-line routing of virtual circuits with applications to load balancing and machine scheduling

    James Aspnes;Yossi Azar;Amos Fiat;Serge Plotkin

  • Improved approximation algorithms for network design problems

    M. X. Goemans;A. V. Goldberg;S. Plotkin;D. B. Shmoys

  • Cost-Distance: Two Metric Network Design

    Adam Meyerson;Kamesh Munagala;Serge Plotkin

  • Fast approximation algorithms for multicommodity flow problems

    Tom Leighton;Clifford Stein;Fillia Makedon;Éva Tardos

  • Excluded minors, network decomposition, and multicommodity flow

    Philip Klein;Serge A. Plotkin;Satish Rao

  • Competitive routing of virtual circuits in ATM networks

    S. Plotkin

  • Approximating a finite metric by a small number of tree metrics

    M. Charikar;C. Chekuri;A. Goel;S. Guha

  • On-line load balancing with applications to machine scheduling and virtual circuit routing

    James Aspnes;Yossi Azar;Amos Fiat;Serge Plotkin

  • Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts

    Philip Klein;Serge Plotkin;Clifford Stein;Eva Tardos

  • Combinatorial algorithms for the generalized circulation problem

    Andrew V. Goldberg;Serge A. Plotkin;Éva Tardos

  • Sublinear-time parallel algorithms for matching and related problems

    Andrew V. Goldberg;Serge A. Plotkin;Pravin M. Vaidya

  • Shallow excluded minors and improved graph decompositions

    Serge Plotkin;Satish Rao;Warren D. Smith

  • Competitive Routing of Virtual Circuits with Unknown Duration

    Baruch Awerbuch;Yossi Azar;Serge Plotkin;Orli Waarts

  • Sticky bits and universality of consensus

    S. A. Plotkin

  • On-Line Load Balancing of Temporary Tasks

    Yossi Azar;Bala Kalyanasundaram;Serge Plotkin;Kirk R Pruhs

  • Routing and admission control in general topology networks with Poisson arrivals

    Anil Kamath;Omri Palmon;Serge Plotkin

Frequent Co-Authors

Éva Tardos
Éva Tardos Cornell University
Andrew V. Goldberg
Andrew V. Goldberg Amazon (United States)
Ashish Goel
Ashish Goel Stanford University
Baruch Awerbuch
Baruch Awerbuch Johns Hopkins University
Yossi Azar
Yossi Azar Tel Aviv University
David B. Shmoys
David B. Shmoys Cornell University
Philip N. Klein
Philip N. Klein Brown University
Satish Rao
Satish Rao University of California, Berkeley
Kamesh Munagala
Kamesh Munagala Duke University
Monika Henzinger
Monika Henzinger Institute of Science and Technology Austria

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 programs can greatly expand your opportunities in computer science. For those just starting, an online associate's degree in computer science offers foundational skills and can lead to entry-level jobs or further study.

If cost is a concern, you can find affordable online courses at a range of accredited institutions. These programs let you learn flexibly while managing expenses, making them an excellent option for budget-conscious students.

Worried about your GPA? Some will grad schools accept low gpa and offer supportive pathways to continue your education. This means students who struggled academically still have options to advance their careers through online study.

With a degree in computer science, graduates can work in fields like software development, cybersecurity, data analysis, and even interdisciplinary roles. Curious about other options? Learn more about what jobs can you get with an environmental science degree to see how varied career pathways can be when paired with technology skills.

Best Scientists Citing Serge Plotkin