1: Metalearning with Very Few Samples Per Task
2: Phylogenetic tree distance computation over succinct representations
3: Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs
4: Fairness in Submodular Maximization over a Matroid Constraint
5: Deciding Foot-sortability and Minimal 2-bounded Non-foot-sortable Sock Orderings
6: Online Covering with Multiple Experts
7: The Effect of Sparsity on $k$-Dominating Set and Related First-Order Graph Properties
8: Gerrymandering Planar Graphs
9: HITSnDIFFs: From Truth Discovery to Ability Discovery by Recovering Matrices with the Consecutive Ones Property
10: Complexity of Local Search for Euclidean Clustering Problems
11: Majority-based Preference Diffusion on Social Networks
12: The Group Access Bounds for Binary Search Trees
13: Semi-Bandit Learning for Monotone Stochastic Optimization
14: Improved Approximation Guarantees for Power Scheduling Problems With Sum-of-Squares Constraints
15: Weighted Proportional Allocations of Indivisible Goods and Chores: Insights via Matchings
16: Deciding the Feasibility and Minimizing the Height of Tangles
17: Viral Marketing in Social Networks with Competing Products
18: Range Entropy Queries and Partitioning
19: Nearly Tight Bounds For Differentially Private Min $s$-$t$ and Multiway Cut
20: Approximate Distance and Shortest-Path Oracles for Fault-Tolerant Geometric Spanners
21: Improved Approximation Coflows Scheduling Algorithms for Minimizing the Total Weighted Completion Time and Makespan in Heterogeneous Parallel Networks
22: Deterministic Minimum Steiner Cut in Maximum Flow Time
23: Near-Optimal Fault Tolerance for Efficient Batch Matrix Multiplication via an Additive Combinatorics Lens
24: Agnostically Learning Multi-index Models with Queries
25: Computing Balanced Solutions for Large International Kidney Exchange Schemes When Cycle Length Is Unbounded
26: Catch Me if You Can: Effective Honeypot Placement in Dynamic AD Attack Graphs
27: Replication-proof Bandit Mechanism Design
28: Adaptive Flip Graph Algorithm for Matrix Multiplication
29: Algorithms for Optimally Shifting Intervals under Intersection Graph Models
30: Selective Run-Length Encoding