1: Generalized Graph Packing Problems Parameterized by Treewidth
2: Parameterized Algorithms for Computing Pareto Sets
3: Separable convex optimization over indegree polytopes
4: Degree Realization by Bipartite Cactus Graphs
5: Efficient Catalytic Graph Algorithms
6: Zero-Freeness is All You Need: A Weitz-Type FPTAS for the Entire Lee-Yang Zero-Free Region
7: The Steiner Shortest Path Tree Problem
8: Engineering Select Support for Hybrid Bitvectors
9: Quantum algorithms for general nonlinear dynamics based on the Carleman embedding
10: Optimal streaming algorithm for detecting $\ell_2$ heavy hitters in random order streams
11: Dimension Reduction for Clustering: The Curious Case of Discrete Centers
12: The General Expiration Streaming Model: Diameter, $k$-Center, Counting, Sampling, and Friends
13: Tight Bounds for Low-Error Frequency Moment Estimation and the Power of Multiple Passes
14: Proximity Graphs for Similarity Search: Fast Construction, Lower Bounds, and Euclidean Separation
15: Compressibility Measures and Succinct Data Structures for Piecewise Linear Approximations
16: A Dynamic, Self-balancing k-d Tree
17: FeynmanDD: Quantum Circuit Analysis with Classical Decision Diagrams
18: Enumeration kernels for Vertex Cover and Feedback Vertex Set
19: Checking and producing word attractors
20: Dorst-Smeulders Coding for Arbitrary Binary Words
21: Instance-Optimal Matrix Multiplicative Weight Update and Its Quantum Applications
22: Improved Approximation Guarantees and Hardness Results for MNL-Driven Product Ranking
23: Maximizing social welfare among EF1 allocations at the presence of two types of agents
24: Additive Approximation Schemes for Low-Dimensional Embeddings
25: Setchain Algorithms for Blockchain Scalability
26: Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distances
27: A Smooth Computational Transition in Tensor PCA
28: Approximate Graph Propagation Revisited: Dynamic Parameterized Queries, Tighter Bounds and Dynamic Updates
29: Toward Minimum Graphic Parity Networks
30: Predictive Spike Timing Enables Distributed Shortest Path Computation in Spiking Neural Networks
31: Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class
32: Certifying and learning quantum Ising Hamiltonians
33: Parameterized Complexity of Vehicle Routing
34: A linear-time algorithm for Chow decompositions
35: The Chonkers Algorithm: Content-Defined Chunking with Provable Strict Guarantees on Size and Locality
36: Foundational theory for optimal decision tree problems. I. Algorithmic and geometric foundations