Pages that link to "Item:Q2437764"

The following pages link to Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization (Q2437764):

Displaying 10 items.

• PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
• Improved approximation algorithms for path vertex covers in regular graphs (Q2006949) (← links)
• An improved approximation for maximum \(k\)-dependent set on bipartite graphs (Q2057593) (← links)
• Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs (Q2341756) (← links)
• On the \(d\)-claw vertex deletion problem (Q2695329) (← links)
• Quadratic vertex kernel for split vertex deletion (Q5896158) (← links)
• Vertex deletion on split graphs: beyond 4-hitting set (Q5918994) (← links)
• Linear‐time algorithms for eliminating claws in graphs (Q6082274) (← links)
• Maximum weight <i>t</i>-sparse set problem on vector-weighted graphs (Q6140983) (← links)
• On the \(d\)-claw vertex deletion problem (Q6182678) (← links)