1: Strongly polynomial efficient approximation scheme for segmentation
2: On Maximization of Weakly Modular Functions: Guarantees of Multi-stage Algorithms, Tractability, and Hardness
3: Succinct data structure for dynamic trees with faster queries
4: More applications of the d-neighbor equivalence: acyclicity and connectivity constraints
5: Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption
6: Representational Power of ReLU Networks and Polynomial Kernels: Beyond Worst-Case Analysis
7: Space-Efficient DFS and Applications: Simpler, Leaner, Faster
8: Groups of automorphisms of p-adic integers and the problem of the existence of fully homomorphic ciphers
9: Protein Design by Algorithm
10: Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions
11: High-Quality Disjoint and Overlapping Community Structure in Large-Scale Complex Networks
12: A faster hafnian formula for complex matrices and its benchmarking on a supercomputer