Adrian Vetta 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
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJim Geelen, Bert Gerards, Bruce A. Reed, Paul D. Seymour, Adrian Vetta: On the odd-minor variant of Hadwiger's conjecture. J. Comb. Theory, Ser. B 99(1): 20-29 (2009)
2008
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSamuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta: Planar graph bipartization in linear time. Discrete Applied Mathematics 156(7): 1175-1180 (2008)
2007
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLP. Donovan, F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong: Degree-constrained network flows. STOC 2007: 681-688
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew 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)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJiangzhuo 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)
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLouigi Addario-Berry, Neil Olver, Adrian Vetta: A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games. J. Graph Algorithms Appl. 11(1): 309-319 (2007)
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLF. Bruce Shepherd, Adrian Vetta: The Demand-Matching Problem. Math. Oper. Res. 32(3): 563-578 (2007)
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSamuel 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)
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLImre Bárány, Santosh Vempala, Adrian Vetta: Nash equilibria in random games. Random Struct. Algorithms 31(4): 391-405 (2007)
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoseph Cheriyan, Adrian Vetta: Approximation Algorithms for Network Design with Metric Costs. SIAM J. Discrete Math. 21(3): 612-636 (2007)
2006
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoseph Cheriyan, Santosh Vempala, Adrian Vetta: Network Design Via Iterative Rounding Of Setpair Relaxations. Combinatorica 26(3): 255-275 (2006)
2005
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLImre Bárány, Santosh Vempala, Adrian Vetta: Nash Equilibria in Random Games. FOCS 2005: 123-131
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichel X. Goemans, Vahab S. Mirrokni, Adrian Vetta: Sink Equilibria and Convergence. FOCS 2005: 142-154
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSamuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta: Approximate Min-max Relations for Odd Cycles in Planar Graphs. IPCO 2005: 35-50
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoseph Cheriyan, Adrian Vetta: Approximation algorithms for network design with metric costs. STOC 2005: 167-175
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSamuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta: Planar graph bipartization in linear time. Electronic Notes in Discrete Mathematics 19: 265-271 (2005)
2004
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVahab S. Mirrokni, Adrian Vetta: Convergence Issues in Competitive Games. APPROX-RANDOM 2004: 183-194
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJiangzhuo 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
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLF. Bruce Shepherd, Adrian Vetta: Lighting fibers in a dark network. IEEE Journal on Selected Areas in Communications 22(9): 1583-1588 (2004)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRavi Kannan, Santosh Vempala, Adrian Vetta: On clusterings: Good, bad and spectral. J. ACM 51(3): 497-515 (2004)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruce A. Reed, Kaleigh Smith, Adrian Vetta: Finding odd cycle transversals. Oper. Res. Lett. 32(4): 299-301 (2004)
2003
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoseph 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
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAdrian Vetta: Nash Equilibria in Competitive Societies, with Applications to Facility Location, Traffic Routing and Auctions. FOCS 2002: 416-
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLF. Bruce Shepherd, Adrian Vetta: The Demand Matching Problem. IPCO 2002: 457-474
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoseph Cheriyan, Santosh Vempala, Adrian Vetta: Approximation algorithms for minimum-cost k-vertex connected subgraphs. STOC 2002: 306-312
2001
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAdrian Vetta: Approximating the minimum strongly connected subgraph via a matching lower bound. SODA 2001: 417-426
2000
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSantosh Vempala, Adrian Vetta: Factor 4/3 approximations for minimum 2-connected subgraphs. APPROX 2000: 262-273
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRavi Kannan, Santosh Vempala, Adrian Vetta: On Clusterings - Good, Bad and Spectral. FOCS 2000: 367-377

Coauthor Index

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

Colors in the list of coauthors

Copyright © Mon Nov 9 16:52:13 2009 by Michael Ley (ley@uni-trier.de)