A PTAS for the multiple knapsack problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Optimizing a mail-order with discount and shipping costs
Information Processing Letters
Scheduling jobs before shut-down
Nordic Journal of Computing
On Maximizing the Throughput of Multiprocessor Tasks
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Scheduling Jobs Before Shut-Down
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Polynominal time approximation schemes for class-constrained packing problem
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
On maximizing the throughput of multiprocessor tasks
Theoretical Computer Science
A fast asymptotic approximation scheme for bin packing with rejection
Theoretical Computer Science
Parameterized approximation scheme for the multiple knapsack problem
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
Algorithmics of Large and Complex Networks
Partitioning activities for agents
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
On the complexity of variations of equal sum subsets
Nordic Journal of Computing
Approximation algorithms for scheduling with reservations
HiPC'07 Proceedings of the 14th international conference on High performance computing
Approximation algorithms for traffic grooming in WDM rings
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Parameterized Approximation Scheme for the Multiple Knapsack Problem
SIAM Journal on Computing
Prompt mechanism for ad placement over time
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Theoretical Computer Science
A fast asymptotic approximation scheme for bin packing with rejection
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
| Hi-index | 0.00 |