1: A Finer View of the Parameterized Landscape of Labeled Graph Contractions
2: Local Search-based Individually Fair Clustering with Outliers
3: Non-iid hypothesis testing: from classical to quantum
4: Quantum matrix arithmetics with Hamiltonian evolution
5: Making and Evaluating Calibrated Forecasts
6: Trickle-down Theorems via C-Lorentzian Polynomials II: Pairwise Spectral Influence and Improved Dobrushin’s Condition
7: Breaking the Treewidth Barrier in Quantum Circuit Simulation with Decision Diagrams
8: Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
9: Extending Ghouila-Houri’s Characterization of Comparability Graphs to Temporal Graphs
10: Randomized Quantum Singular Value Transformation
11: Quantum Sparse Recovery and Quantum Orthogonal Matching Pursuit
12: Parameterized Complexity of s-Club Cluster Edge Deletion: When Is the Diameter Bound Necessary?
13: Clifford testing: algorithms and lower bounds
14: On quantum to classical comparison for Davies generators
15: Quantum Filtering and Analysis of Multiplicities in Eigenvalue Spectra
16: 3-Local Hamiltonian Problem and Constant Relative Error Quantum Partition Function Approximation: $O(2^{\frac{n}{2}})$ Algorithm Is Nearly Optimal under QSETH
17: No exponential quantum speedup for $\mathrm{SIS}^\infty$ anymore
18: Conjugate queries can help
19: Optimal lower bounds for quantum state tomography
20: Clustering in Varying Metrics
21: Integer Factoring with Unoperations
22: Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set
23: k-SUM Hardness Implies Treewidth-SETH
24: Energy-Efficient Maximal Independent Sets in Radio Networks
25: Dynamic Connectivity with Expected Polylogarithmic Worst-Case Update Time
26: Adaptive Sparsification for Linear Programming
27: A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles II: Vertex and Edge Deletion Numbers
28: A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
29: Agnostic Product Mixed State Tomography via Robust Statistics
30: Quartic quantum speedups for community detection
31: Quantum Probe Tomography
32: Randomized and quantum approximate matrix multiplication
33: Computational and statistical lower bounds for low-rank estimation under general inhomogeneous noise
34: A Dobrushin condition for quantum Markov chains: Rapid mixing and conditional mutual information at high temperature
35: The Online Submodular Cover Problem
36: Planar Length-Constrained Minimum Spanning Trees
37: A Faster Randomized Algorithm for Vertex Cover: An Automated Approach
38: Multi-product Influence Maximization in Billboard Advertisement
39: Approximately Bisubmodular Regret Minimization in Billboard and Social Media Advertising
40: Random-Shift Revisited: Tight Approximations for Tree Embeddings and L1-Oblivious Routings
41: Confluence of the Node-Domination and Edge-Domination Hypergraph Rewrite Rules
42: Improved Extended Regular Expression Matching
43: Optimizing Administrative Divisions: A Vertex $k$-Center Approach for Edge-Weighted Road Graphs
44: On Stable Cutsets in General and Minimum Degree Constrained Graphs
45: Parameterized Algorithms for Diversity of Networks with Ecological Dependencies
46: Minimizing the Weighted Makespan with Restarts on a Single Machine
47: Distributed clustering in partially overlapping feature spaces
48: Quantum Circuit for Quantum Fourier Transform for Arbitrary Qubit Connectivity Graphs
49: Combinatorial Philosopher Inequalities
50: Simple Length-Constrained Expander Decompositions
51: Explicit Min-wise Hash Families with Optimal Size
52: Information-Computation Tradeoffs for Noiseless Linear Regression with Oblivious Contamination
53: Learning-Augmented Streaming Algorithms for Correlation Clustering
54: Nine lower bound conjectures on streaming approximation algorithms for CSPs
55: Crane Scheduling Problem with Energy Saving
56: Online Allocation with Concave, Diminishing-Returns Objectives
57: An $O(n\log n)$ Algorithm for Single-Item Capacitated Lot Sizing with a One-Breakpoint All-Units Discount and Non-Increasing Prices
58: List Decoding Reed–Solomon Codes in the Lee, Euclidean, and Other Metrics
59: Sublinear Algorithms for Estimating Single-Linkage Clustering Costs
60: Robust Online Sampling from Possibly Moving Target Distributions
61: Sublinear Metric Steiner Forest via Maximal Independent Set
62: Continual Release of Densest Subgraphs: Privacy Amplification & Sublinear Space via Subsampling
63: A Fast-Converging Decentralized Approach to the Weighted Minimum Vertex Cover Problem
64: High-Probability Bounds For Heterogeneous Local Differential Privacy
65: The Structure of In-Place Space-Bounded Computation
66: Thin Trees via $k$-Respecting Cut Identities
67: Engineering Dominating Patterns: A Fine-grained Case Study
68: Planted clique recovery in random geometric graphs
69: Exact Matching and Top-k Perfect Matching Parameterized by Neighborhood Diversity or Bandwidth
70: Lossless Derandomization for Undirected Single-Source Shortest Paths and Approximate Distance Oracles