Pages that link to "Item:Q5408603"
From MaRDI portal
The following pages link to A Polynomial Kernel for Proper Interval Vertex Deletion (Q5408603):
Displaying 18 items.
- Unit interval editing is fixed-parameter tractable (Q515577) (← links)
- Unit interval vertex deletion: fewer vertices are relevant (Q1747495) (← links)
- Polynomial kernels for deletion to classes of acyclic digraphs (Q1751231) (← links)
- A polynomial kernel for trivially perfect editing (Q1799208) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- Declawing a graph: polyhedra and branch-and-cut algorithms (Q2045043) (← links)
- A polynomial kernel for bipartite permutation vertex deletion (Q2093571) (← links)
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration (Q2237892) (← links)
- Polynomial kernelization for removing induced claws and diamonds (Q2398208) (← links)
- Paradigms for parameterized enumeration (Q2398214) (← links)
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197) (← links)
- Parameterized Enumeration for Modification Problems (Q2799203) (← links)
- Polynomial Kernelization for Removing Induced Claws and Diamonds (Q2827828) (← links)
- Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs (Q2828227) (← links)
- Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
- Solving Partition Problems Almost Always Requires Pushing Many Vertices Around (Q5220192) (← links)
- (Q5874519) (← links)
- The parameterized complexity of cycle packing: indifference is not an issue (Q5919574) (← links)