Online variable sized covering
Information and Computation
New bounds for multi-dimensional packing
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On the online bin packing problem
Journal of the ACM (JACM)
Resource augmentation for online bounded space bin packing
Journal of Algorithms
Fair versus Unrestricted Bin Packing
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
The Accommodating Function - A Generalization of the Competitive Ratio
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Resource Augmentation for Online Bounded Space Bin Packing
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
On the Online Bin Packing Problem
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
New Bounds for Variable-Sized and Resource Augmented Online Bin Packing
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
On-Line Variable Sized Covering
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
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
The competitive ratio for on-line dual bin packing with restricted input sequences
Nordic Journal of Computing
Recent advances on two-dimensional bin packing problems
Discrete Applied Mathematics
On variable sized vector packing
Acta Cybernetica
On-line maximizing the number of items packed in variable-sized bins
Acta Cybernetica
New approximability and inapproximability results for 2-dimensional Bin Packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal online bounded space multidimensional packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for on-line bin-packing problems with cardinality constraints
Discrete Applied Mathematics
Bin packing problems with rejection penalties and their dual problems
Information and Computation
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
Mathematics of Operations Research
On-line scheduling of parallel jobs in a list
Journal of Scheduling
Online bin packing with arbitrary release times
Theoretical Computer Science
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
Online interval coloring with packing constraints
Theoretical Computer Science
Dynamic bin packing of unit fractions items
Theoretical Computer Science
Bin packing problems with rejection penalties and their dual problems
Information and Computation
Tight results for Next Fit and Worst Fit with resource augmentation
Theoretical Computer Science
Minimum weighted sum bin packing
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Dynamic bin packing with unit fraction items revisited
Information Processing Letters
Policy matrix evolution for generation of heuristics
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Journal of Combinatorial Optimization
AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items
SIAM Journal on Optimization
Variable sized online interval coloring with bandwidth
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Dynamic bin packing of unit fractions items
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Online bin packing with cardinality constraints
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Bin packing and covering problems with rejection
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Online bin packing of fragile objects with application in cellular networks
WINE'05 Proceedings of the First international conference on Internet and Network Economics
On dynamic bin packing: an improved lower bound and resource augmentation analysis
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
A robust APTAS for the classical bin packing problem
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Online interval coloring with packing constraints
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Online bin packing with resource augmentation
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Competitive multi-dimensional dynamic bin packing via l-shape bin packing
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Bin packing with rejection revisited
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Two-dimensional bin packing with one-dimensional resource augmentation
Discrete Optimization
Online bin packing with resource augmentation
Discrete Optimization
Discrete Optimization
The two-dimensional bin packing problem with variable bin sizes and costs
Discrete Optimization
Online strip packing with modifiable boxes
Operations Research Letters
An approximation algorithm for square packing
Operations Research Letters
On-line bin packing with arbitrary release times
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Tight bounds for online vector bin packing
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A robust AFPTAS for online bin packing with polynomial migration,
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |