1: Column Selection via Adaptive Sampling
2: Random Irregular Block-hierarchical Networks: Algorithms for Computation of Main Properties
3: An Improved Randomized Data Structure for Dynamic Graph Connectivity
4: Predictive partitioning for efficient BFS traversal in social networks
5: Subtree Isomorphism Revisited
6: How Good is Multi-Pivot Quicksort?
7: Improved Solution to the Non-Domination Level Update Problem
8: Honest signaling in zero-sum games is hard, and lying is even harder
9: A cost function for similarity-based hierarchical clustering
10: A Distance Measure for the Analysis of Polar Opinion Dynamics in Social Networks
11: Faster algorithms to enumerate hypergraph transversals
12: Integrality Gaps and Approximation Algorithms for Dispersers and Bipartite Expanders
13: Algebraic Conditions for Generating Accurate Adjacency Arrays
14: Fast Parallel Operations on Search Trees
15: Preprocessing under uncertainty
16: Approximation Algorithm for Minimum Weight Connected $m$-Fold Dominating Set
17: The Complexity of Pattern Matching for $321$-Avoiding and Skew-Merged Permutations
18: Input Sparsity and Hardness for Robust Subspace Approximation
19: Computing LZ77 in Run-Compressed Space