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 9 items.
- 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)
- 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)
- 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)