Pages that link to "Item:Q5363087"

The following pages link to The Parameterized Complexity of <i>k</i>-B<scp>iclique</scp> (Q5363087):

Displaying 15 items.

• Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
• The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601) (← links)
• FPT algorithms for domination in sparse graphs and beyond (Q1740694) (← links)
• The parameterized space complexity of embedding along a path (Q2408562) (← links)
• Scale reduction techniques for computing maximum induced bicliques (Q2633172) (← links)
• On the kernelization of split graph problems (Q2636501) (← links)
• Parameterized Dynamic Variants of Red-Blue Dominating Set (Q3297772) (← links)
• The Constant Inapproximability of the Parameterized Dominating Set Problem (Q4634028) (← links)
• On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390) (← links)
• (Q5091192) (← links)
• A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem (Q5091240) (← links)
• Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices (Q5111752) (← links)
• From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
• Assessing the Computational Complexity of Multi-layer Subgraph Detection (Q5283362) (← links)
• Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs (Q6657247) (← links)