1: Induced Matching below Guarantees: Average Paves the Way for Fixed-Parameter Tractability
2: Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules
3: Lecture Notes on Quantum Algorithms
4: Graph Searching with Predictions
5: Constant Approximation for Normalized Modularity and Associations Clustering
6: On Learning the Structure of Clusters in Graphs
7: Quantum Mass Production Theorems
8: $(1-\epsilon)$-Approximate Maximum Weighted Matching in Distributed, Parallel, and Semi-Streaming Settings
9: A quasi-quadratic vertex Kernel for Cograph edge editing
10: Deterministic counting Lov'{a}sz local lemma beyond linear programming
11: Depth-First Search performance in a random digraph with geometric outdegree distribution
12: Matrix Multiplication: Verifying Strong Uniquely Solvable Puzzles
13: Targeted k-node Collapse Problem: Towards Understanding the Robustness of Local k-core Structure