The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601): Difference between revisions

@@ Property / arXiv ID @@
+.5857
@@ Property / arXiv ID: 1402.5857 / rank @@
+Normal rank
@@ Property / cites work @@
+Balanced Hashing, Color Coding and Approximate Counting
+Normal rank
@@ Property / cites work @@
+Balanced families of perfect hash functions and their applications
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Finding and counting given length cycles
@@ Property / cites work: Finding and counting given length cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Counting Subgraphs via Homomorphisms
@@ Property / cites work: Counting Subgraphs via Homomorphisms / 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 @@
+Weighted Counting of k-Matchings Is #W[1]-Hard
@@ Property / cites work: Weighted Counting of k-Matchings Is #W[1]-Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Analogues of Probabilistic Computation
+Normal rank
@@ Property / cites work @@
+Understanding the Complexity of Induced Subgraph Isomorphisms
+Normal rank
@@ Property / cites work @@
+Arboricity and Subgraph Listing Algorithms
@@ Property / cites work: Arboricity and Subgraph Listing Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Counting Matchings of Size k Is $\sharp$ W[1]-Hard
+Normal rank
@@ Property / cites work @@
+The complexity of counting homomorphisms seen from the other side
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability and completeness II: On completeness for W[1]
+Normal rank
@@ Property / cites work @@
+Parameterized circuit complexity and the \(W\) hierarchy
+Normal rank
@@ Property / cites work @@
+Q4521549
@@ Property / cites work: Q4521549 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded Tree-Width and CSP-Related Problems
@@ Property / cites work: Bounded Tree-Width and CSP-Related Problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of multiple-interval graph problems
+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 @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Storing a Sparse Table with             <i>0</i>             (1) Worst Case Access Time
+Normal rank
@@ Property / cites work @@
+The complexity of homomorphism and constraint satisfaction problems seen from the other side
+Normal rank
@@ Property / cites work @@
+When is the evaluation of conjunctive queries tractable?
+Normal rank
@@ Property / cites work @@
+Finding and counting vertex-colored subtrees
@@ Property / cites work: Finding and counting vertex-colored subtrees / rank @@
+Normal rank
@@ Property / cites work @@
+The parameterised complexity of counting connected subgraphs and graph motifs
+Normal rank
@@ Property / cites work @@
+Some Hard Families of Parameterized Counting Problems
+Normal rank
@@ Property / cites work @@
+Monte-Carlo algorithms for the planar multiterminal network reliability problem
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of finding subgraphs with hereditary properties.
+Normal rank
@@ Property / cites work @@
+Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning
+Normal rank
@@ Property / cites work @@
+The Parameterized Complexity of <i>k</i>-B<scp>iclique</scp>
+Normal rank
@@ Property / cites work @@
+Parameterized random complexity
@@ Property / cites work: Parameterized random complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4028099
@@ Property / cites work: Q4028099 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. V. Excluding a planar graph
@@ Property / cites work: Graph minors. V. Excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Experimental and Efficient Algorithms
@@ Property / cites work: Experimental and Efficient Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+The Spatial Complexity of Oblivious <i>k</i>-Probe Hash Functions
+Normal rank
@@ Property / cites work @@
+Recognizing small subgraphs
@@ Property / cites work: Recognizing small subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting in Sparse, Regular, and Planar Graphs
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ Property / cites work @@
+Finding, Minimizing, and Counting Weighted Subgraphs
+Normal rank
@@ Property / cites work @@
+Computational complexity of counting problems on 3-regular planar graphs
+Normal rank