Pages that link to "Item:Q3642873"

The following pages link to Interval Completion Is Fixed Parameter Tractable (Q3642873):

Displaying 33 items.

• Polynomial kernels for proper interval completion and related problems (Q393083) (← links)
• Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables (Q414863) (← links)
• A probabilistic approach to problems parameterized above or below tight bounds (Q632807) (← links)
• Solving MAX-\(r\)-SAT above a tight lower bound (Q644808) (← links)
• Note on Max Lin-2 above average (Q656604) (← links)
• On the effectiveness of the incremental approach to minimal chordal edge modification (Q820555) (← links)
• Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
• Characterizing and computing minimal cograph completions (Q972335) (← links)
• Dynamically maintaining split graphs (Q1026107) (← links)
• Scale free interval graphs (Q1035692) (← links)
• Note on maximal bisection above tight lower bound (Q1675768) (← links)
• Sublinear approximation algorithms for boxicity and related problems (Q1693125) (← links)
• Proper interval vertex deletion (Q1949742) (← links)
• Betweenness parameterized above tight lower bound (Q1959433) (← links)
• Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
• Vertex deletion into bipartite permutation graphs (Q2161007) (← links)
• Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes (Q2232241) (← links)
• Minimum fill-in: inapproximability and almost tight lower bounds (Q2304536) (← links)
• A faster FPT algorithm for bipartite contraction (Q2445333) (← links)
• Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
• Exploring the Subexponential Complexity of Completion Problems (Q2828210) (← links)
• Proper Interval Vertex Deletion (Q3058706) (← links)
• Polynomial Kernels for Proper Interval Completion and Related Problems (Q3088286) (← links)
• Characterizing and Computing Minimal Cograph Completions (Q3507328) (← links)
• Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs (Q5387822) (← links)
• (Q5743514) (← links)
• Slightly Superexponential Parameterized Problems (Q5745079) (← links)
• (Q5874519) (← links)
• A Subexponential Parameterized Algorithm for Proper Interval Completion (Q5899484) (← links)
• Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)
• Vertex deletion into bipartite permutation graphs (Q6068239) (← links)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
• A graph-theoretic barcode ordering model for linked-reads (Q6487642) (← links)