A continuously updated catalog of approximability results for NP optimization problems.

Presents research in computational complexity. Its subject is at the interface between mathematics and theoretical computer science, with a clear mathematical profile and strictly mathematical format.

Journal focusing on combinatorial algorithms, informatics, and computational sciences.

Fully-refereed electronic journal offering free access to full-text papers in all branches of discrete mathematics.

The source code of many algorithms (in C and/or Pascal) that have been already tested.

A multidisciplinary journal publishes original research papers that contain substantial mathematical results on complexity as broadly conceived.

Journal available in electronic and hard copy formats. Site provides information on the editorial board, article submissions, and journal scope.

This survey paper describes research in the development of very fast parallel algorithms.