1: Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts
2: Non-positive curvature, and the planar embedding conjecture
3: Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems
4: Exact Weight Subgraphs and the k-Sum Conjecture
5: Approximating {0,1,2}-Survivable Networks with Minimum Number of Steiner Points
6: Optimal amortized regret in every interval
7: Combining Binary Search Trees
8: Counting small cuts in a graph
9: A Nonmonotone Analysis with the Primal-Dual Approach: online routing of virtual circuits with unknown durations
10: The Beachcombers’ Problem: Walking and Searching with Mobile Robots
11: Co-Scheduling Algorithms for High-Throughput Workload Execution
12: Producibility in hierarchical self-assembly
13: ACL2 Meets the GPU: Formalizing a CUDA-based Parallelizable All-Pairs Shortest Path Algorithm in ACL2
14: Optimal Planar Orthogonal Skyline Counting Queries