1: Interlacing Polynomial Method for the Column Subset Selection Problem
2: Logarithmic Weisfeiler–Leman and Treewidth
3: Parameterised Approximation of the Fixation Probability of the Dominant Mutation in the Multi-Type Moran Process
4: A 2-opt Algorithm for Locally Optimal Set Partition Optimization
5: Combinatorial Designs Meet Hypercliques: Higher Lower Bounds for Klee’s Measure Problem and Related Problems in Dimensions $d\ge 4$
6: Online Bipartite Matching in the Probe-Commit Model
7: Shortest Paths in Portalgons
8: Optimal Intervention on Weighted Networks via Edge Centrality
9: Addressing bias in online selection with limited budget of comparisons
10: Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set
11: Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring
12: High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations
13: Neighborhood Averaging for Improving Outlier Detectors
14: Connectivity with uncertainty regions given as line segments
15: A Comparison of Dijkstra’s Algorithm Using Fibonacci Heaps, Binary Heaps, and Self-Balancing Binary Trees
16: Explorable families of graphs
17: Metric dimension parameterized by treewidth in chordal graphs
18: Extending a triangulation from the 2-sphere to the 3-ball
19: Sparse Partial-Tracing
20: An Improved Exact Algorithm for Knot-Free Vertex Deletion
21: On the Maximal Independent Sets of $k$-mers with the Edit Distance
22: Differentially Private Algorithms for Synthetic Power System Datasets
23: Randomized Rumor Spreading Revisited (Long Version)
24: Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source
25: Optimal Fully Dynamic $k$-Center Clustering for Adaptive and Oblivious Adversaries
26: High Probability Bounds for Stochastic Continuous Submodular Maximization