1: Congruency-Constrained TU Problems Beyond the Bimodular Case
2: The VLSAT-2 Benchmark Suite
3: Approximately counting independent sets in bipartite graphs via graph containers
4: Adversarially Robust Streaming via Dense–Sparse Trade-offs
5: Improved Hardness of BDD and SVP Under Gap-(S)ETH
6: Multi-Constraint Shortest Path using Forest Hop Labeling
7: Online Search for a Hyperplane in High-Dimensional Euclidean Space
8: Algorithms and Certificates for Boolean CSP Refutation: “Smoothed is no harder than Random”
9: Improved Online Algorithm for Fractional Knapsack in the Random Order Model
10: Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once
11: Feature-based Individual Fairness in k-Clustering
12: Fast Algorithms for Minimum Homology Basis
13: C-MinHash: Practically Reducing Two Permutations to Just One
14: ReLU Regression with Massart Noise
15: Efficient Locally Optimal Number Set Partitioning for Scheduling, Allocation and Fair Selection
16: Proceedings of the 29th International Symposium on Graph Drawing and Network Visualization (GD 2021)
17: Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts
18: A Note on Projection-Based Recovery of Clusters in Markov Chains
19: The Labeled Direct Product Optimally Solves String Problems on Graphs
20: Maximum-Profit Routing Problem with Multiple Vehicles per Site
21: Decremental All-Pairs Shortest Paths in Deterministic Near-Linear Time
22: Nimber-Preserving Reductions and Homomorphic Sprague-Grundy Game Encodings
23: Maximum Matching sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model
24: Predictable universally unique identification of sequential events on complex objects
25: Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU
26: Online Influence Maximization under the Independent Cascade Model with Node-Level Feedback
27: A Dyadic Simulation Approach to Efficient Range-Summability
28: Domain Sparsification of Discrete Distributions using Entropic Independence
29: Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters
30: The Complexity of Vector Partition
31: Locality in online, dynamic, sequential, and distributed graph algorithms
32: Distributed Vertex Cover Reconfiguration
33: $\varepsilon$-isometric dimension reduction for incompressible subsets of $\ell_p$
34: Optimizing the ecological connectivity of landscapes with generalized flow models and preprocessing
35: Online k-Way Matching with Delays and the H-Metric