Pages that link to "Item:Q1889885"
From MaRDI portal
The following pages link to On the complexity of drawing trees nicely: Corrigendum (Q1889885):
Displaying 4 items.
- On the approximability of two tree drawing conventions (Q294876) (← links)
- Erratum to: ``Computationally tractable approximate and smoothed Polya trees'' (Q517374) (← links)
- Corrigendum to: `Complexity of diagrams' (Q1319087) (← links)
- NP-Completeness of Minimal Width Unordered Tree Layout (Q3378499) (← links)