Vijay V. Vazirani

发表

A new heuristic for rectilinear Steiner trees

Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganley, 1999, 1999 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (Cat. No.99CH37051).

Matching is as easy as matrix inversion

Vijay V. Vazirani, Ketan Mulmuley, Umesh V. Vazirani, 1987, STOC.

A primal-dual schema based approximation algorithm for the element connectivity problem

David P. Williamson, Ion I. Mandoiu, Vijay V. Vazirani, 2002, SODA '99.

Opinion Dynamics in Networks: Convergence, Stability and Lack of Explosion pdf

Vijay V. Vazirani, Tung Mai, Ioannis Panageas, 2016, ICALP.

Finding separator cuts in planar graphs within twice the optimal

Vijay V. Vazirani, Naveen Garg, Huzur Saran, 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

A Pseudo-Deterministic RNC Algorithm for General Graph Perfect Matching pdf

Vijay V. Vazirani, Nima Anari, V. Vazirani, 2019, ArXiv.

Primal-dual approximation algorithms for integral flow and multicut in trees

Mihalis Yannakakis, Vijay V. Vazirani, Naveen Garg, 1997, Algorithmica.

Posted price profit maximization for multicast by approximating fixed points

Aranyak Mehta, Scott Shenker, Vijay V. Vazirani, 2006, J. Algorithms.

New geometry-inspired relaxations and algorithms for the metric Steiner tree problem

Nikhil R. Devanur, Vijay V. Vazirani, Deeparnab Chakrabarty, 2008, Math. Program..

2-Player Nash and Nonsymmetric Bargaining via Flexible Budget Markets pdf

Vijay V. Vazirani, V. Vazirani, 2009, ArXiv.

Set Cover via Dual Fitting

Vijay V. Vazirani, 2003 .

Concave Flow on Small Depth Directed Networks pdf

Richard Peng, Vijay V. Vazirani, Tung Mai, 2017, ArXiv.

New Results on Rationality and Strongly Polynomial Time Solvability in Eisenberg-Gale Markets

Nikhil R. Devanur, Vijay V. Vazirani, Deeparnab Chakrabarty, 2006, WINE.

A Fast Parallel Algorithm for Finding a Maximal Bipartite Set

Vijay V. Vazirani, David Pearson, 1990, FSTTCS.

NC Algorithms for Perfect Matching and Maximum Flow in One-Crossing-Minor-Free Graphs pdf

David Eppstein, Vijay V. Vazirani, 2018, ArXiv.

Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping

Alexander Russell, Mohammad Taghi Hajiaghayi, Ion I. Mandoiu, 2006, International Conference on Computational Science.

Recent results on approximating the Steiner tree problem and its generalizations

Vijay V. Vazirani, V. Vazirani, 2000, Theoretical Computer Science.

NC Algorithms for Computing the Number of Perfect Matchings in K3, 3-free Graphs and Related Problems

Vijay V. Vazirani, V. Vazirani, 1988, SWAT.

A Computationally Motivated Definition Of Parametric Estimation And Its Applications To The Gaussian Distribution

Vijay V. Vazirani, Leonard J. Schulman, 2005, Comb..

A Natural Encoding Scheme Proved Probabilistic Polynomial Complete

Vijay V. Vazirani, Umesh V. Vazirani, 1983, Theor. Comput. Sci..

On the capacity of multiple unicast sessions in undirected graphs

Vijay V. Vazirani, Kamal Jain, Raymond W. Yeung, 2005, ISIT.

Approximation Algorithms for Combinatorial Optimization

Klaus Jansen, Vijay V. Vazirani, Stefano Leonardi, 2000 .

An auction-based market equilibrium algorithm for a production model

Aranyak Mehta, Vijay V. Vazirani, Sanjiv Kapoor, 2007, Theor. Comput. Sci..

ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria

Ruta Mehta, Vijay V. Vazirani, Jugal Garg, 2015, ICALP.

Matching Is as Easy as the Decision Problem, in the NC Model

Vijay V. Vazirani, Nima Anari, V. Vazirani, 2019, ITCS.

Trapdoor pseudo-random number generators, with applications to protocol design

