Single machine scheduling to minimize total late work
Operations Research
Mathematics of Operations Research
Approximate solution of NP optimization problems
Theoretical Computer Science
Parallel machine scheduling with time dependent processing times
Discrete Applied Mathematics
Algorithms for minclique scheduling problems
Discrete Applied Mathematics - Special issue on models and algorithms for planning and scheduling problems
Computing Partitions with Applications to the Knapsack Problem
Journal of the ACM (JACM)
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
Algorithms for Scheduling Independent Tasks
Journal of the ACM (JACM)
Exact and Approximate Algorithms for Scheduling Nonidentical Processors
Journal of the ACM (JACM)
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs
Journal of Heuristics
A PTAS for minimizing the weighted sum of job completion times on parallel machines
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Scheduling a pipelined operator graph
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for extensible bin packing
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On-line scheduling with extendable working time on a small number of machines
Information Processing Letters
An FPTAS for Agreeably Weighted Variance on a Single Machine
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Preemptive Scheduling with Rejection
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Designing PTASs for MIN-SUM Scheduling Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
On energy-optimal voltage scheduling for fixed-priority hard real-time systems
ACM Transactions on Embedded Computing Systems (TECS)
On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems
Theoretical Computer Science
Approximation Algorithms for Extensible Bin Packing
Journal of Scheduling
Designing PTASs for MIN-SUM scheduling problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
Polynomial time approximation schemes and parameterized complexity
Discrete Applied Mathematics
Designing PTASs for MIN-SUM scheduling problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
Characterizing problems for realizing policies in self-adaptive and self-managing systems
Proceedings of the 6th International Symposium on Software Engineering for Adaptive and Self-Managing Systems
A theory and algorithms for combinatorial reoptimization
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
The password allocation problem: strategies for reusing passwords effectively
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
| Hi-index | 0.00 |