| 2024 | SAGT | The Investment Management Game: Extending the Scope of the Notion of Core. | Vijay V. Vazirani |
| 2022 | MFCS | Online Bipartite Matching and Adwords (Invited Talk). | Vijay V. Vazirani |
| 2019 | SPAA | NC Algorithms for Computing a Perfect Matching, the Number of Perfect Matchings, and a Maximum Flow in One-Crossing-Minor-Free Graphs. | David Eppstein, Vijay V. Vazirani |
| 2018 | ESA | Finding Stable Matchings That Are Robust to Errors in the Input. | Tung Mai, Vijay V. Vazirani |
| 2018 | FOCS | Planar Graph Perfect Matching Is in NC. | Nima Anari, Vijay V. Vazirani |
| 2018 | SODA | Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities. | Nima Anari, Tung Mai, Shayan Oveis Gharan, Vijay V. Vazirani |
| 2018 | SODA | A New Class of Combinatorial Markets with Covering Constraints: Algorithms and Applications. | Nikhil R. Devanur, Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod |
| 2017 | COCOON | An Incentive Compatible, Efficient Market for Air Traffic Flow Management. | Ruta Mehta, Vijay V. Vazirani |
| 2017 | ICALP | Opinion Dynamics in Networks: Convergence, Stability and Lack of Explosion. | Tung Mai, Ioannis Panageas, Vijay V. Vazirani |
| 2017 | STOC | Settling the complexity of Leontief and PLC exchange markets under exact and approximate equilibria. | Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod |
| 2015 | ICALP | ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria. | Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod |
| 2015 | SAGT | Settling Some Open Problems on 2-Player Symmetric Nash Equilibria. | Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod |
| 2014 | SODA | On Computability of Equilibria in Markets with Production. | Jugal Garg, Vijay V. Vazirani |
| 2014 | STOC | Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions. | Jugal Garg, Ruta Mehta, Vijay V. Vazirani |
| 2013 | IPCO | Thrifty Algorithms for Multistage Robust Optimization. | Anupam Gupta, Viswanath Nagarajan, Vijay V. Vazirani |
| 2012 | CSR | Can the Theory of Algorithms Ratify the "Invisible Hand of the Market"? | Vijay V. Vazirani |
| 2012 | SODA | The notion of a rational convex program, and an algorithm for the Arrow-Debreu Nash bargaining game. | Vijay V. Vazirani |
| 2012 | STOC | A complementary pivot algorithm for markets under separable, piecewise-linear concave utilities. | Jugal Garg, Ruta Mehta, Milind A. Sohoni, Vijay V. Vazirani |
| 2011 | SIGCOMM | How many tiers?: pricing in the internet transit market. | Vytautas Valancius, Cristian Lumezanu, Nick Feamster, Ramesh Johari, Vijay V. Vazirani |
| 2010 | SAGT | A Perfect Price Discrimination Market Model with Production, and a (Rational) Convex Program for It. | Gagan Goel, Vijay V. Vazirani |
| 2010 | SAGT | 2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties. | Vijay V. Vazirani |
| 2008 | AAIM | Nash Bargaining Via Flexible Budget Markets. | Vijay V. Vazirani |
| 2008 | CoNEXT | MINT: a Market for INternet Transit. | Vytautas Valancius, Nick Feamster, Ramesh Johari, Vijay V. Vazirani |
| 2008 | IMC | Fast monitoring of traffic subpopulations. | Anirudh Ramachandran, Srinivasan Seetharaman, Nick Feamster, Vijay V. Vazirani |
| 2008 | IPCO | New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem. | Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani |
| 2007 | STOC | Eisenberg-Gale markets: algorithms and structural properties. | Kamal Jain, Vijay V. Vazirani |
| 2006 | ICALP | Design Is as Easy as Optimization. | Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani |
| 2006 | ICCS | Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping. | Mohammad Taghi Hajiaghayi, Kamal Jain, Lap Chi Lau, Ion I. Mandoiu, Alexander Russell, Vijay V. Vazirani |
| 2006 | ITW | On the Coding Advantage of Multiple Unicast Sessions in Undirected Graphs. | Kamal Jain, Vijay V. Vazirani, Gideon Yuval |
| 2006 | LATIN | Random Bichromatic Matchings. | Nayantara Bhatnagar, Dana Randall, Vijay V. Vazirani, Eric Vigoda |
| 2006 | SODA | Accelerating simulated annealing for the permanent and combinatorial counting problems. | Ivona Bezkov, Daniel Stefankovic, Vijay V. Vazirani, Eric Vigoda |
| 2005 | FOCS | AdWords and Generalized On-line Matching. | Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani |
| 2005 | ISIT | On the capacity of multiple unicast sessions in undirected graphs. | Kamal Jain, Vijay V. Vazirani, Raymond W. Yeung, Gideon Yuval |
| 2005 | SODA | Market equilibria for homothetic, quasi-concave utilities and economies of scale in production. | Kamal Jain, Vijay V. Vazirani, Yinyu Ye |
| 2003 | STOC | A stochastic process on the hypercube with applications to peer-to-peer networks. | Micah Adler, Eran Halperin, Richard M. Karp, Vijay V. Vazirani |
| 2002 | FOCS | Market Equilibrium via a Primal-Dual-Type Algorithm. | Nikhil R. Devanur, Christos H. Papadimitriou, Amin Saberi, Vijay V. Vazirani |
| 2002 | STOC | Equitable cost allocations via primal-dual-type algorithms. | Kamal Jain, Vijay V. Vazirani |
| 2001 | STOC | Applications of approximation algorithms to cooperative games. | Kamal Jain, Vijay V. Vazirani |
| 1999 | FOCS | Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems. | Kamal Jain, Vijay V. Vazirani |
| 1999 | ICCAD | A new heuristic for rectilinear Steiner trees. | Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganley |
| 1999 | SODA | A Primal-Dual Schema Based Approximation Algorithm for the Element Connectivity Problem. | Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, David P. Williamson |
| 1999 | SODA | On the Bidirected Cut Relaxation for the Metric Steiner Tree Problem. | Sridhar Rajagopalan, Vijay V. Vazirani |
| 1999 | STOC | Majorizing Estimators and the Approximation of #P-Complete Problems. | Leonard J. Schulman, Vijay V. Vazirani |
| 1996 | FOCS | An Efficient Algorithm for Constructing Minimal Trellises for Codes over Finite Abelian Groups. | Vijay V. Vazirani, Huzur Saran, B. Sundar Rajan |
| 1995 | COCOON | Primal-Dual Schema Based Approximation Algorithms (Abstract). | Vijay V. Vazirani |
| 1994 | FOCS | Finding separator cuts in planar graphs within twice the optimal | Naveen Garg, Huzur Saran, Vijay V. Vazirani |
| 1994 | ICALP | Multiway Cuts in Directed and Node Weighted Graphs. | Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis |
| 1993 | FOCS | Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs | Sridhar Rajagopalan, Vijay V. Vazirani |
| 1993 | ICALP | Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover. | Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis |
| 1993 | IPCO | A polyhedron with all s-t cuts as vertices, and adjacency of cuts. | Naveen Garg, Vijay V. Vazirani |
| 1993 | STOC | Approximate max-flow min-(multi)cut theorems and their applications. | Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis |
| 1993 | STOC | A primal-dual approximation algorithm for generalized Steiner network problems. | David P. Williamson, Michel X. Goemans, Milena Mihail, Vijay V. Vazirani |
| 1992 | ICALP | Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract). | Vijay V. Vazirani, Mihalis Yannakakis |
| 1992 | SODA | Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arboresences and Edge-Disjoint Spanning Trees. | H. Narayanan, Huzur Saran, Vijay V. Vazirani |
| 1991 | FOCS | Finding k-cuts within Twice the Optimal | Huzur Saran, Vijay V. Vazirani |
| 1991 | ICALP | On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages. | Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani |
| 1991 | WADS | Representing and Enumerating Edge Connectivity Cuts in RNC. | Dalit Naor, Vijay V. Vazirani |
| 1990 | IPCO | A Theory of Alternating Paths and Blossoms for Proving Correctness of the O(\surdVE) General Graph Matching Algorithm. | Vijay V. Vazirani |
| 1990 | STOC | An Optimal Algorithm for On-line Bipartite Matching | Richard M. Karp, Umesh V. Vazirani, Vijay V. Vazirani |
| 1989 | FOCS | Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem, and for Finding a Kuratowski Homeomorph | Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani |
| 1988 | ICALP | Pfaffian Orientations, 0/1 Permanents, and Even Cycles in Directed Graphs. | Vijay V. Vazirani, Mihalis Yannakakis |
| 1987 | STOC | Matching Is as Easy as Matrix Inversion | Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani |
| 1985 | FOCS | Random Polynomial Time Is Equal to Slightly-random Polynomial Time | Umesh V. Vazirani, Vijay V. Vazirani |
| 1985 | STOC | NP Is as Easy as Detecting Unique Solutions | Leslie G. Valiant, Vijay V. Vazirani |
| 1985 | STOC | The Two-Processor Scheduling Problem is in R-NC | Umesh V. Vazirani, Vijay V. Vazirani |
| 1984 | CRYPTO | Efficient and Secure Pseudo-Random Number Generation. | Umesh V. Vazirani, Vijay V. Vazirani |
| 1984 | FOCS | Efficient and Secure Pseudo-Random Number Generation (Extended Abstract) | Umesh V. Vazirani, Vijay V. Vazirani |
| 1983 | CRYPTO | RSA Bits are 732+epsilon Secure. | Umesh V. Vazirani, Vijay V. Vazirani |
| 1983 | CRYPTO | Reducibility Among Protocols. | Manuel Blum, Umesh V. Vazirani, Vijay V. Vazirani |
| 1983 | FOCS | Global Wire Routing in Two-Dimensional Arrays (Extended Abstract) | Richard M. Karp, Frank Thomson Leighton, Ronald L. Rivest, Clark D. Thompson, Umesh V. Vazirani, Vijay V. Vazirani |
| 1983 | FOCS | Trapdoor Pseudo-random Number Generators, with Applications to Protocol Design | Umesh V. Vazirani, Vijay V. Vazirani |
| 1982 | FOCS | A Natural Encoding Scheme Proved Probabilistic Polynomial Complete | Umesh V. Vazirani, Vijay V. Vazirani |
| 1980 | FOCS | An O(sqrt(|v|) |E|) Algorithm for Finding Maximum Matching in General Graphs | Silvio Micali, Vijay V. Vazirani |