Author of the publication

Graph pattern detection: hardness for all induced patterns and faster non-induced cycles.

, , and . STOC, page 1167-1178. ACM, (2019)

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

Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made., , , and . STOC, page 375-388. ACM, (2016)Fast approximation algorithms for the diameter and radius of sparse graphs., and . STOC, page 515-524. ACM, (2013)Towards Optimal Set-Disjointness and Set-Intersection Data Structures., and . ICALP, volume 168 of LIPIcs, page 74:1-74:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On Diameter Approximation in Directed Graphs., , , and . ESA, volume 274 of LIPIcs, page 2:1-2:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Approximating Min-Diameter: Standard and Bichromatic., , and . ESA, volume 274 of LIPIcs, page 17:1-17:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Algorithms and Hardness for Diameter in Dynamic Graphs., , , , and . ICALP, volume 132 of LIPIcs, page 13:1-13:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Who Can Win a Single-Elimination Tournament?, , and . AAAI, page 516-522. AAAI Press, (2016)Fixing a Tournament.. AAAI, page 895-900. AAAI Press, (2010)Fine-grained Algorithms and Complexity.. ICDT, volume 98 of LIPIcs, page 1:1-1:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Metatheorems for Dynamic Weighted Matching., and . ITCS, volume 67 of LIPIcs, page 58:1-58:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)