Pages that link to "Item:Q4575657"

The following pages link to Linear Recognition of Almost Interval Graphs (Q4575657):

Displaying 34 items.

• Unit interval editing is fixed-parameter tractable (Q515577) (← links)
• Simple linear time recognition of unit interval graphs (Q672408) (← links)
• Rank reduction of oriented graphs by vertex and edge deletions (Q722520) (← links)
• The recognition problem for line bigraphs (Q1398267) (← links)
• Vertex deletion problems on chordal graphs (Q1786595) (← links)
• Paths to trees and cacti (Q1998842) (← links)
• Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
• Towards constant-factor approximation for chordal/distance-hereditary vertex deletion (Q2149107) (← links)
• Vertex deletion into bipartite permutation graphs (Q2161007) (← links)
• Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes (Q2232241) (← links)
• Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results (Q2297848) (← links)
• The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial (Q2849360) (← links)
• Line-Polar Graphs: Characterization and Recognition (Q3225119) (← links)
• Erdös-Pósa Property of Obstructions to Interval Graphs (Q3304101) (← links)
• Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
• (Q4590888) (← links)
• Vertex Deletion Problems on Chordal Graphs (Q5136314) (← links)
• Paths to Trees and Cacti (Q5283353) (← links)
• The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial (Q5499731) (← links)
• Slightly Superexponential Parameterized Problems (Q5745079) (← links)
• (Q5874519) (← links)
• Conflict free version of covering problems on graphs: classical and parameterized (Q5918906) (← links)
• Parameterized complexity of diameter (Q5925618) (← links)
• (Q6065472) (← links)
• Vertex deletion into bipartite permutation graphs (Q6068239) (← links)
• Polynomial Kernel for Interval Vertex Deletion (Q6075746) (← links)
• On the Parameterized Approximability of Contraction to Classes of Chordal Graphs (Q6084414) (← links)
• Erdős–Pósa property of obstructions to interval graphs (Q6094044) (← links)
• Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes (Q6098156) (← links)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
• Domination and Cut Problems on Chordal Graphs with Bounded Leafage (Q6492086) (← links)
• Graphs with at most two moplexes (Q6595515) (← links)
• Modification problems toward proper (Helly) circular-arc graphs (Q6647753) (← links)
• A constant-factor approximation for weighted bond cover (Q6671673) (← links)