1: Local and global expansion in random geometric graphs
2: An experimental study of algorithms for obtaining a singly connected subgraph
3: On The Relative Error of Random Fourier Features for Preserving Kernel Distance
4: Triangle Counting Through Cover-Edges
5: Composition of Differential Privacy & Privacy Amplification by Subsampling
6: Online Pen Testing
7: Q2Graph: a modelling tool for measurement-based quantum computing
8: High Probability Convergence for Accelerated Stochastic Mirror Descent
9: Local Computation of Maximal Independent Set
10: An Almost Singularly Optimal Asynchronous Distributed MST Algorithm
11: Designing a parallel suffix sort
12: Scheduling with Many Shared Resources
13: SicHash – Small Irregular Cuckoo Tables for Perfect Hashing
14: Link Partitioning on Simplicial Complexes Using Higher-Order Laplacians
15: Bicriteria Approximation Algorithms for Priority Matroid Median
16: The DAG Visit approach for Pebbling and I/O Lower Bounds
17: Ruler Rolling
18: Finding Top-k Longest Palindromes in Substrings
19: Computing maximal generalized palindromes
20: Tight Lower Bounds for Problems Parameterized by Rank-width
21: Faster parameterized algorithms for modification problems to minor-closed classes
22: Double-Ended Palindromic Trees: A Linear-Time Data Structure and Its Applications
23: The Power of Duality: Response Time Analysis meets Integer Programming
24: A Fourier Approach to Mixture Learning
25: Romeo and Juliet Meeting in Forest Like Regions
26: $(1-\epsilon)$-approximate fully dynamic densest subgraph: linear space and faster update time
27: Cooperative Coverage with a Leader and a Wingmate in Communication-Constrained Environments
28: What Can We Compute in a Single Round of the Congested Clique?
29: A Novel Maximum-Entropy-Driven Technique for Low-Rank Orthogonal Nonnegative Matrix Factorization with $\ell_0$-Norm sparsity Constraint
30: Paging with Succinct Predictions
31: Sequentially Swapping Tokens: Further on Graph Classes
32: Scalable Experimental Bounds for Dicke and GHZ States Fidelities
33: The Power of Greedy for Online Minimum Cost Matching on the Line
34: LazyFox: Fast and parallelized overlapping community detection in large graphs
35: On the complexity of symmetric vs. functional PCSPs
36: Latent Matrices for Tensor Network Decomposition and to Tensor Completion