Vijay V. Vazirani, Umesh V. Vazirani, 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

An incentive compatible, efficient market for air traffic flow management

Ruta Mehta, Vijay V. Vazirani, 2020, Theor. Comput. Sci..

Rationality and Strongly Polynomial Solvability of Eisenberg--Gale Markets with Two Agents

Nikhil R. Devanur, Vijay V. Vazirani, Deeparnab Chakrabarty, 2010, SIAM J. Discret. Math..

An efficient algorithm for constructing minimal trellises for codes over finite abelian groups

B. Sundar Rajan, Vijay V. Vazirani, Huzur Saran, 1996, IEEE Trans. Inf. Theory.

Planar Graph Perfect Matching Is in NC

Vijay V. Vazirani, Nima Anari, 2020, J. ACM.

Probabilistic estimation of overlap graphs for large sequence datasets

Srinivas Aluru, Vijay V. Vazirani, Sriram P. Chockalingam, 2017, 2017 IEEE International Conference on Bioinformatics and Biomedicine (BIBM).

Efficient and Secure Pseudo-Random Number Generation

Vijay V. Vazirani, Umesh V. Vazirani, V. Vazirani, 1984, CRYPTO.

An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem

Vijay V. Vazirani, Kamal Jain, 2003, Algorithmica.

Equilibrium Pricing of Digital Goods via a New Market Model pdf

Vijay V. Vazirani, Kamal Jain, V. Vazirani, 2010, ArXiv.

Random polynomial time is equal to slightly-random polynomial time

Vijay V. Vazirani, Umesh V. Vazirani, V. Vazirani, 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

Reducibility Among Protocols

Manuel Blum, Vijay V. Vazirani, Umesh V. Vazirani, 1983, CRYPTO.

A Performance-Based Scheme for Pricing Resources in the Cloud pdf

Vijay V. Vazirani, Kamal Jain, Tung Mai, 2016, WINE.

Random Generation of Combinatorial Structures from a Uniform Distribution

Leslie G. Valiant, Mark Jerrum, Vijay V. Vazirani, 1986, Theor. Comput. Sci..

New Convex Programs for Fisher's Market Model and its Generalizations pdf

Nikhil R. Devanur, Vijay V. Vazirani, Kamal Jain, 2016, ArXiv.

A Market for Air Traffic Flow Management pdf

Vijay V. Vazirani, V. Vazirani, 2011, ArXiv.

Planar Graph Perfect Matching Is in NC

Vijay V. Vazirani, Nima Anari, V. Vazirani, 2017, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

On the bidirected cut relaxation for the metric Steiner tree problem

Vijay V. Vazirani, Sridhar Rajagopalan, V. Vazirani, 1999, SODA '99.

Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs

Mihalis Yannakakis, Vijay V. Vazirani, 1989, Discret. Appl. Math..

A natural encoding scheme proved probabilistic polynomial complete

Vijay V. Vazirani, Umesh V. Vazirani, V. Vazirani, 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

Approximate max-flow min-(multi)cut theorems and their applications

Mihalis Yannakakis, Vijay V. Vazirani, Naveen Garg, 1993, SIAM J. Comput..

RSA bits are .732 + ε secure

Umesh Vazirani, Vijay V. Vazirani, V. Vazirani, 1984 .

Market equilibria for homothetic, quasi-concave utilities and economies of scale in production

Vijay V. Vazirani, Kamal Jain, Yinyu Ye, 2005, SODA '05.

Continuity Properties of Equilibrium Prices and Allocations in Linear Fisher Markets

Nimrod Megiddo, Vijay V. Vazirani, N. Megiddo, 2007, WINE.

How many tiers?: pricing in the internet transit market

Nick Feamster, Vijay V. Vazirani, Vytautas Valancius, 2011, SIGCOMM.

Modeling Tiered Pricing in the Internet Transit Market pdf

Nick Feamster, Vijay V. Vazirani, Vytautas Valancius, 2011, ArXiv.

Finding k-cuts within twice the optimal

Vijay V. Vazirani, Huzur Saran, V. Vazirani, 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

Spending Constraint Utilities with Applications to the Adwords Market

Vijay V. Vazirani, 2010, Math. Oper. Res..

