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 19 items.
- 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)
- 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)
- The parameterized complexity of stabbing rectangles (Q2428672) (← links)
- Tractable cases of the extended global cardinality constraint (Q2430356) (← 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)
- 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)
- 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)