1: ER-index: a referential index for encrypted genomic databases
2: Spectral sparsification of matrix inputs as a preprocessing step for quantum algorithms
3: A Fast Exact Algorithm for Airplane Refueling Problem
4: Parallel Online Algorithms for the Bin Packing Problem
5: Understanding Zadimoghaddam’s Edge-weighted Online Matching Algorithm: Weighted Case
6: Upper and Lower Bounds for Fully Retroactive Graph Problems
7: A note on computational approaches for the antibandwidth problem
8: Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters
9: Fast Diameter Computation within Split Graphs
10: Stack Sorting with Increasing and Decreasing Stacks
11: Differentially private anonymized histograms
12: MAMS-A(star): Multi-Agent Multi-Scale A(star)
13: Prophets, Secretaries, and Maximizing the Probability of Choosing the Best
14: Scalable Nearest Neighbor Search for Optimal Transport
15: Minimum Cuts in Surface Graphs
16: Exact Recovery of Community Detection in k-partite Graph Models
17: E2FM: an encrypted and compressed full-text index for collections of genomic sequences
18: LISA: Towards Learned DNA Sequence Search
19: A Fast Max Flow Algorithm
20: Evaluating Quantum Approximate Optimization Algorithm: A Case Study
21: Truly Subcubic Min-Plus Product for Less Structured Matrices, with Applications
22: Regret Bounds for Batched Bandits
23: A Quality Metric for Symmetric Graph Drawings
24: Iterated Decomposition of Biased Permutations Via New Bounds on the Spectral Gap of Markov Chains
25: On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal
26: Optimal Approximation of Doubly Stochastic Matrices
27: Near-Optimal Massively Parallel Graph Connectivity
28: SiPPing Neural Networks: Sensitivity-informed Provable Pruning of Neural Networks
29: Efficiency in managing peer-review of scientific manuscripts – editors’ perspective
30: Improved (In-)Approximability Bounds for d-Scattered Set
31: Reachability and Shortest Paths in the Broadcast CONGEST Model
32: “Bring Your Own Greedy”+Max: Near-Optimal $1/2$-Approximations for Submodular Knapsack
33: Fast Fourier Sparsity Testing
34: Quantum-Inspired Classical Algorithms for Singular Value Transformation
35: Towards Efficient Discrete Integration via Adaptive Quantile Queries
36: FastSV: A Distributed-Memory Connected Component Algorithm with Fast Convergence
37: Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning
38: The PGM-index: a multicriteria, compressed and learned approach to data indexing
39: An Improved FPT Algorithm for the Flip Distance Problem