Randomized truthful auctions of digital goods are randomizations over truthful auctions

Aranyak Mehta, Vijay V. Vazirani, V. Vazirani, 2004, EC '04.

A Theory of Alternating Paths and Blossoms for Proving Correctness of the O(\surdVE) General Graph Matching Algorithm

Vijay V. Vazirani, V. Vazirani, 1990, IPCO.

Cycles in Zero-Sum Differential Games and Biological Diversity

Vijay V. Vazirani, Milena Mihail, Tung Mai, 2018, EC.

A Graph Theoretic Approach to Software Watermarking

Ramarathnam Venkatesan, Saurabh Sinha, Vijay V. Vazirani, 2001, Information Hiding.

MINT: a Market for INternet Transit

Nick Feamster, Vijay V. Vazirani, Vytautas Valancius, 2008, CoNEXT '08.

DATE AND TIME ! ! ! A Complementary Pivot Algorithm for Market Equilibrium under Separable , Piecewise-Linear Concave Utilities

Mihalis Yannakakis, Vijay V. Vazirani, M. Yannakakis, 2012 .

Eisenberg-Gale markets: algorithms and structural properties

Vijay V. Vazirani, Kamal Jain, V. Vazirani, 2007, STOC '07.

Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation

Vijay V. Vazirani, Kamal Jain, V. Vazirani, 2001, JACM.

Primal-Dual Schema Based Approximation Algorithms (Abstract)

Vijay V. Vazirani, 1995, COCOON.

Equitable cost allocations via primal-dual-type algorithms

Vijay V. Vazirani, Kamal Jain, V. Vazirani, 2002, STOC '02.

Accelerating simulated annealing for the permanent and combinatorial counting problems

Eric Vigoda, Ivona Bezáková, Vijay V. Vazirani, 2006, SODA '06.

Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover

Mihalis Yannakakis, Vijay V. Vazirani, Naveen Garg, 1993, ICALP.

NP-Completeness of Some Generalizations of the Maximum Matching Problem

Vijay V. Vazirani, Larry J. Stockmeyer, L. Stockmeyer, 1982, Inf. Process. Lett..

Rational Convex Programs and Efficient Algorithms for 2-Player Nash and Nonsymmetric Bargaining Games

Vijay V. Vazirani, V. Vazirani, 2012, SIAM J. Discret. Math..

Settling Some Open Problems on 2-Player Symmetric Nash Equilibria

Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod, 2015, SAGT.

Finding Separator Cuts in Planar Graphs within Twice the Optimal

Vijay V. Vazirani, Naveen Garg, Huzur Saran, 1999, SIAM J. Comput..

An O(v|v| c |E|) algoithm for finding maximum matching in general graphs

Silvio Micali, Vijay V. Vazirani, S. Micali, 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

Price of Anarchy, Locality Gap, and a Network Service Provider Game

Nikhil R. Devanur, Amin Saberi, Vijay V. Vazirani, 2005, WINE.

Introduction to LP-Duality

Vijay V. Vazirani, V. Vazirani, 2003 .

Algorithmic game theory

Tim Roughgarden, Noam Nisan, Vijay V. Vazirani, 2010, Commun. ACM.

NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching

Vijay V. Vazirani, Umesh V. Vazirani, Dexter Kozen, 1985, FSTTCS.

Global Wire Routing in Two-Dimensional Arrays (Extended Abstract)

Richard M. Karp, Frank Thomson Leighton, Ronald L. Rivest, 1983, FOCS.

Eisenberg-Gale Markets: Rationality, Strongly Polynomial Solvability, and Competition Monotonicity

Nikhil R. Devanur, Vijay V. Vazirani, Deeparnab Chakrabarty, 2006, Electron. Colloquium Comput. Complex..

The Steiner Tree Problem and Its Generalizations

Vijay V. Vazirani, 1998, APPROX.

Non-separable, Quasiconcave Utilities are Easy - in a Perfect Price Discrimination Market Model (Extended Abstract)

Vijay V. Vazirani, V. Vazirani, 2010, WINE.

On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages

Samir Khuller, Vijay V. Vazirani, Stephen G. Mitchell, 1991, Theor. Comput. Sci..

