1: Exact algorithms for maximum weighted independent set on sparse graphs
2: Parameterizing the Permanent: Hardness for $K_8$-minor-free graphs
3: Tight Guarantees for Static Threshold Policies in the Prophet Secretary Problem
4: Approximating Pandora’s Box with Correlations
5: A Further Improvement on Approximating TTP-2
6: A New Test for Hamming-Weight Dependencies
7: Extending Partial Representations of Circular-Arc Graphs
8: BDD-Based Algorithm for SCC Decomposition of Edge-Coloured Graphs
9: Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees
10: Approximation algorithms for priority Steiner tree problems
11: Hierarchical Bitmap Indexing for Range and Membership Queries on Multidimensional Arrays