1: Learning stochastic decision trees
2: Parameterized Complexity of Feature Selection for Categorical Data Clustering
3: Separations for Estimating Large Frequency Moments on Data Streams
4: Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space
5: Fast $n$-fold Boolean Convolution via Additive Combinatorics
6: Fast and Error-Adaptive Influence Maximization based on Count-Distinct Sketches
7: Knapsack and Subset Sum with Small Items
8: Polynomial-Delay Enumeration of Large Maximal Matchings
9: Exact asymptotic characterisation of running time for approximate gradient descent on random graphs
10: Partitioning H-Free Graphs of Bounded Diameter
11: Deletion to Scattered Graph Classes I – case of finite number of graph classes
12: Ultrafast Distributed Coloring of High Degree Graphs
13: ppsim: A software package for efficiently simulating and visualizing population protocols
14: Near Neighbor Search via Efficient Average Distortion Embeddings
15: A 3-approximation list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource and total weighted completion time criterion
16: Tree Edit Distance with Variables. Measuring the Similarity between Mathematical Formulas
17: Testing Triangle Freeness in the General Model in Graphs with Arboricity $O(\sqrt{n})$
18: Improved Local Computation Algorithms for Constructing Spanners
19: Parameterized Algorithms for Diverse Multistage Problems
20: Succinct Euler-Tour Trees
21: Constrained Consensus Sequence Algorithm for DNA Archiving
22: Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal
23: Towards a Model for LSH
24: On the probability of generating a primitive matrix
25: LipBaB: Computing exact Lipschitz constant of ReLU networks
26: kMatrix: A Space Efficient Streaming Graph Summarization Technique
27: Robust Learning of Fixed-Structure Bayesian Networks in Nearly-Linear Time
28: Locally Checkable Labelings with Small Messages
29: Distributed Graph Coloring Made Easy
30: Reversify any sequential algorithm
31: A Mathematical Definition of Particle Methods
32: Breaking O(nr) for Matroid Intersection
33: Isomorphic unordered labeled trees up to substitution ciphering
34: Application of the Level-$2$ Quantum Lasserre Hierarchy in Quantum Approximation Algorithms
35: Frequent Pattern Mining in Continuous-time Temporal Networks
36: On (Coalitional) Exchange-Stable Matching
37: From Average Embeddings To Nearest Neighbor Search
38: How to Design Robust Algorithms using Noisy Comparison Oracle
39: Particle-Based Assembly Using Precise Global Control
40: The Power of the Weisfeiler-Leman Algorithm for Machine Learning with Graphs
41: Open-end bin packing: new and old analysis approaches
42: Sparse Nonnegative Convolution Is Equivalent to Dense Nonnegative Convolution
43: Further Improvements for SAT in Terms of Formula Length
44: Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths
45: The Dynamic k-Mismatch Problem
46: Analysis of Busy-Time Scheduling on Heterogeneous Machines
47: Hedging Against Sore Loser Attacks in Cross-Chain Transactions
48: Disjoint Paths and Connected Subgraphs for H-Free Graphs
49: On Minimizing the Number of Running Buffers for Tabletop Rearrangement
50: Analysis of stochastic Lanczos quadrature for spectrum approximation
51: Fast Stencil Computations using Fast Fourier Transforms