The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Éva Tardos: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David B. Shmoys, Éva Tardos, Karen Aardal
    Approximation Algorithms for Facility Location Problems (Extended Abstract). [Citation Graph (1, 0)][DBLP]
    STOC, 1997, pp:265-274 [Conf]
  2. Zoya Svitkina, Éva Tardos
    Min-Max Multiway Cut. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:207-218 [Conf]
  3. Anupam Gupta, Aravind Srinivasan, Éva Tardos
    Cost-Sharing Mechanisms for Network Design. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:139-150 [Conf]
  4. Éva Tardos
    Approximation Algorithms and Network Games. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:6- [Conf]
  5. Elliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, Éva Tardos, Tom Wexler, Tim Roughgarden
    The Price of Stability for Network Design with Fair Cost Allocation. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:295-304 [Conf]
  6. Aaron Archer, Éva Tardos
    Truthful Mechanisms for One-Parameter Agents. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:482-491 [Conf]
  7. András Frank, Éva Tardos
    An Application of Simultaneous Approximation in Combinatorial Optimization [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:459-463 [Conf]
  8. Zvi Galil, Éva Tardos
    An O(n^2 (m + n log n) log n) Min-Cost Flow Algorithm [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:1-9 [Conf]
  9. Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos
    Interior-Point Methods in Parallel Computation [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:350-355 [Conf]
  10. Andrew V. Goldberg, Serge A. Plotkin, Éva Tardos
    Combinatorial Algorithms for the Generalized Circulation Problem [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:432-443 [Conf]
  11. Jon M. Kleinberg, Yuval Rabani, Éva Tardos
    Fairness in Routing and Load Balancing. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:568-578 [Conf]
  12. Jon M. Kleinberg, Éva Tardos
    Disjoint Paths in Densely Embedded Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:52-61 [Conf]
  13. Jon M. Kleinberg, Éva Tardos
    Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:14-23 [Conf]
  14. Jan Karel Lenstra, David B. Shmoys, Éva Tardos
    Approximation Algorithms for Scheduling Unrelated Parallel Machines [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:217-224 [Conf]
  15. Martin Pál, Éva Tardos
    Group Strategyproof Mechanisms via Primal-Dual Algorithms. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:584-593 [Conf]
  16. Martin Pál, Éva Tardos, Tom Wexler
    Facility Location with Nonuniform Hard Capacities. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:329-338 [Conf]
  17. Serge A. Plotkin, David B. Shmoys, Éva Tardos
    Fast Approximation Algorithms for Fractional Packing and Covering Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:495-504 [Conf]
  18. Tim Roughgarden, Éva Tardos
    How Bad is Selfish Routing? [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:93-102 [Conf]
  19. David Kempe, Jon M. Kleinberg, Éva Tardos
    Influential Nodes in a Diffusion Model for Social Networks. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:1127-1138 [Conf]
  20. Henry Lin, Tim Roughgarden, Éva Tardos, Asher Walkover
    Braess's Paradox, Fibonacci Numbers, and Exponential Inapproximability. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:497-512 [Conf]
  21. Lisa Fleischer, Éva Tardos
    Separating Maximally Violated Comb Inequalities in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:475-489 [Conf]
  22. Vardges Melkonian, Éva Tardos
    Approximation Algorithms for a Directed Network Design Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 1999, pp:345-360 [Conf]
  23. Éva Tardos, Kevin D. Wayne
    Simple Generalized Maximum Flow Algorithms. [Citation Graph (0, 0)][DBLP]
    IPCO, 1998, pp:310-324 [Conf]
  24. Éva Tardos
    Approximation Algorithms for Some Clustering and Classification Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:183- [Conf]
  25. David Kempe, Jon M. Kleinberg, Éva Tardos
    Maximizing the spread of influence through a social network. [Citation Graph (0, 0)][DBLP]
    KDD, 2003, pp:137-146 [Conf]
  26. Ara Hayrapetyan, Éva Tardos, Tom Wexler
    A network pricing game for selfish traffic. [Citation Graph (0, 0)][DBLP]
    PODC, 2005, pp:284-291 [Conf]
  27. Aaron Archer, Jittat Fakcharoenphol, Chris Harrelson, Robert Krauthgamer, Kunal Talwar, Éva Tardos
    Approximate classification via earthmover metrics. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:1079-1087 [Conf]
  28. Aaron Archer, Christos H. Papadimitriou, Kunal Talwar, Éva Tardos
    An approximate truthful mechanism for combinatorial auctions with single parameter agents. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:205-214 [Conf]
  29. Aaron Archer, Éva Tardos
    Frugal path mechanisms. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:991-999 [Conf]
  30. Harold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson
    Approximating the smallest k-edge connected spanning subgraph by LP-rounding. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:562-571 [Conf]
  31. Michel X. Goemans, Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos, David P. Williamson
    Improved Approximation Algorithms for Network Design Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:223-232 [Conf]
  32. Ara Hayrapetyan, Chaitanya Swamy, Éva Tardos
    Network design for information networks. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:933-942 [Conf]
  33. Bruce Hoppe, Éva Tardos
    Polynomial Time Algorithms for Some Evacuation Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:433-441 [Conf]
  34. Bruce Hoppe, Éva Tardos
    The Quickest Transshipment Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:512-521 [Conf]
  35. Henry Lin, Tim Roughgarden, Éva Tardos
    A stronger bound on Braess's Paradox. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:340-341 [Conf]
  36. Carolyn Haibt Norton, Serge A. Plotkin, Éva Tardos
    Using Separation Algorithms in Fixed Dimension. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:377-387 [Conf]
  37. Serge A. Plotkin, Éva Tardos
    Improved Dual Network Simplex. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:367-376 [Conf]
  38. David B. Shmoys, Éva Tardos
    Scheduling Unrelated Machines with Costs. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:448-454 [Conf]
  39. Zoya Svitkina, Éva Tardos
    Facility location with hierarchical facility costs. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:153-161 [Conf]
  40. Elliot Anshelevich, Anirban Dasgupta, Éva Tardos, Tom Wexler
    Near-optimal network design with selfish agents. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:511-520 [Conf]
  41. Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys
    A Constant-Factor Approximation Algorithm for the k-Median Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:1-10 [Conf]
  42. Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin, Éva Tardos
    Scheduling Data Transfers in a Network and the Set Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:189-197 [Conf]
  43. Anupam Gupta, Éva Tardos
    A constant factor approximation algorithm for a class of classification problems. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:652-658 [Conf]
  44. Ara Hayrapetyan, Éva Tardos, Tom Wexler
    The effect of collusion in congestion games. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:89-98 [Conf]
  45. Philip N. Klein, Clifford Stein, Éva Tardos
    Leighton-Rao Might Be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform Capacities [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:310-321 [Conf]
  46. Jon M. Kleinberg, Yuval Rabani, Éva Tardos
    Allocating Bandwidth for Bursty Connections. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:664-673 [Conf]
  47. Jon M. Kleinberg, Éva Tardos
    Approximations for the disjoint paths problem in high-diameter planar networks. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:26-35 [Conf]
  48. Frank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, Éva Tardos, Spyros Tragoudas
    Fast Approximation Algorithms for Multicommodity Flow Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:101-111 [Conf]
  49. Serge A. Plotkin, Éva Tardos
    Improved bounds on the max-flow min-cut ratio for multicommodity flows. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:691-697 [Conf]
  50. Yuval Rabani, Éva Tardos
    Distributed Packet Switching in Arbitrary Networks. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:366-375 [Conf]
  51. Éva Tardos
    Network games. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:341-342 [Conf]
  52. Dan Gusfield, Éva Tardos
    A Faster Parametric Minimum-Cut Algorithm. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:3, pp:278-290 [Journal]
  53. András Frank, Éva Tardos
    An application of simultaneous Diophantine approximation in combinatorial optimization. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1987, v:7, n:1, pp:49-65 [Journal]
  54. Serge A. Plotkin, Éva Tardos
    Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flows. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:3, pp:425-434 [Journal]
  55. Éva Tardos
    A strongly polynomial minimum cost circulation algorithm. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1985, v:5, n:3, pp:247-256 [Journal]
  56. Éva Tardos
    The gap between monotone and non-monotone circuit complexity is exponential. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1988, v:8, n:1, pp:141-142 [Journal]
  57. Vardges Melkonian, Éva Tardos
    Primal-Dual-Based Algorithms for a Directed Network Design Problem. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2005, v:17, n:2, pp:159-174 [Journal]
  58. Éva Tardos, Vijay V. Vazirani
    Improved Bounds for the Max-Flow Min-Multicut Ratio for Planar and K_r, r-Free Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:47, n:2, pp:77-80 [Journal]
  59. Zvi Galil, Éva Tardos
    An O(n²(m + n log n)log n) min-cost flow algorithm. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:2, pp:374-386 [Journal]
  60. Jon M. Kleinberg, Éva Tardos
    Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2002, v:49, n:5, pp:616-639 [Journal]
  61. Tim Roughgarden, Éva Tardos
    How bad is selfish routing? [Citation Graph (0, 0)][DBLP]
    J. ACM, 2002, v:49, n:2, pp:236-259 [Journal]
  62. Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin, Éva Tardos
    Scheduling data transfers in a network and the set scheduling problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:48, n:2, pp:314-332 [Journal]
  63. Philip N. Klein, Serge A. Plotkin, Satish Rao, Éva Tardos
    Approximation Algorithms for Steiner and Directed Multicuts. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:22, n:2, pp:241-269 [Journal]
  64. Carolyn Haibt Norton, Serge A. Plotkin, Éva Tardos
    Using Separation Algorithms in Fixed Dimension. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:1, pp:79-98 [Journal]
  65. Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys
    A Constant-Factor Approximation Algorithm for the k-Median Problem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:1, pp:129-149 [Journal]
  66. Jon M. Kleinberg, Yuval Rabani, Éva Tardos
    Fairness in Routing and Load Balancing. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:63, n:1, pp:2-20 [Journal]
  67. Jon M. Kleinberg, Éva Tardos
    Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1998, v:57, n:1, pp:61-73 [Journal]
  68. Éva Tardos
    An intersection theorem for supermatroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:50, n:2, pp:150-159 [Journal]
  69. Bruce Hoppe, Éva Tardos
    The Quickest Transshipment Problem. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2000, v:25, n:1, pp:36-62 [Journal]
  70. Jan Karel Lenstra, David B. Shmoys, Éva Tardos
    Approximation Algorithms for Scheduling Unrelated Parallel Machines. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1990, v:46, n:, pp:259-271 [Journal]
  71. James B. Orlin, Serge A. Plotkin, Éva Tardos
    Polynomial dual network simplex algorithms. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:255-276 [Journal]
  72. David B. Shmoys, Éva Tardos
    An approximation algorithm for the generalized assignment problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:461-474 [Journal]
  73. Vardges Melkonian, Éva Tardos
    Algorithms for a network design problem with crossing supermodular demands. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:43, n:4, pp:256-265 [Journal]
  74. Lisa Fleischer, Éva Tardos
    Efficient continuous-time dynamic network flow algorithms. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1998, v:23, n:3-5, pp:71-80 [Journal]
  75. Francisco Barahona, Éva Tardos
    Note on Weintraub's Minimum-Cost Circulation Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:3, pp:579-583 [Journal]
  76. Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos
    Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:1, pp:140-150 [Journal]
  77. Philip N. Klein, Serge A. Plotkin, Clifford Stein, Éva Tardos
    Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:3, pp:466-487 [Journal]
  78. Jon M. Kleinberg, Yuval Rabani, Éva Tardos
    Allocating Bandwidth for Bursty Connections. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:1, pp:191-217 [Journal]
  79. Aaron Archer, Éva Tardos
    Frugal path mechanisms. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:1, pp:- [Journal]
  80. Thành Nguyen, Éva Tardos
    Approximately maximizing efficiency and revenue in polyhedral environments. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2007, pp:11-19 [Conf]
  81. Larry Blume, David Easley, Jon M. Kleinberg, Éva Tardos
    Trading networks with price-setting agents. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2007, pp:143-151 [Conf]
  82. Ara Hayrapetyan, Éva Tardos, Tom Wexler
    A network pricing game for selfish traffic. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2007, v:19, n:4, pp:255-266 [Journal]
  83. Cor A. J. Hurkens, Alexander Schrijver, Éva Tardos
    On fractional multicommodity flows and distance functions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:73, n:1-2, pp:99-109 [Journal]

  84. 07271 Abstracts Collection - Computational Social Systems and the Internet . [Citation Graph (, )][DBLP]


  85. 07271 Summary - Computational Social Systems and the Internet. [Citation Graph (, )][DBLP]


  86. 07471 Abstracts Collection - Equilibrium Computation. [Citation Graph (, )][DBLP]


  87. Parallel Imaging Problem. [Citation Graph (, )][DBLP]


  88. Load balancing without regret in the bulletin board model. [Citation Graph (, )][DBLP]


  89. Strategic network formation with structural holes. [Citation Graph (, )][DBLP]


  90. Balanced outcomes in social exchange networks. [Citation Graph (, )][DBLP]


  91. Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract. [Citation Graph (, )][DBLP]


  92. Approximate Pure Nash Equilibria via Lovász Local Lemma. [Citation Graph (, )][DBLP]


  93. Quantifying Outcomes in Games. [Citation Graph (, )][DBLP]


  94. Cost-Sharing Mechanisms for Network Design. [Citation Graph (, )][DBLP]


Search in 0.097secs, Finished in 0.102secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002