Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty Networks.
(Meta) Kernelization.
Exponential Separation of Information and Communication for Boolean Functions.
Invited Articles Foreword.
Polynomial Bounds for the Grid-Minor Theorem.
The Local Lemma Is Asymptotically Tight for SAT.
Highway Dimension and Provably Efficient Shortest Path Algorithms.
A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2.
Playing Mastermind With Many Colors.