Search the dblp DataBase

Publications of Author

1. Vahab S. Mirrokni, Adrian Vetta
   Convergence Issues in Competitive Games. [Citation Graph (0, 0)][DBLP]
   APPROX-RANDOM, 2004, pp:183-194 [Conf]
   
2. Santosh Vempala, Adrian Vetta
   Factor 4/3 approximations for minimum 2-connected subgraphs. [Citation Graph (0, 0)][DBLP]
   APPROX, 2000, pp:262-273 [Conf]
   
3. Imre Bárány, Santosh Vempala, Adrian Vetta
   Nash Equilibria in Random Games. [Citation Graph (0, 0)][DBLP]
   FOCS, 2005, pp:123-131 [Conf]
   
4. Michel X. Goemans, Vahab S. Mirrokni, Adrian Vetta
   Sink Equilibria and Convergence. [Citation Graph (0, 0)][DBLP]
   FOCS, 2005, pp:142-154 [Conf]
   
5. Ravi Kannan, Santosh Vempala, Adrian Vetta
   On Clusterings - Good, Bad and Spectral. [Citation Graph (0, 0)][DBLP]
   FOCS, 2000, pp:367-377 [Conf]
   
6. Adrian Vetta
   Nash Equilibria in Competitive Societies, with Applications to Facility Location, Traffic Routing and Auctions. [Citation Graph (0, 0)][DBLP]
   FOCS, 2002, pp:416-0 [Conf]
   
7. Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta
   Approximate Min-max Relations for Odd Cycles in Planar Graphs. [Citation Graph (0, 0)][DBLP]
   IPCO, 2005, pp:35-50 [Conf]
   
8. F. Bruce Shepherd, Adrian Vetta
   The Demand Matching Problem. [Citation Graph (0, 0)][DBLP]
   IPCO, 2002, pp:457-474 [Conf]
   
9. Adrian Vetta
   Approximating the minimum strongly connected subgraph via a matching lower bound. [Citation Graph (0, 0)][DBLP]
   SODA, 2001, pp:417-426 [Conf]
   
10. Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta
    (Almost) tight bounds and existence theorems for confluent flows. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:529-538 [Conf]
    
11. Joseph Cheriyan, Adrian Vetta
    Approximation algorithms for network design with metric costs. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:167-175 [Conf]
    
12. Joseph Cheriyan, Santosh Vempala, Adrian Vetta
    Approximation algorithms for minimum-cost k-vertex connected subgraphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:306-312 [Conf]
    
13. Joseph Cheriyan, Santosh Vempala, Adrian Vetta
    Network Design Via Iterative Rounding Of Setpair Relaxations. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:3, pp:255-275 [Journal]
    
14. Ravi Kannan, Santosh Vempala, Adrian Vetta
    On clusterings: Good, bad and spectral. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:3, pp:497-515 [Journal]
    
15. Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta
    Approximate min-max relations for odd cycles in planar graphs. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2007, v:110, n:1, pp:71-91 [Journal]
    
16. Bruce A. Reed, Kaleigh Smith, Adrian Vetta
    Finding odd cycle transversals. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:4, pp:299-301 [Journal]
    
17. Joseph Cheriyan, Santosh Vempala, Adrian Vetta
    An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:4, pp:1050-1055 [Journal]
    
18. P. Donovan, F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong
    Degree-constrained network flows. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:681-688 [Conf]
    
19. 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. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2007, v:54, n:4, pp:- [Journal]
    
20. 
    Maximum Flows on Disjoint Paths. [Citation Graph (, )][DBLP]
    
    
21. 
    Computational Aspects of Multimarket Price Wars. [Citation Graph (, )][DBLP]
    
    
22. 
    Planar graph bipartization in linear time. [Citation Graph (, )][DBLP]
    
    
23. 
    An upper bound for the chromatic number of line graphs. [Citation Graph (, )][DBLP]