A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds.
Plane Formation by Synchronous Mobile Robots in the Three-Dimensional Euclidean Space.
The Complexity of Non-Monotone Markets.
Complexity of Counting CSP with Complex Weights.
Invited Article Foreword.
Tight Lower Bounds on Graph Embedding Problems.
Deciding First-Order Properties of Nowhere Dense Graphs.
On Learning and Testing Dynamic Environments.