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):
Displaying 18 items.
- 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)
- Compact Flow Diagrams for State Sequences (Q4577949) (← links)
- On the Approximation of Shortest Common Supersequences and Longest Common Subsequences (Q4857599) (← links)
- (Q4858904) (← links)
- (Q5009468) (← links)
- (Q5009483) (← links)
- (Q5009589) (← links)
- A Parameterized Perspective on Attacking and Defending Elections (Q5041198) (← links)
- Sum-of-Products with Default Values: Algorithms and Complexity Results (Q5076308) (← links)
- Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis (Q5094064) (← links)
- Listing Center Strings Under the Edit Distance Metric (Q5743548) (← links)
- Minimum reload cost graph factors (Q5918369) (← links)
- The complexity of tree partitioning (Q5918926) (← links)
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q6119835) (← links)
- An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth (Q6201339) (← links)
- The multicolored graph realization problem (Q6558680) (← links)
- Parameterized problems complete for nondeterministic FPT time and logarithmic space (Q6614886) (← links)
