Showing cs.CGShow all
2 papers · 1 filter
cs.CG2026
Min-1-Planarity is NP-Hard
Yuto Okada
In this paper, we show that it is NP-hard to determine whether a given graph admits a min-1-planar drawing. A drawing of a graph is min--planar if, for every crossing in the dra…
cs.CG2025
2-Layer Fan-Planarity in Polynomial Time
Yasuaki Kobayashi, Yuto Okada
In this paper, we give a polynomial-time algorithm for deciding whether an input bipartite graph admits a 2-layer fan-planar drawing, resolving an open problem posed in several pap…