Title	Publication Date	Language	Citations
Special Section on the Fifty-First Annual ACM Sympositum on the Theory of Computing (STOC 2019)	2023/04/27	English
Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg–Rao	2023/04/26	English
Four-Coloring \(\boldsymbol{P_6}\)-Free Graphs. II. Finding an Excellent Precoloring	2024/02/28	English
Clustering Mixtures with Almost Optimal Separation in Polynomial Time	2024/02/22	English
Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs	2024/02/21	English
Rigid Matrices from Rectangular PCPs	2024/04/03	English
Online List Labeling: Breaking the \({\log^2 n}\) Barrier	2024/04/11	English
Almost Optimal SuperConstant-Pass Streaming Lower Bounds for Reachability	2024/04/09	English
Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\)	2023/12/15	English
Special Section on the Fifty-Ninth Annual IEEE Symposium on Foundations of Computer Science (2018)	2023/12/14	English
Parameterized Complexity of Untangling Knots	2024/03/21	English
Fast Metric Embedding into the Hamming Cube	2024/03/14	English
Reachability Preservers: New Extremal Bounds and Approximation Algorithms	2024/03/13	English
Counting Small Induced Subgraphs with Hereditary Properties	2024/03/12	English
Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions	2024/03/13	English
Fixed-Parameter Algorithms for the Kneser and Schrijver Problems	2024/03/13	English
Sharp Thresholds in Random Simple Temporal Graphs	2024/03/19	English
Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings	2024/03/19	English
Rounds vs. Communication Tradeoffs for Maximal Independent Sets	2024/03/25	English
Tree-Depth and the Formula Complexity of Subgraph Isomorphism	2023/02/28	English
Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction	2023/02/28	English
A Strong Version of Cobham’s Theorem	2024/01/17	English
The Approximation Ratio of the k-Opt Heuristic for the Euclidean Traveling Salesman Problem	2023/07/20	English
Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\) -Approximation for Submodular Maximization over a Matroid	2023/07/27	English
A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization and Matroid Intersection	2023/02/07	English
Competitively Chasing Convex Bodies	2023/02/07	English
Sublinear Time Approximation of the Cost of a Metric \({k}\)-Nearest Neighbor Graph	2024/04/17	English
Average Sensitivity of Graph Algorithms	2023/08/14	English
Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture	2023/08/10	English
A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games	2023/09/12	English