Scheduling on Unrelated Parallel Machines

Vijay V. Vazirani, 2003 .

AdWords and generalized on-line matching

Aranyak Mehta, Amin Saberi, Vijay V. Vazirani, 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

A Generalization of Birkhoff's Theorem for Distributive Lattices, with Applications to Robust Stable Matchings pdf

Vijay V. Vazirani, Tung Mai, 2018, ArXiv.

Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs

Vijay V. Vazirani, Sridhar Rajagopalan, V. Vazirani, 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem

Nikhil R. Devanur, Vijay V. Vazirani, Deeparnab Chakrabarty, 2008, IPCO.

Thrifty Algorithms for Multistage Robust Optimization pdf

Vijay V. Vazirani, Anupam Gupta, Viswanath Nagarajan, 2013, IPCO.

10171 Abstracts Collection - Equilibrium Computation

Peter Bro Miltersen, Edith Elkind, Bernhard von Stengel, 2010, Equilibrium Computation.

The Two-Processor Scheduling Problem is in Random NC

Vijay V. Vazirani, Umesh V. Vazirani, 1989, SIAM J. Comput..

On the Coding Advantage of Multiple Unicast Sessions in Undirected Graphs

Vijay V. Vazirani, Kamal Jain, Gideon Yuval, 2006, 2006 IEEE Information Theory Workshop - ITW '06 Punta del Este.

2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties

Vijay V. Vazirani, V. Vazirani, 2009, SAGT.

NP is as easy as detecting unique solutions

Leslie G. Valiant, Vijay V. Vazirani, L. Valiant, 1985, STOC '85.

An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case

Nikhil R. Devanur, Vijay V. Vazirani, V. Vazirani, 2003, FSTTCS.

A Perfect Price Discrimination Market Model with Production, and a Rational Convex Program for It

Gagan Goel, Vijay V. Vazirani, V. Vazirani, 2011, Math. Oper. Res..

Primal-dual approximation algorithms for metric facility location and k-median problems

Vijay V. Vazirani, Kamal Jain, V. Vazirani, 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

ALGORITHMS: Collaborative research: development of vector space based methods for protein structure prediction

Vijay V. Vazirani, Haesun Park, 2007 .

Equitable Cost Allocations via Primal--Dual-Type Algorithms

Vijay V. Vazirani, Kamal Jain, 2008, SIAM J. Comput..

Leontief Exchange Markets Can Solve Multivariate Polynomial Equations, Yielding FIXP and ETR Hardness pdf

Ruta Mehta, Vijay V. Vazirani, Jugal Garg, 2014, ArXiv.

On Computability of Equilibria in Markets with Production pdf

Vijay V. Vazirani, Jugal Garg, V. Vazirani, 2013, SODA.

Representing and Enumerating Edge Connectivity Cuts in RNC

Vijay V. Vazirani, Dalit Naor, V. Vazirani, 1991, WADS.

Efficient and Secure Pseudo-Random Number Generation (Extended Abstract)

Vijay V. Vazirani, Umesh V. Vazirani, V. Vazirani, 1984, FOCS.

A Simplification of the MV Matching Algorithm and its Proof

Vijay V. Vazirani, 2012 .

Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities

Vijay V. Vazirani, Nima Anari, Shayan Oveis Gharan, 2016, SODA.

A Greedy Facility Location Algorithm Analyzed Using Dual Fitting

Evangelos Markakis, Amin Saberi, Vijay V. Vazirani, 2001, RANDOM-APPROX.

Approximation Algorithms

Vijay V. Vazirani, V. Vazirani, 2001, Springer Berlin Heidelberg.

Profit-maximizing multicast pricing by approximating fixed points [Extended Abstract]

Aranyak Mehta, Scott Shenker, Vijay V. Vazirani, 2003, EC '03.

Planar Graph Coloring is not Self-Reducible, Assuming P != NP

Samir Khuller, Vijay V. Vazirani, S. Khuller, 1991, Theor. Comput. Sci..

A primal-dual approximation algorithm for generalized steiner network problems

David P. Williamson, Michel X. Goemans, Vijay V. Vazirani, 1995, Comb..

