{"ID":2878912,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2508.17349","arxiv_id":"2508.17349","title":"2-Layer Fan-Planarity in Polynomial Time","abstract":"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 papers since 2015.","short_abstract":"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 papers since 2015.","url_abs":"https://arxiv.org/abs/2508.17349","url_pdf":"https://arxiv.org/pdf/2508.17349v1","authors":"[\"Yasuaki Kobayashi\",\"Yuto Okada\"]","published":"2025-08-24T13:06:55Z","proceeding":"cs.CG","tasks":"[\"cs.CG\",\"cs.DS\"]","methods":"[]","has_code":false}