Refining the graph parameter hierarchy for fine-grained algorithms

• Project/Area Number: 21K11752
• Research Category: Grant-in-Aid for Scientific Research (C)
• Allocation Type: Multi-year Fund
• Section: 一般
• Review Section: Basic Section 60010:Theory of informatics-related
• Research Institution: Nagoya University
• Principal Investigator: 大舘 陽太 名古屋大学, 情報学研究科, 准教授 (80610196)
• Project Period (FY): 2021-04-01 – 2026-03-31
• Project Status: Discontinued (Fiscal Year 2024)
• Budget Amount: ¥4,160,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥960,000); Fiscal Year 2025: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000); Fiscal Year 2024: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000); Fiscal Year 2023: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000); Fiscal Year 2022: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000); Fiscal Year 2021: ¥520,000 (Direct Cost: ¥400,000、Indirect Cost: ¥120,000)
• Keywords: グラフ構造パラメータ / FPTアルゴリズム / グラフアルゴリズム / グラフパラメータ / パラメータ化計算量

Outline of Research at the Start

グラフ上で定義される多くの問題は計算量理論上難しいことが分かっている．そのような問題に対し，グラフの分解可能性をあらわす構造パラメータを用いたアルゴリズム設計が有効である．木分解の幅によって定義される木幅がその代表的な成功例であるが，研究の発展により，一般の木分解では手に負えない問題が見つかってきている．本研究では，木分解に関連したグラフ構造パラメータの階層を見直し，グラフ分解への制限を大幅に弱めた構造パラメータを導入することで，高速アルゴリズム設計可能範囲を拡大することを目指す．さらに，既知の困難性をさらに強い制限の下で示すことにより，重要問題に対するきめ細やかな知見獲得を目指す．

Outline of Annual Research Achievements

グラフ構造パラメータ階層の詳細化によるアルゴリズム設計と計算量解析を研究し，以下に分類される成果を得た: (1) 頂点被覆が小さい場合の高速アルゴリズムを，頂点インテグリティが小さい場合に一般化した; (2) 木幅が小さい場合に対する分かっている困難性を強化し，より限定されたパラメータに対して示した; (3) 何が問題を易しくするのか・難しくするのかに対する構造的メタ定理を発見した.

最終年度は主に以下の成果を得た．・本研究計画の主たるターゲットである頂点インテグリティに対して，最適解の対数倍（log OPT 倍）の精度保証をもつ近似アルゴリズムを設計した．これは今までに知られていた OPT 倍近似アルゴリズムを大幅に改善するものであり，これまでに設計してきた頂点インテグリティをパラメータとしたアルゴリズムの適用可能性を大きく広げることが期待されるものである．・最長共通部分列間の遷移問題に関する多項式時間アルゴリズムを与えた．この結果は，置換グラフというグラフクラスでの独立集合の遷移問題を部分的に解決するものである．（最大独立集合の場合に多項式時間可解であることを示したことになる．）・Mim-widthと呼ばれる非常に一般的なグラフ構造パラメータをパラメータとした場合の誘導部分グラフ発見問題に関して，様々な容易性・困難性の結果を示した．

研究の進展にともない，得られた理論的結果のさらなる発展および実践的活用可能性の解明が必要となってきた．そこで，研究計画を再構成し，実用的なグラフアルゴリズム自動生成を追求する研究課題を計画し，研究計画最終年度前年度応募を行った．今後は，後続研究課題「グラフ分解手法と問題記法の多様化による実践的アルゴリズム自動生成」を実施していく．

Research Products

