Author of the publication

Counting Triangulations and Other Crossing-Free Structures via Onion Layers.

, , , and . Discret. Comput. Geom., 53 (4): 675-690 (2015)

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

A Fixed-Parameter Perspective on #BIS., , , , and . Algorithmica, 81 (10): 3844-3864 (2019)Counting Problems in Parameterized Complexity.. IPEC, volume 115 of LIPIcs, page 1:1-1:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Count on CFI graphs for #P-hardness.. SODA, page 1854-1871. SIAM, (2024)Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths., , and . ESA, volume 204 of LIPIcs, page 34:1-34:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Counting Triangulations and Other Crossing-Free Structures via Onion Layers., , , and . Discret. Comput. Geom., 53 (4): 675-690 (2015)Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes., , and . Theory Comput. Syst., 63 (5): 987-1026 (2019)Count on CFI graphs for #P-hardness.. CoRR, (2023)On the VNP-Hardness of Some Monomial Symmetric Polynomials., , and . FSTTCS, volume 250 of LIPIcs, page 16:1-16:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Parameterizing the Permanent: Hardness for K8-minor-free graphs., and . CoRR, (2021)Determinants from Homomorphisms.. ESA, volume 244 of LIPIcs, page 38:1-38:7. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)