Serge Plotkin

Research.com Recognitions

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

Overview

Best Publications

• Fast approximation algorithms for fractional packing and covering problems

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

  879
  Citations

• Parallel symmetry-breaking in sparse graphs

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

  720
  Citations

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

  Zoë Abrams;Ashish Goel;Serge Plotkin

  510
  Citations

• Throughput-competitive on-line routing

  B. Awerbuch;Y. Azar;S. Plotkin

  488
  Citations

• Network decomposition and locality in distributed computation

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

  377
  Citations

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

  James Aspnes;Yossi Azar;Amos Fiat;Serge Plotkin

  351
  Citations

• Improved approximation algorithms for network design problems

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

  316
  Citations

• Cost-Distance: Two Metric Network Design

  Adam Meyerson;Kamesh Munagala;Serge Plotkin

  313
  Citations

• Fast approximation algorithms for multicommodity flow problems

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

  313
  Citations

• Excluded minors, network decomposition, and multicommodity flow

  Philip Klein;Serge A. Plotkin;Satish Rao

  264
  Citations

• Competitive routing of virtual circuits in ATM networks

  S. Plotkin

  240
  Citations

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

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

  239
  Citations

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

  James Aspnes;Yossi Azar;Amos Fiat;Serge Plotkin

  217
  Citations

• 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

  207
  Citations

• Combinatorial algorithms for the generalized circulation problem

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

  182
  Citations

• Sublinear-time parallel algorithms for matching and related problems

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

  172
  Citations

• Shallow excluded minors and improved graph decompositions

  Serge Plotkin;Satish Rao;Warren D. Smith

  166
  Citations

• Competitive Routing of Virtual Circuits with Unknown Duration

  Baruch Awerbuch;Yossi Azar;Serge Plotkin;Orli Waarts

  137
  Citations

• Sticky bits and universality of consensus

  S. A. Plotkin

  123
  Citations

• On-Line Load Balancing of Temporary Tasks

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

  104
  Citations

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

  Anil Kamath;Omri Palmon;Serge Plotkin

  100
  Citations