1: Survivable Paths in Multilayer Networks
2: Uniqueness of Tensor Decompositions with Applications to Polynomial Identifiability
3: Entropy, Optimization and Counting
4: Local Graph Clustering Beyond Cheeger’s Inequality
5: From Hierarchical Partitions to Hierarchical Covers: Optimal Fault-Tolerant Spanners for Doubling Metrics
6: Ordering Metro Lines by Block Crossings
7: Quantile Regression for Large-scale Applications
8: Combinatorial Pair Testing: Distinguishing Workers from Slackers
9: Adaptive reference-free compression of sequence quality scores
10: Lightweight LCP Construction for Next-Generation Sequencing Datasets
11: TREEWIDTH and PATHWIDTH parameterized by vertex cover
12: Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests of Multifurcating Trees
13: Matrix Inversion Is As Easy As Exponentiation
14: Prior-Independent Mechanisms for Scheduling
15: Minimum Common String Partition Parameterized by Partition Size is Fixed-Parameter Tractable
16: Relative Interval Analysis of Paging Algorithms on Access Graphs
17: LZ-Compressed String Dictionaries
18: Hierarchies of Predominantly Connected Communities
19: Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity
20: Parameterized Quantum Query Complexity of Graph Collision
21: Parallel String Sample Sort
22: A Note on (Parallel) Depth- and Breadth-First Search by Arc Elimination
23: Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids
24: Classical and Quantum Algorithms for Testing Equivalence of Group Extensions
25: Optimal Noise Adding Mechanisms for Approximate Differential Privacy
26: Sparsest Cut on Bounded Treewidth Graphs: Algorithms and Hardness Results
27: Interdiction Problems on Planar Graphs
28: Probabilistic Constructions of Computable Objects and a Computable Version of Lov'asz Local Lemma