1: Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees
2: Corpus-compressed Streaming and the Spotify Problem
3: Simultaneous Consecutive Ones Submatrix and Editing Problems : Classical Complexity \& Fixed-Parameter Tractable Results
4: On weighted depths in random binary search trees
5: A new algorithm for fast generalized DFTs
6: Dimensionality reduction with missing values imputation
7: Dynamic Parameterized Problems and Algorithms
8: Speeding Up String Matching by Weak Factor Recognition
9: A heuristic algorithm for the Bin Packing Problem with Conflicts on Interval Graphs
10: Supporting Ruled Polygons
11: Sequential Checking: Reallocation-Free Data-Distribution Algorithm for Scale-out Storage
12: The sample complexity of multi-reference alignment
13: Packing Cycles Faster Than Erd\H{o}s-P'osa
14: Robust Optimization for Non-Convex Objectives
15: Biased Predecessor Search
16: Dining Philosophers, Leader Election and Ring Size problems, in the quantum setting
17: Learning Geometric Concepts with Nasty Noise
18: Maximum Induced Matching Algorithms via Vertex Ordering Characterizations
19: On Directed Feedback Vertex Set parameterized by treewidth
20: Single-sink Fractionally Subadditive Network Design
21: A new and improved algorithm for online bin packing
22: Fast Compressed Self-Indexes with Deterministic Linear-Time Construction
23: Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor
24: Adaptive Modular Exponentiation Methods v.s. Python’s Power Function
25: On Calculation of Bounds for Greedy Algorithms when Applied to Sensor Selection Problems
26: Shared-memory Graph Truss Decomposition
27: Networked Fairness in Cake Cutting
28: A subexponential parameterized algorithm for Directed Subset Traveling Salesman Problem on planar graphs