Pages that link to "Item:Q5899484"
From MaRDI portal
The following pages link to A Subexponential Parameterized Algorithm for Proper Interval Completion (Q5899484):
Displaying 12 items.
- Unit interval editing is fixed-parameter tractable (Q515577) (← links)
- Rank reduction of oriented graphs by vertex and edge deletions (Q722520) (← links)
- A polynomial kernel for trivially perfect editing (Q1799208) (← links)
- Paths to trees and cacti (Q1998842) (← links)
- Polynomial kernelization for removing induced claws and diamonds (Q2398208) (← links)
- A cubic vertex-kernel for \textsc{Trivially Perfect Editing} (Q2696282) (← links)
- Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
- Paths to Trees and Cacti (Q5283353) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)
- On the Parameterized Approximability of Contraction to Classes of Chordal Graphs (Q6084414) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- On the proper interval completion problem within some chordal subclasses (Q6635117) (← links)
