| No. |
Title |
Author |
Year |
| 1 |
Determinants from Homomorphisms |
Curticapean, Radu |
2022 |
| 2 |
On the VNP-Hardness of Some Monomial Symmetric Polynomials |
Curticapean, Radu et al. |
2022 |
| 3 |
Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths |
Curticapean, Radu et al. |
2021 |
| 4 |
Counting Problems in Parameterized Complexity |
Curticapean, Radu |
2019 |
| 5 |
Parameterized Streaming Algorithms for Min-Ones d-SAT |
Agrawal, Akanksha et al. |
2019 |
| 6 |
A Fixed-Parameter Perspective on #BIS |
Curticapean, Radu et al. |
2018 |
| 7 |
Counting Edge-Injective Homomorphisms and Matchings on Restricted Graph Classes |
Curticapean, Radu et al. |
2017 |
| 8 |
Finding Detours is Fixed-Parameter Tractable |
Bezáková, Ivona et al. |
2017 |
| 9 |
Counting Matchings with k Unmatched Vertices in Planar Graphs |
Curticapean, Radu |
2016 |
| 10 |
Parity Separation: A Scientifically Proven Method for Permanent Weight Loss |
Curticapean, Radu |
2016 |
