1: The Kernighan-Lin Search Algorithm
2: The Model Counting Competitions 2021-2023
3: Satisfactory Budget Division
4: PAC Learning is just Bipartite Matching (Sort of)
5: Optimal local certification on graphs of bounded pathwidth
6: Learning-Based TSP-Solvers Tend to Be Overly Greedy
7: Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems
8: Graph parameters that are coarsely equivalent to tree-length
9: Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap
10: Minimum Riesz s-Energy Subset Selection in Ordered Point Sets via Dynamic Programming
11: On Exact Learning of $d$-Monotone Functions
12: IBB: Fast Burrows-Wheeler Transform Construction for Length-Diverse DNA Data
13: Fair densest subgraph across multiple graphs
14: Fair Vertex Problems Parameterized by Cluster Vertex Deletion
15: Node ranking in labeled networks
16: Fully Dynamic Spectral Sparsification of Hypergraphs
17: Dense Subgraph Discovery Meets Strong Triadic Closure
18: Reductions in local certification
19: Southwest Tree: A Low-Memory Data Structure for Partial Accumulations by Non-Commutative Invertible Operations
20: A New Rejection Sampling Approach to $k$-$\mathtt{means}$++ With Improved Trade-Offs
21: Efficient and Practical Approximation Algorithms for Advertising in Content Feeds
22: Extending the Applicability of Bloom Filters by Relaxing their Parameter Constraints
23: A note on Ordered Ruzsa-Szemer'edi graphs
24: A Clique Partitioning-Based Algorithm for Graph Compression
25: Max-Min Diversification with Asymmetric Distances
26: Posted Price Mechanisms for Online Allocation with Diseconomies of Scale
27: Algorithms and Hardness Results for the $(k,\ell)$-Cover Problem
28: Improving polynomial bounds for the Graphical Traveling Salesman Problem with release dates on paths
29: Efficient Implementation of the Global Cardinality Constraint with Costs
30: Unweighted Code Sparsifiers and Thin Subgraphs
31: Algorithms with Calibrated Machine Learning Predictions
32: Group Trip Planning Query Problem with Multimodal Journey
33: Optimal Orthogonal Drawings in Linear Time
34: Near-optimal Linear Sketches and Fully-Dynamic Algorithms for Hypergraph Spectral Sparsification
35: Pandora with Inaccurate Priors
36: Fast Geographic Routing in Fixed-Growth Graphs
37: Cascaded Learned Bloom Filter for Optimal Model-Filter Size Balance and Fast Rejection
38: Tensor Decomposition Meets Knowledge Compilation: A Study Comparing Tensor Trains with OBDDs
39: Knowing When to Stop Matters: A Unified Algorithm for Online Conversion under Horizon Uncertainty
40: Fast In-Spectrum Graph Watermarks
41: Near-Optimal Sample Complexity for MDPs via Anchoring
42: Tight Bounds for Noisy Computation of High-Influence Functions, Connectivity, and Threshold
43: LLM Query Scheduling with Prefix Reuse and Latency Constraints