1: Online Algorithms to Schedule a Proportionate Flexible Flow Shop of Batching Machines
2: Simulating Population Protocols in Sub-Constant Time per Interaction
3: Imbalance Parameterized by Twin Cover Revisited
4: Efficient Reconstruction of Stochastic Pedigrees
5: Faster classical Boson Sampling
6: Multi-Party Campaigning
7: Improved Throughput for All-or-Nothing Multicommodity Flows with Arbitrary Demands
8: Fast simulation of Grover’s quantum search on classical computer
9: Structural Parameterizations of Clique Coloring
10: Approaching Optimal Duplicate Detection in a Sliding Window
11: Improved Algorithms for Solving Polynomial Systems over GF(2) by Multiple Parity-Counting
12: On the Petri Nets with a Single Shared Place and Beyond
13: High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming
14: Approximate $\mathrm{CVP}_{p}$ in time $2^{0.802 \, n}$
15: Faster Exponential-time Algorithms for Approximately Counting Independent Sets
16: An Algorithmic Method of Partial Derivatives
17: Exact Parallelization of the Stochastic Simulation Algorithm for Scalable Simulation of Large Biochemical Networks
18: A Relational Gradient Descent Algorithm For Support Vector Machine Training
19: List homomorphism problems for signed trees
20: Counting Distinct Patterns in Internal Dictionary Matching
21: Compact Distributed Certification of Planar Graphs
22: Red-Blue Point Separation for Points on a Circle
23: Structure and Algorithm for Path of Solutions to a Class of Fused Lasso Problems
24: Super-resolution and Robust Sparse Continuous Fourier Transform in Any Constant Dimension: Nearly Linear Time and Sample Complexity
25: An improved solution approach for the Budget constrained Fuel Treatment Scheduling problem
26: Fully Online Matching II: Beating Ranking and Water-filling
27: k-Approximate Quasiperiodicity under Hamming and Edit Distance
28: A remark on approximating permanents of positive definite matrices
29: A Polynomial-Time Algorithm for Unconstrained Binary Quadratic Optimization
30: Robustly Learning any Clusterable Mixture of Gaussians
31: Testing Positive Semi-Definiteness via Random Submatrices
32: Distance-2 Coloring in the CONGEST Model
33: Scaling Blockchains Without Giving up Decentralization and Security
34: Shortest Distances as Enumeration Problem