Author of the publication

Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond.

, , , and . STOC, page 1487-1500. ACM, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Multivariate Analysis of Orthogonal Range Searching and Graph Distances., , and . IPEC, volume 115 of LIPIcs, page 4:1-4:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)The Time Complexity of Fully Sparse Matrix Multiplication., , , and . SODA, page 4670-4703. SIAM, (2024)Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution., , and . SODA, page 3069-3090. SIAM, (2022)Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max., , and . STOC, page 943-954. ACM, (2019)A Fine-Grained Analogue of Schaefer's Theorem in P: Dichotomy of Exists^k-Forall-Quantified First-Order Graph Properties., , and . CCC, volume 137 of LIPIcs, page 31:1-31:27. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Faster Minimization of Tardy Processing Time on a Single Machine., , , , and . ICALP, volume 168 of LIPIcs, page 19:1-19:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)A Fine-grained Classification of Subquadratic Patterns for Subgraph Listing and Friends., and . CoRR, (2024)Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond., , , and . STOC, page 1487-1500. ACM, (2022)Approximating Subset Sum Ratio faster than Subset Sum.. SODA, page 1260-1277. SIAM, (2024)Impossibility Results for Grammar-Compressed Linear Algebra., , , and . NeurIPS, (2020)