On Counting Parameterized Matching and Packing (Q4632178): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-39817-4_13
+Normal rank
@@ Property / OpenAlex ID @@
+W2493989425
@@ Property / OpenAlex ID: W2493989425 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4427867
@@ Property / cites work: Q4427867 / rank @@
+Normal rank
@@ Property / cites work @@
+Counting Paths and Packings in Halves
@@ Property / cites work: Counting Paths and Packings in Halves / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934608
@@ Property / cites work: Q2934608 / rank @@
+Normal rank
@@ Property / cites work @@
+Counting Matchings of Size k Is $\sharp$ W[1]-Hard
+Normal rank
@@ Property / cites work @@
+The Parameterized Complexity of Counting Problems
@@ Property / cites work: The Parameterized Complexity of Counting Problems / rank @@
+Normal rank
@@ Property / cites work @@
+The parameterised complexity of counting connected subgraphs and graph motifs
+Normal rank
@@ Property / cites work @@
+Monte-Carlo approximation algorithms for enumeration problems
+Normal rank
@@ Property / cites work @@
+Limits and Applications of Group Algebras for Parameterized Problems
+Normal rank
@@ Property / cites work @@
+On counting 3-D matchings of size \(k\)
@@ Property / cites work: On counting 3-D matchings of size \(k\) / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized and Exact Computation
@@ Property / cites work: Parameterized and Exact Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized counting problems
@@ Property / cites work: Parameterized counting problems / rank @@
+Normal rank
@@ Property / cites work @@
+The challenges of unbounded treewidth in parameterised subgraph counting problems
+Normal rank
@@ Property / cites work @@
+Exact Parameterized Multilinear Monomial Counting via k-Layer Subset Convolution and k-Disjoint Sum
+Normal rank