• [Int'l Joint Research] LAMSADE, Universite Paris Dauphine/IRIF, Universite de Paris(フランス)
• [Journal Article] Dichotomies for Tree Minor Containment with structural parameters (2025)
  • Author(s): Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi
  • Journal Title: Theoretical Computer Science Volume: 1026 Pages: 114984-114984
  • DOI: 10.1016/j.tcs.2024.114984
  • Peer Reviewed / Open Access
• [Journal Article] An improved spectral lower bound of treewidth (2025)
  • Author(s): Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi
  • Journal Title: Information Processing Letters Volume: 188 Pages: 106536-106536
  • DOI: 10.1016/j.ipl.2024.106536
  • Peer Reviewed / Open Access
• [Journal Article] Structural Parameterizations of Vertex Integrity (2025)
  • Author(s): Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi
  • Journal Title: Theoretical Computer Science Volume: 1024 Pages: 114954-114954
  • DOI: 10.1016/j.tcs.2024.114954
  • Peer Reviewed / Open Access
• [Journal Article] Finding a Reconfiguration Sequence between Longest Increasing Subsequences (2024)
  • Author(s): Yuuki Aoike, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
  • Journal Title: IEICE Transactions on Information and Systems Volume: E107.D Issue: 4 Pages: 559-563
  • DOI: 10.1587/transinf.2023EDL8067
  • ISSN: 0916-8532, 1745-1361
  • Year and Date: 2024-04-01
  • Peer Reviewed / Open Access
• [Journal Article] Collecting Balls on a Line by Robots with Limited Energy (2024)
  • Author(s): HANAKA Tesshu、HONORATO DROGUETT Nicolas、KURITA Kazuhiro、ONO Hirotaka、OTACHI Yota
  • Journal Title: IEICE Transactions on Information and Systems Volume: E107.D Issue: 3 Pages: 325-327
  • DOI: 10.1587/transinf.2023FCL0003
  • ISSN: 0916-8532, 1745-1361
  • Year and Date: 2024-03-01
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] On a Spectral Lower Bound of Treewidth (2024)
  • Author(s): GIMA Tatsuya、HANAKA Tesshu、NORO Kohei、ONO Hirotaka、OTACHI Yota
  • Journal Title: IEICE Transactions on Information and Systems Volume: E107.D Issue: 3 Pages: 328-330
  • DOI: 10.1587/transinf.2023FCL0002
  • ISSN: 0916-8532, 1745-1361
  • Year and Date: 2024-03-01
  • Peer Reviewed / Open Access
• [Journal Article] Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited (2024)
  • Author(s): Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi
  • Journal Title: Algorithmica Volume: 86 Issue: 11 Pages: 3395-3424
  • DOI: 10.1007/s00453-024-01261-0
  • Peer Reviewed / Open Access
• [Journal Article] Grouped domination parameterized by vertex cover, twin cover, and beyond (2024)
  • Author(s): Hanaka Tesshu、Ono Hirotaka、Otachi Yota、Uda Saeki
  • Journal Title: Theoretical Computer Science Volume: 996 Pages: 114507-114507
  • DOI: 10.1016/j.tcs.2024.114507
  • Peer Reviewed
• [Journal Article] Finding induced subgraphs from graphs with small mim-width (2024)
  • Author(s): Yota Otachi, Akira Suzuki, Yuma Tamura
  • Journal Title: Leibniz International Proceedings in Informatics Volume: 294
  • Peer Reviewed
• [Journal Article] On the Complexity of List $$\mathcal H$$-Packing for Sparse Graph Classes (2024)
  • Author(s): Gima Tatsuya、Hanaka Tesshu、Kobayashi Yasuaki、Otachi Yota、Shirai Tomohito、Suzuki Akira、Tamura Yuma、Zhou Xiao
  • Journal Title: Proceedings of the 18th International Conference and Workshop on Algorithms and Computation (WALCOM 2024) Volume: 14549 Pages: 421-435
  • DOI: 10.1007/978-981-97-0566-5_30
  • ISBN: 9789819705658, 9789819705665
  • Peer Reviewed / Open Access
• [Journal Article] Structural Parameterizations of Vertex Integrity (2024)
  • Author(s): Gima Tatsuya、Hanaka Tesshu、Kobayashi Yasuaki、Murai Ryota、Ono Hirotaka、Otachi Yota
  • Journal Title: Lecture Notes in Computer Science Volume: 14549 Pages: 406-420
  • DOI: 10.1007/978-981-97-0566-5_29
  • ISBN: 9789819705658, 9789819705665
  • Peer Reviewed
• [Journal Article] Dichotomies for Tree Minor Containment with Structural Parameters (2024)
  • Author(s): Gima Tatsuya、Kumabe Soh、Kurita Kazuhiro、Okada Yuto、Otachi Yota
  • Journal Title: 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March, Proceedings Volume: 14549 Pages: 392-405
  • DOI: 10.1007/978-981-97-0566-5_28
  • ISBN: 9789819705658, 9789819705665
  • Peer Reviewed
• [Journal Article] Orientable Burning Number of Graphs (2024)
  • Author(s): Courtiel Julien、Dorbec Paul、Gima Tatsuya、Lecoq Romain、Otachi Yota
  • Journal Title: The 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024), Lecture Notes in Computer Science Volume: 14549 Pages: 377-391
  • DOI: 10.1007/978-981-97-0566-5_27
  • ISBN: 9789819705658, 9789819705665
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Sorting balls and water: Equivalence and computational complexity (2023)
  • Author(s): Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
  • Journal Title: Theoretical Computer Science Volume: 927 Pages: 114158-114158
  • DOI: 10.1016/j.tcs.2023.114158
  • Peer Reviewed / Open Access
