1: On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching
2: Hardness of approximation for H-free edge modification problems
3: Maximum Selection and Sorting with Adversarial Comparators and an Application to Density Estimation
4: Approximation Algorithm for N-distance Minimal Vertex Cover Problem
5: Approximately coloring graphs without long induced paths
6: Efficient Robust Proper Learning of Log-concave Distributions
7: Finding Low-Rank Solutions via Non-Convex Matrix Factorization, Efficiently and Provably
8: Approximation algorithms for the vertex happiness
9: Conflict Resolution in Multiple Access Channels Supporting Simultaneous Successful Transmissions
10: Constraining the Number of Positive Responses in Adaptive, Non-Adaptive, and Two-Stage Group Testing
11: Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
12: Better partitions of protein graphs for subsystem quantum chemistry
13: On Matching and Thickness in Heterogeneous Dynamic Markets
14: Variable Neighborhood Search Based Algorithm for University Course Timetabling Problem
15: Computing the Optimal Longest Queue Length in Torus Networks
16: Length of the continued logarithm algorithm on rational inputs
17: A Probabilistic-Based Model for Binary CSP
18: FM-index of Alignment with Gaps
19: Randomized Ternary Search Tries
20: Single machine scheduling with job-dependent machine deterioration
21: A revised model of fluid transport optimization in Physarum polycephalum
22: Context Trees: Augmenting Geospatial Trajectories with Context