Pages that link to "Item:Q5363088"

The following pages link to Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels (Q5363088):

Displayed 16 items.

• Finding a chain graph in a bipartite permutation graph (Q284350) ‎ (← links)
• Turing kernelization for finding long paths and cycles in restricted graph classes (Q730497) ‎ (← links)
• Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs (Q896655) ‎ (← links)
• On some FPT problems without polynomial Turing compressions (Q2072079) ‎ (← links)
• Fine-grained parameterized complexity analysis of graph coloring problems (Q2112649) ‎ (← links)
• Turing kernelization for finding long paths in graph classes excluding a topological minor (Q2272596) ‎ (← links)
• Alternative parameterizations of \textsc{Metric Dimension} (Q2285127) ‎ (← links)
• Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps (Q2828236) ‎ (← links)
• Kernelization Algorithms for Packing Problems Allowing Overlaps (Q2948487) ‎ (← links)
• Arbitrary Overlap Constraints in Graph Packing Problems (Q4639933) ‎ (← links)
• Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor (Q5111882) ‎ (← links)
• Inapproximability of $H$-Transversal/Packing (Q5348212) ‎ (← links)
• Approximate Turing Kernelization for Problems Parameterized by Treewidth (Q5874531) ‎ (← links)
• Subgraph isomorphism on graph classes that exclude a substructure (Q5919029) ‎ (← links)
• Parameterised and fine-grained subgraph counting, modulo 2 (Q6130316) ‎ (← links)
• Extended MSO model checking via small vertex integrity (Q6185940) ‎ (← links)