The following pages link to Jens Lagergren (Q293218):
Displaying 27 items.
- Approximate Max \(k\)-Cut with subgraph guarantee (Q293220) (← links)
- Compatibility of unrooted phylogenetic trees is FPT (Q820142) (← links)
- Fast neighbor joining (Q1019174) (← links)
- Upper bounds on the size of obstructions and intertwines (Q1272647) (← links)
- On the approximability of the Steiner tree problem in phylogeny (Q1281766) (← links)
- The nonexistence of reduction rules giving an embedding into a \(k\)-tree (Q1336627) (← links)
- Approximability of maximum splitting of k-sets and some other Apx-complete problems (Q1350605) (← links)
- Easy problems for tree-decomposable graphs (Q3361904) (← links)
- The gene evolution model and computing its associated probabilities (Q3452203) (← links)
- Motif Yggdrasil: Sampling from a Tree Mixture Model (Q3596331) (← links)
- (Q3812222) (← links)
- (Q4036591) (← links)
- (Q4252043) (← links)
- (Q4259987) (← links)
- (Q4273873) (← links)
- A Polynomial-Time Algorithm for Near-Perfect Phylogeny (Q4429677) (← links)
- (Q4472468) (← links)
- Hypothesis testing in perfect phylogeny for a bounded number of characters (Q4593964) (← links)
- The size of an intertwine (Q4632453) (← links)
- Algorithms for RH Mapping: New Ideas and Improved Analysis (Q4651527) (← links)
- (Q4818875) (← links)
- Fitting points on the real line and its application to RH mapping (Q4820904) (← links)
- Efficient Parallel Algorithms for Graphs of Bounded Tree-Width (Q4864433) (← links)
- Equivalent definitions of recognizability for sets of graphs of bounded tree-width (Q4882496) (← links)
- Recognizable sets of graphs of bounded tree-width (Q5096279) (← links)
- Automata, Languages and Programming (Q5716751) (← links)
- On the approximability of the Steiner tree problem in phylogeny (Q6487426) (← links)