• [Journal Article] Reconfiguration of cliques in a graph (2023)
  • Author(s): Ito Takehiro、Ono Hirotaka、Otachi Yota
  • Journal Title: Discrete Applied Mathematics Volume: 333 Pages: 43-58
  • DOI: 10.1016/j.dam.2023.01.026
  • Peer Reviewed
• [Journal Article] Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond (2023)
  • Author(s): Hanaka Tesshu、Ono Hirotaka、Otachi Yota、Uda Saeki
  • Journal Title: Lecture Notes in Computer Science Volume: 13898 Pages: 263-277
  • DOI: 10.1007/978-3-031-30448-4_19
  • ISBN: 9783031304477, 9783031304484
  • Peer Reviewed
• [Journal Article] Reconfiguring (non-spanning) arborescences (2023)
  • Author(s): Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
  • Journal Title: Theoretical Computer Science Volume: 943 Pages: 131-141
  • DOI: 10.1016/j.tcs.2022.12.007
  • Peer Reviewed / Open Access
• [Journal Article] Sequentially Swapping Tokens: Further on Graph Classes (2023)
  • Author(s): Kiya Hironori、Okada Yuto、Ono Hirotaka、Otachi Yota
  • Journal Title: Lecture Notes in Computer Science Volume: 13878 Pages: 222-235
  • DOI: 10.1007/978-3-031-23101-8_15
  • ISBN: 9783031231001, 9783031231018
  • Peer Reviewed
• [Journal Article] Linear-Time Recognition of Double-Threshold Graphs (2022)
  • Author(s): Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno
  • Journal Title: Algorithmica 84(4): 1163-1181 (2022) Volume: 84 Issue: 4 Pages: 1163-1181
  • DOI: 10.1007/s00453-021-00921-9
  • Peer Reviewed / Open Access
• [Journal Article] An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion (2022)
  • Author(s): Aoike Yuuki、Gima Tatsuya、Hanaka Tesshu、Kiyomi Masashi、Kobayashi Yasuaki、Kobayashi Yusuke、Kurita Kazuhiro、Otachi Yota
  • Journal Title: Theory of Computing Systems Volume: 66 Issue: 2 Pages: 502-515
  • DOI: 10.1007/s00224-022-10076-x
  • Peer Reviewed / Open Access
• [Journal Article] Exploring the gap between treedepth and vertex cover through vertex integrity (2022)
  • Author(s): Gima Tatsuya、Hanaka Tesshu、Kiyomi Masashi、Kobayashi Yasuaki、Otachi Yota
  • Journal Title: Theoretical Computer Science Volume: 918 Pages: 60-76
  • DOI: 10.1016/j.tcs.2022.03.021
  • Peer Reviewed
• [Journal Article] Parameterized Complexity of Graph Burning (2022)
  • Author(s): Kobayashi Yasuaki、Otachi Yota
  • Journal Title: Algorithmica Volume: 84 Issue: 8 Pages: 2379-2393
  • DOI: 10.1007/s00453-022-00962-8
  • Peer Reviewed / Open Access
• [Journal Article] Grundy Distinguishes Treewidth from Pathwidth (2022)
  • Author(s): Belmonte Remy、Kim Eun Jung、Lampis Michael、Mitsou Valia、Otachi Yota
  • Journal Title: SIAM Journal on Discrete Mathematics Volume: 36 Issue: 3 Pages: 1761-1787
  • DOI: 10.1137/20m1385779
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study (2022)
  • Author(s): Hanaka Tesshu、Kobayashi Yasuaki、Kurita Kazuhiro、Lee See Woo、Otachi Yota
  • Journal Title: Proceedings of the AAAI Conference on Artificial Intelligence Volume: 36 Issue: 4 Pages: 3758-3766
  • DOI: 10.1609/aaai.v36i4.20290
  • Peer Reviewed / Open Access
• [Journal Article] Sorting balls and water: Equivalence and computational complexity (2022)
  • Author(s): Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
  • Journal Title: Leibniz International Proceedings in Informatics Volume: 226
  • Peer Reviewed / Open Access
• [Journal Article] Independent set reconfiguration on directed graphs (2022)
  • Author(s): Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa.
  • Journal Title: Leibniz International Proceedings in Informatics Volume: 241
  • Peer Reviewed / Open Access
