The following pages link to Magnus Bordewich (Q281903):
Displaying 33 items.
- Reticulation-visible networks (Q281904) (← links)
- Determining phylogenetic networks from inter-taxa distances (Q304036) (← links)
- (Q313790) (redirect page) (← links)
- An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances (Q313792) (← links)
- Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width (Q463068) (← links)
- On the fixed parameter tractability of agreement-based phylogenetic distances (Q504072) (← links)
- Budgeted nature reserve selection with diversity feature loss and arbitrary split systems (Q662604) (← links)
- On the information content of discrete phylogenetic characters (Q667690) (← links)
- Recovering normal networks from shortest inter-taxa distance information (Q667692) (← links)
- Constructing tree-child networks from distance matrices (Q724232) (← links)
- Identifying \(X\)-trees with few characters (Q869997) (← links)
- Computing the minimum number of hybridization events for a consistent evolutionary history (Q881571) (← links)
- A 3-approximation algorithm for the subtree distance between phylogenies (Q1018098) (← links)
- Optimizing phylogenetic diversity across two trees (Q1021786) (← links)
- On the computational complexity of the rooted subtree prune and regraft distance (Q1764471) (← links)
- A universal tree-based network with the minimum number of reticulations (Q1801081) (← links)
- Counting consistent phylogenetic trees is \#P-complete (Q1883389) (← links)
- On the complexity of optimising variants of phylogenetic diversity on phylogenetic networks (Q2143143) (← links)
- Lost in space? Generalising subtree prune and regraft to spaces of phylogenetic networks (Q2404037) (← links)
- Path coupling without contraction (Q2457299) (← links)
- Identifying phylogenetic trees (Q2570101) (← links)
- Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width (Q3012830) (← links)
- On the Approximation Complexity Hierarchy (Q3075447) (← links)
- Mixing of the Glauber dynamics for the ferromagnetic Potts model (Q3467578) (← links)
- Path coupling using stopping times and counting independent sets and colorings in hypergraphs (Q3503609) (← links)
- Stopping Times, Metrics and Approximate Counting (Q3613753) (← links)
- Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs (Q4812336) (← links)
- On the Maximum Agreement Subtree Conjecture for Balanced Trees (Q5028359) (← links)
- Defining a Phylogenetic Tree with the Minimum Number of $r$-State Characters (Q5254033) (← links)
- Fundamentals of Computation Theory (Q5492913) (← links)
- Approximate Counting and Quantum Computation (Q5704387) (← links)
- Approximating the Tutte polynomial (Q5889995) (← links)
- Quantifying the difference between phylogenetic diversity and diversity indices (Q6124442) (← links)
