Adrian Vetta

2008
24	EE	Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta: Planar graph bipartization in linear time. Discrete Applied Mathematics 156(7): 1175-1180 (2008)
2007
23	EE	P. Donovan, F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong: Degree-constrained network flows. STOC 2007: 681-688
22	EE	A. D. King, Bruce A. Reed, Adrian Vetta: An upper bound for the chromatic number of line graphs. Eur. J. Comb. 28(8): 2182-2187 (2007)
21	EE	Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta: (Almost) Tight bounds and existence theorems for single-commodity confluent flows. J. ACM 54(4): (2007)
20	EE	Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta: Approximate min-max relations for odd cycles in planar graphs. Math. Program. 110(1): 71-91 (2007)
19	EE	Imre Bárány, Santosh Vempala, Adrian Vetta: Nash equilibria in random games. Random Struct. Algorithms 31(4): 391-405 (2007)
18	EE	Joseph Cheriyan, Adrian Vetta: Approximation Algorithms for Network Design with Metric Costs. SIAM J. Discrete Math. 21(3): 612-636 (2007)
2006
17	EE	Joseph Cheriyan, Santosh Vempala, Adrian Vetta: Network Design Via Iterative Rounding Of Setpair Relaxations. Combinatorica 26(3): 255-275 (2006)
2005
16	EE	Imre Bárány, Santosh Vempala, Adrian Vetta: Nash Equilibria in Random Games. FOCS 2005: 123-131
15	EE	Michel X. Goemans, Vahab S. Mirrokni, Adrian Vetta: Sink Equilibria and Convergence. FOCS 2005: 142-154
14	EE	Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta: Approximate Min-max Relations for Odd Cycles in Planar Graphs. IPCO 2005: 35-50
13	EE	Joseph Cheriyan, Adrian Vetta: Approximation algorithms for network design with metric costs. STOC 2005: 167-175
2004
12	EE	Vahab S. Mirrokni, Adrian Vetta: Convergence Issues in Competitive Games. APPROX-RANDOM 2004: 183-194
11	EE	Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta: (Almost) tight bounds and existence theorems for confluent flows. STOC 2004: 529-538
10	EE	F. Bruce Shepherd, Adrian Vetta: Lighting fibers in a dark network. IEEE Journal on Selected Areas in Communications 22(9): 1583-1588 (2004)
9	EE	Ravi Kannan, Santosh Vempala, Adrian Vetta: On clusterings: Good, bad and spectral. J. ACM 51(3): 497-515 (2004)
8	EE	Bruce A. Reed, Kaleigh Smith, Adrian Vetta: Finding odd cycle transversals. Oper. Res. Lett. 32(4): 299-301 (2004)
2003
7	EE	Joseph Cheriyan, Santosh Vempala, Adrian Vetta: An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph. SIAM J. Comput. 32(4): 1050-1055 (2003)
2002
6	EE	Adrian Vetta: Nash Equilibria in Competitive Societies, with Applications to Facility Location, Traffic Routing and Auctions. FOCS 2002: 416-
5	EE	F. Bruce Shepherd, Adrian Vetta: The Demand Matching Problem. IPCO 2002: 457-474
4	EE	Joseph Cheriyan, Santosh Vempala, Adrian Vetta: Approximation algorithms for minimum-cost k-vertex connected subgraphs. STOC 2002: 306-312
2001
3	EE	Adrian Vetta: Approximating the minimum strongly connected subgraph via a matching lower bound. SODA 2001: 417-426
2000
2	EE	Santosh Vempala, Adrian Vetta: Factor 4/3 approximations for minimum 2-connected subgraphs. APPROX 2000: 262-273
1		Ravi Kannan, Santosh Vempala, Adrian Vetta: On Clusterings - Good, Bad and Spectral. FOCS 2000: 367-377

Coauthor Index

1	Imre Bárány	[16] [19]
2	Jiangzhuo Chen	[11] [21]
3	Joseph Cheriyan	[4] [7] [13] [17] [18]
4	P. Donovan	[23]
5	Samuel Fiorini	[14] [20] [24]
6	Michel X. Goemans	[15]
7	Nadia Hardy	[14] [20] [24]
8	Ravi Kannan (Ravindran Kannan)	[1] [9]
9	A. D. King	[22]
10	Robert D. Kleinberg (Robert Kleinberg)	[11] [21]
11	László Lovász	[11] [21]
12	Vahab S. Mirrokni (Seyed Vahab Mirrokni)	[12] [15]
13	Rajmohan Rajaraman	[11] [21]
14	Bruce A. Reed	[8] [14] [20] [22] [24]
15	F. Bruce Shepherd	[5] [10] [23]
16	Kaleigh Smith	[8]
17	Ravi Sundaram	[11] [21]
18	Santosh Vempala	[1] [2] [4] [7] [9] [16] [17] [19]
19	Gordon T. Wilfong	[23]

Colors in the list of coauthors