A stochastic process on the hypercube with applications to peer-to-peer networks

Richard M. Karp, Eran Halperin, Micah Adler, 2003, STOC '03.

A New Class of Combinatorial Markets with Covering Constraints: Algorithms and Applications

Nikhil R. Devanur, Ruta Mehta, Vijay V. Vazirani, 2015, SODA.

Hardness of Approximation

Vijay V. Vazirani, 2003 .

A primal-dual approximation algorithm for generalized steiner network problems

David P. Williamson, Michel X. Goemans, Vijay V. Vazirani, 1993, Comb..

Set Cover via the Primal-Dual Schema

Vijay V. Vazirani, V. Vazirani, 2003 .

Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications

Mihalis Yannakakis, Vijay V. Vazirani, Naveen Garg, 1996, SIAM J. Comput..

Allocation of Divisible Goods Under Lexicographic Preferences pdf

Vijay V. Vazirani, Leonard J. Schulman, V. Vazirani, 2012, FSTTCS.

Finding Stable Matchings that are Robust to Errors in the Input

Vijay V. Vazirani, Tung Mai, V. Vazirani, 2018, ESA.

∃R-Completeness for Decision Versions of Multi-Player (Symmetric) Nash Equilibria

Ruta Mehta, Vijay V. Vazirani, Jugal Garg, 2018, ACM Trans. Economics and Comput..

Equilibrium Computation (Dagstuhl Seminar 14342)

Kurt Mehlhorn, Rahul Savani, Nimrod Megiddo, 2014, Dagstuhl Reports.

Strategyproof cost-sharing mechanisms for set cover and facility location games

Nikhil R. Devanur, Vijay V. Vazirani, Milena Mihail, 2003, EC '03.

A complementary pivot algorithm for markets under separable, piecewise-linear concave utilities

Ruta Mehta, Vijay V. Vazirani, Milind A. Sohoni, 2012, STOC '12.

Rational Convex Programs, Their Feasibility, and the Arrow-Debreu Nash Bargaining Game pdf

Vijay V. Vazirani, V. Vazirani, 2010, ArXiv.

Convex Program Duality, Fisher Markets, and Nash Social Welfare

Nikhil R. Devanur, Richard Cole, Vijay V. Vazirani, 2016, EC.

A Limited-Backtrack Greedy Schema for Approximation Algorithms

Vivek Arora, Vijay V. Vazirani, Huzur Saran, 1994, FSTTCS.

Nonseparable, Concave Utilities Are Easy - in a Perfect Price Discrimination Market Model

Vijay V. Vazirani, V. Vazirani, 2013, SIAM J. Discret. Math..

Strategyproof cost-sharing mechanisms for set cover and facility location games

Nikhil R. Devanur, Vijay V. Vazirani, Milena Mihail, 2005, Decis. Support Syst..

A Real Polynomial for Bipartite Graph Minimum Weight Perfect Matchings pdf

Vijay V. Vazirani, Thorben Tröbst, V. Vazirani, 2020, Inf. Process. Lett..

Settling the complexity of Leontief and PLC exchange markets under exact and approximate equilibria

Ruta Mehta, Vijay V. Vazirani, Jugal Garg, 2017, STOC.

A Perfect Price Discrimination Market Model with Production, and a (Rational) Convex Program for It

Gagan Goel, Vijay V. Vazirani, V. Vazirani, 2010, SAGT.

Algorithms and markets

Vijay V. Vazirani, 2010 .

An optimal algorithm for on-line bipartite matching

Richard M. Karp, Vijay V. Vazirani, Umesh V. Vazirani, 1990, STOC '90.

RSA Bits are 732+epsilon Secure

Vijay V. Vazirani, Umesh V. Vazirani, V. Vazirani, 1983, CRYPTO.

Primal-Dual Schema Based Approximation Algorithms

Vijay V. Vazirani, V. Vazirani, 2000, Theoretical Aspects of Computer Science.

Applications of approximation algorithms to cooperative games

Vijay V. Vazirani, Kamal Jain, V. Vazirani, 2001, STOC '01.

Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm

Ruta Mehta, Vijay V. Vazirani, Jugal Garg, 2018, Math. Oper. Res..

