1: On The Maximum Linear Arrangement Problem for Trees
2: Optimal Multi-Pass Lower Bounds for MST in Dynamic Streams
3: Geometric Thickness of Multigraphs is $\exists \mathbb{R}$-complete
4: Scheduling Splittable Jobs on Configurable Machines
5: C(star): A New Bounding Approach for the Moving-Target Traveling Salesman Problem
6: Distinct Shortest Walk Enumeration for RPQs
7: Set-valued recursions arising from vantage-point trees
8: Fault tree reliability analysis via squarefree polynomials
9: A symbolic-arithmetic for teaching double-black node removal in red-black trees
10: Mean estimation in the add-remove model of differential privacy
11: The Complexity of Envy-Free Graph Cutting
12: The Computational Complexity of Concise Hypersphere Classification
13: Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous
14: The Parameterized Complexity of Coordinated Motion Planning
15: Top-Down Drawings of Compound Graphs
16: Finding a Cluster in Incomplete Data
17: Maximizing Social Welfare in Score-Based Social Distance Games
18: A Structural Complexity Analysis of Synchronous Dynamical Systems
19: Algorithms and Complexity for Congested Assignments
20: Improved Frequency Estimation Algorithms with and without Predictions
21: Approximation algorithms for k-median problems on complex networks: theory and practice
22: Near-Optimal Differentially Private k-Core Decomposition
23: Approximate Fully Dynamic Directed Densest Subgraph
24: Treewidth is Polynomial in Maximum Degree on Graphs Excluding a Planar Induced Minor
25: Machine Learning for the Multi-Dimensional Bin Packing Problem: Literature Review and Empirical Evaluation
26: Combinatorial Stationary Prophet Inequalities
27: Connectivity Oracles for Predictable Vertex Failures
28: Covering Rectilinear Polygons with Area-Weighted Rectangles
29: On the complexity of list $\mathcal H$-packing for sparse graph classes
30: Approximate Integer Solution Counts over Linear Arithmetic Constraints
31: Fast sampling from constrained spaces using the Metropolis-adjusted Mirror Langevin algorithm
32: Complexity of Digital Quantum Simulation in the Low-Energy Subspace: Applications and a Lower Bound
33: Solving Dense Linear Systems Faster Than via Preconditioning
34: Matching Noisy Keys for Obfuscation
35: Decremental Matching in General Weighted Graphs