On multi-dimensional packing problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Better approximation algorithms for bin covering
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Online variable sized covering
Information and Computation
An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
On-Line Variable Sized Covering
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
On-Line Maximizing the Number of Items Packed in Variable-Sized Bins
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
On-line maximizing the number of items packed in variable-sized bins
Acta Cybernetica
Approximation lower bounds in online LIB bin packing and covering
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
Bin packing problems with rejection penalties and their dual problems
Information and Computation
A classification scheme for bin packing theory
Acta Cybernetica
Performance bounds for peer-assisted live streaming
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Bin packing with controllable item sizes
Information and Computation
Asymptotic fully polynomial approximation schemes for variants of open-end bin packing
Information Processing Letters
Bounded-space online bin cover
Journal of Scheduling
Bin packing problems with rejection penalties and their dual problems
Information and Computation
On the sum minimization version of the online bin covering problem
Discrete Applied Mathematics
Bin packing and covering problems with rejection
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Comparing online algorithms for bin packing problems
Journal of Scheduling
An exact algorithm for the dual bin packing problem
Operations Research Letters
Optimal on-line algorithms for variable-sized bin covering
Operations Research Letters
Bin covering with cardinality constraints
Discrete Applied Mathematics
| Hi-index | 0.04 |