Pages that link to "Item:Q3189081"

The following pages link to Kernel(s) for problems with no kernel (Q3189081):

Displaying 23 items.

• Parameterized algorithms for non-separating trees and branchings in digraphs (Q334949) (← links)
• A \(9k\) kernel for nonseparating independent set in planar graphs (Q385964) (← links)
• Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
• Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
• A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269) (← links)
• Turing kernelization for finding long paths and cycles in restricted graph classes (Q730497) (← links)
• On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
• Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds (Q2093577) (← links)
• Reoptimization of parameterized problems (Q2170282) (← links)
• Turing kernelization for finding long paths in graph classes excluding a topological minor (Q2272596) (← links)
• A completeness theory for polynomial (Turing) kernelization (Q2343083) (← links)
• A linear-time kernelization for the rooted \(k\)-leaf outbranching problem (Q2354724) (← links)
• An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
• Linear kernels for outbranching problems in sparse digraphs (Q2408200) (← links)
• A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion (Q2662677) (← links)
• How heavy independent sets help to find arborescences with many leaves in DAGs (Q2698292) (← links)
• Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems (Q2839214) (← links)
• Basic Terminology, Notation and Results (Q3120433) (← links)
• Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor (Q5111882) (← links)
• Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses (Q5501928) (← links)
• Approximate Turing Kernelization for Problems Parameterized by Treewidth (Q5874531) (← links)
• Parameterized certificate dispersal and its variants (Q5964075) (← links)
• Leafy spanning arborescences in DAGs (Q5970768) (← links)