0 citations0 referencesGoogle Scholardoi.orgParameterized counting problemsAnnals of Pure and Applied Logic·2005·Vol. 138(1-3), pp. 147–182Citations Over TimeTop 24% of 2005 papersCatherine McCartinRelated Papers→ On the computational hardness based on linear FPT-reductions(2006)32 cited→ Counting Problems in Parameterized Complexity(2019)8 cited→ Parameterized Counting Problems(2002)7 cited→ The simple, little and slow things count : on parameterized counting complexity(2015)20 cited