Yuto Okada

activity

20242026

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2026

Pathwidth of 2-Layer $k$ -Planar Graphs

Yuto Okada

A bipartite graph $G = (X \cup Y, E)$ is a 2-layer $k$ -planar graph if it admits a drawing on the plane such that the vertices in $X$ and $Y$ are placed on two parallel lines respe…

cs.DM2024

Bounding the Treewidth of Outer $k$ -Planar Graphs via Triangulations

Oksana Firman, Grzegorz Gutowski, Myroslav Kryven +2

The treewidth is a structural parameter that measures the tree-likeness of a graph. Many algorithmic and combinatorial results are expressed in terms of the treewidth. In this pape…

Pathwidth of 2-Layer k-Planar Graphs

Bounding the Treewidth of Outer k-Planar Graphs via Triangulations

Pathwidth of 2-Layer $k$ -Planar Graphs

Bounding the Treewidth of Outer $k$ -Planar Graphs via Triangulations