| Year |
Citation |
Score |
| 2020 |
Anari N, Vazirani VV. Planar Graph Perfect Matching Is in NC Journal of the Acm. 67: 1-34. DOI: 10.1145/3397504 |
0.32 |
|
| 2020 |
Mehta R, Vazirani VV. An incentive compatible, efficient market for air traffic flow management Theoretical Computer Science. 818: 41-50. DOI: 10.1016/J.Tcs.2018.09.006 |
0.37 |
|
| 2018 |
Garg J, Mehta R, Vazirani VV. Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm Mathematics of Operations Research. 43: 996-1024. DOI: 10.1287/Moor.2017.0892 |
0.484 |
|
| 2015 |
Garg J, Mehta R, Sohoni M, Vazirani VV. A complementary pivot algorithm for market equilibrium under separable, piecewise-linear concave utilities Siam Journal On Computing. 44: 1820-1847. DOI: 10.1137/140971002 |
0.544 |
|
| 2014 |
Garg J, Mehta R, Vazirani VV. Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions Proceedings of the Annual Acm Symposium On Theory of Computing. 525-534. DOI: 10.1145/2591796.2591863 |
0.401 |
|
| 2014 |
Chakrabarty D, Goel G, Vazirani VV, Wang L, Yu C. Submodularity helps in nash and nonsymmetric bargaining games Siam Journal On Discrete Mathematics. 28: 99-115. DOI: 10.1137/110821433 |
0.652 |
|
| 2014 |
Garg J, Vazirani VV. On computability of equilibria in markets with production Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1329-1340. |
0.351 |
|
| 2013 |
Vazirani VV. Nonseparable, concave utilities are easy-in a perfect price discrimination market model Siam Journal On Discrete Mathematics. 27: 266-273. DOI: 10.1137/110841849 |
0.361 |
|
| 2012 |
Garg J, Mehta R, Sohoni M, Vazirani VV. A complementary pivot algorithm for markets under separable, piecewise-linear concave utilities Proceedings of the Annual Acm Symposium On Theory of Computing. 1003-1015. DOI: 10.1145/2213977.2214068 |
0.434 |
|
| 2012 |
Vazirani VV. The notion of a rational convex program, and an algorithm for the arrow-debreu nash bargaining game Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 973-992. DOI: 10.1145/2160158.2160160 |
0.493 |
|
| 2012 |
Vazirani VV. Rational convex programs and efficient algorithms for 2-player Nash and nonsymmetric bargaining games Siam Journal On Discrete Mathematics. 26: 896-918. DOI: 10.1137/110832021 |
0.355 |
|
| 2012 |
Vazirani VV. Can the theory of algorithms ratify the "invisible hand of the market"? Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7353: 1-5. DOI: 10.1007/978-3-642-30642-6_1 |
0.303 |
|
| 2011 |
Goel G, Vazirani VV. A perfect price discrimination market model with production, and a rational convex program for it Mathematics of Operations Research. 36: 762-782. DOI: 10.1287/Moor.1110.0517 |
0.649 |
|
| 2011 |
Vazirani VV, Yannakakis M. Market equilibrium under separable, piecewise-linear, concave utilities Journal of the Acm. 58. DOI: 10.1145/1970392.1970394 |
0.402 |
|
| 2010 |
Vazirani VV. Spending constraint utilities with applications to the adwords market Mathematics of Operations Research. 35: 458-478. DOI: 10.1287/Moor.1100.0450 |
0.385 |
|
| 2010 |
Chakrabarty D, Devanur NR, Vazirani VV. Rationality and strongly polynomial solvability of Eisenberg-Gale markets with two agents Siam Journal On Discrete Mathematics. 24: 1117-1136. DOI: 10.1137/070693072 |
0.758 |
|
| 2010 |
Jain K, Vazirani VV. Eisenberg-Gale markets: Algorithms and game-theoretic properties Games and Economic Behavior. 70: 84-106. DOI: 10.1016/J.Geb.2008.11.011 |
0.637 |
|
| 2010 |
Vazirani VV. 2-Player nash and nonsymmetric bargaining games: Algorithms and structural properties Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6386: 323-334. DOI: 10.1007/978-3-642-16170-4_28 |
0.304 |
|
| 2010 |
Goel G, Vazirani V. A perfect price discrimination market model with production, and a (Rational) convex program for it Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6386: 186-197. DOI: 10.1007/978-3-642-16170-4_17 |
0.548 |
|
| 2008 |
Devanur NR, Papadimitriou CH, Saberi A, Vazirani VV. Market equilibrium via a primal - Dual algorithm for a convex program Journal of the Acm. 55. DOI: 10.1145/1411509.1411512 |
0.742 |
|
| 2008 |
Chakrabarty D, Devanur NR, Vazirani VV. New geometry-inspired relaxations and algorithms for the metric steiner tree problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5035: 344-358. DOI: 10.1007/S10107-009-0299-0 |
0.786 |
|
| 2008 |
Bhatnagar N, Randall D, Vazirani VV, Vigoda E. Random bichromatic matchings Algorithmica (New York). 50: 418-445. DOI: 10.1007/S00453-007-9096-4 |
0.359 |
|
| 2008 |
Chakrabarty D, Goel G, Vazirani VV, Wang L, Yu C. Efficiency, fairness and competitiveness in nash bargaining games Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5385: 498-505. DOI: 10.1007/978-3-540-92185-1_55 |
0.648 |
|
| 2008 |
Vazirani VV. Nash bargaining via flexible budget markets Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5034: 2. DOI: 10.1007/978-3-540-68880-8_2 |
0.366 |
|
| 2007 |
Mehta A, Saberi A, Vazirani U, Vazirani V. AdWords and generalized online matching Journal of the Acm. 54. DOI: 10.1145/1284320.1284321 |
0.722 |
|
| 2007 |
Jain K, Vazirani VV. Eisenberg-Gale markets: Algorithms and structural properties Proceedings of the Annual Acm Symposium On Theory of Computing. 364-373. DOI: 10.1145/1250790.1250845 |
0.334 |
|
| 2007 |
Vazirani VV. Combinatorial algorithms for market equilibria Algorithmic Game Theory. 103-134. DOI: 10.1017/CBO9780511800481.007 |
0.366 |
|
| 2007 |
Kapoor S, Mehta A, Vazirani V. An auction-based market equilibrium algorithm for a production model Theoretical Computer Science. 378: 153-164. DOI: 10.1016/j.tcs.2007.02.018 |
0.326 |
|
| 2007 |
Garg D, Jain K, Talwar K, Vazirani VV. A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property Theoretical Computer Science. 378: 143-152. DOI: 10.1016/j.tcs.2007.02.017 |
0.408 |
|
| 2007 |
Vazirani VV. New markets models and algorithms 45th Annual Allerton Conference On Communication, Control, and Computing 2007. 1: 468-470. |
0.339 |
|
| 2007 |
Vazirani VV. Markets and the primal-dual paradigm Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4858: 4. |
0.427 |
|
| 2006 |
Chakrabarty D, Mehta A, Vazirani VV. Design is as easy as optimization Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4051: 477-488. DOI: 10.1137/080735898 |
0.67 |
|
| 2006 |
Bezáková I, Štefankovič D, Vazirani VV, Vigoda E. Accelerating simulated annealing for the permanent and combinatorial counting problems Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 900-907. DOI: 10.1137/050644033 |
0.414 |
|
| 2006 |
Jain K, Vazirani VV, Yuval G. On the capacity of multiple unicast sessions in undirected graphs Ieee Transactions On Information Theory. 52: 2805-2809. DOI: 10.1109/Tit.2006.874543 |
0.546 |
|
| 2006 |
Mehta A, Shenker S, Vazirani VV. Posted price profit maximization for multicast by approximating fixed points Journal of Algorithms. 58: 150-164. DOI: 10.1016/J.Jalgor.2004.08.002 |
0.49 |
|
| 2006 |
Chakrabarty D, Devanur N, Vazirani VV. New results on rationality and strongly polynomial time solvability in Eisenberg-Gale markets Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4286: 239-250. DOI: 10.1007/11944874_22 |
0.615 |
|
| 2006 |
Hajiaghayi MT, Jain K, Lau LC, Mǎndoiu II, Russell A, Vazirani VV. Minimum multicolored subgraph problem in multiplex PCR primer set selection and population haplotyping Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3992: 758-766. DOI: 10.1007/11758525_102 |
0.612 |
|
| 2005 |
Mehta A, Saberi A, Vazirani U, Vazirani V. AdWords and generalized on-line matching Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 2005: 264-273. DOI: 10.1109/SFCS.2005.12 |
0.673 |
|
| 2005 |
Schulman LJ, Vazirani VV. A computationally motivated definition of parametric estimation and its applications to the gaussian distribution Combinatorica. 25: 465-486. DOI: 10.1007/S00493-005-0028-4 |
0.337 |
|
| 2004 |
Garg N, Vazirani VV, Yannakakis M. Multiway cuts in node weighted graphs Journal of Algorithms. 50: 49-61. DOI: 10.1016/S0196-6774(03)00111-1 |
0.406 |
|
| 2004 |
Devanur NR, Vazirani VV. The spending constraint model for market equilibrium: Algorithmic, existence and uniqueness results Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 519-528. |
0.72 |
|
| 2003 |
Jain K, Mahdian M, Markakis E, Saberi A, Vazirani VV. Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP Journal of the Acm. 50: 795-824. DOI: 10.1145/950620.950621 |
0.644 |
|
| 2003 |
Devanur NR, Mihail M, Vazirani VV. Strategyproof cost-sharing mechanisms for set cover and facility location games Proceedings of the Acm Conference On Electronic Commerce. 108-114. DOI: 10.1016/j.dss.2004.08.004 |
0.654 |
|
| 2003 |
Jain K, Vazirani VV. An approximation algorithm for the fault tolerant metric facility location problem Algorithmica (New York). 38: 433-439. DOI: 10.1007/S00453-003-1070-1 |
0.651 |
|
| 2003 |
Devanur NR, Vazirani VV. Extensions of the spending constraint model: Existence and uniqueness of equilibria Proceedings of the Acm Conference On Electronic Commerce. 202-203. |
0.682 |
|
| 2003 |
Devanur NR, Vazirani VV. An improved approximation scheme for computing Arrow-Debreu prices for the linear case Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2914: 149-155. |
0.725 |
|
| 2002 |
Jain K, Vazirani VV. Equitable cost allocations via primal-dual-type algorithms Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 313-321. DOI: 10.1137/060658448 |
0.551 |
|
| 2002 |
Jain K, Mǎndoiu I, Vazirani VV, Williamson DP. A primal-dual schema based approximation algorithm for the element connectivity problem Journal of Algorithms. 45: 1-15. DOI: 10.1016/S0196-6774(02)00222-5 |
0.737 |
|
| 2002 |
Devanur NR, Papadimitriou CH, Saberi A, Vazirani VV. Market equilibrium via a primal-dual-type algorithm Annual Symposium On Foundations of Computer Science - Proceedings. 389-395. |
0.729 |
|
| 2001 |
Jain K, Vazirani VV. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation Journal of the Acm. 48: 274-296. DOI: 10.1145/375827.375845 |
0.658 |
|
| 2000 |
Mandoiu I, Vazirani V, Ganley J. A new heuristic for rectilinear Steiner trees Ieee Transactions On Computer-Aided Design of Integrated Circuits and Systems. 19: 1129-1139. DOI: 10.1109/43.875292 |
0.528 |
|
| 2000 |
Vazirani VV. Recent results on approximating the Steiner tree problem and its generalizations Theoretical Computer Science. 235: 205-216. DOI: 10.1016/S0304-3975(99)00192-9 |
0.383 |
|
| 1999 |
Garg N, Saran H, Vazirani VV. Finding separator cuts in planar graphs within twice the optimal Siam Journal On Computing. 29: 159-179. DOI: 10.1137/S0097539794271692 |
0.496 |
|
| 1998 |
Rajagopalan S, Vazirani VV. Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs Siam Journal On Computing. 28: 525-540. DOI: 10.1137/S0097539793260763 |
0.498 |
|
| 1998 |
Jain K, Mandoiu I, Vazirani VV. The «art of trellis decoding» is computationally hard-for large fields Ieee International Symposium On Information Theory - Proceedings. 13. DOI: 10.1109/ISIT.1998.708591 |
0.536 |
|
| 1998 |
Jain K, Mǎndoiu I, Vazirani VV. The art of trellis decoding is computationally hard - For large fields Ieee Transactions On Information Theory. 44: 1211-1214. DOI: 10.1109/18.669287 |
0.565 |
|
| 1998 |
Vazirani VV. The steiner tree problem and its generalizations Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1444: 33-38. DOI: 10.1007/Bfb0053961 |
0.433 |
|
| 1997 |
Garg N, Vazirani VV, Yannakakis M. Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees Algorithmica (New York). 18: 3-20. DOI: 10.1007/Bf02523685 |
0.422 |
|
| 1996 |
Garg N, Vazirani VV, Yannakakis M. Approximate max-flow min-(multi)cut theorems and their applications Siam Journal On Computing. 25: 235-251. DOI: 10.1137/S0097539793243016 |
0.303 |
|
| 1996 |
Vazirani VV, Saran H, Sundar Rajan B. An efficient algorithm for constructing minimal trellises for codes over finite abelian groups Ieee Transactions On Information Theory. 42: 1839-1854. DOI: 10.1109/18.556679 |
0.38 |
|
| 1995 |
Saran H, Vazirani VV. Finding k Cuts within Twice the Optimal Siam Journal On Computing. 24: 101-108. DOI: 10.1137/S0097539792251730 |
0.378 |
|
| 1995 |
Williamson DP, Goemans MX, Mihail M, Vazirani VV. A primal-dual approximation algorithm for generalized steiner network problems Combinatorica. 15: 435-454. DOI: 10.1007/Bf01299747 |
0.502 |
|
| 1995 |
Vazirani VV. Primal-dual schema based approximation algorithms Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 959: 650-652. DOI: 10.1007/3-540-45878-6_7 |
0.447 |
|
| 1994 |
Narayanan H, Saran H, Vazirani VV. Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arborescences and Edge-Disjoint Spanning Trees Siam Journal On Computing. 23: 387-397. DOI: 10.1137/S0097539791195245 |
0.523 |
|
| 1994 |
Khuller S, Mitchell SG, Vazirani VV. On-line algorithms for weighted bipartite matching and stable marriages Theoretical Computer Science. 127: 255-267. DOI: 10.1016/0304-3975(94)90042-6 |
0.444 |
|
| 1994 |
Vazirani VV. A theory of alternating paths and blossoms for proving correctness of the {Mathematical expression} general graph maximum matching algorithm Combinatorica. 14: 71-109. DOI: 10.1007/BF01305952 |
0.309 |
|
| 1993 |
Tardos E, Vazirani VV. Improved bounds for the max-flow min-multicut ratio for planar and Kr, r-free graphs Information Processing Letters. 47: 77-80. DOI: 10.1016/0020-0190(93)90228-2 |
0.395 |
|
| 1993 |
Pearson D, Vazirani VV. Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets Journal of Algorithms. 14: 171-179. DOI: 10.1006/Jagm.1993.1008 |
0.438 |
|
| 1992 |
Khuller S, Mitchell SG, Vazirani VV. Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem and for Finding a Kuratowski Homeomorph Siam Journal On Computing. 21: 486-506. DOI: 10.1137/0221032 |
0.496 |
|
| 1991 |
Khuller S, Vazirani VV. Planar graph coloring is not self-reducible, assuming P ≠ NP Theoretical Computer Science. 88: 183-189. DOI: 10.1016/0304-3975(91)90081-C |
0.313 |
|
| 1990 |
Karp RM, Vazirani UV, Vazirani VV. Optimal algorithm for on-line bipartite matching . 352-358. |
0.666 |
|
| 1989 |
Vazirani VV. NC algorithms for computing the number of perfect matchings in K3,3-free graphs and related problems Information and Computation. 80: 152-164. DOI: 10.1016/0890-5401(89)90017-5 |
0.447 |
|
| 1989 |
Rabin MO, Vazirani VV. Maximum matchings in general graphs through randomization Journal of Algorithms. 10: 557-567. DOI: 10.1016/0196-6774(89)90005-9 |
0.505 |
|
| 1989 |
Vazirani VV, Yannakakis M. Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs Discrete Applied Mathematics. 25: 179-190. DOI: 10.1016/0166-218X(89)90053-X |
0.33 |
|
| 1989 |
Vazirani UV, Vazirani VV. Two-processor scheduling problem is in random NC Siam Journal On Computing. 18: 1140-1148. |
0.709 |
|
| 1987 |
Mulmuley K, Vazirani UV, Vazirani VV. Matching is as easy as matrix inversion Combinatorica. 7: 105-113. DOI: 10.1007/Bf02579206 |
0.709 |
|
| 1987 |
Karp RM, Leighton FT, Rivest RL, Thompson CD, Vazirani UV, Vazirani VV. Global wire routing in two-dimensional arrays Algorithmica. 2: 113-129. DOI: 10.1007/BF01840353 |
0.556 |
|
| 1987 |
Karp RM, Leighton FT, Rivest RL, Thompson CD, Vazirani UV, Vazirani VV. GLOBAL WIRE ROUTING IN TWO-DIMENSIONAL ARRAYS Algorithmica (New York). 2: 113-129. DOI: 10.1007/Bf01840353 |
0.325 |
|
| 1986 |
Jerrum MR, Valiant LG, Vazirani VV. Random generation of combinatorial structures from a uniform distribution Theoretical Computer Science. 43: 169-188. DOI: 10.1016/0304-3975(86)90174-X |
0.387 |
|
| 1985 |
Valiant LG, Vazirani VV. NP IS AS EASY AS DETECTING UNIQUE SOLUTIONS Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 458-463. DOI: 10.1016/0304-3975(86)90135-0 |
0.318 |
|
| 1985 |
Vazirani UV, Vazirani VV. RANDOM POLYNOMIAL TIME IS EQUAL TO SLIGHTLY-RANDOM POLYNOMIAL TIME Annual Symposium On Foundations of Computer Science (Proceedings). 417-428. |
0.641 |
|
| 1984 |
Vazirani UV, Vazirani VV. EFFICIENT AND SECURE PSEUDO-RANDOM NUMBER GENERATION Annual Symposium On Foundations of Computer Science (Proceedings). 458-463. |
0.583 |
|
| 1983 |
Vazirani UV, Vazirani VV. A natural encoding scheme proved probabilistic polynomial complete Theoretical Computer Science. 24: 291-300. DOI: 10.1016/0304-3975(83)90004-X |
0.613 |
|
| 1983 |
Vazirani UV, Vazirani VV. TRAPDOOR PSEUDO-RANDOM NUMBER GENERATORS, WITH APPLICATIONS TO PROTOCOL DESIGN Annual Symposium On Foundations of Computer Science (Proceedings). 23-30. |
0.57 |
|
| Show low-probability matches. |