1: Catch Me If You Can: Finding the Source of Infections in Temporal Networks
2: Dynamic Network Discovery via Infection Tracing
3: Linear Programming based Approximation to Individually Fair k-Clustering with Outliers
4: Sequential Diversification with Provable Guarantees
5: New Approximation Guarantees for The Economic Warehouse Lot Scheduling Problem
6: Deterministic Even-Cycle Detection in Broadcast CONGEST
7: New results for the detection of bicliques
8: Logarithmic Positional Partition Interval Encoding
9: Proportionally Fair Matching via Randomized Rounding
10: Regularized Dikin Walks for Sampling Truncated Logconcave Measures, Mixed Isoperimetry and Beyond Worst-Case Analysis
11: Quantum search in a dictionary based on fingerprinting-hashing
12: Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges
13: Adaptive Manipulation for Coalitions in Knockout Tournaments
14: Parallel Greedy Best-First Search with a Bound on the Number of Expansions Relative to Sequential Search
15: Witty: An Efficient Solver for Computing Minimum-Size Decision Trees
16: Approximating the Top Eigenvector in Random Order Streams
17: Cluster Editing on Cographs and Related Classes
18: Round and Communication Efficient Graph Coloring
19: Convergence of the QuickVal Residual
20: Cuckoo Heavy Keeper and the balancing act of maintaining heavy-hitters in stream processing
21: Computing crossing numbers with topological and geometric restrictions
22: Assessing fault-tolerant quantum advantage for $k$-SAT with structure
23: Stable Approximation Algorithms for Dominating Set and Independent Set
24: Differentially Private Substring and Document Counting
25: On the Robustness of Spectral Algorithms for Semirandom Stochastic Block Models
26: Fingerprinting Codes Meet Geometry: Improved Lower Bounds for Private Query Release and Adaptive Data Analysis
27: Fine-Grained Computation in 3-Space: Matrix Multiplication and Graph Problems
28: Loss Minimization for Electrical Flows over Spanning Trees on Grids
29: Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
30: Log-Time K-Means Clustering for 1D Data: Novel Approaches with Proof and Implementation
31: Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation
32: Solving the all pairs shortest path problem after minor update of a large dense graph
33: Continuous Flattening and Reversing of Convex Polyhedral Linkages
34: Tokenisation is NP-Complete
35: Rainbow Arborescence Conjecture
36: Distance Vector Domination
37: Parameterized Complexity of (d,r)-Domination via Modular Decomposition
38: Approximation Algorithms for Clustering with Minimum Sum of Radii, Diameters, and Squared Radii
39: Faster Positional-Population Counts for AVX2, AVX-512, and ASIMD
40: Chorba: A novel CRC32 implementation
41: Lower bounds for the universal TSP on the plane
42: Robust random graph matching in dense graphs via vector approximate message passing
43: Fast Biclique Counting on Bipartite Graphs: A Node Pivot-based Approach
44: Carbonyl4: A Sketch for Set-Increment Mixed Updates