The SCEAS System
| |||||||

## Search the dblp DataBase
Rakesh Vohra:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Yair Bartal, Amos Fiat, Howard J. Karloff, Rakesh Vohra
**New Algorithms for an Ancient Scheduling Problem**[Citation Graph (1, 0)][DBLP] STOC, 1992, pp:51-58 [Conf] - Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra
**Nonlinear Formulations and Improved Randomized Approximation Algorithms for Multicut Problems.**[Citation Graph (0, 0)][DBLP] IPCO, 1995, pp:29-39 [Conf] - Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra
**On Dependent Randomized Rounding Algorithms.**[Citation Graph (0, 0)][DBLP] IPCO, 1996, pp:330-344 [Conf] - Jay Sethuraman, Chung-Piaw Teo, Rakesh Vohra
**Integer Programming and Arrovian Social Welfare Functions.**[Citation Graph (0, 0)][DBLP] IPCO, 2002, pp:194-211 [Conf] - Eyal Beigman, Rakesh Vohra
**Learning from revealed preference.**[Citation Graph (0, 0)][DBLP] ACM Conference on Electronic Commerce, 2006, pp:36-42 [Conf] - Rakesh Vohra, Nicholas G. Hall
**A Probabilistic Analysis of the Maximal Covering Location Problem.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1993, v:43, n:2, pp:175-183 [Journal] - Dean P. Foster, Rakesh Vohra
**Probabilistic Analysis of a Heuristics for the Dual Bin Packing Problem.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1989, v:31, n:6, pp:287-290 [Journal] - Yair Bartal, Amos Fiat, Howard J. Karloff, Rakesh Vohra
**New Algorithms for an Ancient Scheduling Problem.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1995, v:51, n:3, pp:359-366 [Journal] - Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra
**Analysis of LP relaxations for multiway and multicut problems.**[Citation Graph (0, 0)][DBLP] Networks, 1999, v:34, n:2, pp:102-114 [Journal] - Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra
**On dependent randomized rounding algorithms.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 1999, v:24, n:3, pp:105-114 [Journal] - Daniel J. Kleitman, Rakesh Vohra
**Computing the Bandwidth of Interval Graphs.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1990, v:3, n:3, pp:373-375 [Journal] **On Revenue Equivalence in Truthful Mechanisms.**[Citation Graph (, )][DBLP]**The complexity of forecast testing: abstract.**[Citation Graph (, )][DBLP]**Dynamic cost-per-action mechanisms and applications to online advertising.**[Citation Graph (, )][DBLP]**On revenue equivalence in truthful mechanisms.**[Citation Graph (, )][DBLP]**The Complexity of Forecast Testing.**[Citation Graph (, )][DBLP]
Search in 0.028secs, Finished in 0.030secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |