Author of the publication

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs.

, , , , , , and . SODA, page 3664-3683. SIAM, (2023)

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

Computing Generalized Convolutions Faster Than Brute Force., , , , and . Algorithmica, 86 (1): 334-366 (January 2024)Anti-Factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)., , and . CoRR, (2021)Computing Generalized Convolutions Faster Than Brute Force., , , , and . IPEC, volume 249 of LIPIcs, page 12:1-12:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs., , , , , , and . SODA, page 3664-3683. SIAM, (2023)Subcubic certificates for CFL reachability., , and . Proc. ACM Program. Lang., 6 (POPL): 1-29 (2022)Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth., , and . ICALP, volume 198 of LIPIcs, page 95:1-95:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Parameterized Complexity of Weighted Multicut in Trees., , , , and . WG, volume 13453 of Lecture Notes in Computer Science, page 257-270. Springer, (2022)Hitting Meets Packing: How Hard Can it Be?, , , , , , and . CoRR, (2024)Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results., , , , , , and . CoRR, (2023)Anti-Factor Is FPT Parameterized by Treewidth and List Size (But Counting Is Hard)., , and . IPEC, volume 249 of LIPIcs, page 22:1-22:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)