| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Éva Tardos Aaron Archer , Jittat Fakcharoenphol , Chris Harrelson , Robert Krauthgamer , Kunal Talwar , Éva Tardos: Approximate classification via earthmover metrics. SODA 2004 : 1079-1087 Henry Lin , Tim Roughgarden , Éva Tardos: A stronger bound on Braess's Paradox. SODA 2004 : 340-341 Éva Tardos: Approximation Algorithms and Network Games. ESA 2003 : 6 Martin Pál , Éva Tardos: Group Strategyproof Mechanisms via Primal-Dual Algorithms. FOCS 2003 : 584-593 David Kempe , Jon M. Kleinberg , Éva Tardos: Maximizing the spread of influence through a social network. KDD 2003 : 137-146 Aaron Archer , Christos H. Papadimitriou , Kunal Talwar , Éva Tardos: An approximate truthful mechanism for combinatorial auctions with single parameter agents. SODA 2003 : 205-214 Elliot Anshelevich , Anirban Dasgupta , Éva Tardos, Tom Wexler : Near-optimal network design with selfish agents. STOC 2003 : 511-520 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) Aaron Archer , Éva Tardos: Frugal path mechanisms. SODA 2002 : 991-999 Tim Roughgarden , Éva Tardos: How bad is selfish routing? J. ACM 49 (2): 236-259 (2002) 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) 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) Martin Pál , Éva Tardos, Tom Wexler : Facility Location with Nonuniform Hard Capacities. FOCS 2001 : 329-338 Aaron Archer , Éva Tardos: Truthful Mechanisms for One-Parameter Agents. FOCS 2001 : 482-491 Jon M. Kleinberg , Yuval Rabani , Éva Tardos: Fairness in Routing and Load Balancing. J. Comput. Syst. Sci. 63 (1): 2-20 (2001) Tim Roughgarden , Éva Tardos: How Bad is Selfish Routing? FOCS 2000 : 93-102 Anupam Gupta , Éva Tardos: A constant factor approximation algorithm for a class of classification problems. STOC 2000 : 652-658 Jon M. Kleinberg , Yuval Rabani , Éva Tardos: Allocating Bandwidth for Bursty Connections. SIAM J. Comput. 30 (1): 191-217 (2000) Jon M. Kleinberg , Éva Tardos: Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields. FOCS 1999 : 14-23 Jon M. Kleinberg , Yuval Rabani , Éva Tardos: Fairness in Routing and Load Balancing. FOCS 1999 : 568-578 Vardges Melkonian , Éva Tardos: Approximation Algorithms for a Directed Network Design Problem. IPCO 1999 : 345-360 Éva Tardos: Approximation Algorithms for Some Clustering and Classification Problems. ISAAC 1999 : 183 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 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 Éva Tardos, Kevin D. Wayne : Simple Generalized Maximum Flow Algorithms. IPCO 1998 : 310-324 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) David B. Shmoys , Éva Tardos, Karen Aardal : Approximation Algorithms for Facility Location Problems (Extended Abstract). STOC 1997 : 265-274 Jon M. Kleinberg , Yuval Rabani , Éva Tardos: Allocating Bandwidth for Bursty Connections. STOC 1997 : 664-673 Philip N. Klein , Serge A. Plotkin , Satish Rao , Éva Tardos: Approximation Algorithms for Steiner and Directed Multicuts. J. Algorithms 22 (2): 241-269 (1997) Lisa Fleischer , Éva Tardos: Separating Maximally Violated Comb Inequalities in Planar Graphs. IPCO 1996 : 475-489 Yuval Rabani , Éva Tardos: Distributed Packet Switching in Arbitrary Networks. STOC 1996 : 366-375 Jon M. Kleinberg , Éva Tardos: Disjoint Paths in Densely Embedded Graphs. FOCS 1995 : 52-61 Bruce Hoppe , Éva Tardos: The Quickest Transshipment Problem. SODA 1995 : 512-521 Jon M. Kleinberg , Éva Tardos: Approximations for the disjoint paths problem in high-diameter planar networks. STOC 1995 : 26-35 Serge A. Plotkin , Éva Tardos: Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flows. Combinatorica 15 (3): 425-434 (1995) 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 Bruce Hoppe , Éva Tardos: Polynomial Time Algorithms for Some Evacuation Problems. SODA 1994 : 433-441 Dan Gusfield , Éva Tardos: A Faster Parametric Minimum-Cut Algorithm. Algorithmica 11 (3): 278-290 (1994) 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) David B. Shmoys , Éva Tardos: Scheduling Unrelated Machines with Costs. SODA 1993 : 448-454 Serge A. Plotkin , Éva Tardos: Improved bounds on the max-flow min-cut ratio for multicommodity flows. STOC 1993 : 691-697 É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) Carolyn Haibt Norton , Serge A. Plotkin , Éva Tardos: Using Separation Algorithms in Fixed Dimension. J. Algorithms 13 (1): 79-98 (1992) 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) Serge A. Plotkin , David B. Shmoys , Éva Tardos: Fast Approximation Algorithms for Fractional Packing and Covering Problems FOCS 1991 : 495-504 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 Serge A. Plotkin , Éva Tardos: Improved Dual Network Simplex. SODA 1990 : 367-376 Carolyn Haibt Norton , Serge A. Plotkin , Éva Tardos: Using Separation Algorithms in Fixed Dimension. SODA 1990 : 377-387 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 Andrew V. Goldberg , Serge A. Plotkin , David B. Shmoys , Éva Tardos: Interior-Point Methods in Parallel Computation FOCS 1989 : 350-355 Francisco Barahona , Éva Tardos: Note on Weintraub's Minimum-Cost Circulation Algorithm. SIAM J. Comput. 18 (3): 579-583 (1989) Andrew V. Goldberg , Serge A. Plotkin , Éva Tardos: Combinatorial Algorithms for the Generalized Circulation Problem FOCS 1988 : 432-443 Éva Tardos: The gap between monotone and non-monotone circuit complexity is exponential. Combinatorica 8 (1): 141-142 (1988) Zvi Galil , Éva Tardos: An O(n²(m + n log n)log n) min-cost flow algorithm. J. ACM 35 (2): 374-386 (1988) Jan Karel Lenstra , David B. Shmoys , Éva Tardos: Approximation Algorithms for Scheduling Unrelated Parallel Machines FOCS 1987 : 217-224 András Frank , Éva Tardos: An application of simultaneous Diophantine approximation in combinatorial optimization. Combinatorica 7 (1): 49-65 (1987) Zvi Galil , Éva Tardos: An O(n^2 (m + n log n) log n) Min-Cost Flow Algorithm FOCS 1986 : 1-9 András Frank , Éva Tardos: An Application of Simultaneous Approximation in Combinatorial Optimization FOCS 1985 : 459-463 Éva Tardos: A strongly polynomial minimum cost circulation algorithm. Combinatorica 5 (3): 247-256 (1985) 1 [ 33 ] 2 [ 53 ] 3 [ 46 ] [ 51 ] [ 54 ] [ 59 ] 4 [ 9 ] 5 [ 37 ] [ 48 ] 6 [ 53 ] 7 [ 59 ] 8 [ 30 ] 9 [ 2 ] [ 4 ] 10 [ 3 ] [ 6 ] 11 [ 36 ] [ 52 ] 12 [ 24 ] 13 [ 8 ] [ 10 ] [ 16 ] [ 24 ] 14 [ 37 ] [ 48 ] 15 [ 43 ] 16 [ 22 ] 17 [ 59 ] 18 [ 36 ] [ 52 ] 19 [ 23 ] [ 27 ] 20 [ 55 ] 21 [ 11 ] [ 21 ] [ 31 ] 22 [ 26 ] [ 28 ] [ 32 ] [ 34 ] [ 40 ] [ 41 ] [ 42 ] [ 45 ] [ 49 ] [ 55 ] 23 [ 59 ] 24 [ 14 ] 25 [ 5 ] 26 [ 58 ] 27 [ 14 ] 28 [ 39 ] 29 [ 12 ] [ 17 ] 30 [ 47 ] [ 56 ] 31 [ 54 ] 32 [ 8 ] [ 10 ] [ 12 ] [ 13 ] [ 14 ] [ 15 ] [ 16 ] [ 17 ] [ 19 ] [ 21 ] [ 24 ] [ 25 ] [ 31 ] [ 36 ] [ 52 ] 33 [ 29 ] [ 32 ] [ 40 ] [ 42 ] [ 45 ] 34 [ 31 ] 35 [ 44 ] [ 50 ] [ 58 ] 36 [ 5 ] [ 10 ] [ 15 ] [ 16 ] [ 20 ] [ 24 ] [ 33 ] [ 37 ] [ 48 ] 37 [ 11 ] [ 14 ] [ 21 ] 38 [ 54 ] [ 59 ] 39 [ 14 ] 40 [ 18 ] 41 [ 35 ] 42 [ 47 ] [ 53 ] 43 [ 24 ]  ©2004 Association for Computing Machinery |
