Author of the publication

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

FPT Approximation Using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set., and . ISAAC, volume 283 of LIPIcs, page 19:1-19:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)The Parameterized Complexity of k-Biclique.. SODA, page 605-615. SIAM, (2015)A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem.. ICALP, volume 132 of LIPIcs, page 81:1-81:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Constant approximating k-clique is w1-hard.. STOC, page 1749-1756. ACM, (2021)On Lower Bounds of Approximating Parameterized k-Clique., , , and . ICALP, volume 229 of LIPIcs, page 90:1-90:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)The Constant Inapproximability of the Parameterized Dominating Set Problem., and . SIAM J. Comput., 48 (2): 513-533 (2019)Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH., , , , and . Electron. Colloquium Comput. Complex., (2024)Parameterized Intractability of Even Set and Shortest Vector Problem., , , , , , , and . Electron. Colloquium Comput. Complex., (2019)The Parameterized Complexity of the k-Biclique Problem.. J. ACM, 65 (5): 34:1-34:23 (2018)Improved Hardness of Approximating k-Clique under ETH., , , and . FOCS, page 285-306. IEEE, (2023)