Travelled to:1 × Austria
1 × Canada
1 × Finland
1 × Greece
1 × Israel
1 × Italy
1 × Japan
1 × Spain
1 × Sweden
9 × USA
Collaborated with:M.Yannakakis K.Jain U.V.Vazirani N.Garg J.Garg R.Mehta R.M.Karp L.J.Schulman L.G.Valiant D.Chakrabarty A.Mehta S.Khuller S.G.Mitchell K.Mulmuley S.Yazdanbod M.A.Sohoni M.Adler E.Halperin D.P.Williamson M.X.Goemans M.Mihail
Talks about:algorithm (9) approxim (5) applic (4) match (4) problem (3) weight (3) primal (3) easi (3) dual (3) cut (3)
Person: Vijay V. Vazirani
DBLP: Vazirani:Vijay_V=
Contributed to:
2015
20142012200720062003200220011999199419931993199219911990198819871985Wrote 20 papers:
- ICALP-v1-2015-GargMVY #multi #nash #symmetry
- ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria (JG, RM, VVV, SY), pp. 554–566.
- STOC-2014-GargMV #algorithm #equilibrium
- Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions (JG, RM, VVV), pp. 525–534.
- STOC-2012-GargMSV #algorithm
- A complementary pivot algorithm for markets under separable, piecewise-linear concave utilities (JG, RM, MAS, VVV), pp. 1003–1016.
- STOC-2007-JainV #algorithm
- Eisenberg-Gale markets: algorithms and structural properties (KJ, VVV), pp. 364–373.
- ICALP-v1-2006-ChakrabartyMV #design #optimisation
- Design Is as Easy as Optimization (DC, AM, VVV), pp. 477–488.
- STOC-2003-AdlerHKV #network #peer-to-peer #probability #process
- A stochastic process on the hypercube with applications to peer-to-peer networks (MA, EH, RMK, VVV), pp. 575–584.
- STOC-2002-JainV #algorithm
- Equitable cost allocations via primal-dual-type algorithms (KJ, VVV), pp. 313–321.
- STOC-2001-JainV #algorithm #approximate #game studies
- Applications of approximation algorithms to cooperative games (KJ, VVV), pp. 364–372.
- STOC-1999-SchulmanV #approximate #problem
- Majorizing Estimators and the Approximation of #P-Complete Problems (LJS, VVV), pp. 288–294.
- ICALP-1994-GargVY #graph #multi
- Multiway Cuts in Directed and Node Weighted Graphs (NG, VVV, MY), pp. 487–498.
- ICALP-1993-GargVY #algorithm #approximate #multi #set
- Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover (NG, VVV, MY), pp. 64–75.
- STOC-1993-GargVY #approximate #multi #theorem
- Approximate max-flow min-(multi)cut theorems and their applications (NG, VVV, MY), pp. 698–707.
- STOC-1993-WilliamsonGMV #algorithm #approximate #network #problem
- A primal-dual approximation algorithm for generalized Steiner network problems (DPW, MXG, MM, VVV), pp. 708–717.
- ICALP-1992-VaziraniY
- Suboptimal Cuts: Their Enumeration, Weight and Number (VVV, MY), pp. 366–377.
- ICALP-1991-KhullerMV #algorithm #online
- On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages (SK, SGM, VVV), pp. 728–738.
- STOC-1990-KarpVV #algorithm #online
- An Optimal Algorithm for On-line Bipartite Matching (RMK, UVV, VVV), pp. 352–358.
- ICALP-1988-VaziraniY #graph
- Pfaffian Orientations, 0/1 Permanents, and Even Cycles in Directed Graphs (VVV, MY), pp. 667–681.
- STOC-1987-MulmuleyVV #matrix
- Matching Is as Easy as Matrix Inversion (KM, UVV, VVV), pp. 345–354.
- STOC-1985-ValiantV #detection
- NP Is as Easy as Detecting Unique Solutions (LGV, VVV), pp. 458–463.
- STOC-1985-VaziraniV #problem #scheduling
- The Two-Processor Scheduling Problem is in R-NC (UVV, VVV), pp. 11–21.