1: Exact Method for Generating Strategy-Solvable Sudoku Clues
2: Planar Graphs that Need Four Pages
3: Classical and Quantum Algorithms for Constructing Text from Dictionary Problem
4: Query complexity of heavy hitter estimation
5: A Fully Dynamic Algorithm for k-Regret Minimizing Sets
6: Parameterized Complexity of Min-Power Asymmetric Connectivity
7: A Note on Generic Tangle Algorithms
8: Differentially Private Decomposable Submodular Maximization
9: Longest Square Subsequence Problem Revisited
10: Bi-Criteria Multiple Knapsack Problem with Grouped Items
11: Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation
12: Lower Bounds for Caching with Delayed Hits
13: Scheduling in the Random-Order Model