Author of the publication

Parameterized Counting of Trees, Forests and Matroid Bases.

, and . CSR, volume 10304 of Lecture Notes in Computer Science, page 85-98. Springer, (2017)

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

Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders., , and . CoRR, (2020)The Weisfeiler-Leman Dimension of Existential Conjunctive Queries., , and . CoRR, (2023)Counting small induced subgraphs with hereditary properties., and . STOC, page 1543-1551. ACM, (2022)The Weisfeiler-Leman Dimension of Conjunctive Queries., , and . Proc. ACM Manag. Data, 2 (2): 86 (2024)Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders., , and . ICALP, volume 198 of LIPIcs, page 108:1-108:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Counting Answers to Existential Questions., , and . ICALP, volume 132 of LIPIcs, page 113:1-113:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory., and . SODA, page 2161-2180. SIAM, (2020)Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity., , , and . CoRR, (2023)Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies., and . FOCS, page 276-285. IEEE, (2021)Counting Subgraphs in Somewhere Dense Graphs., , , and . ITCS, volume 251 of LIPIcs, page 27:1-27:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)