121 citations · 416 across the 16 of their papers we have counts for
Showing 2017 · cs.DSShow all
2 papers · 2 filters
cs.DS2017★ 6 cited
Fine-grained reductions from approximate counting to decision
Holger Dell, John Lapinskas
In this paper, we introduce a general framework for fine-grained reductions of approximate counting problems to their decision versions. (Thus we use an oracle that decides whether…
cs.DS2017★ 81 cited
Homomorphisms Are a Good Basis for Counting Small Subgraphs
Radu Curticapean, Holger Dell, Dániel Marx
We introduce graph motif parameters, a class of graph parameters that depend only on the frequencies of constant-size induced subgraphs. Classical works by Lovász show that many in…