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

Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP., , and . Algorithmica, 81 (2): 541-556 (2019)Counting Subgraphs in Somewhere Dense Graphs., , , and . CoRR, (2022)Counting Homomorphisms to K4-minor-free Graphs, modulo 2., , , and . SODA, page 2303-2314. SIAM, (2021)Counting Small Induced Subgraphs Satisfying Monotone Properties., , and . FOCS, page 1356-1367. IEEE, (2020)The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree., , and . STOC, page 542-552. ACM, (2023)Counting Induced Subgraphs: A Topological Approach to #W1-hardness., and . IPEC, volume 115 of LIPIcs, page 24:1-24:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices.. ESA, volume 87 of LIPIcs, page 63:1-63:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations., , , and . PODS, page 315-324. ACM, (2022)Parameterized Counting of Trees, Forests and Matroid Bases., and . CSR, volume 10304 of Lecture Notes in Computer Science, page 85-98. Springer, (2017)Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity., , , and . Proc. ACM Manag. Data, 2 (2): 113 (2024)