Pages that link to "Item:Q4820910"
From MaRDI portal
The following pages link to Analogs & duals of the MAST problem for sequences & trees (Q4820910):
Displayed 12 items.
- On encodings of phylogenetic networks of bounded level (Q455730) (← links)
- Parameterized complexity and approximability of the longest compatible sequence problem (Q456697) (← links)
- Complexity issues in vertex-colored graph pattern matching (Q533412) (← links)
- On the parameterized complexity of the multi-MCT and multi-MCST problems (Q630185) (← links)
- Parameterized algorithms for feedback set problems and their duals in tournaments (Q820159) (← links)
- Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number (Q1752485) (← links)
- On the space and circuit complexity of parameterized problems: classes and completeness (Q2343093) (← links)
- Tractability and hardness of flood-filling games on trees (Q2344738) (← links)
- The Impact of Parameterized Complexity to Interdisciplinary Problem Solving (Q2908532) (← links)
- Parameterized Complexity and Approximability of the SLCS Problem (Q3503583) (← links)
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems (Q3637312) (← links)
- A Survey on the Complexity of Flood-Filling Games (Q6163636) (← links)