Pages that link to "Item:Q521799"

The following pages link to A polynomial Turing-kernel for weighted independent set in bull-free graphs (Q521799):

Displaying 15 items.

• Parameterized complexity of independent set in H-free graphs (Q786045) (← links)
• Improved FPT algorithms for weighted independent set in bull-free graphs (Q1685998) (← links)
• Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← links)
• On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
• A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number (Q2101164) (← links)
• Turing kernelization for finding long paths in graph classes excluding a topological minor (Q2272596) (← links)
• Alternative parameterizations of \textsc{Metric Dimension} (Q2285127) (← links)
• Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case (Q2363699) (← links)
• Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
• Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs (Q2817880) (← links)
• Improved FPT Algorithms for Weighted Independent Set in Bull-Free Graphs (Q2946027) (← links)
• The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs (Q3181049) (← links)
• Parameterized Complexity of Independent Set in H-Free Graphs. (Q5009479) (← links)
• Approximate Turing Kernelization for Problems Parameterized by Treewidth (Q5874531) (← links)
• Polynomial Turing compressions for some graph problems parameterized by modular-width (Q6591463) (← links)