Probabilistic analysis of algorithms: on computing methodologies for computer algorithms performance evaluation
Improved Approximation Algorithms for Shop Scheduling Problems
SIAM Journal on Computing
Distributed packet switching in arbitrary networks
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Universal O(congestion + dilation + log1+&egr;N) local control packet switching algorithms
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Better approximation guarantees for job-shop scheduling
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Packet routing with arbitrary end-to-end delay requirements
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
New and improved algorithms for minsum shop scheduling
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On the drift of short schedules
Theoretical Computer Science
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Value-maximizing deadline scheduling and its application to animation rendering
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
A genetic algorithm for the Flexible Job-shop Scheduling Problem
Computers and Operations Research
Tight Bounds for Permutation Flow Shop Scheduling
Mathematics of Operations Research
Tight bounds for permutation flow shop scheduling
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
| Hi-index | 0.00 |