81 citations · 134 across the 18 of their papers we have counts for
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 of graphs, #Sub is the counting problem that, given a graph and an arbitrary graph , 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 is single-crossing if it can be drawn in the plane with at most one crossing. For any single-crossing graph , we give an time algorithm for counting perfect…