An Unrestricted Learning Procedure.
On the Complexity of Cache Analysis for Different Replacement Policies.
Invited Articles Foreword.
The Weisfeiler-Leman Dimension of Planar Graphs Is at Most 3.
Computing the Geometric Intersection Number of Curves.
Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents.
Deciding Context Unification.