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