On the Structure of Polynomial Time Reducibility
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)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Some complexity results for the Traveling Salesman Problem
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Sequential Diagnosability is Co-NP Complete
IEEE Transactions on Computers
Allocation and Scheduling of Precedence-Related Periodic Tasks
IEEE Transactions on Parallel and Distributed Systems
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
When does a dynamic programming formulation guarantee the existence of an FPTAS?
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On the complexity of designing optimal partial-match retrieval systems
ACM Transactions on Database Systems (TODS)
The tracker: a threat to statistical database security
ACM Transactions on Database Systems (TODS)
Flowshop scheduling with limited temporary storage
Journal of the ACM (JACM)
On the complexity of integer programming
Journal of the ACM (JACM)
Computer-Aided complexity classification of combinational problems
Communications of the ACM
Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Polynominal time approximation schemes for class-constrained packing problem
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Real-Time Support for Mobile Robotics
RTAS '03 Proceedings of the The 9th IEEE Real-Time and Embedded Technology and Applications Symposium
On approximability of linear ordering and related NP-optimization problems on graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Low distortion maps between point sets
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Conditions that impact the complexity of QoS routing
IEEE/ACM Transactions on Networking (TON)
Complexity of preemptive minsum scheduling on unrelated parallel machines
Journal of Algorithms
Lot-sizing scheduling with batch setup times
Journal of Scheduling
Multiprocessor scheduling under precedence constraints: polyhedral results
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Backfilling with lookahead to optimize the packing of parallel jobs
Journal of Parallel and Distributed Computing
Resource management for real-time tasks in mobile robotics
Journal of Systems and Software
Note: The harmonious coloring problem is NP-complete for interval and permutation graphs
Discrete Applied Mathematics
Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing
IEEE Transactions on Computers
Performance bounds for peer-assisted live streaming
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Approximation algorithms for scheduling unrelated parallel machines
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems
Theoretical Computer Science
The architecture of MANIP: a parallel computer system for solving NP-complete problems
AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
Synthesis of reconfigurable high-performance multicore systems
Proceedings of the ACM/SIGDA international symposium on Field programmable gate arrays
Optimal and heuristic solution methods for a multiprocessor machine scheduling problem
Computers and Operations Research
Online Scheduling with Bounded Migration
Mathematics of Operations Research
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
Algorithmics of Large and Complex Networks
Load balancing inbound traffic in multihomed stub autonomous systems
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Multiprocessor scheduling under precedence constraints: Polyhedral results
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Complexity of preemptive minsum scheduling on unrelated parallel machines
Journal of Algorithms
Distributed coalition formation in visual sensor networks: a virtual vision approach
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Approximation algorithms for scheduling with reservations
HiPC'07 Proceedings of the 14th international conference on High performance computing
Genetic branch-and-bound or exact genetic algorithm?
EA'07 Proceedings of the Evolution artificielle, 8th international conference on Artificial evolution
Conditional hardness of precedence constrained scheduling on identical machines
Proceedings of the forty-second ACM symposium on Theory of computing
Understanding queries in a search database system
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Partial information spreading with application to distributed maximum coverage
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
'Strong'-'weak' precedence in scheduling: Extensions to series-parallel orders
Discrete Applied Mathematics
Constructing datatype-generic fully polynomial-time approximation schemes using generalised thinning
Proceedings of the 6th ACM SIGPLAN workshop on Generic programming
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
Online scheduling with rearrangement on two related machines
Theoretical Computer Science
The train delivery problem: vehicle routing meets bin packing
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Optimal algorithms for online scheduling with bounded rearrangement at the end
Theoretical Computer Science
Hardness of Precedence Constrained Scheduling on Identical Machines
SIAM Journal on Computing
Journal of Discrete Algorithms
Bounding prefix transposition distance for strings and permutations
Theoretical Computer Science
Proxy-Assisted scheduling for energy-efficient multimedia streaming over wireless LAN
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
Maximizing the weighted number of on-time jobs in single machine scheduling with time windows
Mathematical and Computer Modelling: An International Journal
Theoretical investigations on maximal dual feasible functions
Operations Research Letters
Scheduling on same-speed processors with at most one downtime on each machine
Discrete Optimization
Operations Research Letters
An optimal algorithm for preemptive on-line scheduling
Operations Research Letters
Online scheduling with one rearrangement at the end: Revisited
Information Processing Letters
Parallel-machine scheduling to minimize tardiness penalty and power cost
Computers and Industrial Engineering
Considering inter-task resource constraints in task allocation
Autonomous Agents and Multi-Agent Systems
Leveraging endpoint flexibility in data-intensive clusters
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
Multi-criteria scheduling: an agent-based approach for expert knowledge integration
Journal of Scheduling
Exact scalable sensitivity analysis for the next release problem
ACM Transactions on Software Engineering and Methodology (TOSEM)
Algorithms for scheduling of chemotherapy plans
Computers in Biology and Medicine
Task assignment algorithms for two-type heterogeneous multiprocessors
Real-Time Systems
| Hi-index | 0.03 |