Pages that link to "Item:Q1949125"

The following pages link to Towards optimal kernel for connected vertex cover in planar graphs (Q1949125):

Displaying 7 items.

• A \(13k\)-kernel for planar feedback vertex set via region decomposition (Q306250) (← links)
• Planar graph vertex partition for linear problem kernels (Q355502) (← links)
• Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
• A \(9k\) kernel for nonseparating independent set in planar graphs (Q385964) (← links)
• An improved linear kernel for complementary maximal strip recovery: simpler and smaller (Q2319903) (← links)
• Towards optimal kernel for edge-disjoint triangle packing (Q2446590) (← links)
• A 42k Kernel for the Complementary Maximal Strip Recovery Problem (Q4632213) (← links)