Pages that link to "Item:Q386050"

The following pages link to Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050):

Displayed 14 items.

• Kernelization using structural parameters on sparse graph classes (Q340583) ‎ (← links)
• Fixed parameter tractability of graph deletion problems over data streams (Q2019516) ‎ (← links)
• Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) ‎ (← links)
• Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies (Q2119402) ‎ (← links)
• Streaming deletion problems parameterized by vertex cover (Q2140522) ‎ (← links)
• Polynomial kernels for hitting forbidden minors under structural parameterizations (Q2202024) ‎ (← links)
• Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets (Q2412632) ‎ (← links)
• Meta-kernelization using well-structured modulators (Q2413976) ‎ (← links)
• A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion (Q2662677) ‎ (← links)
• FPT is characterized by useful obstruction sets (Q2828222) ‎ (← links)
• Uniform Kernelization Complexity of Hitting Forbidden Minors (Q3448821) ‎ (← links)
• Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) ‎ (← links)
• Streaming deletion problems Parameterized by vertex cover (Q6057830) ‎ (← links)
• Polynomial Kernel for Interval Vertex Deletion (Q6075746) ‎ (← links)