Pages that link to "Item:Q3656849"
From MaRDI portal
The following pages link to A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams (Q3656849):
Displayed 9 items.
- A note on the parameterized complexity of unordered maximum tree orientation (Q427909) (← links)
- An infinite antichain of planar tanglegrams (Q2140994) (← links)
- Some problems related to the space of optimal tree reconciliations (invited talk) (Q2154074) (← links)
- Visualizing co-phylogenetic reconciliations (Q2310765) (← links)
- Drawing (complete) binary tanglegrams (Q2428677) (← links)
- Satisfying more than half of a system of linear equations over GF(2): a multivariate approach (Q2637641) (← links)
- (Q5743380) (← links)
- Block crossings in one-sided tanglegrams (Q6179427) (← links)
- The largest crossing number of tanglegrams (Q6194257) (← links)