1: Computing the Independence Polynomial: from the Tree Threshold down to the Roots
2: EPR-dictionaries: A practical and fast data structure for constant time searches in unidirectional and bidirectional FM-indices
3: An $\widetilde{O}(n)$ Queries Adaptive Tester for Unateness
4: A note on the Survivable Network Design Problem
5: Bidirectional Conditional Insertion Sort algorithm; An efficient progress on the classical insertion sort
6: Node Overlap Removal by Growing a Tree
7: Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems
8: System Identification and Control of Valkyrie through SVA–Based Regressor Computation
9: Parameterized Algorithms for the Maximum Agreement Forest Problem on Multiple Rooted Multifurcating Trees
10: The power of online thinning in reducing discrepancy
11: Testing Assignments to Constraint Satisfaction Problems
12: Lower Bounds for On-line Interval Coloring with Vector and Cardinality Constraints
13: The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs
14: On the limitations of deterministic de-randomizations for online bipartite matching and max-sat
15: Distributed Degree Splitting, Edge Coloring, and Orientations
16: Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More
17: Approximation algorithms for the maximum weight internal spanning tree problem
18: Bi-Arc Digraphs and Conservative Polymorphisms
19: Finding Large Set Covers Faster via the Representation Method
20: Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors
21: Constrained Submodular Maximization: Beyond 1/e
22: Chi-squared Amplification: Identifying Hidden Hubs
23: The $(1|1)_R$-Centroid Problem on the Plane
24: Greedy Maximization Framework for Graph-based Influence Functions