Pages that link to "Item:Q3057628"
From MaRDI portal
The following pages link to Measuring Indifference: Unit Interval Vertex Deletion (Q3057628):
Displayed 14 items.
- Unit interval editing is fixed-parameter tractable (Q515577) (← links)
- Unit interval vertex deletion: fewer vertices are relevant (Q1747495) (← links)
- Vertex deletion problems on chordal graphs (Q1786595) (← links)
- Proper interval vertex deletion (Q1949742) (← links)
- Declawing a graph: polyhedra and branch-and-cut algorithms (Q2045043) (← links)
- Distance from triviality 2.0: hybrid parameterizations (Q2169932) (← links)
- Modifying a graph using vertex elimination (Q2345941) (← links)
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- A faster FPT algorithm for bipartite contraction (Q2445333) (← links)
- Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs (Q2828227) (← links)
- Proper Interval Vertex Deletion (Q3058706) (← links)
- Vertex Deletion Problems on Chordal Graphs (Q5136314) (← links)
- The parameterized complexity of cycle packing: indifference is not an issue (Q5919574) (← links)