Research output per year
Research output per year
Search results
-
2024
Count on CFI graphs for #P-hardness
Curticapean, R.-C., 2024, Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024. Society for Industrial and Applied Mathematics, p. 1854 - 1871Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open AccessFile -
2022
Determinants from Homomorphisms
Curticapean, R.-C., 2022, 30th Annual European Symposium on Algorithms (ESA 2022). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 38Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open Access -
On the VNP-Hardness of Some Monomial Symmetric Polynomials
Curticapean, R.-C., Limaye, N. & Srinivasan, S., 14 Dec 2022, 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Vol. 250.Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open Access -
Parameterizing the permanent: Hardness for fixed excluded minors
Curticapean, R.-C. & Xia, M., 2022, Symposium on Simplicity in Algorithms (SOSA). Society for Industrial and Applied Mathematics, p. 297-307Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open AccessFile -
2021
A full complexity dichotomy for immanant families
Curticapean, R.-C., 15 Jun 2021, Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, p. 1770 14 p.Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open AccessFile -
Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths
Curticapean, R.-C., Dell, H. & Husfeldt, T., 2021, Proceedings of the 29th Annual European Symposium on Algorithms. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Vol. 204. 17 p. 34Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open AccessFile -
2019
Parameterized Streaming Algorithms for Min-Ones d-SAT
Agrawal, A., Biswas, A., Bonnet, É., Brettell, N., Curticapean, R.-C., Marx, D., Miltzow, T., Raman, V. & Saurabh, S., 2019, 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, p. 8:1-8:20 20 p. (Leibniz International Proceedings in Informatics (LIPIcs)).Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open AccessFile -
The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms
Chen, H., Curticapean, R.-C. & Dell, H., 2019, Graph-Theoretic Concepts in Computer Science: 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019, Revised Papers. Springer, p. 364-378 (Lecture Notes in Computer Science, Vol. 11789).Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open AccessFile