Seller-Focused Algorithms for Online Auctioning
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Random knapsack in expected polynomial time
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Typical properties of winners and losers in discrete optimization
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Random knapsack in expected polynomial time
Journal of Computer and System Sciences - Special issue: STOC 2003
Reliability constrained routing in QoS networks
IEEE/ACM Transactions on Networking (TON)
Algorithm for stochastic multiple-choice knapsack problem and application to keywords bidding
Proceedings of the 17th international conference on World Wide Web
On the sum minimization version of the online bin covering problem
Discrete Applied Mathematics
Pareto optimal solutions for smoothed analysts
Proceedings of the forty-third annual ACM symposium on Theory of computing
Smoothed analysis of integer programming
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Smoothed analysis of integer programming
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Average-case analysis of a greedy algorithm for the 0/1 knapsack problem
Operations Research Letters
| Hi-index | 0.01 |