Pages that link to "Item:Q727962"
From MaRDI portal
The following pages link to Approximating maximum agreement forest on multiple binary trees (Q727962):
Displaying 11 items.
- An improved FPT algorithm for almost forest deletion problem (Q1751414) (← links)
- On unrooted and root-uncertain variants of several well-known phylogenetic network problems (Q1755726) (← links)
- An improved kernel for max-bisection above tight lower bound (Q1985605) (← links)
- Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm (Q2221808) (← links)
- Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition (Q2285134) (← links)
- Improved approximation algorithms for two-stage flowshops scheduling problem (Q2285149) (← links)
- New kernels for several problems on planar graphs (Q2285156) (← links)
- Gene tree reconciliation including transfers with replacement is NP-hard and FPT (Q2424823) (← links)
- Dealing with several parameterized problems by random methods (Q2636503) (← links)
- Parameterized algorithms for edge biclique and related problems (Q2636505) (← links)
- A duality based 2-approximation algorithm for maximum agreement forest (Q2687064) (← links)
