Pages that link to "Item:Q1575712"
From MaRDI portal
The following pages link to The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712):
Displaying 13 items.
- Parameterized complexity and approximability of the longest compatible sequence problem (Q456697) (← links)
- Acyclic and star colorings of cographs (Q643025) (← links)
- The treewidth of line graphs (Q723884) (← links)
- Incomplete directed perfect phylogeny in linear time (Q832858) (← links)
- Hard problems in similarity searching (Q1885825) (← links)
- Completing colored graphs to meet a target property (Q2030434) (← links)
- Tractability and hardness of flood-filling games on trees (Q2344738) (← links)
- Inferring phylogenetic trees using answer set programming (Q2467563) (← links)
- Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Parameterized Complexity and Approximability of the SLCS Problem (Q3503583) (← links)
- (Q5743514) (← links)
- Parameterized problems complete for nondeterministic FPT time and logarithmic space (Q6614886) (← links)
