Éva Tardos

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