1: Efficient Algorithms for Partitioning Circulant Graphs with Optimal Spectral Approximation
2: The Horton-Strahler number of butterfly trees
3: A Dichotomy Theorem for Multi-Pass Streaming CSPs
4: Optimal Micro-Transit Zoning via Clique Generation and Integer Programming
5: Triangle-Covered Graphs: Algorithms, Complexity, and Structure
6: Fast Percolation Centrality Approximation with Importance Sampling
7: On the Smallest Size of Internal Collage Systems
8: Liar’s vertex-edge domination in unit disk graph
9: An ETH-Tight FPT Algorithm for Rejection-Proof Set Packing with Applications to Kidney Exchange
10: Foundational theory for optimal decision tree problems. II. Optimal hypersurface decision tree algorithm
11: SAQ: Pushing the Limits of Vector Quantization through Code Adjustment and Dimension Segmentation
12: Graph Coloring Below Guarantees via Co-Triangle Packing
13: Efficient Enumeration of At Most $k$-Out Polygons
14: TimeCluster with PCA is Equivalent to Subspace Identification of Linear Dynamical Systems
15: Protecting participants or population? Comparison of k-anonymous Origin-Destination matrices
16: Sublinear-Time Algorithms for Diagonally Dominant Systems and Applications to the Friedkin-Johnsen Model
17: Outperforming Dijkstra on Sparse Graphs: The Lightning Network Use Case
18: Hardness of Dynamic Core and Truss Decompositions
19: On Solving Asymmetric Diagonally Dominant Linear Systems in Sublinear Time
20: Smaller Circuits for Bit Addition
21: Algorithms for Optimizing Acyclic Queries
22: Normalized Square Root: Sharper Matrix Factorization Bounds for Differentially Private Continual Counting
23: Fast and Compact Sketch-Based Dynamic Connectivity
24: Kronecker Powers, Orthogonal Vectors, and the Asymptotic Spectrum
25: Decoded Quantum Interferometry Requires Structure
26: Efficient Algorithms for Disjoint Shortest Paths Problem and its Extensions
27: The Complexity of Finding and Counting Subtournaments
28: Streaming periodicity with mismatches, wildcards, and edits
29: Fast and Optimal Incremental Parametric Procedure for the Densest Subgraph Problem: An Experimental Study
30: Efficient Computation of Time-Index Powered Weighted Sums Using Cascaded Accumulators
31: Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs
32: Balanced Spanning Tree Distributions Have Separation Fairness
33: Classical and Quantum Heuristics for the Binary Paint Shop Problem
34: Tree-independence number VI. Thetas and pyramids
35: Graph-Based Approximate Nearest Neighbor Search Revisited: Theoretical Analysis and Optimization
36: A Bouquet of Results on Maximum Range Sum: General Techniques and Hardness Reductions
37: Constant time enumeration of perfect bipartite matchings
38: On the Structural Parameterizations of 2-Club with Triangle Constraints
39: Analyzing and improving a classical Betti number estimation algorithm
40: Query-Efficient Locally Private Hypothesis Selection via the Scheffe Graph
41: Clustering with Set Outliers and Applications in Relational Clustering
42: Ordered Leaf Attachment (OLA) Vectors can Identify Reticulation Events even in Multifurcated Trees
43: WarpSpeed: A High-Performance Library for Concurrent GPU Hash Tables
44: Sublinear Time Quantum Sensitivity Sampling
45: Quadratic Kernel for Cliques or Trees Vertex Deletion
46: Differential Privacy for Euclidean Jordan Algebra with Applications to Private Symmetric Cone Programming
47: Optimal 4-Approximation for the Correlated Pandora’s Problem