Marek Karpinski Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems. [Citation Graph (0, 0)][DBLP] Algorithmica, 2001, v:30, n:3, pp:386-397 [Journal]

Maxim Sviridenko Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint. [Citation Graph (0, 0)][DBLP] Algorithmica, 2001, v:30, n:3, pp:398-405 [Journal]

V. Kumar An Approximation Algorithm for Circular Arc Colouring. [Citation Graph (0, 0)][DBLP] Algorithmica, 2001, v:30, n:3, pp:406-417 [Journal]

Michael E. Saks, Shiyu Zhou Sample Spaces with Small Bias on Neighborhoods and Error-Correcting Communication Protocols. [Citation Graph (0, 0)][DBLP] Algorithmica, 2001, v:30, n:3, pp:418-431 [Journal]