Pages that link to "Item:Q392032"

The following pages link to Kernel bounds for path and cycle problems (Q392032):

Displaying 17 items.

• Turing kernelization for finding long paths and cycles in restricted graph classes (Q730497) (← links)
• Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number (Q1752485) (← links)
• Independent-set reconfiguration thresholds of hereditary graph classes (Q1801058) (← links)
• On the complexity of approximately matching a string to a directed graph (Q2084771) (← links)
• A completeness theory for polynomial (Turing) kernelization (Q2343083) (← links)
• Sparsification upper and lower bounds for graph problems and not-all-equal SAT (Q2408194) (← links)
• Tractability, hardness, and kernelization lower bound for and/or graph solution (Q2410230) (← links)
• Meta-kernelization using well-structured modulators (Q2413976) (← links)
• Solving Problems on Graphs of High Rank-Width (Q3449829) (← links)
• Kernelization of Graph Hamiltonicity: Proper $H$-Graphs (Q4986812) (← links)
• Hans Bodlaender and the Theory of Kernelization Lower Bounds (Q5042447) (← links)
• Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds (Q5042452) (← links)
• Packing Cycles Faster Than Erdos--Posa (Q5232148) (← links)
• Parameterized Pre-Coloring Extension and List Coloring Problems (Q5857010) (← links)
• Chordless Cycle Packing Is Fixed-Parameter Tractable (Q5874543) (← links)
• The parameterized complexity of cycle packing: indifference is not an issue (Q5919574) (← links)
• Packing arc-disjoint cycles in oriented graphs (Q6126480) (← links)