Éva Tardos Home Page Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
102Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert D. Kleinberg, Georgios Piliouras, Éva Tardos: Load balancing without regret in the bulletin board model. PODC 2009: 56-62
101Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert Kleinberg, Georgios Piliouras, Éva Tardos: Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract. STOC 2009: 533-542
100Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThành Nguyen, Éva Tardos: Approximate Pure Nash Equilibria via Lovász Local Lemma. WINE 2009: 160-171
99Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLÉva Tardos: Quantifying Outcomes in Games. WINE 2009: 17
98Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarold 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
97no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLP. 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
96Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJon M. Kleinberg, Siddharth Suri, Éva Tardos, Tom Wexler: Strategic network formation with structural holes. ACM Conference on Electronic Commerce 2008: 284-293
95Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThành Nguyen, Éva Tardos: Parallel Imaging Problem. ESA 2008: 684-695
94Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJon M. Kleinberg, Éva Tardos: Balanced outcomes in social exchange networks. STOC 2008: 295-304
93Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnupam Gupta, Aravind Srinivasan, Éva Tardos: Cost-Sharing Mechanisms for Network Design. Algorithmica 50(1): 98-119 (2008)
92no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIrit Dinur, Éva Tardos: Special Issue on Foundations of Computer Science. SIAM J. Comput. 37(6): (2008)
91Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLElliot 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)
90Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJon M. Kleinberg, Siddharth Suri, Éva Tardos, Tom Wexler: Strategic network formation with structural holes. SIGecom Exchanges 7(3): (2008)
89Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLElliot Anshelevich, Anirban Dasgupta, Éva Tardos, Tom Wexler: Near-Optimal Network Design with Selfish Agents. Theory of Computing 4(1): 77-109 (2008)
2007
88no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter 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
87Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThành Nguyen, Éva Tardos: Approximately maximizing efficiency and revenue in polyhedral environments. ACM Conference on Electronic Commerce 2007: 11-19
86Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLarry Blume, David A. Easley, Jon M. Kleinberg, Éva Tardos: Trading networks with price-setting agents. ACM Conference on Electronic Commerce 2007: 143-151
85Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Cramton, Rudolf Müller, Éva Tardos, Moshe Tennenholtz: 07271 Abstracts Collection - Computational Social Systems and the Internet . Computational Social Systems and the Internet 2007
84Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Cramton, Rudolf Müller, Éva Tardos, Moshe Tennenholtz: 07271 Summary - Computational Social Systems and the Internet. Computational Social Systems and the Internet 2007
83Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLP. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel: 07471 Abstracts Collection - Equilibrium Computation. Equilibrium Computation 2007
82Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAaron Archer, Éva Tardos: Frugal path mechanisms. ACM Transactions on Algorithms 3(1): (2007)
81Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAra Hayrapetyan, Éva Tardos, Tom Wexler: A network pricing game for selfish traffic. Distributed Computing 19(4): 255-266 (2007)
2006
80Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZoya Svitkina, Éva Tardos: Facility location with hierarchical facility costs. SODA 2006: 153-161
79Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAra Hayrapetyan, Éva Tardos, Tom Wexler: The effect of collusion in congestion games. STOC 2006: 89-98
2005
78Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Kempe, Jon M. Kleinberg, Éva Tardos: Influential Nodes in a Diffusion Model for Social Networks. ICALP 2005: 1127-1138
77Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHenry C. Lin, Tim Roughgarden, Éva Tardos, Asher Walkover: Braess's Paradox, Fibonacci Numbers, and Exponential Inapproximability. ICALP 2005: 497-512
76Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAra Hayrapetyan, Éva Tardos, Tom Wexler: A network pricing game for selfish traffic. PODC 2005: 284-291
75Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarold 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
74Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAra Hayrapetyan, Chaitanya Swamy, Éva Tardos: Network design for information networks. SODA 2005: 933-942
73Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVardges Melkonian, Éva Tardos: Primal-Dual-Based Algorithms for a Directed Network Design Problem. INFORMS Journal on Computing 17(2): 159-174 (2005)
2004
72Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnupam Gupta, Aravind Srinivasan, Éva Tardos: Cost-Sharing Mechanisms for Network Design. APPROX-RANDOM 2004: 139-150
71Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZoya Svitkina, Éva Tardos: Min-Max Multiway Cut. APPROX-RANDOM 2004: 207-218
70Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLElliot 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
69Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAaron Archer, Jittat Fakcharoenphol, Chris Harrelson, Robert Krauthgamer, Kunal Talwar, Éva Tardos: Approximate classification via earthmover metrics. SODA 2004: 1079-1087
68Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHenry C. Lin, Tim Roughgarden, Éva Tardos: A stronger bound on Braess's Paradox. SODA 2004: 340-341
67Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLÉva Tardos: Network games. STOC 2004: 341-342
66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVardges Melkonian, Éva Tardos: Algorithms for a network design problem with crossing supermodular demands. Networks 43(4): 256-265 (2004)
2003
65Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLÉva Tardos: Approximation Algorithms and Network Games. ESA 2003: 6
64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Pál, Éva Tardos: Group Strategyproof Mechanisms via Primal-Dual Algorithms. FOCS 2003: 584-593
63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid Kempe, Jon M. Kleinberg, Éva Tardos: Maximizing the spread of influence through a social network. KDD 2003: 137-146
62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAaron Archer, Christos H. Papadimitriou, Kunal Talwar, Éva Tardos: An approximate truthful mechanism for combinatorial auctions with single parameter agents. SODA 2003: 205-214
61Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLElliot Anshelevich, Anirban Dasgupta, Éva Tardos, Tom Wexler: Near-optimal network design with selfish agents. STOC 2003: 511-520
60no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAaron Archer, Christos H. Papadimitriou, Kunal Talwar, Éva Tardos: An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents. Internet Mathematics 1(2): (2003)
59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAshish 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
58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAaron Archer, Éva Tardos: Frugal path mechanisms. SODA 2002: 991-999
57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTim Roughgarden, Éva Tardos: How bad is selfish routing? J. ACM 49(2): 236-259 (2002)
56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJon 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)
55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMoses 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
54no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Pál, Éva Tardos, Tom Wexler: Facility Location with Nonuniform Hard Capacities. FOCS 2001: 329-338
53no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAaron Archer, Éva Tardos: Truthful Mechanisms for One-Parameter Agents. FOCS 2001: 482-491
52no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJon M. Kleinberg, Yuval Rabani, Éva Tardos: Fairness in Routing and Load Balancing. J. Comput. Syst. Sci. 63(1): 2-20 (2001)
2000
51no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTim Roughgarden, Éva Tardos: How Bad is Selfish Routing? FOCS 2000: 93-102
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnupam Gupta, Éva Tardos: A constant factor approximation algorithm for a class of classification problems. STOC 2000: 652-658
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruce Hoppe, Éva Tardos: The Quickest Transshipment Problem. Math. Oper. Res. 25(1): 36-62 (2000)
48no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJon M. Kleinberg, Yuval Rabani, Éva Tardos: Allocating Bandwidth for Bursty Connections. SIAM J. Comput. 30(1): 191-217 (2000)
1999
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJon M. Kleinberg, Éva Tardos: Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields. FOCS 1999: 14-23
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJon M. Kleinberg, Yuval Rabani, Éva Tardos: Fairness in Routing and Load Balancing. FOCS 1999: 568-578
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVardges Melkonian, Éva Tardos: Approximation Algorithms for a Directed Network Design Problem. IPCO 1999: 345-360
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLÉva Tardos: Approximation Algorithms for Some Clustering and Classification Problems. ISAAC 1999: 183
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMoses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys: A Constant-Factor Approximation Algorithm for the k-Median Problem (Extended Abstract). STOC 1999: 1-10
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAshish 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
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLÉva Tardos, Kevin D. Wayne: Simple Generalized Maximum Flow Algorithms. IPCO 1998: 310-324
40no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJon M. Kleinberg, Éva Tardos: Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks. J. Comput. Syst. Sci. 57(1): 61-73 (1998)
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLisa Fleischer, Éva Tardos: Efficient continuous-time dynamic network flow algorithms. Oper. Res. Lett. 23(3-5): 71-80 (1998)
1997
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid B. Shmoys, Éva Tardos, Karen Aardal: Approximation Algorithms for Facility Location Problems (Extended Abstract). STOC 1997: 265-274
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJon M. Kleinberg, Yuval Rabani, Éva Tardos: Allocating Bandwidth for Bursty Connections. STOC 1997: 664-673
36no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPhilip N. Klein, Serge A. Plotkin, Satish Rao, Éva Tardos: Approximation Algorithms for Steiner and Directed Multicuts. J. Algorithms 22(2): 241-269 (1997)
1996
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLisa Fleischer, Éva Tardos: Separating Maximally Violated Comb Inequalities in Planar Graphs. IPCO 1996: 475-489
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYuval Rabani, Éva Tardos: Distributed Packet Switching in Arbitrary Networks. STOC 1996: 366-375
1995
33no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJon M. Kleinberg, Éva Tardos: Disjoint Paths in Densely Embedded Graphs. FOCS 1995: 52-61
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruce Hoppe, Éva Tardos: The Quickest Transshipment Problem. SODA 1995: 512-521
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJon M. Kleinberg, Éva Tardos: Approximations for the disjoint paths problem in high-diameter planar networks. STOC 1995: 26-35
30no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerge A. Plotkin, Éva Tardos: Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flows. Combinatorica 15(3): 425-434 (1995)
1994
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichel 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
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruce Hoppe, Éva Tardos: Polynomial Time Algorithms for Some Evacuation Problems. SODA 1994: 433-441
27no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDan Gusfield, Éva Tardos: A Faster Parametric Minimum-Cut Algorithm. Algorithmica 11(3): 278-290 (1994)
26no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPhilip 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
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid B. Shmoys, Éva Tardos: Scheduling Unrelated Machines with Costs. SODA 1993: 448-454
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerge A. Plotkin, Éva Tardos: Improved bounds on the max-flow min-cut ratio for multicommodity flows. STOC 1993: 691-697
23no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLÉ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)
22no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJames B. Orlin, Serge A. Plotkin, Éva Tardos: Polynomial dual network simplex algorithms. Math. Program. 60: 255-276 (1993)
21no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid B. Shmoys, Éva Tardos: An approximation algorithm for the generalized assignment problem. Math. Program. 62: 461-474 (1993)
1992
20no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCarolyn Haibt Norton, Serge A. Plotkin, Éva Tardos: Using Separation Algorithms in Fixed Dimension. J. Algorithms 13(1): 79-98 (1992)
19no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew 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
18no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerge A. Plotkin, David B. Shmoys, Éva Tardos: Fast Approximation Algorithms for Fractional Packing and Covering Problems FOCS 1991: 495-504
17no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank 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
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerge A. Plotkin, Éva Tardos: Improved Dual Network Simplex. SODA 1990: 367-376
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCarolyn Haibt Norton, Serge A. Plotkin, Éva Tardos: Using Separation Algorithms in Fixed Dimension. SODA 1990: 377-387
14no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPhilip N. Klein, Clifford Stein, Éva Tardos: Leighton-Rao Might Be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform Capacities STOC 1990: 310-321
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLÉva Tardos: An intersection theorem for supermatroids. J. Comb. Theory, Ser. B 50(2): 150-159 (1990)
12no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Karel Lenstra, David B. Shmoys, Éva Tardos: Approximation Algorithms for Scheduling Unrelated Parallel Machines. Math. Program. 46: 259-271 (1990)
1989
11no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos: Interior-Point Methods in Parallel Computation FOCS 1989: 350-355
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCor A. J. Hurkens, Alexander Schrijver, Éva Tardos: On fractional multicommodity flows and distance functions. Discrete Mathematics 73(1-2): 99-109 (1989)
9no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrancisco Barahona, Éva Tardos: Note on Weintraub's Minimum-Cost Circulation Algorithm. SIAM J. Comput. 18(3): 579-583 (1989)
1988
8no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Serge A. Plotkin, Éva Tardos: Combinatorial Algorithms for the Generalized Circulation Problem FOCS 1988: 432-443
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLÉva Tardos: The gap between monotone and non-monotone circuit complexity is exponential. Combinatorica 8(1): 141-142 (1988)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZvi Galil, Éva Tardos: An O(n²(m + n log n)log n) min-cost flow algorithm. J. ACM 35(2): 374-386 (1988)
1987
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Karel Lenstra, David B. Shmoys, Éva Tardos: Approximation Algorithms for Scheduling Unrelated Parallel Machines FOCS 1987: 217-224
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrás Frank, Éva Tardos: An application of simultaneous Diophantine approximation in combinatorial optimization. Combinatorica 7(1): 49-65 (1987)
1986
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZvi Galil, Éva Tardos: An O(n^2 (m + n log n) log n) Min-Cost Flow Algorithm FOCS 1986: 1-9
1985
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrás Frank, Éva Tardos: An Application of Simultaneous Approximation in Combinatorial Optimization FOCS 1985: 459-463
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLÉva Tardos: A strongly polynomial minimum cost circulation algorithm. Combinatorica 5(3): 247-256 (1985)

