統計
- プレプリント 📕 × 12
- 国際会議 📗 × 8
- ジャーナル 📘 × 2
プレプリント
On Edge-Disjoint Maximal Outerplanar Graphs
Yuto Okada, Yota Otachi, Lena Volk.
📕 arXivOne-Sided Local Crossing Minimization
Grzegorz Gutowski, Maarten Löffler, Yuto Okada, Alexander Wolff.
📕 arXiv2-Layer Fan-Planarity in Polynomial Time
Yasuaki Kobayashi, Yuto Okada.
📕 arXivPathwidth of 2-Layer k-Planar Graphs
Yuto Okada.
📕 arXiv
査読済み
Finding a Maximum Common (Induced) Subgraph: Structural Parameters Revisited
Tesshu Hanaka, Yuto Okada, Yota Otachi, Lena Volk.
📕 arXiv 📗 WALCOM 2026Hitting Geodesic Intervals in Structurally Restricted Graphs
Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada, Yota Otachi, Hayato Takaike.
📕 arXiv 📗 IPEC 2025Structural Parameterizations of k-Planarity
Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada.
📕 arXiv 📗 GD 2025Recognizing 2-Layer and Outer k-Planar Graphs
Yasuaki Kobayashi, Yuto Okada, Alexander Wolff.
📕 arXiv 📗 SoCG 2025Basis Sequence Reconfiguration in the Union of Matroids
Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi, Yuto Okada, Rin Saito.
📕 arXiv 📗 ISAAC 2024Bounding the Treewidth of Outer k-Planar Graphs via Triangulations
Oksana Firman, Grzegorz Gutowski, Myroslav Kryven, Yuto Okada, Alexander Wolff.
📕 arXiv 📗 GD 2024Dichotomies for Tree Minor Containment with Structural Parameters
Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi.
📕 arXiv 📗 WALCOM 2024 📘 Theoretical Computer ScienceSequentially Swapping Tokens: Further on Graph Classes
Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi.
📕 arXiv 📗 SOFSEM 2023 📘 Journal of Computer and System Sciences