The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Vijay V. Vazirani: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Kamal Jain, Vijay V. Vazirani
    Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems. [Citation Graph (1, 0)][DBLP]
    FOCS, 1999, pp:2-13 [Conf]
  2. Huzur Saran, Vijay V. Vazirani
    Finding k-cuts within Twice the Optimal [Citation Graph (1, 0)][DBLP]
    FOCS, 1991, pp:743-751 [Conf]
  3. Mark Jerrum, Leslie G. Valiant, Vijay V. Vazirani
    Random Generation of Combinatorial Structures from a Uniform Distribution. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:43, n:, pp:169-188 [Journal]
  4. Vijay V. Vazirani
    Primal-Dual Schema Based Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
    Theoretical Aspects of Computer Science, 2000, pp:198-207 [Conf]
  5. Kamal Jain, Vijay V. Vazirani
    An approximation algorithm for the fault tolerant metric facility location problem. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:177-183 [Conf]
  6. Rahul Garg, Sanjiv Kapoor, Vijay V. Vazirani
    An Auction-Based Market Equilibrium Algorithm for the Separable Gross Substitutability Case. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:128-138 [Conf]
  7. Vijay V. Vazirani
    The Steiner Tree Problem and Its Generalizations. [Citation Graph (0, 0)][DBLP]
    APPROX, 1998, pp:33-38 [Conf]
  8. Vijay V. Vazirani
    Primal-Dual Schema Based Approximation Algorithms (Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:650-652 [Conf]
  9. Umesh V. Vazirani, Vijay V. Vazirani
    RSA Bits are 732+epsilon Secure. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1983, pp:369-375 [Conf]
  10. Umesh V. Vazirani, Vijay V. Vazirani
    Efficient and Secure Pseudo-Random Number Generation. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1984, pp:193-202 [Conf]
  11. Manuel Blum, Umesh V. Vazirani, Vijay V. Vazirani
    Reducibility Among Protocols. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1983, pp:137-146 [Conf]
  12. Nikhil R. Devanur, Christos H. Papadimitriou, Amin Saberi, Vijay V. Vazirani
    Market Equilibrium via a Primal-Dual-Type Algorithm. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:389-395 [Conf]
  13. Naveen Garg, Huzur Saran, Vijay V. Vazirani
    Finding separator cuts in planar graphs within twice the optimal [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:14-23 [Conf]
  14. 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) [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:453-459 [Conf]
  15. Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani
    Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem, and for Finding a Kuratowski Homeomorph [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:300-305 [Conf]
  16. Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani
    AdWords and Generalized On-line Matching. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:264-273 [Conf]
  17. Silvio Micali, Vijay V. Vazirani
    An O(sqrt(|v|) |E|) Algorithm for Finding Maximum Matching in General Graphs [Citation Graph (0, 0)][DBLP]
    FOCS, 1980, pp:17-27 [Conf]
  18. Sridhar Rajagopalan, Vijay V. Vazirani
    Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:322-331 [Conf]
  19. Vijay V. Vazirani, Huzur Saran, B. Sundar Rajan
    An Efficient Algorithm for Constructing Minimal Trellises for Codes over Finite Abelian Groups. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:144-153 [Conf]
  20. Umesh V. Vazirani, Vijay V. Vazirani
    A Natural Encoding Scheme Proved Probabilistic Polynomial Complete [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:40-44 [Conf]
  21. Umesh V. Vazirani, Vijay V. Vazirani
    Trapdoor Pseudo-random Number Generators, with Applications to Protocol Design [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:23-30 [Conf]
  22. Umesh V. Vazirani, Vijay V. Vazirani
    Efficient and Secure Pseudo-Random Number Generation (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:458-463 [Conf]
  23. Umesh V. Vazirani, Vijay V. Vazirani
    Random Polynomial Time Is Equal to Slightly-random Polynomial Time [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:417-428 [Conf]
  24. Vivek Arora, Santosh Vempala, Huzur Saran, Vijay V. Vazirani
    A Limited-Backtrack Greedy Schema for Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1994, pp:318-329 [Conf]
  25. Nikhil R. Devanur, Vijay V. Vazirani
    An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:149-155 [Conf]
  26. Dexter Kozen, Umesh V. Vazirani, Vijay V. Vazirani
    NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1985, pp:496-503 [Conf]
  27. David Pearson, Vijay V. Vazirani
    A Fast Parallel Algorithm for Finding a Maximal Bipartite Set. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:225-231 [Conf]
  28. Umesh V. Vazirani, Vijay V. Vazirani
    Sampling a Population with a Semi-Random Source. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:443-452 [Conf]
  29. Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani
    Design Is as Easy as Optimization. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:477-488 [Conf]
  30. 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. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:64-75 [Conf]
  31. Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
    Multiway Cuts in Directed and Node Weighted Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:487-498 [Conf]
  32. Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani
    On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:728-738 [Conf]
  33. Vijay V. Vazirani, Mihalis Yannakakis
    Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:366-377 [Conf]
  34. Vijay V. Vazirani, Mihalis Yannakakis
    Pfaffian Orientations, 0/1 Permanents, and Even Cycles in Directed Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:667-681 [Conf]
  35. 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. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2006, pp:758-766 [Conf]
  36. Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganley
    A new heuristic for rectilinear Steiner trees. [Citation Graph (0, 0)][DBLP]
    ICCAD, 1999, pp:157-162 [Conf]
  37. Ramarathnam Venkatesan, Vijay V. Vazirani, Saurabh Sinha
    A Graph Theoretic Approach to Software Watermarking. [Citation Graph (0, 0)][DBLP]
    Information Hiding, 2001, pp:157-168 [Conf]
  38. Naveen Garg, Vijay V. Vazirani
    A polyhedron with all s-t cuts as vertices, and adjacency of cuts. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:281-289 [Conf]
  39. Vijay V. Vazirani
    A Theory of Alternating Paths and Blossoms for Proving Correctness of the O(\surdVE) General Graph Matching Algorithm. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:509-530 [Conf]
  40. Nayantara Bhatnagar, Dana Randall, Vijay V. Vazirani, Eric Vigoda
    Random Bichromatic Matchings. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:190-201 [Conf]
  41. Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani
    A Greedy Facility Location Algorithm Analyzed Using Dual Fitting. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:127-137 [Conf]
  42. Nikhil R. Devanur, Milena Mihail, Vijay V. Vazirani
    Strategyproof cost-sharing mechanisms for set cover and facility location games. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2003, pp:108-114 [Conf]
  43. Nikhil R. Devanur, Vijay V. Vazirani
    Extensions of the spending constraint-model: existence and uniqueness of equilibria (extended abstract). [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2003, pp:202-203 [Conf]
  44. Aranyak Mehta, Scott Shenker, Vijay V. Vazirani
    Profit-maximizing multicast pricing by approximating fixed points. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2003, pp:218-219 [Conf]
  45. Aranyak Mehta, Vijay V. Vazirani
    Randomized truthful auctions of digital goods are randomizations over truthful auctions. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2004, pp:120-124 [Conf]
  46. Ivona Bezáková, Daniel Stefankovic, Vijay V. Vazirani, Eric Vigoda
    Accelerating simulated annealing for the permanent and combinatorial counting problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:900-907 [Conf]
  47. Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, David P. Williamson
    A Primal-Dual Schema Based Approximation Algorithm for the Element Connectivity Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:484-489 [Conf]
  48. Kamal Jain, Vijay V. Vazirani, Yinyu Ye
    Market equilibria for homothetic, quasi-concave utilities and economies of scale in production. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:63-71 [Conf]
  49. H. Narayanan, Huzur Saran, Vijay V. Vazirani
    Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arboresences and Edge-Disjoint Spanning Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:357-366 [Conf]
  50. Sridhar Rajagopalan, Vijay V. Vazirani
    On the Bidirected Cut Relaxation for the Metric Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:742-751 [Conf]
  51. Micah Adler, Eran Halperin, Richard M. Karp, Vijay V. Vazirani
    A stochastic process on the hypercube with applications to peer-to-peer networks. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:575-584 [Conf]
  52. Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
    Approximate max-flow min-(multi)cut theorems and their applications. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:698-707 [Conf]
  53. Kamal Jain, Vijay V. Vazirani
    Applications of approximation algorithms to cooperative games. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:364-372 [Conf]
  54. Kamal Jain, Vijay V. Vazirani
    Equitable cost allocations via primal-dual-type algorithms. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:313-321 [Conf]
  55. Richard M. Karp, Umesh V. Vazirani, Vijay V. Vazirani
    An Optimal Algorithm for On-line Bipartite Matching [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:352-358 [Conf]
  56. Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani
    Matching Is as Easy as Matrix Inversion [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:345-354 [Conf]
  57. Leonard J. Schulman, Vijay V. Vazirani
    Majorizing Estimators and the Approximation of #P-Complete Problems. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:288-294 [Conf]
  58. Leslie G. Valiant, Vijay V. Vazirani
    NP Is as Easy as Detecting Unique Solutions [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:458-463 [Conf]
  59. Umesh V. Vazirani, Vijay V. Vazirani
    The Two-Processor Scheduling Problem is in R-NC [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:11-21 [Conf]
  60. David P. Williamson, Michel X. Goemans, Milena Mihail, Vijay V. Vazirani
    A primal-dual approximation algorithm for generalized Steiner network problems. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:708-717 [Conf]
  61. Vijay V. Vazirani
    NC Algorithms for Computing the Number of Perfect Matchings in K3, 3-free Graphs and Related Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 1988, pp:233-242 [Conf]
  62. Dalit Naor, Vijay V. Vazirani
    Representing and Enumerating Edge Connectivity Cuts in RNC. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:273-285 [Conf]
  63. Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani
    New Results on Rationality and Strongly Polynomial Time Solvability in Eisenberg-Gale Markets. [Citation Graph (0, 0)][DBLP]
    WINE, 2006, pp:239-250 [Conf]
  64. 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. [Citation Graph (0, 0)][DBLP]
    WINE, 2005, pp:1046-1055 [Conf]
  65. Kamal Jain, Aranyak Mehta, Kunal Talwar, Vijay V. Vazirani
    A Simple Characterization for Truth-Revealing Single-Item Auctions. [Citation Graph (0, 0)][DBLP]
    WINE, 2005, pp:122-128 [Conf]
  66. Dinesh Garg, Kamal Jain, Kunal Talwar, Vijay V. Vazirani
    A Primal-Dual Algorithm for Computing Fisher Equilibrium in the Absence of Gross Substitutability Property. [Citation Graph (0, 0)][DBLP]
    WINE, 2005, pp:24-33 [Conf]
  67. Sanjiv Kapoor, Aranyak Mehta, Vijay V. Vazirani
    An Auction-Based Market Equilibrium Algorithm for a Production Model. [Citation Graph (0, 0)][DBLP]
    WINE, 2005, pp:102-111 [Conf]
  68. Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
    Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:18, n:1, pp:3-20 [Journal]
  69. Kamal Jain, Vijay V. Vazirani
    An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:38, n:3, pp:433-439 [Journal]
  70. 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. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1987, v:2, n:, pp:113-129 [Journal]
  71. Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani
    Matching is as easy as matrix inversion. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1987, v:7, n:1, pp:105-113 [Journal]
  72. Leonard J. Schulman, Vijay V. Vazirani
    A Computationally Motivated Definition Of Parametric Estimation And Its Applications To The Gaussian Distribution. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2005, v:25, n:4, pp:465-486 [Journal]
  73. Vijay V. Vazirani
    A Theory of Alternating Paths and Blossoms for Proving Correctness of the O(sqrt{V E}) General Graph Maximum Matching Algorithm. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1994, v:14, n:1, pp:71-109 [Journal]
  74. David P. Williamson, Michel X. Goemans, Milena Mihail, Vijay V. Vazirani
    A Primal-Dual Approximation Algorithm for Generalized Steiner Network Problems. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:3, pp:435-454 [Journal]
  75. Kamal Jain, Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani
    Greedy Facility Location Algorithms Analyzed using Dual Fitting with Factor-Revealing LP [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  76. Nikhil R. Devanur, Milena Mihail, Vijay V. Vazirani
    Strategyproof cost-sharing mechanisms for set cover and facility location games. [Citation Graph (0, 0)][DBLP]
    Decision Support Systems, 2005, v:39, n:1, pp:11-22 [Journal]
  77. Vijay V. Vazirani
    NC Algorithms for Computing the Number of Perfect Matchings in K_3,3-Free Graphs and Related Problems [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:80, n:2, pp:152-164 [Journal]
  78. Larry J. Stockmeyer, Vijay V. Vazirani
    NP-Completeness of Some Generalizations of the Maximum Matching Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:15, n:1, pp:14-19 [Journal]
  79. Éva Tardos, Vijay V. Vazirani
    Improved Bounds for the Max-Flow Min-Multicut Ratio for Planar and K_r, r-Free Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:47, n:2, pp:77-80 [Journal]
  80. Kamal Jain, Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani
    Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:6, pp:795-824 [Journal]
  81. Kamal Jain, Vijay V. Vazirani
    Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2001, v:48, n:2, pp:274-296 [Journal]
  82. Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
    Multiway cuts in node weighted graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:50, n:1, pp:49-61 [Journal]
  83. Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, David P. Williamson
    A primal-dual schema based approximation algorithm for the element connectivity problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:45, n:1, pp:1-15 [Journal]
  84. Aranyak Mehta, Scott Shenker, Vijay V. Vazirani
    Posted price profit maximization for multicast by approximating fixed points. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2006, v:58, n:2, pp:150-164 [Journal]
  85. David Pearson, Vijay V. Vazirani
    Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:14, n:2, pp:171-179 [Journal]
  86. Michael O. Rabin, Vijay V. Vazirani
    Maximum Matchings in General Graphs Through Randomization. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1989, v:10, n:4, pp:557-567 [Journal]
  87. Naveen Garg, Huzur Saran, Vijay V. Vazirani
    Finding Separator Cuts in Planar Graphs within Twice the Optimal. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:1, pp:159-179 [Journal]
  88. Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
    Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:2, pp:235-251 [Journal]
  89. Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani
    Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem and for Finding a Kuratowski Homeomorph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:3, pp:486-506 [Journal]
  90. H. Narayanan, Huzur Saran, Vijay V. Vazirani
    Randomized Parallel Algorithms for Matroid Union and Intersection, With Applications to Arboresences and Edge-Disjoint Spanning Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:2, pp:387-397 [Journal]
  91. Sridhar Rajagopalan, Vijay V. Vazirani
    Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:525-540 [Journal]
  92. Huzur Saran, Vijay V. Vazirani
    Finding k Cuts within Twice the Optimal. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:1, pp:101-108 [Journal]
  93. Umesh V. Vazirani, Vijay V. Vazirani
    The Two-Processor Scheduling Problem is in Random NC. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:6, pp:1140-1148 [Journal]
  94. Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganley
    A new heuristic for rectilinear Steiner trees. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 2000, v:19, n:10, pp:1129-1139 [Journal]
  95. Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani
    On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:127, n:2, pp:255-267 [Journal]
  96. Samir Khuller, Vijay V. Vazirani
    Planar Graph Coloring is not Self-Reducible, Assuming P != NP. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:88, n:1, pp:183-189 [Journal]
  97. Leslie G. Valiant, Vijay V. Vazirani
    NP is as Easy as Detecting Unique Solutions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:85-93 [Journal]
  98. Vijay V. Vazirani
    Recent results on approximating the Steiner tree problem and its generalizations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:235, n:1, pp:205-216 [Journal]
  99. Umesh V. Vazirani, Vijay V. Vazirani
    A Natural Encoding Scheme Proved Probabilistic Polynomial Complete. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:24, n:, pp:291-300 [Journal]
  100. Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani
    The 'Art of Trellis Decoding' Is Computationally Hardi - For Large Fields. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:3, pp:1211-1214 [Journal]
  101. Kamal Jain, Vijay V. Vazirani, Gideon Yuval
    On the capacity of multiple unicast sessions in undirected graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:6, pp:2805-2809 [Journal]
  102. Vijay V. Vazirani, Huzur Saran, B. Sundar Rajan
    An efficient algorithm for constructing minimal trellises for codes over finite abelian groups. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1839-1854 [Journal]
  103. Kamal Jain, Vijay V. Vazirani
    Eisenberg-Gale markets: algorithms and structural properties. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:364-373 [Conf]
  104. Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani
    AdWords and generalized online matching. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2007, v:54, n:5, pp:- [Journal]
  105. Sanjiv Kapoor, Aranyak Mehta, Vijay V. Vazirani
    An auction-based market equilibrium algorithm for a production model. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:378, n:2, pp:153-164 [Journal]
  106. Dinesh Garg, Kamal Jain, Kunal Talwar, Vijay V. Vazirani
    A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:378, n:2, pp:143-152 [Journal]

  107. Nash Bargaining Via Flexible Budget Markets. [Citation Graph (, )][DBLP]


  108. Solvency Games. [Citation Graph (, )][DBLP]


  109. Fast monitoring of traffic subpopulations. [Citation Graph (, )][DBLP]


  110. New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem. [Citation Graph (, )][DBLP]


  111. Nash Bargaining Via Flexible Budget Markets. [Citation Graph (, )][DBLP]


  112. Markets and the Primal-Dual Paradigm. [Citation Graph (, )][DBLP]


  113. Efficiency, Fairness and Competitiveness in Nash Bargaining Games. [Citation Graph (, )][DBLP]


  114. Continuity Properties of Equilibrium Prices and Allocations in Linear Fisher Markets. [Citation Graph (, )][DBLP]


  115. Continuity Properties of Equilibria in Some Fisher and Arrow-Debreu Market Models. [Citation Graph (, )][DBLP]


  116. MINT: a Market for INternet Transit. [Citation Graph (, )][DBLP]


  117. Market Equilibrium under Separable, Piecewise-Linear, Concave Utilities. [Citation Graph (, )][DBLP]


  118. Random Bichromatic Matchings. [Citation Graph (, )][DBLP]


  119. 2-Player Nash and Nonsymmetric Bargaining via Flexible Budget Markets [Citation Graph (, )][DBLP]


  120. Equilibrium Pricing of Digital Goods via a New Market Model [Citation Graph (, )][DBLP]


  121. Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs. [Citation Graph (, )][DBLP]


  122. Continuity Properties of Equilibria in Some Fisher and Arrow-Debreu Market Models. [Citation Graph (, )][DBLP]


  123. Solvency Games. [Citation Graph (, )][DBLP]


  124. Eisenberg-Gale Markets: Rationality, Strongly Polynomial Solvability, and Competition Monotonicity. [Citation Graph (, )][DBLP]


Search in 0.030secs, Finished in 0.039secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002