Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs.
Algebraic Approach to Promise Constraint Satisfaction.
Invited Article Foreword.
Kernel-based Methods for Bandit Convex Optimization.
Clique Is Hard on Average for Regular Resolution.
Response Time Distribution in a Tandem Pair of Queues with Batch Processing.
On the Power of Symmetric Linear Programs.
Competitive Caching with Machine Learned Advice.
Balancing Straight-line Programs.