English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

In SODA'99, Chan introduced a simple type of planar straight-line upwardorder-preserving drawings of binary trees, known as LR drawings: such a drawingis obtained by picking a root-to-leaf path, drawing the path as a straightline, and recursively drawing the subtrees along the paths. Chan proved thatany binary tree with $n$ nodes admits an LR drawing with $O(n^{0.48})$ width.In SODA'17, Frati, Patrignani, and Roselli proved that there exist families of$n$-node binary trees for which any LR drawing has $\Omega(n^{0.418})$ width.In this note, we improve Chan's upper bound to $O(n^{0.437})$ and Frati etal.'s lower bound to $\Omega(n^{0.429})$.

Improved Upper and Lower Bounds for LR Drawings of Binary Trees