1: A polynomial delay algorithm generating all potential maximal cliques in triconnected planar graphs
2: Permutation-Avoiding FFT-Based Convolution
3: Approximations for Fault-Tolerant Total and Partial Positive Influence Domination
4: Private List Learnability vs. Online List Learnability
5: Distributed Computing From First Principles
6: Downstream: efficient cross-platform algorithms for fixed-capacity stream downsampling
7: The Densest SWAMP problem: subhypergraphs with arbitrary monotonic partial edge rewards
8: Stochastic Multi-Objective Multi-Armed Bandits: Regret Definition and Algorithm
9: Efficient Approximate Temporal Triangle Counting in Streaming with Predictions
10: FPT Constant Approximation Algorithms for Colorful Sum of Radii
11: Ultra-Resilient Superimposed Codes: Near-Optimal Construction and Applications
12: Learning Augmented Graph $k$-Clustering
13: Avoiding Obfuscation with Prover-Estimator Debate
14: Spectral partitioning of graphs into compact, connected regions
15: glass: ordered set data structure for client-side order books
16: Asymptotically Smaller Encodings for Graph Problems and Scheduling
17: An Exact and Efficient Sampler for Dynamic Discrete Distributions
18: The Complexity of Counting Small Sub-Hypergraphs
19: Simpler, Better, Faster, Stronger: Revisiting a Successful Reduction Rule for Dominating Set
20: Compressing Suffix Trees by Path Decompositions
21: Parallel Complexity of Depth-First-Search and Maximal path
22: Zarr-Based Chunk-Level Cumulative Sums in Reduced Dimensions
23: Private Continual Counting of Unbounded Streams
24: Efficient space reduction techniques by optimized majority rules for the Kemeny aggregation problem
25: Tractable Graph Structures in EFX Orientation
26: Learn to Vaccinate: Combining Structure Learning and Effective Vaccination for Epidemic and Outbreak Control
27: Linear-Time Primitives for Algorithm Development in Graphical Causal Inference
28: AlgoSelect: Universal Algorithm Selection via the Comb Operator
29: Learning Algorithms in the Limit
30: A survey of Chernoff and Hoeffding bounds
31: Advancing Stochastic 3-SAT Solvers by Dissipating Oversatisfied Constraints
32: Linearithmic Clean-up for Vector-Symbolic Key-Value Memory with Kroneker Rotation Products
33: HybHuff: Lossless Compression for Hypergraphs via Entropy-Guided Huffman-Bitwise Coordination
34: Local Routing on Ordered $\Theta$-graphs
35: On the Efficient Discovery of Maximum $k$-Defective Biclique
36: Parallel batch queries on dynamic trees: algorithms and experiments
37: Parallel Point-to-Point Shortest Paths and Batch Queries
38: A Distributional-Lifting Theorem for PAC Learning
39: LMQ-Sketch: Lagom Multi-Query Sketch for High-Rate Online Analytics
40: Minimum-Weight Half-Plane Hitting Set
41: When does FTP become FPT?
42: Large Average Subtensor Problem: Ground-State, Algorithms, and Algorithmic Barriers
43: On the Power of Spatial Locality on Online Routing Problems
44: Structural Optimal Jacobian Accumulation and Minimum Edge Count are NP-Complete Under Vertex Elimination
45: Faster Low-Rank Approximation and Kernel Ridge Regression via the Block-Nystr"om Method
46: Contextual Pattern Mining and Counting