Items where Author is "Curticapean, Radu"
 | Up a level |
Number of items: 7.
2014
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 2014 | Curticapean, Radu and Marx, Dániel Complexity of counting subgraphs: Only the boundedness of the vertex-cover number counts | Book Section |
2016
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 2016 | Curticapean, Radu Counting Matchings with k Unmatched Vertices in Planar Graphs | Book Section | |
| 2016 | Curticapean, Radu Parity Separation: A Scientifically Proven Method for Permanent Weight Loss | Book Section | |
| 2016 | Curticapean, Radu and Marx, Dániel Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus |  | Book Section |
2017
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 2017 | Curticapean, Radu and Dell, H and Roth, M Counting edge-injective homomorphisms and matchings on restricted graph classes | Book Section | |
| 2017 | Bezáková, I and Curticapean, Radu and Dell, H and Fomin, FV Finding detours is fixed-parameter tractable | Book Section | |
| 2017 | Curticapean, Radu and Dell, H and Marx, Dániel Homomorphisms are a good basis for counting small subgraphs | Book Section |
