1: Controlling the Spread of Epidemics on Networks with Differential Privacy
2: Learning Juntas under Markov Random Fields
3: Constant-Factor Algorithms for Revenue Management with Consecutive Stays
4: Learning DNF through Generalized Fourier Representations
5: BWT for string collections
6: Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator
7: Nearly-Linear Time Private Hypothesis Selection with the Optimal Approximation Factor
8: Reweighted Spectral Partitioning Works: Bounds for Special Graph Classes
9: Computing Diverse and Nice Triangulations
10: New aspects of quantum topological data analysis: Betti number estimation, and testing and tracking of homology and cohomology classes
11: A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs
12: The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs
13: A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time
14: Fairly Wired: Towards Leximin-Optimal Division of Electricity
15: Learning Optimal Posted Prices for a Unit-Demand Buyer
16: Sensitivity-Aware Density Estimation in Multiple Dimensions
17: A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs
18: On the Inversion Modulo a Power of an Integer
19: The power of mediators: Price of anarchy and stability in Bayesian games with submodular social welfare
20: Cartesian Forest Matching
21: Upper bounds on the theta function of random graphs
22: GPU-Parallelizable Randomized Sketch-and-Precondition for Linear Regression using Sparse Sign Sketches
23: Labelling Data with Unknown References
24: Prefix-free parsing for merging big BWTs
25: Cover time of random subgraphs of the hypercube
26: Conjectured Bounds for 2-Local Hamiltonians via Token Graphs
27: Connectivity-Preserving Minimum Separator in AT-free Graphs
28: Stability Notions for Hospital Residents with Sizes
29: GenTT: Generate Vectorized Codes for General Tensor Permutation
30: Testing (Conditional) Mutual Information
31: Faster Approx. Top-K: Harnessing the Full Power of Two Stages
32: Rumors on evolving graphs through stationary times
33: Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs
34: Identity Testing for Circuits with Exponentiation Gates
35: An $O(\log \log n)$-approximate budget feasible mechanism for subadditive valuations
36: Improved Byzantine Agreement under an Adaptive Adversary
37: Online matching on stochastic block model
38: Decomposing Words for Enhanced Compression: Exploring the Number of Runs in the Extended Burrows-Wheeler Transform
39: Resilient Pattern Mining
40: Compressing Hypergraphs using Suffix Sorting
41: Memory Hierarchy Design for Caching Middleware in the Age of NVM
42: The Peculiarities of Extending Queue Layouts
43: A Unified Framework for Provably Efficient Algorithms to Estimate Shapley Values
44: On Minimizers of Minimum Density
45: Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors
46: Learning-Augmented Hierarchical Clustering
47: On Differential Privacy for Adaptively Solving Search Problems via Sketching
48: Why is My Route Different Today? An Algorithm for Explaining Route Selection
49: Smallest Suffixient Sets as a Repetitiveness Measure
50: Perfect Matching with Few Link Activations
51: An extension of Dembo-Hammer’s reduction algorithm for the 0-1 knapsack problem
52: Longer Lists Yield Better Matchings
53: Efficient Computation of Closed Substrings
54: Sample and Expand: Discovering Low-rank Submatrices With Quality Guarantees
55: Modern Minimal Perfect Hashing: A Survey
56: #P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?