default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVijay V. Vazirani
Person information
- affiliation: Unniversity of California, Irvine, CA, USA
- affiliation: Georgia Institute of Technology, College of Computing, Atlanta, GA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j67]Jugal Garg, Thorben Tröbst, Vijay V. Vazirani:
One-sided matching markets with endowments: equilibria and algorithms. Auton. Agents Multi Agent Syst. 38(2): 40 (2024)- [j66]Vijay V. Vazirani
:
A Theory of Alternating Paths and Blossoms from the Perspective of Minimum Length. Math. Oper. Res. 49(3): 2009-2047 (2024) - [c118]Vijay V. Vazirani:
The Investment Management Game: Extending the Scope of the Notion of Core. SAGT 2024: 223-239 - [i55]Thorben Tröbst, Vijay V. Vazirani:
Cardinal-Utility Matching Markets: The Quest for Envy-Freeness, Pareto-Optimality, and Efficient Computability. CoRR abs/2402.08851 (2024) - [i54]Vijay V. Vazirani:
The Assignment Game: New Mechanisms for Equitable Core Imputations. CoRR abs/2402.11437 (2024) - [i53]Rohith Reddy Gangam, Naveen Garg, Parnian Shahkar, Vijay V. Vazirani:
The Flow Game: Leximin and Leximax Core Imputations. CoRR abs/2403.06037 (2024) - 2023
- [j65]Thorben Tröbst, Vijay V. Vazirani:
A real polynomial for bipartite graph minimum weight perfect matchings. Inf. Process. Lett. 179: 106286 (2023) - [c117]Jugal Garg, Thorben Tröbst, Vijay V. Vazirani:
A Nash-Bargaining-Based Mechanism for One-Sided Matching Markets and Dichotomous Utilities. AAMAS 2023: 2721-2723 - [c116]Vijay V. Vazirani:
Towards a Practical, Budget-Oblivious Algorithm for the Adwords Problem Under Small Bids. FSTTCS 2023: 21:1-21:14 - [i52]Vijay V. Vazirani:
The Investment Management Game: Extending the Scope of the Notion of Core. CoRR abs/2302.00608 (2023) - [i51]Vijay V. Vazirani:
LP-Duality Theory and the Cores of Games. CoRR abs/2302.07627 (2023) - [i50]Rohith Reddy Gangam, Tung Mai, Nitya Raju, Vijay V. Vazirani:
A Structural and Algorithmic Study of Stable Matching Lattices of Multiple Instances. CoRR abs/2304.02590 (2023) - [i49]Thorben Tröbst, Vijay V. Vazirani:
Two-Sided Matching Markets: Impossibility Results on Existence of Efficient and Envy Free Solutions. CoRR abs/2310.16807 (2023) - 2022
- [j64]Vijay V. Vazirani:
The general graph matching game: Approximate core. Games Econ. Behav. 132: 478-486 (2022) - [c115]Jugal Garg, Thorben Tröbst, Vijay V. Vazirani:
One-Sided Matching Markets with Endowments: Equilibria and Algorithms. AAMAS 2022: 463-471 - [c114]Rohith Reddy Gangam, Tung Mai, Nitya Raju, Vijay V. Vazirani:
A Structural and Algorithmic Study of Stable Matching Lattices of "Nearby" Instances, with Applications. FSTTCS 2022: 19:1-19:20 - [c113]Vijay V. Vazirani:
New Characterizations of Core Imputations of Matching and b-Matching Games. FSTTCS 2022: 28:1-28:13 - [c112]Mojtaba Hosseini, Vijay V. Vazirani:
Nash-Bargaining-Based Models for Matching Markets: One-Sided and Two-Sided; Fisher and Arrow-Debreu. ITCS 2022: 86:1-86:20 - [c111]Vijay V. Vazirani:
Online Bipartite Matching and Adwords (Invited Talk). MFCS 2022: 5:1-5:11 - [i48]Vijay V. Vazirani:
Insights into the Core of the Assignment Game via Complementarity. CoRR abs/2202.00619 (2022) - [i47]Vijay V. Vazirani:
Cores of Games via Total Dual Integrality, with Applications to Perfect Graphs and Polymatroids. CoRR abs/2209.04903 (2022) - 2021
- [j63]David Eppstein, Vijay V. Vazirani:
NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs. SIAM J. Comput. 50(3): 1014-1033 (2021) - [c110]Vijay V. Vazirani, Mihalis Yannakakis:
Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets. ITCS 2021: 59:1-59:19 - [i46]Vijay V. Vazirani:
The General Graph Matching Game: Approximate Core. CoRR abs/2101.07390 (2021) - [i45]Mojtaba Hosseini, Vijay V. Vazirani:
Nash-Bargaining-Based Models for Matching Markets, with Implementations and Experimental Results. CoRR abs/2105.10704 (2021) - [i44]Ioannis Panageas, Thorben Tröbst, Vijay V. Vazirani:
Combinatorial Algorithms for Matching Markets via Nash Bargaining: One-Sided, Two-Sided and Non-Bipartite. CoRR abs/2106.02024 (2021) - [i43]Vijay V. Vazirani:
Randomized Online Algorithms for Adwords. CoRR abs/2107.10777 (2021) - 2020
- [j62]Nima Anari, Vijay V. Vazirani:
Planar Graph Perfect Matching Is in NC. J. ACM 67(4): 21:1-21:34 (2020) - [j61]Ruta Mehta, Vijay V. Vazirani:
An incentive compatible, efficient market for air traffic flow management. Theor. Comput. Sci. 818: 41-50 (2020) - [c109]Karthik Gajulapalli, James A. Liu, Tung Mai, Vijay V. Vazirani:
Stability-Preserving, Time-Efficient Mechanisms for School Choice in Two Rounds. FSTTCS 2020: 21:1-21:15 - [c108]Nima Anari, Vijay V. Vazirani:
Matching Is as Easy as the Decision Problem, in the NC Model. ITCS 2020: 54:1-54:25 - [i42]Thorben Tröbst, Vijay V. Vazirani:
A Real Polynomial for Bipartite Graph Minimum Weight Perfect Matchings. CoRR abs/2003.08917 (2020) - [i41]Vijay V. Vazirani, Mihalis Yannakakis:
Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets. CoRR abs/2004.01348 (2020) - [i40]Jugal Garg, Thorben Tröbst, Vijay V. Vazirani:
An Arrow-Debreu Extension of the Hylland-Zeckhauser Scheme: Equilibrium Existence and Algorithms. CoRR abs/2009.10320 (2020) - [i39]Vijay V. Vazirani:
An Extension of the Birkhoff-von Neumann Theorem to Non-Bipartite Graphs. CoRR abs/2010.05984 (2020) - [i38]Vijay V. Vazirani:
A Proof of the MV Matching Algorithm. CoRR abs/2012.03582 (2020)
2010 – 2019
- 2019
- [c107]David Eppstein, Vijay V. Vazirani:
NC Algorithms for Computing a Perfect Matching, the Number of Perfect Matchings, and a Maximum Flow in One-Crossing-Minor-Free Graphs. SPAA 2019: 23-30 - [i37]Nima Anari, Vijay V. Vazirani:
A Pseudo-Deterministic RNC Algorithm for General Graph Perfect Matching. CoRR abs/1901.10387 (2019) - [i36]Tung Mai, Vijay V. Vazirani:
Stability-Preserving, Incentive-Compatible, Time-Efficient Mechanisms for Increasing School Capacity. CoRR abs/1904.04431 (2019) - [i35]Karthik Gajulapalli, James A. Liu, Vijay V. Vazirani:
Further Results on Stability-Preserving Mechanisms for School Choice. CoRR abs/1906.11475 (2019) - 2018
- [j60]Jugal Garg, Ruta Mehta, Vijay V. Vazirani:
Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm. Math. Oper. Res. 43(3): 996-1024 (2018) - [j59]Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod:
∃R-Completeness for Decision Versions of Multi-Player (Symmetric) Nash Equilibria. ACM Trans. Economics and Comput. 6(1): 1:1-1:23 (2018) - [c106]Tung Mai, Vijay V. Vazirani:
Finding Stable Matchings That Are Robust to Errors in the Input. ESA 2018: 60:1-60:11 - [c105]Nima Anari, Vijay V. Vazirani:
Planar Graph Perfect Matching Is in NC. FOCS 2018: 650-661 - [c104]Tung Mai, Milena Mihail, Ioannis Panageas, Will Ratcliff, Vijay V. Vazirani, Peter Yunker:
Cycles in Zero-Sum Differential Games and Biological Diversity. EC 2018: 339-350 - [c103]Nima Anari, Tung Mai, Shayan Oveis Gharan, Vijay V. Vazirani:
Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities. SODA 2018: 2274-2290 - [c102]Nikhil R. Devanur, Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod:
A New Class of Combinatorial Markets with Covering Constraints: Algorithms and Applications. SODA 2018: 2311-2325 - [i34]David Eppstein, Vijay V. Vazirani:
NC Algorithms for Perfect Matching and Maximum Flow in One-Crossing-Minor-Free Graphs. CoRR abs/1802.00084 (2018) - [i33]Tung Mai, Vijay V. Vazirani:
A Natural Generalization of Stable Matching Solved via New Insights into Ideal Cuts. CoRR abs/1802.06621 (2018) - [i32]Tung Mai, Vijay V. Vazirani:
Finding Stable Matchings that are Robust to Errors in the Input. CoRR abs/1804.00553 (2018) - [i31]Tung Mai, Vijay V. Vazirani:
A Generalization of Birkhoff's Theorem for Distributive Lattices, with Applications to Robust Stable Matchings. CoRR abs/1804.05537 (2018) - 2017
- [c101]Rahul Nihalani, Sriram P. Chockalingam, Shaowei Zhu, Vijay V. Vazirani, Srinivas Aluru:
Probabilistic estimation of overlap graphs for large sequence datasets. BIBM 2017: 247-252 - [c100]Ruta Mehta, Vijay V. Vazirani:
An Incentive Compatible, Efficient Market for Air Traffic Flow Management. COCOON 2017: 407-419 - [c99]Tung Mai, Ioannis Panageas, Vijay V. Vazirani:
Opinion Dynamics in Networks: Convergence, Stability and Lack of Explosion. ICALP 2017: 140:1-140:14 - [c98]Ruta Mehta, Ioannis Panageas, Georgios Piliouras, Prasad Tetali, Vijay V. Vazirani:
Mutation, Sexual Reproduction and Survival in Dynamic Environments. ITCS 2017: 16:1-16:29 - [c97]Richard Cole, Nikhil R. Devanur, Vasilis Gkatzelis, Kamal Jain, Tung Mai, Vijay V. Vazirani, Sadra Yazdanbod:
Convex Program Duality, Fisher Markets, and Nash Social Welfare. EC 2017: 459-460 - [c96]Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod:
Settling the complexity of Leontief and PLC exchange markets under exact and approximate equilibria. STOC 2017: 890-901 - [c95]Kamal Jain, Tung Mai, Vijay V. Vazirani:
A Performance-Based Scheme for Pricing Resources in the Cloud. WINE 2017: 281-293 - [i30]Tung Mai, Richard Peng, Anup B. Rao, Vijay V. Vazirani:
Concave Flow on Small Depth Directed Networks. CoRR abs/1704.07791 (2017) - [i29]Nima Anari, Vijay V. Vazirani:
Planar Graph Perfect Matching is in NC. CoRR abs/1709.07822 (2017) - [i28]Tung Mai, Ioannis Panageas, Will Ratcliff, Vijay V. Vazirani, Peter Yunker:
Rock-Paper-Scissors, Differential Games and Biological Diversity. CoRR abs/1710.11249 (2017) - 2016
- [j58]Jugal Garg, Ruta Mehta, Vijay V. Vazirani:
Dichotomies in Equilibrium Computation and Membership of PLC Markets in FIXP. Theory Comput. 12(1): 1-25 (2016) - [i27]Nikhil R. Devanur, Kamal Jain, Tung Mai, Vijay V. Vazirani, Sadra Yazdanbod:
New Convex Programs for Fisher's Market Model and its Generalizations. CoRR abs/1603.01257 (2016) - [i26]Tung Mai, Ioannis Panageas, Vijay V. Vazirani:
Opinion Dynamics in Networks: Convergence, Stability and Lack of Explosion. CoRR abs/1607.03881 (2016) - [i25]Richard Cole, Nikhil R. Devanur, Vasilis Gkatzelis, Kamal Jain, Tung Mai, Vijay V. Vazirani, Sadra Yazdanbod:
Convex Program Duality, Fisher Markets, and Nash Social Welfare. CoRR abs/1609.06654 (2016) - [i24]Kamal Jain, Tung Mai, Vijay V. Vazirani:
A Performance-Based Scheme for Pricing Resources in the Cloud. CoRR abs/1610.00157 (2016) - [i23]Nima Anari, Tung Mai, Shayan Oveis Gharan, Vijay V. Vazirani:
Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities. CoRR abs/1612.05191 (2016) - 2015
- [j57]Jugal Garg, Ruta Mehta, Milind A. Sohoni, Vijay V. Vazirani:
A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities. SIAM J. Comput. 44(6): 1820-1847 (2015) - [c94]Leonard J. Schulman, Vijay V. Vazirani:
Allocation of Divisible Goods Under Lexicographic Preferences. FSTTCS 2015: 543-559 - [c93]Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod:
ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria. ICALP (1) 2015: 554-566 - [c92]Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod:
Settling Some Open Problems on 2-Player Symmetric Nash Equilibria. SAGT 2015: 272-284 - [i22]Ruta Mehta, Ioannis Panageas, Georgios Piliouras, Prasad Tetali, Vijay V. Vazirani:
The game of survival: Sexual evolution in dynamic environments. CoRR abs/1511.01409 (2015) - [i21]Nikhil R. Devanur, Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod:
A Market for Scheduling, with Applications to Cloud Computing. CoRR abs/1511.08748 (2015) - 2014
- [j56]Deeparnab Chakrabarty, Gagan Goel, Vijay V. Vazirani, Lei Wang, Changyuan Yu:
Submodularity Helps in Nash and Nonsymmetric Bargaining Games. SIAM J. Discret. Math. 28(1): 99-115 (2014) - [c91]Jugal Garg, Vijay V. Vazirani:
On Computability of Equilibria in Markets with Production. SODA 2014: 1329-1340 - [c90]Jugal Garg, Ruta Mehta, Vijay V. Vazirani:
Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions. STOC 2014: 525-534 - [c89]Maria-Florina Balcan, Amit Daniely, Ruta Mehta, Ruth Urner, Vijay V. Vazirani:
Learning Economic Parameters from Revealed Preferences. WINE 2014: 338-353 - [i20]Maria-Florina Balcan, Amit Daniely, Ruta Mehta, Ruth Urner, Vijay V. Vazirani:
Learning Economic Parameters from Revealed Preferences. CoRR abs/1407.7937 (2014) - [i19]Jugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod:
Leontief Exchange Markets Can Solve Multivariate Polynomial Equations, Yielding FIXP and ETR Hardness. CoRR abs/1411.5060 (2014) - [i18]Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod:
Settling Some Open Problems on 2-Player Symmetric Nash Equilibria. CoRR abs/1412.0969 (2014) - [i17]Nimrod Megiddo, Kurt Mehlhorn, Rahul Savani, Vijay V. Vazirani:
Equilibrium Computation (Dagstuhl Seminar 14342). Dagstuhl Reports 4(8): 73-88 (2014) - 2013
- [j55]Vijay V. Vazirani:
Nonseparable, Concave Utilities Are Easy - in a Perfect Price Discrimination Market Model. SIAM J. Discret. Math. 27(1): 266-273 (2013) - [c88]Anupam Gupta, Viswanath Nagarajan, Vijay V. Vazirani:
Thrifty Algorithms for Multistage Robust Optimization. IPCO 2013: 217-228 - [i16]Anupam Gupta, Viswanath Nagarajan, Vijay V. Vazirani:
Thrifty Algorithms for Multistage Robust Optimization. CoRR abs/1302.5445 (2013) - [i15]Ruta Mehta, Vijay V. Vazirani:
An Incentive Compatible, Efficient Market for Air Traffic Flow Management. CoRR abs/1305.3241 (2013) - [i14]Jugal Garg, Vijay V. Vazirani:
Computability of Equilibria in Markets with Production. CoRR abs/1308.5272 (2013) - 2012
- [j54]Vijay V. Vazirani:
The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game. J. ACM 59(2): 7:1-7:36 (2012) - [j53]Vijay V. Vazirani:
Rational Convex Programs and Efficient Algorithms for 2-Player Nash and Nonsymmetric Bargaining Games. SIAM J. Discret. Math. 26(3): 896-918 (2012) - [c87]Vijay V. Vazirani:
Can the Theory of Algorithms Ratify the "Invisible Hand of the Market"? CSR 2012: 1-5 - [c86]Vijay V. Vazirani:
The notion of a rational convex program, and an algorithm for the Arrow-Debreu Nash bargaining game. SODA 2012: 973-992 - [c85]Jugal Garg, Ruta Mehta, Milind A. Sohoni, Vijay V. Vazirani:
A complementary pivot algorithm for markets under separable, piecewise-linear concave utilities. STOC 2012: 1003-1016 - [i13]Leonard J. Schulman, Vijay V. Vazirani:
Allocation of Divisible Goods under Lexicographic Preferences. CoRR abs/1206.4366 (2012) - [i12]Vijay V. Vazirani:
An Improved Definition of Blossoms and a Simpler Proof of the MV Matching Algorithm. CoRR abs/1210.4594 (2012) - 2011
- [j52]Vijay V. Vazirani, Mihalis Yannakakis:
Market equilibrium under separable, piecewise-linear, concave utilities. J. ACM 58(3): 10:1-10:25 (2011) - [j51]Gagan Goel, Vijay V. Vazirani:
A Perfect Price Discrimination Market Model with Production, and a Rational Convex Program for It. Math. Oper. Res. 36(4): 762-782 (2011) - [j50]Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani:
New geometry-inspired relaxations and algorithms for the metric Steiner tree problem. Math. Program. 130(1): 1-32 (2011) - [c84]Vytautas Valancius, Cristian Lumezanu, Nick Feamster, Ramesh Johari, Vijay V. Vazirani:
How many tiers?: pricing in the internet transit market. SIGCOMM 2011: 194-205 - [i11]Vijay V. Vazirani:
A Market for Air Traffic Flow Management. CoRR abs/1109.5214 (2011) - [i10]Vytautas Valancius, Cristian Lumezanu, Nick Feamster, Ramesh Johari, Vijay V. Vazirani:
Modeling Tiered Pricing in the Internet Transit Market. CoRR abs/1112.3740 (2011) - 2010
- [j49]Kamal Jain, Vijay V. Vazirani:
Eisenberg-Gale markets: Algorithms and game-theoretic properties. Games Econ. Behav. 70(1): 84-106 (2010) - [j48]Vijay V. Vazirani:
Spending Constraint Utilities with Applications to the Adwords Market. Math. Oper. Res. 35(2): 458-478 (2010) - [j47]Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani:
Design is as Easy as Optimization. SIAM J. Discret. Math. 24(1): 270-286 (2010) - [j46]Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani:
Rationality and Strongly Polynomial Solvability of Eisenberg--Gale Markets with Two Agents. SIAM J. Discret. Math. 24(3): 1117-1136 (2010) - [c83]Vijay V. Vazirani, Mihalis Yannakakis:
Market Equilibrium under Separable, Piecewise-Linear, Concave Utilities. ICS 2010: 156-165 - [c82]Gagan Goel, Vijay V. Vazirani:
A Perfect Price Discrimination Market Model with Production, and a (Rational) Convex Program for It. SAGT 2010: 186-197 - [c81]Vijay V. Vazirani:
2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties. SAGT 2010: 323-334 - [c80]Vijay V. Vazirani:
Non-separable, Quasiconcave Utilities are Easy - in a Perfect Price Discrimination Market Model (Extended Abstract). WINE 2010: 563-570 - [e3]Edith Elkind, Nimrod Megiddo, Peter Bro Miltersen, Vijay V. Vazirani, Bernhard von Stengel:
Equilibrium Computation, 25.04. - 30.04.2010. Dagstuhl Seminar Proceedings 10171, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i9]Edith Elkind, Nimrod Megiddo, Peter Bro Miltersen, Bernhard von Stengel, Vijay V. Vazirani:
10171 Abstracts Collection - Equilibrium Computation. Equilibrium Computation 2010 - [i8]Kamal Jain, Vijay V. Vazirani:
Equilibrium Pricing of Digital Goods via a New Market Model. CoRR abs/1007.4586 (2010) - [i7]Vijay V. Vazirani:
Rational Convex Programs, Their Feasibility, and the Arrow-Debreu Nash Bargaining Game. CoRR abs/1010.4280 (2010) - [i6]Vijay V. Vazirani:
Non-Separable, Quasiconcave Utilities are Easy -- in a Perfect Price Discrimination Market Model. CoRR abs/1010.4281 (2010)
2000 – 2009
- 2009
- [c79]Vijay V. Vazirani, Lei Wang:
Continuity Properties of Equilibria in Some Fisher and Arrow-Debreu Market Models. WINE 2009: 422-429 - [i5]Vijay V. Vazirani:
2-Player Nash and Nonsymmetric Bargaining via Flexible Budget Markets. CoRR abs/0908.1181 (2009) - 2008
- [j45]Nayantara Bhatnagar, Dana Randall, Vijay V. Vazirani, Eric Vigoda:
Random Bichromatic Matchings. Algorithmica 50(4): 418-445 (2008) - [j44]Nikhil R. Devanur, Christos H. Papadimitriou, Amin Saberi, Vijay V. Vazirani:
Market equilibrium via a primal-dual algorithm for a convex program. J. ACM 55(5): 22:1-22:18 (2008) - [j43]Ivona Bezáková, Daniel Stefankovic, Vijay V. Vazirani, Eric Vigoda:
Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems. SIAM J. Comput. 37(5): 1429-1454 (2008) - [j42]Kamal Jain, Vijay V. Vazirani:
Equitable Cost Allocations via Primal--Dual-Type Algorithms. SIAM J. Comput. 38(1): 241-256 (2008) - [c78]Vijay V. Vazirani:
Nash Bargaining Via Flexible Budget Markets. AAIM 2008: 2 - [c77]Vytautas Valancius, Nick Feamster, Ramesh Johari, Vijay V. Vazirani:
MINT: a Market for INternet Transit. CoNEXT 2008: 70 - [c76]Noam Berger, Nevin Kapur, Leonard J. Schulman, Vijay V. Vazirani:
Solvency Games. FSTTCS 2008: 61-72 - [c75]Anirudh Ramachandran, Srinivasan Seetharaman, Nick Feamster, Vijay V. Vazirani:
Fast monitoring of traffic subpopulations. Internet Measurement Conference 2008: 257-270 - [c74]Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani:
New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem. IPCO 2008: 344-358 - [c73]Vijay V. Vazirani:
Nash Bargaining Via Flexible Budget Markets. SWAT 2008: 4 - [c72]Deeparnab Chakrabarty, Gagan Goel, Vijay V. Vazirani, Lei Wang, Changyuan Yu:
Efficiency, Fairness and Competitiveness in Nash Bargaining Games. WINE 2008: 498-505 - [i4]Noam Berger, Nevin Kapur, Leonard J. Schulman, Vijay V. Vazirani:
Solvency Games. Electron. Colloquium Comput. Complex. TR08 (2008) - [i3]Vijay V. Vazirani, Lei Wang:
Continuity Properties of Equilibria in Some Fisher and Arrow-Debreu Market Models. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j41]Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani:
AdWords and generalized online matching. J. ACM 54(5): 22 (2007) - [j40]Dinesh Garg, Kamal Jain, Kunal Talwar, Vijay V. Vazirani:
A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property. Theor. Comput. Sci. 378(2): 143-152 (2007) - [j39]Sanjiv Kapoor, Aranyak Mehta, Vijay V. Vazirani:
An auction-based market equilibrium algorithm for a production model. Theor. Comput. Sci. 378(2): 153-164 (2007) - [c71]Kamal Jain, Vijay V. Vazirani:
Eisenberg-Gale markets: algorithms and structural properties. STOC 2007: 364-373 - [c70]Vijay V. Vazirani:
Markets and the Primal-Dual Paradigm. WINE 2007: 4 - [c69]Nimrod Megiddo, Vijay V. Vazirani:
Continuity Properties of Equilibrium Prices and Allocations in Linear Fisher Markets. WINE 2007: 362-367 - [e2]Noam Nisan, Tim Roughgarden, Éva Tardos, Vijay V. Vazirani:
Algorithmic Game Theory. Cambridge University Press 2007, ISBN 9780511800481 - 2006
- [j38]Aranyak Mehta, Scott Shenker, Vijay V. Vazirani:
Posted price profit maximization for multicast by approximating fixed points. J. Algorithms 58(2): 150-164 (2006) - [j37]Kamal Jain, Vijay V. Vazirani, Gideon Yuval:
On the capacity of multiple unicast sessions in undirected graphs. IEEE Trans. Inf. Theory 52(6): 2805-2809 (2006) - [c68]Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani:
Design Is as Easy as Optimization. ICALP (1) 2006: 477-488 - [c67]Mohammad Taghi Hajiaghayi, Kamal Jain, Lap Chi Lau, Ion I. Mandoiu, Alexander Russell, Vijay V. Vazirani:
Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping. International Conference on Computational Science (2) 2006: 758-766 - [c66]Kamal Jain, Vijay V. Vazirani, Gideon Yuval:
On the Coding Advantage of Multiple Unicast Sessions in Undirected Graphs. ITW 2006: 211 - [c65]Nayantara Bhatnagar, Dana Randall, Vijay V. Vazirani, Eric Vigoda:
Random Bichromatic Matchings. LATIN 2006: 190-201 - [c64]Ivona Bezáková, Daniel Stefankovic, Vijay V. Vazirani, Eric Vigoda:
Accelerating simulated annealing for the permanent and combinatorial counting problems. SODA 2006: 900-907 - [c63]Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani:
New Results on Rationality and Strongly Polynomial Time Solvability in Eisenberg-Gale Markets. WINE 2006: 239-250 - [i2]Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani:
Eisenberg-Gale Markets: Rationality, Strongly Polynomial Solvability, and Competition Monotonicity. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j36]Leonard J. Schulman, Vijay V. Vazirani:
A Computationally Motivated Definition Of Parametric Estimation And Its Applications To The Gaussian Distribution. Comb. 25(4): 465-486 (2005) - [j35]Nikhil R. Devanur, Milena Mihail, Vijay V. Vazirani:
Strategyproof cost-sharing mechanisms for set cover and facility location games. Decis. Support Syst. 39(1): 11-22 (2005) - [c62]Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani:
AdWords and Generalized On-line Matching. FOCS 2005: 264-273 - [c61]Kamal Jain, Vijay V. Vazirani, Raymond W. Yeung, Gideon Yuval:
On the capacity of multiple unicast sessions in undirected graphs. ISIT 2005: 563-567 - [c60]Kamal Jain, Vijay V. Vazirani, Yinyu Ye:
Market equilibria for homothetic, quasi-concave utilities and economies of scale in production. SODA 2005: 63-71 - [c59]Dinesh Garg, Kamal Jain, Kunal Talwar, Vijay V. Vazirani:
A Primal-Dual Algorithm for Computing Fisher Equilibrium in the Absence of Gross Substitutability Property. WINE 2005: 24-33 - [c58]Sanjiv Kapoor, Aranyak Mehta, Vijay V. Vazirani:
An Auction-Based Market Equilibrium Algorithm for a Production Model. WINE 2005: 102-111 - [c57]Kamal Jain, Aranyak Mehta, Kunal Talwar, Vijay V. Vazirani:
A Simple Characterization for Truth-Revealing Single-Item Auctions. WINE 2005: 122-128 - [c56]Nikhil R. Devanur, Naveen Garg, Rohit Khandekar, Vinayaka Pandit, Amin Saberi, Vijay V. Vazirani:
Price of Anarchy, Locality Gap, and a Network Service Provider Game. WINE 2005: 1046-1055 - 2004
- [j34]Kamal Jain, Vijay V. Vazirani:
An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem. Algorithmica 38(3): 433-439 (2004) - [j33]Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis:
Multiway cuts in node weighted graphs. J. Algorithms 50(1): 49-61 (2004) - [c55]Rahul Garg, Sanjiv Kapoor, Vijay V. Vazirani:
An Auction-Based Market Equilibrium Algorithm for the Separable Gross Substitutability Case. APPROX-RANDOM 2004: 128-138 - [c54]Aranyak Mehta, Vijay V. Vazirani:
Randomized truthful auctions of digital goods are randomizations over truthful auctions. EC 2004: 120-124 - 2003
- [j32]Kamal Jain, Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani:
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM 50(6): 795-824 (2003) - [c53]Nikhil R. Devanur, Vijay V. Vazirani:
An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case. FSTTCS 2003: 149-155 - [c52]Nikhil R. Devanur, Milena Mihail, Vijay V. Vazirani:
Strategyproof cost-sharing mechanisms for set cover and facility location games. EC 2003: 108-114 - [c51]Nikhil R. Devanur, Vijay V. Vazirani:
Extensions of the spending constraint-model: existence and uniqueness of equilibria (extended abstract). EC 2003: 202-203 - [c50]Aranyak Mehta, Scott Shenker, Vijay V. Vazirani:
Profit-maximizing multicast pricing by approximating fixed points. EC 2003: 218-219 - [c49]Micah Adler, Eran Halperin, Richard M. Karp, Vijay V. Vazirani:
A stochastic process on the hypercube with applications to peer-to-peer networks. STOC 2003: 575-584 - 2002
- [j31]Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, David P. Williamson:
A primal-dual schema based approximation algorithm for the element connectivity problem. J. Algorithms 45(1): 1-15 (2002) - [c48]Nikhil R. Devanur, Christos H. Papadimitriou, Amin Saberi, Vijay V. Vazirani:
Market Equilibrium via a Primal-Dual-Type Algorithm. FOCS 2002: 389-395 - [c47]Kamal Jain, Vijay V. Vazirani:
Equitable cost allocations via primal-dual-type algorithms. STOC 2002: 313-321 - [e1]Klaus Jansen, Stefano Leonardi, Vijay V. Vazirani:
Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings. Lecture Notes in Computer Science 2462, Springer 2002, ISBN 3-540-44186-7 [contents] - [i1]Kamal Jain, Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani:
Greedy Facility Location Algorithms Analyzed using Dual Fitting with Factor-Revealing LP. CoRR cs.DS/0207028 (2002) - 2001
- [b1]Vijay V. Vazirani:
Approximation algorithms. Springer 2001, ISBN 978-3-540-65367-7, pp. I-IXI, 1-378 - [j30]Kamal Jain, Vijay V. Vazirani:
Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation. J. ACM 48(2): 274-296 (2001) - [c46]Ramarathnam Venkatesan, Vijay V. Vazirani, Saurabh Sinha:
A Graph Theoretic Approach to Software Watermarking. Information Hiding 2001: 157-168 - [c45]Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani:
A Greedy Facility Location Algorithm Analyzed Using Dual Fitting. RANDOM-APPROX 2001: 127-137 - [c44]Kamal Jain, Vijay V. Vazirani:
Applications of approximation algorithms to cooperative games. STOC 2001: 364-372 - 2000
- [j29]Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganley:
A new heuristic for rectilinear Steiner trees. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 19(10): 1129-1139 (2000) - [j28]Vijay V. Vazirani:
Recent results on approximating the Steiner tree problem and its generalizations. Theor. Comput. Sci. 235(1): 205-216 (2000) - [c43]Vijay V. Vazirani:
Primal-Dual Schema Based Approximation Algorithms. Theoretical Aspects of Computer Science 2000: 198-207 - [c42]Kamal Jain, Vijay V. Vazirani:
An approximation algorithm for the fault tolerant metric facility location problem. APPROX 2000: 177-183
1990 – 1999
- 1999
- [j27]Naveen Garg, Huzur Saran, Vijay V. Vazirani:
Finding Separator Cuts in Planar Graphs within Twice the Optimal. SIAM J. Comput. 29(1): 159-179 (1999) - [c41]Kamal Jain, Vijay V. Vazirani:
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems. FOCS 1999: 2-13 - [c40]Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganley:
A new heuristic for rectilinear Steiner trees. ICCAD 1999: 157-162 - [c39]Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, David P. Williamson:
A Primal-Dual Schema Based Approximation Algorithm for the Element Connectivity Problem. SODA 1999: 484-489 - [c38]Sridhar Rajagopalan, Vijay V. Vazirani:
On the Bidirected Cut Relaxation for the Metric Steiner Tree Problem. SODA 1999: 742-751 - [c37]Leonard J. Schulman, Vijay V. Vazirani:
Majorizing Estimators and the Approximation of #P-Complete Problems. STOC 1999: 288-294 - 1998
- [j26]Sridhar Rajagopalan, Vijay V. Vazirani:
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs. SIAM J. Comput. 28(2): 525-540 (1998) - [j25]Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani:
The 'Art of Trellis Decoding' Is Computationally Hardi - For Large Fields. IEEE Trans. Inf. Theory 44(3): 1211-1214 (1998) - [c36]Vijay V. Vazirani:
The Steiner Tree Problem and Its Generalizations. APPROX 1998: 33-38 - 1997
- [j24]Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis:
Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees. Algorithmica 18(1): 3-20 (1997) - 1996
- [j23]Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis:
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications. SIAM J. Comput. 25(2): 235-251 (1996) - [j22]Vijay V. Vazirani, Huzur Saran, B. Sundar Rajan:
An efficient algorithm for constructing minimal trellises for codes over finite abelian groups. IEEE Trans. Inf. Theory 42(6): 1839-1854 (1996) - [c35]Vijay V. Vazirani, Huzur Saran, B. Sundar Rajan:
An Efficient Algorithm for Constructing Minimal Trellises for Codes over Finite Abelian Groups. FOCS 1996: 144-153 - 1995
- [j21]David P. Williamson, Michel X. Goemans, Milena Mihail, Vijay V. Vazirani:
A Primal-Dual Approximation Algorithm for Generalized Steiner Network Problems. Comb. 15(3): 435-454 (1995) - [j20]Naveen Garg, Vijay V. Vazirani:
A polyhedron with alls - t cuts as vertices, and adjacency of cuts. Math. Program. 70: 17-25 (1995) - [j19]Huzur Saran, Vijay V. Vazirani:
Finding k Cuts within Twice the Optimal. SIAM J. Comput. 24(1): 101-108 (1995) - [c34]Vijay V. Vazirani:
Primal-Dual Schema Based Approximation Algorithms (Abstract). COCOON 1995: 650-652 - 1994
- [j18]Vijay V. Vazirani:
A Theory of Alternating Paths and Blossoms for Proving Correctness of the O(sqrt{V E}) General Graph Maximum Matching Algorithm. Comb. 14(1): 71-109 (1994) - [j17]H. Narayanan, Huzur Saran, Vijay V. Vazirani:
Randomized Parallel Algorithms for Matroid Union and Intersection, With Applications to Arboresences and Edge-Disjoint Spanning Trees. SIAM J. Comput. 23(2): 387-397 (1994) - [j16]Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani:
On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages. Theor. Comput. Sci. 127(2): 255-267 (1994) - [c33]Naveen Garg, Huzur Saran, Vijay V. Vazirani:
Finding separator cuts in planar graphs within twice the optimal. FOCS 1994: 14-23 - [c32]Vivek Arora, Santosh S. Vempala, Huzur Saran, Vijay V. Vazirani:
A Limited-Backtrack Greedy Schema for Approximation Algorithms. FSTTCS 1994: 318-329 - [c31]Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis:
Multiway Cuts in Directed and Node Weighted Graphs. ICALP 1994: 487-498 - 1993
- [j15]Éva Tardos, Vijay V. Vazirani:
Improved Bounds for the Max-Flow Min-Multicut Ratio for Planar and K_r, r-Free Graphs. Inf. Process. Lett. 47(2): 77-80 (1993) - [j14]David Pearson, Vijay V. Vazirani:
Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets. J. Algorithms 14(2): 171-179 (1993) - [c30]Sridhar Rajagopalan, Vijay V. Vazirani:
Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs. FOCS 1993: 322-331 - [c29]Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis:
Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover. ICALP 1993: 64-75 - [c28]Naveen Garg, Vijay V. Vazirani:
A polyhedron with all s-t cuts as vertices, and adjacency of cuts. IPCO 1993: 281-289 - [c27]Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis:
Approximate max-flow min-(multi)cut theorems and their applications. STOC 1993: 698-707 - [c26]David P. Williamson, Michel X. Goemans, Milena Mihail, Vijay V. Vazirani:
A primal-dual approximation algorithm for generalized Steiner network problems. STOC 1993: 708-717 - 1992
- [j13]Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani:
Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem and for Finding a Kuratowski Homeomorph. SIAM J. Comput. 21(3): 486-506 (1992) - [c25]Vijay V. Vazirani, Mihalis Yannakakis:
Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract). ICALP 1992: 366-377 - [c24]H. Narayanan, Huzur Saran, Vijay V. Vazirani:
Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arboresences and Edge-Disjoint Spanning Trees. SODA 1992: 357-366 - 1991
- [j12]Samir Khuller, Vijay V. Vazirani:
Planar Graph Coloring is not Self-Reducible, Assuming P != NP. Theor. Comput. Sci. 88(1): 183-189 (1991) - [c23]Huzur Saran, Vijay V. Vazirani:
Finding k-cuts within Twice the Optimal. FOCS 1991: 743-751 - [c22]Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani:
On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages. ICALP 1991: 728-738 - [c21]Dalit Naor, Vijay V. Vazirani:
Representing and Enumerating Edge Connectivity Cuts in RNC. WADS 1991: 273-285 - 1990
- [c20]David Pearson, Vijay V. Vazirani:
A Fast Parallel Algorithm for Finding a Maximal Bipartite Set. FSTTCS 1990: 225-231 - [c19]Vijay V. Vazirani:
A Theory of Alternating Paths and Blossoms for Proving Correctness of the O(\surdVE) General Graph Matching Algorithm. IPCO 1990: 509-530 - [c18]Richard M. Karp, Umesh V. Vazirani, Vijay V. Vazirani:
An Optimal Algorithm for On-line Bipartite Matching. STOC 1990: 352-358
1980 – 1989
- 1989
- [j11]Vijay V. Vazirani, Mihalis Yannakakis:
Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs. Discret. Appl. Math. 25(1-2): 179-190 (1989) - [j10]Vijay V. Vazirani:
NC Algorithms for Computing the Number of Perfect Matchings in K_3,3-Free Graphs and Related Problems. Inf. Comput. 80(2): 152-164 (1989) - [j9]Michael O. Rabin, Vijay V. Vazirani:
Maximum Matchings in General Graphs Through Randomization. J. Algorithms 10(4): 557-567 (1989) - [j8]Umesh V. Vazirani, Vijay V. Vazirani:
The Two-Processor Scheduling Problem is in Random NC. SIAM J. Comput. 18(6): 1140-1148 (1989) - [c17]Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani:
Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem, and for Finding a Kuratowski Homeomorph. FOCS 1989: 300-305 - 1988
- [c16]Vijay V. Vazirani, Mihalis Yannakakis:
Pfaffian Orientations, 0/1 Permanents, and Even Cycles in Directed Graphs. ICALP 1988: 667-681 - [c15]Vijay V. Vazirani:
NC Algorithms for Computing the Number of Perfect Matchings in K3, 3-free Graphs and Related Problems. SWAT 1988: 233-242 - 1987
- [j7]Richard M. Karp, Frank Thomson Leighton, Ronald L. Rivest, Clark D. Thompson, Umesh V. Vazirani, Vijay V. Vazirani:
Global Wire Routing in Two-Dimensional Arrays. Algorithmica 2: 113-129 (1987) - [j6]Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani:
Matching is as easy as matrix inversion. Comb. 7(1): 105-113 (1987) - [c14]Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani:
Matching Is as Easy as Matrix Inversion. STOC 1987: 345-354 - 1986
- [j5]Mark Jerrum, Leslie G. Valiant, Vijay V. Vazirani:
Random Generation of Combinatorial Structures from a Uniform Distribution. Theor. Comput. Sci. 43: 169-188 (1986) - [j4]Leslie G. Valiant, Vijay V. Vazirani:
NP is as Easy as Detecting Unique Solutions. Theor. Comput. Sci. 47(3): 85-93 (1986) - [c13]Umesh V. Vazirani, Vijay V. Vazirani:
Sampling a Population with a Semi-Random Source. FSTTCS 1986: 443-452 - 1985
- [c12]Umesh V. Vazirani, Vijay V. Vazirani:
Random Polynomial Time Is Equal to Slightly-random Polynomial Time. FOCS 1985: 417-428 - [c11]Dexter Kozen, Umesh V. Vazirani, Vijay V. Vazirani:
NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching. FSTTCS 1985: 496-503 - [c10]Umesh V. Vazirani, Vijay V. Vazirani:
The Two-Processor Scheduling Problem is in R-NC. STOC 1985: 11-21 - [c9]Leslie G. Valiant, Vijay V. Vazirani:
NP Is as Easy as Detecting Unique Solutions. STOC 1985: 458-463 - 1984
- [c8]Umesh V. Vazirani, Vijay V. Vazirani:
Efficient and Secure Pseudo-Random Number Generation. CRYPTO 1984: 193-202 - [c7]Umesh V. Vazirani, Vijay V. Vazirani:
Efficient and Secure Pseudo-Random Number Generation (Extended Abstract). FOCS 1984: 458-463 - 1983
- [j3]Umesh V. Vazirani, Vijay V. Vazirani:
A Natural Encoding Scheme Proved Probabilistic Polynomial Complete. Theor. Comput. Sci. 24: 291-300 (1983) - [c6]Manuel Blum, Umesh V. Vazirani, Vijay V. Vazirani:
Reducibility Among Protocols. CRYPTO 1983: 137-146 - [c5]Umesh V. Vazirani, Vijay V. Vazirani:
RSA Bits are 732+epsilon Secure. CRYPTO 1983: 369-375 - [c4]Umesh V. Vazirani, Vijay V. Vazirani:
Trapdoor Pseudo-random Number Generators, with Applications to Protocol Design. FOCS 1983: 23-30 - [c3]Richard M. Karp, Frank Thomson Leighton, Ronald L. Rivest, Clark D. Thompson, Umesh V. Vazirani, Vijay V. Vazirani:
Global Wire Routing in Two-Dimensional Arrays (Extended Abstract). FOCS 1983: 453-459 - 1982
- [j2]Larry J. Stockmeyer, Vijay V. Vazirani:
NP-Completeness of Some Generalizations of the Maximum Matching Problem. Inf. Process. Lett. 15(1): 14-19 (1982) - [j1]Eugene L. Lawler, Michael George Luby, Vijay V. Vazirani:
Scheduling open shops with parallel machines. Oper. Res. Lett. 1(4): 161-164 (1982) - [c2]Umesh V. Vazirani, Vijay V. Vazirani:
A Natural Encoding Scheme Proved Probabilistic Polynomial Complete. FOCS 1982: 40-44 - 1980
- [c1]Silvio Micali, Vijay V. Vazirani:
An O(sqrt(|v|) |E|) Algorithm for Finding Maximum Matching in General Graphs. FOCS 1980: 17-27
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 23:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