Design is as Easy as Optimization

Aranyak Mehta, Vijay V. Vazirani, Deeparnab Chakrabarty, 2006, SIAM J. Discret. Math..

Multiway cuts in node weighted graphs

Mihalis Yannakakis, Vijay V. Vazirani, Naveen Garg, 2004, J. Algorithms.

Design is as Easy as Optimization

Aranyak Mehta, Vijay V. Vazirani, Deeparnab Chakrabarty, 2010, SIAM J. Discret. Math..

Feedback Vertex Set

Vijay V. Vazirani, 2003 .

Stability-Preserving, Incentive-Compatible, Time-Efficient Mechanisms for Increasing School Capacity pdf

Vijay V. Vazirani, Tung Mai, V. Vazirani, 2019, ArXiv.

Random Bichromatic Matchings

Eric Vigoda, Dana Randall, Vijay V. Vazirani, 2006, Algorithmica.

Sampling a Population with a Semi-Random Source

Vijay V. Vazirani, Umesh V. Vazirani, 1986, FSTTCS.

Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem and for Finding a Kuratowski Homeomorph

Samir Khuller, Vijay V. Vazirani, Stephen G. Mitchell, 1992, SIAM J. Comput..

A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property

Vijay V. Vazirani, Kamal Jain, Dinesh Garg, 2005, Theor. Comput. Sci..

Submodularity Helps in Nash and Nonsymmetric Bargaining Games

Gagan Goel, Changyuan Yu, Vijay V. Vazirani, 2014, SIAM J. Discret. Math..

An Extension of the Birkhoff-von Neumann Theorem to Non-Bipartite Graphs pdf

Vijay V. Vazirani, V. Vazirani, 2020, ArXiv.

Extensions of the spending constraint model: existence and uniqueness of equilibria [Extended Abstract]

Nikhil R. Devanur, Vijay V. Vazirani, V. Vazirani, 2003, EC '03.

Maximum Matchings in General Graphs Through Randomization

Vijay V. Vazirani, Michael O. Rabin, M. Rabin, 1989, J. Algorithms.

A Natural Generalization of Stable Matching Solved via New Insights into Ideal Cuts pdf

Vijay V. Vazirani, Tung Mai, V. Vazirani, 2018, ArXiv.

Efficiency, Fairness and Competitiveness in Nash Bargaining Games

Gagan Goel, Changyuan Yu, Vijay V. Vazirani, 2008, WINE.

A theory of alternating paths and blossoms for proving correctness of the $$O(\sqrt V E)$$ general graph maximum matching algorithm

Vijay V. Vazirani, V. Vazirani, 1990, Comb..

The 'Art of Trellis Decoding' Is Computationally Hardi - For Large Fields

Ion I. Mandoiu, Vijay V. Vazirani, Kamal Jain, 1998, IEEE Trans. Inf. Theory.

Scheduling open shops with parallel machines

Eugene L. Lawler, Vijay V. Vazirani, Michael Luby, 1982, Oper. Res. Lett..

Nash Bargaining Via Flexible Budget Markets

Vijay V. Vazirani, V. Vazirani, 2008, SWAT.

Improved Bounds for the Max-Flow Min-Multicut Ratio for Planar and K_r, r-Free Graphs

Éva Tardos, Vijay V. Vazirani, V. Vazirani, 1993, Inf. Process. Lett..

Eisenberg-Gale markets: Algorithms and game-theoretic properties

Vijay V. Vazirani, Kamal Jain, V. Vazirani, 2010, Games Econ. Behav..

Random Bichromatic Matchings

Eric Vigoda, Dana Randall, Vijay V. Vazirani, 2006, LATIN.

Mutation, Sexual Reproduction and Survival in Dynamic Environments

Ruta Mehta, Vijay V. Vazirani, Prasad Tetali, 2015, ITCS.

A polyhedron with alls—t cuts as vertices, and adjacency of cuts

Vijay V. Vazirani, Naveen Garg, V. Vazirani, 1995, Math. Program..

A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property

Vijay V. Vazirani, Kamal Jain, Dinesh Garg, 2005, Theor. Comput. Sci..

