1: Kernelization of Packing Problems
2: On generation of node distributions for meshless PDE discretizations
3: FLEET: Butterfly Estimation from a Bipartite Graph Stream
4: On balanced clustering with tree-like structures over clusters
5: Rounding semidefinite programs for large-domain problems via Brownian motion
6: A Unified Approach to Scalable Spectral Sparsification of Directed Graphs
7: A Non-iterative Parallelizable Eigenbasis Algorithm for Johnson Graphs
8: LZRR: LZ77 Parsing with Right Reference
9: Finding Tutte paths in linear time
10: An Improved Scheme in the Two Query Adaptive Bitprobe Model
11: Thwarting Adversarial Examples: An $L_0$-RobustSparse Fourier Transform
12: Massively scalable Sinkhorn distances via the Nystr"om method
13: Optimal Algorithm for Profiling Dynamic Arrays with Finite Values
14: Mind the Independence Gap
15: Efficient Dispersion of Mobile Robots on Arbitrary Graphs and Grids
16: Shortest Reconfiguration of Matchings
17: A Polynomial Time Algorithm for Maximum Likelihood Estimation of Multivariate Log-concave Densities
18: The Glauber dynamics for edge-colourings of trees
19: Processing Transactions in a Predefined Order
20: A Trivial Yet Optimal Solution to Vertex Fault Tolerant Spanners
21: Partial Function Extension with Applications to Learning and Property Testing
22: Graph classes and forbidden patterns on three vertices
23: Minuet: A method to solve Sudoku puzzles by hand