1: MABSplit: Faster Forest Training Using Multi-Armed Bandits
2: Performance Enhancement Strategies for Sparse Matrix-Vector Multiplication (SpMV) and Iterative Linear Solvers
3: Correlating Theory and Practice in Finding Clubs and Plexes
4: Fast and exact fixed-radius neighbor search based on sorting
5: Min-max Submodular Ranking for Multiple Agents
6: Parameterized Algorithms for String Matching to DAGs: Funnels and Beyond
7: Automatic vehicle trajectory data reconstruction at scale
8: Differentially Private Range Query on Shortest Paths
9: Privately Estimating a Gaussian: Efficient, Robust and Optimal
10: Approximate counting using Taylor’s theorem: a survey
11: Essentials of Parallel Graph Analytics
12: Computing Well-Covered Vector Spaces of Graphs using Modular Decomposition
13: On the Optimum Scenarios for Single Row Equidistant Facility Layout Problem
14: GPU Load Balancing
15: High-Performance Filters For GPUs
16: Unconstrained Traveling Tournament Problem is APX-complete
17: The One-Inclusion Graph Algorithm is not Always Optimal
18: Lower bound on the running time of Pop-Stack Sorting on a random permutation
19: Excluding Single-Crossing Matching Minors in Bipartite Graphs
20: High Performance Construction of RecSplit Based Minimal Perfect Hash Functions
21: Dominance for Containment Problems
22: Scheduling with Predictions
23: Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms
24: Additive estimates of the permanent using Gaussian fields
25: An efficient quantum algorithm for simulating polynomial differential equations
26: Is it easier to count communities than find them?