Radu Curticapean

most citedComplexity of counting subgraphs: only the boundedness of the vertex-cover number counts

11 citations · 17 across the 2 of their papers we have counts for

collaborators

Showing 2014Show all

2 papers · 1 filter

cs.CC2014★ 11 cited

Complexity of counting subgraphs: only the boundedness of the vertex-cover number counts

Radu Curticapean, Dániel Marx

For a class $H$ of graphs, #Sub $(H)$ is the counting problem that, given a graph $H \in H$ and an arbitrary graph $G$ , asks for the number of subgraphs…

cs.DS2014★ 6 cited

Counting perfect matchings in graphs that exclude a single-crossing minor

Radu Curticapean

A graph $H$ is single-crossing if it can be drawn in the plane with at most one crossing. For any single-crossing graph $H$ , we give an $O (n^{4})$ time algorithm for counting perfect…