1: A new approach to bipartite stable matching optimization
2: Centralized Selection with Preferences in the Presence of Biases
3: FPT approximations for Capacitated Sum of Radii and Diameters
4: A Performance Bound for the Greedy Algorithm in a Generalized Class of String Optimization Problems
5: Efficiently Learning Markov Random Fields from Dynamics
6: OciorCOOL: Faster Byzantine Agreement and Reliable Broadcast
7: Robust Max Selection
8: Reconstructing semi-directed level-1 networks using few quarnets
9: Exploring Monotone Priority Queues for Dijkstra Optimization
10: On the joint embedding property for cographs and trees
11: Structured Downsampling for Fast, Memory-efficient Curation of Online Data Streams
12: Position Fair Mechanisms Allocating Indivisible Goods
13: Learning Multiple Secrets in Mastermind
14: Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain
15: Adversary Resilient Learned Bloom Filters
16: A Simple Linear Space Data Structure for ANN with Application in Differential Privacy
17: Improved Hardness Results of the Cardinality-Based Minimum s-t Cut Problem in Hypergraphs
18: Dual-Step Optimization for Binary Sequences with High Merit Factors
19: Deterministic approximation for the volume of the truncated fractional matching polytope
20: Static Pricing for Single Sample Multi-unit Prophet Inequalities
21: Maximum And- vs. Even-SAT
22: Computing the LZ-End parsing: Easy to implement and practically efficient
23: An Optimal Algorithm for Sorting Pattern-Avoiding Sequences
24: Fine-Grained Complexity of Multiple Domination and Dominating Patterns in Sparse Graphs
25: Graph Inspection for Robotic Motion Planning: Do Arithmetic Circuits Help?
26: Towards Instance-Optimal Euclidean Spanners
27: An efficient heuristic for approximate maximum flow computations
28: Compression with wildcards: All induced metric subgraphs
29: Consistent Strong Triadic Closure in Multilayer Networks
30: A Simple 4-Approximation Algorithm for Maximum Agreement Forests on Multiple Unrooted Binary Trees
31: Vertex identification to a forest
32: Fast DCT+: A Family of Fast Transforms Based on Rank-One Updates of the Path Graph
33: Accurate and Fast Estimation of Temporal Motifs using Path Sampling
34: Revisiting Local PageRank Estimation on Undirected Graphs: Simple and Optimal
35: The Better Solution Probability Metric: Optimizing QAOA to Outperform its Warm-Start Solution