1: An Algorithmic Approach to Finding Degree-Doubling Nodes in Oriented Graphs
2: On the Parameterized Complexity of Controlling Amendment and Successive Winners
3: Differentially Private Matchings
4: Twin-width one
5: Submodular Maximization Subject to Uniform and Partition Matroids: From Theory to Practical Applications and Distributed Solutions
6: A fast algorithm for the Frobenius problem in three variables
7: Beyond Non-Degeneracy: Revisiting Certainty Equivalent Heuristic for Online Linear Programming
8: John Ellipsoids via Lazy Updates
9: Locally computing edge orientations
10: An Optimal Algorithm for Half-plane Hitting Set
11: Optimal Bounds for Open Addressing Without Reordering
12: Efficient $d$-ary Cuckoo Hashing at High Load Factors by Bubbling Up
13: Chameleon2++: An Efficient Chameleon2 Clustering with Approximate Nearest Neighbors
14: Local Enumeration: The Not-All-Equal Case
15: A Faster Algorithm for Constrained Correlation Clustering
16: On the non-submodularity of the problem of adding links to minimize the effective graph resistance
17: A Simple and Combinatorial Approach to Proving Chernoff Bounds and Their Generalizations
18: On the Locality of Hall’s Theorem
19: Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering
20: On Beating $2^n$ for the Closest Vector Problem
21: Young domination on Hamming rectangles