Pages that link to "Item:Q1607033"

The following pages link to A general method to speed up fixed-parameter-tractable algorithms (Q1607033):

Displaying 38 items.

• Polynomial kernels for proper interval completion and related problems (Q393083) (← links)
• On making directed graphs transitive (Q414917) (← links)
• Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions (Q494805) (← links)
• Fixed-parameter algorithms for DAG partitioning (Q507587) (← links)
• An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem (Q511682) (← links)
• Vertex cover problem parameterized above and below tight bounds (Q633768) (← links)
• Complexity and parameterized algorithms for cograph editing (Q690461) (← links)
• Improved upper bounds for vertex cover (Q708228) (← links)
• Refined memorization for vertex cover (Q835007) (← links)
• An efficient fixed-parameter algorithm for 3-hitting set (Q876698) (← links)
• Fixed parameter algorithms for one-sided crossing minimization revisited (Q935846) (← links)
• Two fixed-parameter algorithms for vertex covering by paths on trees (Q963337) (← links)
• Fixed-parameter algorithms for cluster vertex deletion (Q987386) (← links)
• Efficiency in exponential time for domination-type problems (Q1003475) (← links)
• Fixed-parameter algorithms for Kemeny rankings (Q1035688) (← links)
• Going weighted: parameterized algorithms for cluster editing (Q1040589) (← links)
• Call control with \(k\) rejections (Q1877703) (← links)
• On the existence of subexponential parameterized algorithms (Q1877709) (← links)
• Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms (Q1877711) (← links)
• Improved exact algorithms for MAX-SAT (Q1878397) (← links)
• Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes (Q1928521) (← links)
• A golden ratio parameterized algorithm for cluster editing (Q1932356) (← links)
• On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems (Q1949740) (← links)
• New fixed-parameter algorithms for the minimum quartet inconsistency problem (Q1959377) (← links)
• Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space (Q2203595) (← links)
• Applying modular decomposition to parameterized cluster editing problems (Q2272201) (← links)
• On the kernelization of ranking \(r\)-CSPs: linear vertex-kernels for generalizations of feedback arc set and betweenness in tournaments (Q2345613) (← links)
• An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs (Q2354311) (← links)
• On the generalized multiway cut in trees problem (Q2436662) (← links)
• A cubic-vertex kernel for flip consensus tree (Q2441594) (← links)
• A refined search tree technique for dominating set on planar graphs (Q2575830) (← links)
• Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
• A Basic Parameterized Complexity Primer (Q2908536) (← links)
• On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems (Q3058699) (← links)
• Polynomial Kernels for Proper Interval Completion and Related Problems (Q3088286) (← links)
• A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion (Q3196407) (← links)
• Graph Motif Problems Parameterized by Dual (Q5119384) (← links)
• Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)