NC Algorithms for Computing the Number of Perfect Matchings in K_3,3-Free Graphs and Related Problems

Vijay V. Vazirani, V. Vazirani, 1989, Inf. Comput..

Minimum Makespan Scheduling

Vijay V. Vazirani, 2003 .

A Market for Scheduling, with Applications to Cloud Computing pdf

Nikhil R. Devanur, Ruta Mehta, Vijay V. Vazirani, 2015, ArXiv.

Continuity Properties of Equilibria in Some Fisher and Arrow-Debreu Market Models

Vijay V. Vazirani, Lei Wang, V. Vazirani, 2009, WINE.

The game of survival: Sexual evolution in dynamic environments pdf

Ruta Mehta, Vijay V. Vazirani, Prasad Tetali, 2015, ArXiv.

Building a Better Mousetrap

Nick Feamster, Vijay V. Vazirani, Srinivasan Seetharaman, 2007 .

An efficient algorithm for constructing minimal trellises for codes over finite Abelian groups

B. Sundar Rajan, Vijay V. Vazirani, Huzur Saran, 1996, Proceedings of 37th Conference on Foundations of Computer Science.

Solvency Games

Vijay V. Vazirani, Leonard J. Schulman, Nevin Kapur, 2008, Electron. Colloquium Comput. Complex..

NP is as easy as detecting unique solutions

Leslie G. Valiant, Vijay V. Vazirani, L. Valiant, 1985, STOC '85.

Can the Theory of Algorithms Ratify the "Invisible Hand of the Market"?

Vijay V. Vazirani, V. Vazirani, 2012, CSR.

Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions

Ruta Mehta, Vijay V. Vazirani, Jugal Garg, 2014, STOC.

An Arrow-Debreu Extension of the Hylland-Zeckhauser Scheme: Equilibrium Existence and Algorithms pdf

Vijay V. Vazirani, Jugal Garg, Thorben Tröbst, 2020, ArXiv.

Further Results on Stability-Preserving Mechanisms for School Choice pdf

Vijay V. Vazirani, Karthik Gajulapalli, James A. Liu, 2019, ArXiv.

Rock-Paper-Scissors, Differential Games and Biological Diversity pdf

Vijay V. Vazirani, Tung Mai, Ioannis Panageas, 2017, ArXiv.

Fast monitoring of traffic subpopulations

Nick Feamster, Vijay V. Vazirani, Srinivasan Seetharaman, 2008, IMC '08.

Finding k Cuts within Twice the Optimal

Vijay V. Vazirani, Huzur Saran, 1995, SIAM J. Comput..

Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP

Evangelos Markakis, Amin Saberi, Vijay V. Vazirani, 2002, JACM.

A Simple Characterization for Truth-Revealing Single-Item Auctions

Aranyak Mehta, Vijay V. Vazirani, Kamal Jain, 2005, WINE.

Learning Economic Parameters from Revealed Preferences

Maria-Florina Balcan, Ruth Urner, Ruta Mehta, 2014, WINE.

Multicut and Integer Multicommodity Flow in Trees

Vijay V. Vazirani, 2003 .

On the capacity of multiple unicast sessions in undirected graphs

Vijay V. Vazirani, Kamal Jain, Gideon Yuval, 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

The two-processor scheduling problem is in R-NC

Vijay V. Vazirani, Umesh V. Vazirani, V. Vazirani, 1985, STOC '85.

Dichotomies in Equilibrium Computation and Membership of PLC Markets in FIXP

Ruta Mehta, Vijay V. Vazirani, Jugal Garg, 2016, Theory Comput..

The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game

Vijay V. Vazirani, V. Vazirani, 2012, JACM.

An Improved Definition of Blossoms and a Simpler Proof of the MV Matching Algorithm pdf

Vijay V. Vazirani, 2012, ArXiv.

Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs

Vijay V. Vazirani, Sridhar Rajagopalan, V. Vazirani, 1999, SIAM J. Comput..

Stability-Preserving, Time-Efficient Mechanisms for School Choice in Two Rounds

Vijay V. Vazirani, Tung Mai, Karthik Gajulapalli, 2020, FSTTCS.

