Tight approximations for resource constrained scheduling and bin packing

The NP-Completeness of Edge-Coloring

Ian Holyer · SIAM Journal on Computing · 1981 · 1.1K citations

Randomized rounding: A technique for provably good algorithms and algorithmic proofs

Prabhakar Raghavan, Clark D. Tompson · COMBINATORICA · 1987 · 1K citations

Secure Multi-party Computation, Cryptographic Primitive, Engineering +12

Approximation algorithms for scheduling unrelated parallel machines

Jan Karel Lenstra, David B. Shmoys, Éva Tardos · Mathematical Programming · 1990 · 919 citations

Mathematical Programming, Engineering, Parallel Complexity Theory +9

A fast and simple randomized parallel algorithm for the maximal independent set problem

Noga Alon, László Babai, Alon Itai · Journal of Algorithms · 1986 · 834 citations

Mathematical Programming, Engineering, Parallel Complexity Theory +8

Fast probabilistic algorithms for hamiltonian circuits and matchings

Dana Angluin, Leslie G. Valiant · Journal of Computer and System Sciences · 1979 · 586 citations

Mathematical Programming, Circuit Complexity, Hamiltonian Circuits +7