Pages that link to "Item:Q3596728"
From MaRDI portal
The following pages link to A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs (Q3596728):
Displaying 11 items.
- A linear kernel for a planar connected dominating set (Q534569) (← links)
- Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms (Q547307) (← links)
- Kernel bounds for disjoint cycles and disjoint paths (Q638521) (← links)
- Planar vertex-disjoint cycle packing: new structures and improved kernel (Q1708648) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- (Q3469114) (← links)
- Kernel Bounds for Disjoint Cycles and Disjoint Paths (Q3639278) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs (Q5163509) (← links)
- Packing Cycles Faster Than Erdos--Posa (Q5232148) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710805) (← links)