Group Strategyproofness and No Subsidy via LP-Duality

Vijay V. Vazirani, Kamal Jain, V. Vazirani, 1999 .

On-line Algorithms for Weighted Matching and Stable Marriages

Samir Khuller, Vijay V. Vazirani, Stephen G. Mitchell, 1990 .

An auction-based market equilibrium algorithm for a production model

Aranyak Mehta, Vijay V. Vazirani, Sanjiv Kapoor, 2007, Theor. Comput. Sci..

AdWords and Generalized On-line Matching

Aranyak Mehta, Amin Saberi, Umesh Vazirani, 2005, FOCS.

Settling the Complexity of Arrow-Debreu Markets under Leontief and PLC Utilities, using the Classes FIXP and \Exists-R.

Ruta Mehta, Vijay V. Vazirani, Jugal Garg, 2014 .

Majorizing estimators and the approximation of #P-complete problems

Vijay V. Vazirani, Leonard J. Schulman, 1999, STOC '99.

Market equilibrium via a primal--dual algorithm for a convex program

Nikhil R. Devanur, Amin Saberi, Christos H. Papadimitriou, 2008, JACM.

Randomized parallel algorithms for matroid union and intersection, with applications to arboresences and edge-disjoint spanning trees

Vijay V. Vazirani, Huzur Saran, H. Narayanan, 1992, SODA '92.

A Proof of the MV Matching Algorithm pdf

Vijay V. Vazirani, 2020, ArXiv.

Processor efficient parallel algorithms for the two disjoint paths problem, and for finding a Kuratowski homeomorph

Samir Khuller, Vijay V. Vazirani, Stephen G. Mitchell, 1989, 30th Annual Symposium on Foundations of Computer Science.

Markets and the Primal-Dual Paradigm

Vijay V. Vazirani, 2007, WINE.

Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets pdf

Mihalis Yannakakis, Vijay V. Vazirani, M. Yannakakis, 2020, ITCS.

On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages

Samir Khuller, Vijay V. Vazirani, Stephen G. Mitchell, 1994, Theor. Comput. Sci..

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, D. Eppstein, 2019, SPAA.

Algorithmes d'approximation (Collection IRIS)

Vijay V. Vazirani, V. Vazirani, 2007 .

Multiway Cuts in Directed and Node Weighted Graphs

Mihalis Yannakakis, Vijay V. Vazirani, Naveen Garg, 1994, ICALP.

The General Graph Matching Game: Approximate Core pdf

Vijay V. Vazirani, 2021, ArXiv.

Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets

Vijay V. Vazirani, David Pearson, 1993, J. Algorithms.

An approximation algorithm for the fault tolerant metric facility location problem

Vijay V. Vazirani, Kamal Jain, 2000, APPROX.

An Auction-Based Market Equilibrium Algorithm for the Separable Gross Substitutability Case

Vijay V. Vazirani, Rahul Garg, Sanjiv Kapoor, 2004, APPROX-RANDOM.

Pfaffian Orientations, 0/1 Permanents, and Even Cycles in Directed Graphs

Mihalis Yannakakis, Vijay V. Vazirani, 1988, ICALP.

Market equilibrium via a primal-dual-type algorithm

Nikhil R. Devanur, Amin Saberi, Christos H. Papadimitriou, 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

Nash Bargaining Via Flexible Budget Markets

Vijay V. Vazirani, 2008, SWAT.

Algorithmic Game Theory: Preface

Tim Roughgarden, Éva Tardos, Noam Nisan, 2007 .

Online Bipartite Matching and Adwords

Vijay V. Vazirani, 2021 .

Randomized Online Algorithms for Adwords pdf

Vijay V. Vazirani, V. Vazirani, 2021, arXiv.org.

Nash-Bargaining-Based Models for Matching Markets, with Implementations and Experimental Results pdf

Vijay V. Vazirani, Mojtaba Hosseini, V. Vazirani, 2021, ArXiv.

Nash-Bargaining-Based Models for Matching Markets: One-Sided and Two-Sided; Fisher and Arrow-Debreu

Vijay V. Vazirani, Mojtaba Hosseini, V. Vazirani, 2021, ITCS.