Coauthor Index

1Karen Aardal [38]
2Elliot Anshelevich [61] [70] [89] [91]
3Aaron Archer [53] [58] [60] [62] [69] [82]
4Francisco Barahona [9]
5Larry Blume [86]
6Moses Charikar [43] [55]
7Peter Cramton [84] [85] [88]
8Anirban Dasgupta [61] [70] [89] [91]
9Irit Dinur [92]
10David A. Easley [86]
11Jittat Fakcharoenphol [69]
12Lisa Fleischer [35] [39]
13András Frank [2] [4]
14Harold N. Gabow [75] [98]
15Zvi Galil [3] [6]
16Ashish Goel [42] [59]
17Michel X. Goemans [29] [75] [98]
18Andrew V. Goldberg [8] [11] [19] [29]
19Sudipto Guha [43] [55]
20Anupam Gupta [50] [72] [93]
21Dan Gusfield [27]
22Chris Harrelson [69]
23Ara Hayrapetyan [74] [76] [79] [81]
24Monika Rauch Henzinger (Monika Henzinger, Monika Rauch) [42] [59]
25P. Jean-Jacques Herings [83] [97]
26Bruce Hoppe [28] [32] [49]
27Cor A. J. Hurkens [10]
28Marcin Jurdzinski [83] [97]
29David Kempe [63] [78]
30Philip N. Klein [14] [26] [36]
31Jon M. Kleinberg [31] [33] [37] [40] [46] [47] [48] [52] [56] [63] [70] [78] [86] [90] [91] [94] [96]
32Robert D. Kleinberg (Robert Kleinberg) [101] [102]
33Robert Krauthgamer [69]
34Frank Thomson Leighton (Tom Leighton) [17]
35Jan Karel Lenstra [5] [12]
36Henry C. Lin [68] [77]
37Fillia Makedon [17]
38Vardges Melkonian [45] [66] [73]
39Peter Bro Miltersen [83] [97]
40Rudolf Müller [84] [85] [88]
41Thành Nguyen [87] [95] [100]
42Carolyn Haibt Norton [15] [20]
43James B. Orlin [22]
44Martin Pál (Martin Pal) [54] [64]
45Christos H. Papadimitriou [60] [62]
46Georgios Piliouras [101] [102]
47Serge A. Plotkin [8] [11] [15] [16] [17] [18] [19] [20] [22] [24] [26] [29] [30] [36] [42] [59]
48Yuval Rabani [34] [37] [46] [48] [52]
49Satish Rao [36]
50Tim Roughgarden [51] [57] [68] [70] [77] [91]
51Alexander Schrijver [10]
52David B. Shmoys [5] [11] [12] [18] [19] [21] [25] [29] [38] [43] [55]
53Aravind Srinivasan [72] [93]
54Clifford Stein [14] [17] [26]
55Bernhard von Stengel [83] [97]
56Siddharth Suri [90] [96]
57Zoya Svitkina [71] [80]
58Chaitanya Swamy [74]
59Kunal Talwar [60] [62] [69]
60Moshe Tennenholtz [84] [85] [88]
61Spyros Tragoudas [17]
62Vijay V. Vazirani [23]
63Asher Walkover [77]
64Kevin D. Wayne [41]
65Tom Wexler [54] [61] [70] [76] [79] [81] [89] [90] [91] [96]
66David P. Williamson [29] [75] [98]

Colors in the list of coauthors

Copyright © Sun Mar 14 22:39:24 2010 by Michael Ley (ley@uni-trier.de)