Pages that link to "Item:Q1877706"
From MaRDI portal
The following pages link to On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems (Q1877706):
Displayed 32 items.
- A parameterized study of maximum generalized pattern matching problems (Q300450) (← links)
- On the parameterised complexity of string morphism problems (Q315525) (← links)
- Model counting for CNF formulas of bounded modular treewidth (Q334935) (← links)
- Satisfiability of acyclic and almost acyclic CNF formulas (Q385062) (← links)
- Variants of constrained longest common subsequence (Q407588) (← links)
- Editing graphs to satisfy degree constraints: a parameterized approach (Q414866) (← links)
- Parameterized complexity and approximability of the longest compatible sequence problem (Q456697) (← links)
- The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT (Q456705) (← links)
- Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
- On finding optimal polytrees (Q500966) (← links)
- Parameterizing by the number of numbers (Q692894) (← links)
- Longest common subsequence problem for unoriented and cyclic strings (Q868937) (← links)
- On parameterized complexity of the multi-MCS problem (Q1019178) (← links)
- Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming (Q1759676) (← links)
- Computing the similarity of two sequences with nested arc annotations (Q1884953) (← links)
- Tractability and hardness of flood-filling games on trees (Q2344738) (← links)
- A complete parameterized complexity analysis of bounded planning (Q2353405) (← links)
- Parameterized complexity of the MinCCA problem on graphs of bounded decomposability (Q2399617) (← links)
- Parameterized complexity of secluded connectivity problems (Q2408560) (← links)
- The parameterized complexity of stabbing rectangles (Q2428672) (← links)
- Tractable cases of the extended global cardinality constraint (Q2430356) (← links)
- Parameterized domination in circle graphs (Q2441539) (← links)
- On the computational hardness based on linear fpt-reductions (Q2498987) (← links)
- Hardness results for the center and median string problems under the weighted and unweighted edit distances (Q2569417) (← links)
- Algorithmic Aspects of Upper Domination: A Parameterised Perspective (Q2830063) (← links)
- Split-Plot Designs for Robotic Serial Dilution Assays (Q2893371) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows (Q2908547) (← links)
- On Directed Steiner Trees with Multiple Roots (Q3181063) (← links)
- Parameterized Complexity and Approximability of the SLCS Problem (Q3503583) (← links)
- The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT (Q3637173) (← links)
- Listing Center Strings Under the Edit Distance Metric (Q5743548) (← links)