Static job scheduling in partitionable mesh connected systems
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
Mathematics of Operations Research
Introduction to Linear Optimization
Introduction to Linear Optimization
Approximating the Advertisement Placement Problem
Journal of Scheduling
Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing
Mathematics of Operations Research
On strip packing With rotations
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On packing squares with resource augmentation: maximizing the profit
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
An asymptotic approximation algorithm for 3D-strip packing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Improved approximation algorithms for multidimensional bin packing problems
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
Mathematics of Operations Research
Harmonic algorithm for 3-dimensional strip packing problem
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
An efficient approximation scheme for the one-dimensional bin-packing problem
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Combinatorial Optimization: Theory and Algorithms
Combinatorial Optimization: Theory and Algorithms
Approximation algorithms for 3D orthogonal Knapsack
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
A polynomial time approximation scheme for the square packing problem
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
On efficient weighted rectangle packing with large resources
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Inapproximability results for orthogonal rectangle packing problems with rotations
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Approximating the orthogonal knapsack problem for hypercubes
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Packing weighted rectangles into a square
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
On the two-dimensional Knapsack Problem
Operations Research Letters
New approximability results for 2-dimensional packing problems
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
SIAM Journal on Discrete Mathematics
On the weak computability of a four dimensional orthogonal packing and time scheduling problem
Theoretical Computer Science
Theoretical Computer Science
| Hi-index | 5.23 |
We study a computational complexity version of the 2D Sperner problem, which states that any three coloring of vertices of a triangulated triangle, satisfying some boundary conditions, will have a trichromatic triangle. In introducing a complexity class ...