Pages that link to "Item:Q2343083"

The following pages link to A completeness theory for polynomial (Turing) kernelization (Q2343083):

Displaying 21 items.

• Turing kernelization for finding long paths and cycles in restricted graph classes (Q730497) (← links)
• On the approximate compressibility of connected vertex cover (Q2006945) (← links)
• On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
• A polynomial kernel for bipartite permutation vertex deletion (Q2093571) (← links)
• Turing kernelization for finding long paths in graph classes excluding a topological minor (Q2272596) (← links)
• Alternative parameterizations of \textsc{Metric Dimension} (Q2285127) (← links)
• On kernelization and approximation for the vector connectivity problem (Q2408198) (← links)
• A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion (Q2662677) (← links)
• Preprocessing to reduce the search space: antler structures for feedback vertex set (Q2672419) (← links)
• Circumventing connectivity for kernelization (Q2692730) (← links)
• Kernelization of Cycle Packing with Relaxed Disjointness Constraints (Q3174716) (← links)
• Hans Bodlaender and the Theory of Kernelization Lower Bounds (Q5042447) (← links)
• (Q5075825) (← links)
• Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments (Q5084628) (← links)
• Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor (Q5111882) (← links)
• Approximate Turing Kernelization for Problems Parameterized by Treewidth (Q5874531) (← links)
• Parameterized certificate dispersal and its variants (Q5964075) (← links)
• Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem (Q6068532) (← links)
• On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)
• Preprocessing to reduce the search space: antler structures for feedback vertex set (Q6564613) (← links)
• Polynomial Turing compressions for some graph problems parameterized by modular-width (Q6591463) (← links)