https://yutookada.com/en/ Recent content on Yuto Okada Hugo -- 0.125.7 en Sun, 21 Dec 2025 00:00:00 +0900 https://yutookada.com/en/blog/treewidth-3/ Sun, 21 Dec 2025 00:00:00 +0900 https://yutookada.com/en/blog/treewidth-3/ (English translation of the original article, by Gemini 3 Pro (~90%) + me.) This article is for the 21st day of Tree Advent Calendar 2025. Overview For a graph $G$, let $\mathrm{tw}(G)$ denote the treewidth of $G$. This article introduces a simple algorithm to solve the following decision problem. Input: A (simple undirected) graph $G = (V, E)$ with $n$ vertices and $m$ edges. Output: Is $\mathrm{tw}(G) \leq 3$? Expert readers might know these facts: https://yutookada.com/en/cv/ Mon, 01 Jan 0001 00:00:00 +0000 https://yutookada.com/en/cv/ Personal Information Name: Yuto Okada Affiliation: Nagoya University E-Mail Address: research [at] yutookada.com [DBLP] [ORCID] Education April 2024 – March 2027 (expected) Doctoral Course of Department of Mathematical Informatics, Graduate School of Informatics, Nagoya University Supervisor: Prof. Yota Otachi April 2022 – March 2024 Master’s Course of Department of Mathematical Informatics, Graduate School of Informatics, Nagoya University April 2018 – March 2022 Department of Natural Informatics, School of Informatics, Nagoya University （April 2020 –）Division of Mathematical Informatics Occupation April 2026 – March 2028 JSPS Research Fellow (DC2) 2025 – Research Assistant at Nagoya University April 2024 – March 2027 March 2026 Research Fellow at Nagoya University Make New Standards Program for the Next Generation Researchers Awards 2025年6月: Excellent Presentation Award by Research Association of Optimization Theory and Algorithms, Operations Research Society of Japan 2023年1月: Best Student Paper Award of SOFSEM 2023 Other Activities (Sub)Reviewer journals: JGAA conferences: CIAC 2025, IPEC 2025, GD 2025 https://yutookada.com/en/presentations/ Mon, 01 Jan 0001 00:00:00 +0000 https://yutookada.com/en/presentations/ International Conferences (Refereed) 2025 [PDF] Structural Parameterizations of k-Planarity Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada. The 33rd International Symposium on Graph Drawing and Network Visualization (GD 2025). [PDF] Recognizing 2-Layer and Outer k-Planar Graphs Yasuaki Kobayashi, Yuto Okada, Alexander Wolff. The 41st International Symposium on Computational Geometry (SoCG 2025). 2024 [PDF] Bounding the Treewidth of Outer k-Planar Graphs via Triangulations Oksana Firman, Grzegorz Gutowski, Myroslav Kryven, Yuto Okada, Alexander Wolff. https://yutookada.com/en/publications/ Mon, 01 Jan 0001 00:00:00 +0000 https://yutookada.com/en/publications/ Statistics Preprint 📕 × 12 Conference Proceeding 📗 × 8 Journal Paper 📘 × 3 Preprints On Edge-Disjoint Maximal Outerplanar Graphs Yuto Okada, Yota Otachi, Lena Volk. 📕 arXiv One-Sided Local Crossing Minimization Grzegorz Gutowski, Maarten Löffler, Yuto Okada, Alexander Wolff. 📕 arXiv 2-Layer Fan-Planarity in Polynomial Time Yasuaki Kobayashi, Yuto Okada. 📕 arXiv Refereed Papers Finding a Maximum Common (Induced) Subgraph: Structural Parameters Revisited Tesshu Hanaka, Yuto Okada, Yota Otachi, Lena Volk. https://yutookada.com/en/tools/ Mon, 01 Jan 0001 00:00:00 +0000 https://yutookada.com/en/tools/ Graph Parameter Hierarchy Visualizer Path Decomposition Visualizer