• [Journal Article] Parameterized complexity of non-separating and non-disconnecting paths and sets (2022)
  • Author(s): Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket Saurabh
  • Journal Title: Leibniz International Proceedings in Informatics Volume: 241
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Algorithmic meta-theorems for combinatorial reconfiguration revisited (2022)
  • Author(s): Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi
  • Journal Title: Leibniz International Proceedings in Informatics Volume: 244
  • Peer Reviewed / Open Access
• [Journal Article] Extended MSO model checking via small vertex integrity (2022)
  • Author(s): Tatsuya Gima, Yota Otachi
  • Journal Title: Leibniz International Proceedings in Informatics Volume: 248
  • Peer Reviewed / Open Access
• [Journal Article] Reconfiguration of Regular Induced Subgraphs (2022)
  • Author(s): Eto Hiroshi、Ito Takehiro、Kobayashi Yasuaki、Otachi Yota、Wasa Kunihiro
  • Journal Title: Lecture Notes in Computer Science Volume: 13174 Pages: 35-46
  • DOI: 10.1007/978-3-030-96731-4_4
  • ISBN: 9783030967307, 9783030967314
  • Peer Reviewed
• [Journal Article] Parameterized Complexity of $$(A,\ell )$$-Path Packing (2021)
  • Author(s): Belmonte Remy、Hanaka Tesshu、Kanzaki Masaaki、Kiyomi Masashi、Kobayashi Yasuaki、Kobayashi Yusuke、Lampis Michael、Ono Hirotaka、Otachi Yota
  • Journal Title: Algorithmica Volume: 84 Issue: 4 Pages: 871-895
  • DOI: 10.1007/s00453-021-00875-y
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Longest common subsequence in sublinear space (2021)
  • Author(s): Kiyomi Masashi、Horiyama Takashi、Otachi Yota
  • Journal Title: Information Processing Letters Volume: 168 Pages: 106084-106084
  • DOI: 10.1016/j.ipl.2020.106084
  • Peer Reviewed
• [Journal Article] Low-congestion shortcut and graph parameters (2021)
  • Author(s): Kitamura Naoki、Kitagawa Hirotaka、Otachi Yota、Izumi Taisuke
  • Journal Title: Distributed Computing Volume: 34 Issue: 5 Pages: 349-365
  • DOI: 10.1007/s00446-021-00401-x
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] On the security number of the Cartesian product of graphs (2021)
  • Author(s): Jakovac Marko、Otachi Yota
  • Journal Title: Discrete Applied Mathematics Volume: 304 Pages: 119-128
  • DOI: 10.1016/j.dam.2021.07.030
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Exploring the Gap Between Treedepth and Vertex Cover Through Vertex?Integrity (2021)
  • Author(s): Gima Tatsuya、Hanaka Tesshu、Kiyomi Masashi、Kobayashi Yasuaki、Otachi Yota
  • Journal Title: Lecture Notes in Computer Science Volume: 12701 Pages: 271-285
  • DOI: 10.1007/978-3-030-75242-2_19
  • ISBN: 9783030752415, 9783030752422
  • Peer Reviewed
• [Journal Article] Computational Complexity of Jumping Block Puzzles (2021)
  • Author(s): Kanzaki Masaaki、Otachi Yota、Uehara Ryuhei
  • Journal Title: Lecture Notes in Computer Science Volume: 13025 Pages: 655-667
  • DOI: 10.1007/978-3-030-89543-3_54
  • ISBN: 9783030895426, 9783030895433
  • Peer Reviewed
• [Journal Article] Reconfiguring Directed Trees in a Digraph (2021)
  • Author(s): Ito Takehiro、Iwamasa Yuni、Kobayashi Yasuaki、Nakahata Yu、Otachi Yota、Wasa Kunihiro
  • Journal Title: Lecture Notes in Computer Science Volume: 13025 Pages: 343-354
  • DOI: 10.1007/978-3-030-89543-3_29
  • ISBN: 9783030895426, 9783030895433
  • Peer Reviewed
• [Journal Article] Distributed Reconfiguration of Spanning Trees (2021)
  • Author(s): Yamauchi Yukiko、Kamiyama Naoyuki、Otachi Yota
  • Journal Title: Lecture Notes in Computer Science Volume: 13046 Pages: 516-520
  • DOI: 10.1007/978-3-030-91081-5_40
  • ISBN: 9783030910808, 9783030910815
  • Peer Reviewed
• [Journal Article] Token Sliding on Split Graphs (2020)
  • Author(s): Belmonte Remy、Kim Eun Jung、Lampis Michael、Mitsou Valia、Otachi Yota、Sikora Florian
  • Journal Title: Theory of Computing Systems Volume: Online Issue: 4 Pages: 662-686
  • DOI: 10.1007/s00224-020-09967-8
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Presentation] Finding induced subgraphs from graphs with small mim-width (2024)
  • Author(s): Yota Otachi, Akira Suzuki, Yuma Tamura
  • Organizer: The 19th Scandinavian Symposium on Algorithm Theory (SWAT 2024)
  • Int'l Joint Research
• [Presentation] Structural parameterizations of vertex integrity (2024)
  • Author(s): Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi
  • Organizer: The 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024)
  • Int'l Joint Research
• [Presentation] On the complexity of List H-Packing for sparse graph classes (2024)
  • Author(s): Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
  • Organizer: The 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024)
  • Int'l Joint Research
• [Presentation] Dichotomies for Tree Minor Containment with structural parameters (2024)
  • Author(s): Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi
  • Organizer: The 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024)
  • Int'l Joint Research
• [Presentation] Orientable burning number of graphs (2024)
  • Author(s): Julien Courtiel, Paul Dorbec, Tatsuya Gima, Romain Lecoq, Yota Otachi
  • Organizer: The 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024)
  • Int'l Joint Research
• [Presentation] Grouped domination parameterized by vertex cover, twin cover, and beyond (2023)
  • Author(s): Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda
  • Organizer: The 13th International Conference on Algorithms and Complexity (CIAC 2023)
  • Int'l Joint Research
• [Presentation] Sequentially swapping tokens: Further on graph classes (2023)
  • Author(s): Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi.
  • Organizer: The 48th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2023).
  • Int'l Joint Research
• [Presentation] A framework to design approximation algorithms for finding diverse solutions in combinatorial problems. (2023)
  • Author(s): Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi.
  • Organizer: The 37th AAAI Conference on Artificial Intelligence (AAAI 2023).
  • Int'l Joint Research
• [Presentation] Sorting balls and water: Equivalence and computational complexity (2022)
  • Author(s): Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka.
  • Organizer: The 11th International Conference on Fun with Algorithms (FUN 2022).
  • Int'l Joint Research
• [Presentation] Independent set reconfiguration on directed graphs (2022)
  • Author(s): Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
  • Organizer: The 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022).
  • Int'l Joint Research
• [Presentation] Parameterized complexity of non-separating and non-disconnecting paths and sets (2022)
  • Author(s): Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket Saurabh.
  • Organizer: The 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022).
  • Int'l Joint Research
• [Presentation] Algorithmic meta-theorems for combinatorial reconfiguration revisited (2022)
  • Author(s): Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi.
  • Organizer: The 30th European Symposium on Algorithms (ESA 2022).
  • Int'l Joint Research
• [Presentation] Extended MSO model checking via small vertex integrity (2022)
  • Author(s): Tatsuya Gima, Yota Otachi.
  • Organizer: The 33rd International Symposium on Algorithms and Computation (ISAAC 2022).
  • Int'l Joint Research
• [Presentation] Computing diverse shortest paths efficiently: A theoretical and experimental study (2022)
  • Author(s): Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi
  • Organizer: The 36th AAAI Conference on Artificial Intelligence (AAAI 2022)
  • Int'l Joint Research
• [Presentation] Reconfiguration of regular induced subgraphs (2022)
  • Author(s): Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
  • Organizer: The 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022)
  • Int'l Joint Research
• [Presentation] Exploring the gap between treedepth and vertex cover through vertex integrity (2021)
  • Author(s): Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
  • Organizer: The 12th International Conference on Algorithms and Complexity (CIAC 2021)
  • Int'l Joint Research
• [Presentation] Computational complexity of jumping block puzzles (2021)
  • Author(s): Masaaki Kanzaki, Yota Otachi, Ryuhei Uehara
  • Organizer: The 27th International Computing and Combinatorics Conference (COCOON 2021)
  • Int'l Joint Research
• [Presentation] Reconfiguring directed trees in a digraph (2021)
  • Author(s): Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
  • Organizer: The 27th International Computing and Combinatorics Conference (COCOON 2021)
  • Int'l Joint Research
• [Presentation] Distributed reconfiguration of spanning trees (2021)
  • Author(s): Yukiko Yamauchi, Naoyuki Kamiyama, Yota Otachi
  • Organizer: The 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2021)
  • Int'l Joint Research