1: Approximate and Robust Bounded Job Start Scheduling for Royal Mail Delivery Offices
2: A column-generation-based matheuristic for periodic train timetabling with integrated passenger routing
3: FPT algorithms for generalized feedback vertex set problems
4: Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection
5: Matrix Bloom Filter: An Efficient Probabilistic Data Structure for 2-tuple Batch Lookup
6: A Control-Theoretic Perspective on Optimal High-Order Optimization
7: Game Theory based Joint Task Offloading and Resources Allocation Algorithm for Mobile Edge Computing
8: A new Frequency Estimation Sketch for Data Streams
9: Constructing a provably adversarially-robust classifier from a high accuracy one
10: Learning Mixtures of Linear Regressions in Subexponential Time via Fourier Moments
11: Finding the Mode of a Kernel Density Estimate
12: Balancing the Tradeoff Between Clustering Value and Interpretability
13: Approximating MIS over equilateral $B_1$-VPG graphs
14: Putting Ridesharing to the Test: Efficient and Scalable Solutions and the Power of Dynamic Vehicle Relocation
15: Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters
16: Finding Effective Geo-Social Group for Impromptu Activity with Multiple Demands
17: Improved quantum algorithm for the random subset sum problem
18: Dynamic Toolbox for ETRINV
19: Pseudospectral Shattering, the Sign Function, and Diagonalization in Nearly Matrix Multiplication Time
20: A Theory of Trotter Error
21: The Planted Matching Problem: Phase Transitions and Exact Results
22: Slim Graph: Practical Lossy Graph Compression for Approximate Graph Processing, Storage, and Analytics
23: The power of synergy in differential privacy: Combining a small curator with local randomizers
24: Optimal Tree Decompositions Revisited: A Simpler Linear-Time FPT Algorithm
25: Energy Minimization in DAG Scheduling on MPSoCs at Run-Time: Theory and Practice
26: Imposing edges in Minimum Spanning Tree
27: Robust Product-line Pricing under Generalized Extreme Value Models
28: Comparing Hierarchical Data Structures for Sparse Volume Rendering with Empty Space Skipping
29: An Efficient Algorithm for the Escherization Problem in the Polygon Representation
30: An $\tilde{O}(\log^2 n)$-approximation algorithm for $2$-edge-connected dominating set
31: Circ-Tree: A B+-Tree Variant with Circular Design for Persistent Memory
32: String factorisations with maximum or minimum dimension