Hardness of Approximating Flow and Job Shop Scheduling Problems.
Deterministic Distributed Vertex Coloring in Polylogarithmic Time.
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth.
Invited Articles Foreword.
Smoothed Analysis of the k-Means Method.