81 citations · 134 across the 18 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.CC2016★ 1 cited
Counting matchings with k unmatched vertices in planar graphs
Radu Curticapean
We consider the problem of counting matchings in planar graphs. While perfect matchings in planar graphs can be counted by a classical polynomial-time algorithm, the problem of cou…
cs.DS2016★ 27 cited
Finding Detours is Fixed-parameter Tractable
Ivona Bezáková, Radu Curticapean, Holger Dell +1
We consider the following natural "above guarantee" parameterization of the classical Longest Path problem: For given vertices s and t of a graph G, and an integer k, the problem L…