1: Fast Algorithms for Exact String Matching
2: Efficiently Finding All Maximal $\alpha$-gapped Repeats
3: Optimal quantum algorithm for polynomial interpolation
4: FPT Approximation Schemes for Maximizing Submodular Functions
5: Implementing Efficient All Solutions SAT Solvers
6: On independent set on B1-EPG graphs
7: A Note on Easy and Efficient Computation of Full Abelian Periods of a Word
8: Rank Aggregation: New Bounds for MCx
9: Sparse Density Representations for Simultaneous Inference on Large Spatial Datasets
10: A Note on Finding Dual Feedback Vertex Set
11: M. Levin’s construction of absolutely normal numbers with very low discrepancy
12: Existence of k-ary Trees: Subtree Sizes, Heights and Depths
13: Routing in Unit Disk Graphs
14: Design and Management of Vehicle Sharing Systems: A Survey of Algorithmic Approaches
15: A Framework for Estimating Stream Expression Cardinalities
16: DC Decomposition of Nonconvex Polynomials with Algebraic Techniques
17: Simultaneous Feedback Vertex Set: A Parameterized Perspective
18: Logarithmic regret bounds for Bandits with Knapsacks
19: Source Localization in Networks: Trees and Beyond
20: On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy
21: A Box Decomposition Algorithm to Compute the Hypervolume Indicator