1: Representing and Reasoning about Dynamic Code
2: The Distribution Function of the Longest Path Length in Constant Treewidth DAGs with Random Edge Length
3: Shortest Feasible Paths with Charging Stops for Battery Electric Vehicles
4: Multilevel Combinatorial Optimization Across Quantum Architectures
5: Tractable Minor-free Generalization of Planar Zero-field Ising Models
6: Simultaneous FPQ-Ordering and Hybrid Planarity Testing
7: Sequential metric dimension for random graphs
8: Maintenance scheduling in a railway corricdor
9: Vertex Sparsifiers for c-Edge Connectivity
10: Parameterized Coloring Problems on Threshold Graphs
11: Analyzing Trade-offs in Reversible Linear and Binary Search Algorithms
12: A story of diameter, radius and Helly property
13: Faster p-norm minimizing flows, via smoothed q-norm problems
14: Neural Execution of Graph Algorithms
15: Resolution of the Burrows-Wheeler Transform Conjecture
16: Mimicking Networks Parameterized by Connectivity
17: Scaling Betweenness Approximation to Billions of Edges by MPI-based Adaptive Sampling
18: Cutting an alignment with Ockham’s razor
19: Communication-Efficient (Weighted) Reservoir Sampling from Fully Distributed Data Streams
20: NC Algorithms for Popular Matchings in One-Sided Preference Systems and Related Problems
21: Manipulating Node Similarity Measures in Networks
22: Non-Rectangular Convolutions and (Sub-)Cadences with Three Elements
23: A Curious Link Between Prime Numbers, the Maundy Cake Problem and Parallel Sorting
24: Improved Approximation for Maximum Edge Colouring Problem
25: Overlay Indexes: Efficiently Supporting Aggregate Range Queries and Authenticated Data Structures in Off-the-Shelf Databases
26: Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
27: Tight Running Time Lower Bounds for Strong Inapproximability of Maximum $k$-Coverage, Unique Set Cover and Related Problems (via $t$-Wise Agreement Testing Theorem)
28: Equivalence of Systematic Linear Data Structures and Matrix Rigidity
29: A Deterministic Linear Program Solver in Current Matrix Multiplication Time
30: Selection on $X_1+X_2+\cdots + X_m$ with layer-ordered heaps
31: Facility Location Problem in Differential Privacy Model Revisited
32: Near-Optimal Bounds for Online Caching with Machine Learned Advice
33: Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs
34: Cilkmem: Algorithms for Analyzing the Memory High-Water Mark of Fork-Join Parallel Programs
35: Towards a theory of non-commutative optimization: geodesic first and second order methods for moment maps and polytopes
36: Locality-Sensitive Hashing for f-Divergences: Mutual Information Loss and Beyond
37: Same-Cluster Querying for Overlapping Clusters
38: A Fast and Tight Heuristic for A(star) in Road Networks
39: Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks