Éva Tardos

Research.com Recognitions

• 2019 - IEEE John von Neumann Medal “For contributions to the field of algorithms, including foundational new methods in optimization, approximation algorithms, and algorithmic game theory.”
• 2013 - Fellow of the American Mathematical Society
• 2013 - Member of the National Academy of Sciences
• 2009 - SIAM Fellow For the design and analysis of graph and network algorithms.
• 2007 - Member of the National Academy of Engineering For contributions to the design and analysis of efficient algorithms for network problems.
• 2006 - Dantzig Prize, by the Society for Industrial and Applied Mathematics (SIAM) and the Mathematical Optimization Society (MOS)
• 2005 - Fellow of the Institute for Operations Research and the Management Sciences (INFORMS)
• 2001 - Fellow of the American Academy of Arts and Sciences
• 1999 - Fellow of John Simon Guggenheim Memorial Foundation
• 1998 - ACM Fellow For fundamental contributions in the design and analysis of algorithms, combinatorial optimization, network flows, and approximation algorithms.
• 1991 - Fellow of Alfred P. Sloan Foundation

Overview

Best Publications

• Maximizing the Spread of Influence through a Social Network

  David Kempe;Jon M. Kleinberg;Éva Tardos

  10984
  Citations

• How bad is selfish routing

  Tim Roughgarden;Éva Tardos

  2630
  Citations

• Algorithm Design

  Jon Kleinberg;Eva Tardos

  2596
  Citations

• Algorithmic Game Theory: Quantifying the Inefficiency of Equilibria

  Noam Nisan;Tim Roughgarden;Eva Tardos;Vijay V. Vazirani

  2359
  Citations

• Algorithmic Game Theory: Computing in Games

  Noam Nisan;Tim Roughgarden;Eva Tardos;Vijay V. Vazirani

  1914
  Citations

• The Price of Stability for Network Design with Fair Cost Allocation

  Elliot Anshelevich;Anirban Dasgupta;Jon Kleinberg;Éva Tardos

  1871
  Citations

• Approximation algorithms for scheduling unrelated parallel machines

  J. K. Lenstra;D. B. Shmoys;É. Tardos

  1395
  Citations

• Influential nodes in a diffusion model for social networks

  David Kempe;Jon Kleinberg;Éva Tardos

  1326
  Citations

• An approximation algorithm for the generalized assignment problem

  David B. Shmoys;Éva Tardos

  907
  Citations

• Fast approximation algorithms for fractional packing and covering problems

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

  879
  Citations

• A constant-factor approximation algorithm for the k -median problem

  Moses Charikar;Sudipto Guha;Éva Tardos;David B. Shmoys

  853
  Citations

• Approximation algorithms for facility location problems

  D.B. Shmoys;É. Tardos;K.I. Aardal

  802
  Citations

• Truthful mechanisms for one-parameter agents

  A. Archer;E. Tardos

  762
  Citations

• Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields

  Jon Kleinberg;Éva Tardos

  759
  Citations

• Approximation algorithms for facility location problems (extended abstract)

  David B. Shmoys;Éva Tardos;Karen Aardal

  756
  Citations

• A strongly polynomial algorithm to solve combinatorial linear programs

  Eva Tardos

  604
  Citations

• Fairness in Routing and Load Balancing

  Jon Kleinberg;Yuval Rabani;Éva Tardos

  522
  Citations

• An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents

  Aaron Archer;Christos H. Papadimitriou;Kunal Talwar;Éva Tardos

  514
  Citations

• Frugal path mechanisms

  Aaron Archer;Éva Tardos

  506
  Citations

• A strongly polynomial minimum cost circulation algorithm

  Éva Tardos

  487
  Citations

• A constant-factor approximation algorithm for the k-median problem (extended abstract)

  Moses Charikar;Sudipto Guha;Éva Tardos;David B. Shmoys

  329
  Citations