Pages that link to "Item:Q4651498"

The following pages link to The Parameterized Complexity of Counting Problems (Q4651498):

Displaying 50 items.

• Tractable counting of the answers to conjunctive queries (Q389242) (← links)
• The complexity of weighted counting for acyclic conjunctive queries (Q395018) (← links)
• Faster algorithms for finding and counting subgraphs (Q439930) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• Cycle-maximal triangle-free graphs (Q472981) (← links)
• The parameterized complexity of \(k\)-edge induced subgraphs (Q729817) (← links)
• Counting induced subgraphs: a topological approach to \#W[1]-hardness (Q786040) (← links)
• Counting induced subgraphs: an algebraic approach to \(\#\)W[1]-hardness (Q832520) (← links)
• The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601) (← links)
• Efficient algorithms for counting parameterized list \(H\)-colorings (Q931733) (← links)
• Counting the number of independent sets in chordal graphs (Q935840) (← links)
• The parameterized complexity of probability amplification (Q975525) (← links)
• Parameterized approximation of dominating set problems (Q975529) (← links)
• On counting 3-D matchings of size \(k\) (Q1040648) (← links)
• The union of minimal hitting sets: parameterized combinatorial bounds and counting (Q1044023) (← links)
• Sublinear-time algorithms for counting star subgraphs via edge sampling (Q1709591) (← links)
• The complexity of Bayesian networks specified by propositional and relational languages (Q1711881) (← links)
• Randomised enumeration of small witnesses using a decision oracle (Q1725640) (← links)
• Counting linear extensions: parameterizations by treewidth (Q1739113) (← links)
• Computing the number of induced copies of a fixed graph in a bounded degree graph (Q1741847) (← links)
• On the complexity of finding and counting solution-free sets of integers (Q1752464) (← links)
• Parameterized random complexity (Q1946497) (← links)
• Finding and counting vertex-colored subtrees (Q1949738) (← links)
• Tridiagonalization of systems of coupled linear differential equations with variable coefficients by a Lanczos-like method (Q2029827) (← links)
• Parameterized counting of partially injective homomorphisms (Q2032353) (← links)
• The complexity of finding optimal subgraphs to represent spatial correlation (Q2149864) (← links)
• From the \(W\)-hierarchy to XNLP. Classes of fixed parameter intractability (Q2154075) (← links)
• The parameterised complexity of counting connected subgraphs and graph motifs (Q2256721) (← links)
• Dichotomy results for fixed point counting in Boolean dynamical systems (Q2257296) (← links)
• A fixed-parameter perspective on \#BIS (Q2272593) (← links)
• Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity (Q2289006) (← links)
• Refining invariants for computing autotopism groups of partial Latin rectangles (Q2305926) (← links)
• Counting edge-injective homomorphisms and matchings on restricted graph classes (Q2321927) (← links)
• A general purpose algorithm for counting simple cycles and simple paths of any length (Q2415361) (← links)
• Solving \#SAT using vertex covers (Q2464035) (← links)
• The parameterized complexity of maximality and minimality problems (Q2470035) (← links)
• Parameterized counting matching and packing: a family of hard problems that admit FPTRAS (Q2636502) (← links)
• Graph operations and neighborhood polynomials (Q2656325) (← links)
• A Lanczos-like method for non-autonomous linear ordinary differential equations (Q2701202) (← links)
• Some Hard Families of Parameterized Counting Problems (Q2832302) (← links)
• What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
• Balanced Hashing, Color Coding and Approximate Counting (Q3656847) (← links)
• On Counting Parameterized Matching and Packing (Q4632178) (← links)
• (Q4633029) (← links)
• (Q5009461) (← links)
• (Q5009487) (← links)
• Counting short cycles of (c,d)-regular bipartite graphs (Q5013469) (← links)
• Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2 (Q5013574) (← links)
• Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
• Counting Small Induced Subgraphs Satisfying Monotone Properties (Q5071087) (← links)