An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems
IEEE Transactions on Computers
Scheduling Multiprocessor Tasks to Minimize Schedule Length
IEEE Transactions on Computers
Complexity of scheduling parallel task systems
SIAM Journal on Discrete Mathematics
Scheduling multiprocessor tasks on three dedicated processors
Information Processing Letters
Complexity of scheduling multiprocessor tasks with prespecified processor allocations
Discrete Applied Mathematics
An approximation algorithm for scheduling on three dedicated machines
Discrete Applied Mathematics
Approximation algorithms for scheduling
Approximation algorithms for NP-hard problems
Efficiency and effectiveness of normal schedules on three dedicated processors
Selected papers from the second Krakow conference on Graph theory
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Linear-time approximation schemes for scheduling malleable parallel tasks
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
Concrete Math
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Scheduling Independent Multiprocessor Tasks
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Approximation algorithms for general parallel task scheduling
Information Processing Letters
General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Grouping Techniques for Scheduling Problems: Simpler and Faster
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Parameterized complexity: the main ideas and connections to practical computing
Experimental algorithmics
Scheduling parallel jobs to minimize the makespan
Journal of Scheduling
Improved results for scheduling batched parallel jobs by using a generalized analysis framework
Journal of Parallel and Distributed Computing
Provably efficient two-level adaptive scheduling
JSSPP'06 Proceedings of the 12th international conference on Job scheduling strategies for parallel processing
A framework for designing approximation algorithms for scheduling problems
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Some new directions and questions in parameterized complexity
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
| Hi-index | 0.00 |