Some hard families of parameterised counting problems

Mark Jerrum, Kitty Meeks

Type: Preprint

Publication Date: 2013-10-24

Citations: 1

Locations

arXiv (Cornell University) - View

Similar Works

Action	Title	Year	Authors
+	Some hard families of parameterised counting problems	2013	Mark Jerrum Kitty Meeks
+	Some hard classes of parameterised counting problems.	2013	Mark Jerrum Kitty Meeks
+ PDF Chat	Some Hard Families of Parameterized Counting Problems	2015	Mark Jerrum Kitty Meeks
+	The Parameterised Complexity of Counting Connected Subgraphs and Graph Motifs	2013	Mark Jerrum Kitty Meeks
+	The Parameterised Complexity of Counting Connected Subgraphs and Graph Motifs	2013	Mark Jerrum Kitty Meeks
+	The challenges of unbounded treewidth in parameterised subgraph counting problems	2014	Kitty Meeks
+	The challenges of unbounded treewidth in parameterised subgraph counting problems	2015	Kitty Meeks
+	The challenges of unbounded treewidth in parameterised subgraph counting problems	2014	Kitty Meeks
+	The parameterised complexity of counting connected subgraphs and graph motifs	2014	Mark Jerrum Kitty Meeks
+ PDF Chat	The parameterised complexity of counting even and odd induced subgraphs	2016	Mark Jerrum Kitty Meeks
+	The parameterised complexity of counting even and odd induced subgraphs	2014	Mark Jerrum Kitty Meeks
+	The parameterised complexity of counting even and odd induced subgraphs	2014	Mark Jerrum Kitty Meeks
+	The Parameterised Complexity of Counting Connected Subgraphs.	2013	Mark Jerrum Kitty Meeks
+	Weighted Counting of k-Matchings Is #W[1]-Hard	2012	Markus Bläser Radu Curticapean
+	Counting Problems in Parameterized Complexity.	2019	Radu Curticapean
+ PDF Chat	From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs	2024	Simon Döring Dániel Marx Philip Wellnitz
+	Counting Matchings of Size k Is $\sharp$ W[1]-Hard	2013	Radu Curticapean
+	The Parameterized Complexity of Counting Problems	2004	Jörg Flum Martin Grohe
+	On the Parameterised Complexity of Induced Multipartite Graph Parameters	2020	Ryan L. Mann Luke Mathieson Catherine Greenhill
+	Parameterized Algorithms for Graph Partitioning Problems	2014	Hadas Shachnai Meirav Zehavi

Works That Cite This (1)

Action	Title	Year	Authors
+	The parameterised complexity of counting connected subgraphs and graph motifs	2014	Mark Jerrum Kitty Meeks

Works Cited by This (7)

Action	Title	Year	Authors
+ PDF Chat	A Combinatorial Problem in Geometry	2009	P. Erdős G. Szckeres
+	Approximation Algorithms for Some Parameterized Counting Problems	2002	V. Arvind Venkatesh Raman
+	The Parameterised Complexity of Counting Connected Subgraphs and Graph Motifs	2013	Mark Jerrum Kitty Meeks
+	The complexity of counting homomorphisms seen from the other side	2004	Víctor Dalmau Peter Jönsson
+	The Parameterized Complexity of Counting Problems	2004	Jörg Flum Martin Grohe
+	Complexity of counting subgraphs: only the boundedness of the vertex-cover number counts	2014	Radu Curticapean Dániel Marx
+ PDF Chat	The Parameterized Complexity of k-Edge Induced Subgraphs	2012	Bingkai Lin Yijia Chen