Otachi Yota 大舘陽太

… Alternative Names

OTACHI Yota 大舘陽太

Less

Researcher Number	80610196
Other IDs
Affiliation (Current)	2025: 名古屋大学, 情報学研究科, 准教授
Affiliation (based on the past Project Information) *help	2019 – 2025: 名古屋大学, 情報学研究科, 准教授 2018 – 2019: 熊本大学, 大学院先端科学研究部(工), 准教授 2016: 北陸先端科学技術大学院大学, 先端科学技術研究科, 助教 2012 – 2016: 北陸先端科学技術大学院大学, 情報科学研究科, 助教 2011: 東北大学, 大学院・情報科学研究科, 助教
Review Section/Research Field	Principal Investigator Basic Section 60010:Theory of informatics-related / Sections That Are Subject to Joint Review: Basic Section60010:Theory of informatics-related , Basic Section60020:Mathematical informatics-related / Basic Section 60020:Mathematical informatics-related / Theory of informatics / Fundamental theory of informatics Except Principal Investigator Medium-sized Section 60:Information science, computer engineering, and related fields / Transformative Research Areas, Section (IV) / Basic Section 60010:Theory of informatics-related / Science and Engineering / Fundamental theory of informatics
Keywords	Principal Investigator グラフアルゴリズム / FPTアルゴリズム / 木幅 / 固定パラメータ容易性 / パラメータ化計算量 / グラフパラメータ / グラフ構造パラメータ / 固定パラメータ容易アルゴリズム / 木構造 / 計算量二分法 … More / 禁止部分グラフ / 木距離幅 / アルゴリズム理論 / グラフ幅パラメータ / グラフ同型性判定問題 / 指数時間アルゴリズム / 固定パラメータ計算量 / グラフクラス / 全域木混雑度 / 計算複雑性 / 全域木混雑度問題 … More Except Principal Investigator グラフアルゴリズム / アルゴリズム / 計算幾何学 / 列挙アルゴリズム / 組合せ遷移 / パス幅 / 木幅 / 計算量 / 作業領域 / 省メモリ / グラフ理論 / 実問題への応用 / 実用的アルゴリズム / 固定パラメータアルゴリズム / PSPACE完全 / 近似アルゴリズム / パラメータ化計算量 / 多項式階層 / グラフ最適化 / 局所構造 / パラメータ化アルゴリズム / 均衡計算 / 組合せ最適化 / 分散アルゴリズム / BDD / 遷移問題 / 計算幾何 / 離散数学 / 離散構造 / 二部決定ダイアグラム / 組合せ遷移問題 / 高速アルゴリズム / 計算折り紙 / 計算複雑性 / 二部決定図（BDD) / データ構造 / 計算量の理論 / モジュラ幅 / 固定パラメータ容易性 / 頂点インテグリティ / 固定パラメータ容易アルゴリズム / 固定パラメータ困難問題 / 下界 / 問題の下界 / 格子グラフ / 最短経路問題 / 計算複雑度 / 最短経路発見問題 / 直近上位要素発見問題 / トレードオフ / アルゴリズム設計 / 深さ優先探索 / 画像処理 / 省メモリアルゴリズム Less

グラフ分解手法と問題記法の多様化による実践的アルゴリズム自動生成Principal Investigator
- Principal Investigator
  
  大舘陽太
- Project Period (FY)
  2025 – 2029
- Research Category
  
  Grant-in-Aid for Scientific Research (B)
- Review Section
  
  Basic Section 60010:Theory of informatics-related
  Basic Section 60020:Mathematical informatics-related
  Sections That Are Subject to Joint Review: Basic Section60010:Theory of informatics-related , Basic Section60020:Mathematical informatics-related
- Research Institution
  Nagoya University
Making treewidth and pathwidth practical
- Principal Investigator
  
  玉木久夫
- Project Period (FY)
  2024 – 2027
- Research Category
  
  Grant-in-Aid for Scientific Research (A)
- Review Section
  
  Medium-sized Section 60:Information science, computer engineering, and related fields
- Research Institution
  Meiji University
超スマート社会時代のアルゴリズム工学 - パラメータ化近似均衡計算
- Principal Investigator
  
  小野廣隆
- Project Period (FY)
  2022 – 2026
- Research Category
  
  Grant-in-Aid for Scientific Research (A)
- Review Section
  
  Medium-sized Section 60:Information science, computer engineering, and related fields
- Research Institution
  Nagoya University
Refining the graph parameter hierarchy for fine-grained algorithmsPrincipal Investigator
- Principal Investigator
  
  大舘陽太
- Project Period (FY)
  2021 – 2025
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60010:Theory of informatics-related
- Research Institution
  Nagoya University
Computer Science Approach for Expanding Combinatorial Reconfiguration: Toward Automatic Generation of Algorithms
- Principal Investigator
  
  ITO Takehiro
- Project Period (FY)
  2020 – 2022
- Research Category
  
  Grant-in-Aid for Transformative Research Areas (B)
- Review Section
  
  Transformative Research Areas, Section (IV)
- Research Institution
  Tohoku University
Speeding up FPT algorithms with special tree decompositionsPrincipal Investigator
- Principal Investigator
  
  Otachi Yota
- Project Period (FY)
  2018 – 2021
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60010:Theory of informatics-related
- Research Institution
  Nagoya University
  Kumamoto University
General algorithms for fixed-parameter intractable problems
- Principal Investigator
  
  Kiyomi Masashi
- Project Period (FY)
  2018 – 2022
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60010:Theory of informatics-related
- Research Institution
  Seikei University
  Yokohama City University
Research on algorithms and data structures for solving theoretically hard problems in practical time
- Principal Investigator
  
  Uehara Ryuhei
- Project Period (FY)
  2018 – 2022
- Research Category
  
  Grant-in-Aid for Scientific Research (A)
- Review Section
  
  Medium-sized Section 60:Information science, computer engineering, and related fields
- Research Institution
  Japan Advanced Institute of Science and Technology
Fixed width parameter algorithms for the graph isomorphism problemPrincipal Investigator
- Principal Investigator
  
  Otachi Yota
- Project Period (FY)
  2013 – 2015
- Research Category
  
  Grant-in-Aid for Young Scientists (B)
- Research Field
  
  Theory of informatics
- Research Institution
  Japan Advanced Institute of Science and Technology
Exploring the Limits of Computation in the Scenario of Constrained Work Space
- Principal Investigator
  
  Asano Tetsuo
- Project Period (FY)
  2012 – 2016
- Research Category
  
  Grant-in-Aid for Scientific Research on Innovative Areas (Research in a proposed research area)
- Review Section
  
  Science and Engineering
- Research Institution
  Japan Advanced Institute of Science and Technology
Development of Algorithmic Paradigms on Memory-Constrained Computation
- Principal Investigator
  
  ASANO Tetsuo
- Project Period (FY)
  2011 – 2014
- Research Category
  
  Grant-in-Aid for Scientific Research (B)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Japan Advanced Institute of Science and Technology
Designing low-congestion sparse networksPrincipal Investigator
- Principal Investigator
  
  OTACHI Yota
- Project Period (FY)
  2011 – 2012
- Research Category
  
  Grant-in-Aid for Research Activity Start-up
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Japan Advanced Institute of Science and Technology
  Tohoku University

All 2024 2023 2022 2021 2020 2019 2018 2016 2015 2014 2013 2012 2011 Other

All Journal Article Presentation

[Journal Article] Collecting Balls on a Line by Robots with Limited Energy2024
- Author(s)
  HANAKA Tesshu、HONORATO DROGUETT Nicolas、KURITA Kazuhiro、ONO Hirotaka、OTACHI Yota
- Journal Title
  
  IEICE Trans. Inf. & Syst.
  
  Volume: E107.D Issue: 3 Pages: 325-327
- DOI
  10.1587/transinf.2023FCL0003
- ISSN
  0916-8532, 1745-1361
- Year and Date
  2024-03-01
- Language
  English
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-21K19765, KAKENHI-PROJECT-21K17812, KAKENHI-PROJECT-21K11752, KAKENHI-PLANNED-20H05793, KAKENHI-PROJECT-23K24806
[Journal Article] Computational complexity of jumping block puzzles2024
- Author(s)
  Masaaki Kanzaki, Yota Otachi, Giovanni Viglietta, Ryuhei Uehara
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 983 Pages: 114292-114292
- DOI
  10.1016/j.tcs.2023.114292
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-20H05793
[Journal Article] Finding induced subgraphs from graphs with small mim-width2024
- Author(s)
  Yota Otachi, Akira Suzuki, Yuma Tamura
- Journal Title
  
  Proc. of 19th Scandinavian Symposium on Algorithm Theory (SWAT 2024), Leibniz International Proceedings in Informatics
  
  Volume: 294
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PLANNED-20H05793
[Journal Article] Dichotomies for Tree Minor Containment with Structural Parameters2024
- 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
- Data Source
  KAKENHI-PROJECT-21K17812, KAKENHI-PROJECT-23KJ1066, KAKENHI-PROJECT-21K11752, KAKENHI-PLANNED-20H05793
[Journal Article] On a Spectral Lower Bound of Treewidth2024
- Author(s)
  GIMA Tatsuya、HANAKA Tesshu、NORO Kohei、ONO Hirotaka、OTACHI Yota
- Journal Title
  
  IEICE Trans. Inf. & Syst.
  
  Volume: E107.D Issue: 3 Pages: 328-330
- DOI
  10.1587/transinf.2023FCL0002
- ISSN
  0916-8532, 1745-1361
- Year and Date
  2024-03-01
- Language
  English
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-21K19765, KAKENHI-PROJECT-21K17707, KAKENHI-PROJECT-23KJ1066, KAKENHI-PROJECT-21K11752, KAKENHI-PLANNED-20H05793
[Journal Article] On the Complexity of List $$\mathcal H$$-Packing for Sparse Graph Classes2024
- 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
- Data Source
  KAKENHI-PROJECT-21K17707, KAKENHI-PROJECT-23KJ1066, KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-20K11666, KAKENHI-PROJECT-21K21278, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05794, KAKENHI-PROJECT-23K28034
[Journal Article] Orientable Burning Number of Graphs2024
- 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
- Data Source
  KAKENHI-PROJECT-23KJ1066, KAKENHI-PROJECT-21K11752, KAKENHI-PLANNED-20H05793
[Journal Article] Structural Parameterizations of Vertex Integrity2024
- 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
- Data Source
  KAKENHI-PROJECT-21K19765, KAKENHI-PROJECT-21K17707, KAKENHI-PROJECT-23KJ1066, KAKENHI-PROJECT-21K11752, KAKENHI-PLANNED-20H05793, KAKENHI-PROJECT-23K28034
[Journal Article] Finding a Reconfiguration Sequence between Longest Increasing Subsequences2024
- Author(s)
  Yuuki Aoike, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
- Journal Title
  
  IEICE Trans. Inf. & Syst.
  
  Volume: E107.D Issue: 4 Pages: 559-563
- DOI
  10.1587/transinf.2023EDL8067
- ISSN
  0916-8532, 1745-1361
- Year and Date
  2024-04-01
- Language
  English
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PLANNED-20H05793, KAKENHI-PROJECT-23K28034
[Journal Article] Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond2023
- 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
- Data Source
  KAKENHI-PROJECT-21K19765, KAKENHI-PROJECT-21K17707, KAKENHI-PROJECT-21K11752
[Journal Article] A framework to design approximation algorithms for finding diverse solutions in combinatorial problems2023
- Author(s)
  Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
- Journal Title
  
  Proc. of 37th AAAI Conference on Artificial Intelligence (AAAI 2023), AAAI-23 Technical Tracks 4
  
  Volume: 37 Issue: 4 Pages: 3968-3976
- DOI
  10.1609/aaai.v37i4.25511
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-22H00513
[Journal Article] Sorting balls and water: Equivalence and computational complexity2023
- 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
- Data Source
  KAKENHI-PROJECT-18K11150, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-19K12098, KAKENHI-PROJECT-20K11666, KAKENHI-PLANNED-20H05962, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05794, KAKENHI-PROJECT-18H04091, KAKENHI-PLANNED-20H05964
[Journal Article] Sequentially Swapping Tokens: Further on Graph Classes2023
- 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
- Data Source
  KAKENHI-PROJECT-21K11752, KAKENHI-PLANNED-20H05967, KAKENHI-PROJECT-21K21283, KAKENHI-PLANNED-20H05793, KAKENHI-PROJECT-22H00513
[Journal Article] Reconfiguration of cliques in a graph2023
- 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
- Data Source
  KAKENHI-PROJECT-21K19765, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-21K11752, KAKENHI-PLANNED-20H05793, KAKENHI-PROJECT-18H04091
[Journal Article] Reconfiguring (non-spanning) arborescences2023
- 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
- Data Source
  KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-22K17851, KAKENHI-PROJECT-20K23323, KAKENHI-PROJECT-20K19742, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05794, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-22H00513
[Journal Article] Extended MSO Model Checking via Small Vertex Integrity2023
- Author(s)
  Gima Tatsuya、Otachi Yota
- Journal Title
  
  Algorithmica
  
  Volume: 86 Issue: 1 Pages: 147-170
- DOI
  10.1007/s00453-023-01161-9
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23KJ1066, KAKENHI-PLANNED-20H05793
[Journal Article] Reconfiguration of Regular Induced Subgraphs2022
- 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
- Data Source
  KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-19K20350, KAKENHI-PROJECT-20K19742, KAKENHI-PLANNED-20H05793
[Journal Article] Sorting balls and water: Equivalence and computational complexity2022
- 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
  
  The 11th International Conference on Fun with Algorithms (FUN 2022), Leibniz International Proceedings in Informatics
  
  Volume: 226
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-22H00513
[Journal Article] Parameterized Complexity of Graph Burning2022
- 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
- Data Source
  KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-20H00595, KAKENHI-PROJECT-20K19742, KAKENHI-PLANNED-20H05793, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-22H00513
[Journal Article] Finding shortest non-separating and non-disconnecting paths2022
- Author(s)
  Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi
- Journal Title
  
  arXiv
  
  Volume: --
- Open Access
- Data Source
  KAKENHI-PLANNED-20H05793
[Journal Article] Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study2022
- 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
- Data Source
  KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-21K17812, KAKENHI-PUBLICLY-21H05861, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05962
[Journal Article] Linear-Time Recognition of Double-Threshold Graphs2022
- 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
- Data Source
  KAKENHI-PROJECT-17K00017, KAKENHI-PROJECT-20K11670, KAKENHI-PROJECT-21K11752, KAKENHI-PLANNED-20H05964, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091
[Journal Article] An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion2022
- 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
- Data Source
  KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-20K11692, KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-20H00595, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-20K19742, KAKENHI-PLANNED-20H05962, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091
[Journal Article] Sorting balls and water: Equivalence and computational complexity2022
- 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
- Data Source
  KAKENHI-PROJECT-21K11752
[Journal Article] Algorithmic meta-theorems for combinatorial reconfiguration revisited2022
- Author(s)
  Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi
- Journal Title
  
  Proc. of 30th Annual European Symposium on Algorithms (ESA 2022), Leibniz International Proceedings in Informatics
  
  Volume: 244
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PLANNED-20H05793
[Journal Article] Parameterized complexity of non-separating and non-disconnecting paths and sets2022
- Author(s)
  Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket Saurabh
- Journal Title
  
  The 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), Leibniz International Proceedings in Informatics
  
  Volume: 241
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-22H00513
[Journal Article] Extended MSO model checking via small vertex integrity2022
- Author(s)
  Tatsuya Gima, Yota Otachi
- Journal Title
  
  The 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics
  
  Volume: 248
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-22H00513
[Journal Article] Parameterized complexity of non-separating and non-disconnecting paths and sets2022
- 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
- Data Source
  KAKENHI-PROJECT-21K11752
[Journal Article] A framework to design approximation algorithms for finding diverse solutions in combinatorial problems2022
- Author(s)
  Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
- Journal Title
  
  arXiv
  
  Volume: --
- Open Access
- Data Source
  KAKENHI-PLANNED-20H05793
[Journal Article] Grundy Distinguishes Treewidth from Pathwidth2022
- 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
- Data Source
  KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-22H00513
[Journal Article] Algorithmic meta-theorems for combinatorial reconfiguration revisited2022
- Author(s)
  Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi
- Journal Title
  
  Leibniz International Proceedings in Informatics
  
  Volume: 244
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-21K11752
[Journal Article] Exploring the gap between treedepth and vertex cover through vertex integrity2022
- 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
- Data Source
  KAKENHI-PROJECT-21K17707, KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-20H00595, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-20K19742
[Journal Article] Independent set reconfiguration on directed graphs2022
- 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
- Data Source
  KAKENHI-PROJECT-21K11752
[Journal Article] Independent set reconfiguration on directed graphs2022
- Author(s)
  Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
- Journal Title
  
  Proc. of 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), Leibniz International Proceedings in Informatics
  
  Volume: 241
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PLANNED-20H05793
[Journal Article] Independent set reconfiguration on directed graphs2022
- Author(s)
  Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
- Journal Title
  
  arXiv
  
  Volume: --
- Open Access
- Data Source
  KAKENHI-PLANNED-20H05793
[Journal Article] Algorithmic meta-theorems for combinatorial reconfiguration revisited2022
- Author(s)
  Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi
- Journal Title
  
  The 30th European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics
  
  Volume: 244
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-22H00513
[Journal Article] Sorting balls and water: Equivalence and computational complexity2022
- 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
  
  Proc. of 11th International Conference on Fun with Algorithms (FUN 2022), Leibniz International Proceedings in Informatics
  
  Volume: 226
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PLANNED-20H05793
[Journal Article] Independent set reconfiguration on directed graphs2022
- Author(s)
  Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
- Journal Title
  
  The 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), Leibniz International Proceedings in Informatics
  
  Volume: 241
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-22H00513
[Journal Article] Extended MSO model checking via small vertex integrity2022
- Author(s)
  Tatsuya Gima, Yota Otachi
- Journal Title
  
  Proc. of 33rd International Symposium on Algorithms and Computation (ISAAC 2022), Leibniz International Proceedings in Informatics
  
  Volume: 248
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PLANNED-20H05793
[Journal Article] Extended MSO model checking via small vertex integrity2022
- Author(s)
  Tatsuya Gima, Yota Otachi
- Journal Title
  
  Leibniz International Proceedings in Informatics
  
  Volume: 248
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-21K11752
[Journal Article] Sorting balls and water: equivalence and computational complexity2022
- 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
  
  arXiv
  
  Volume: --
- Open Access
- Data Source
  KAKENHI-PLANNED-20H05793
[Journal Article] Parameterized complexity of non-separating and non-disconnecting paths and sets2022
- Author(s)
  Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket Saurabh
- Journal Title
  
  Proc. of 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), Leibniz International Proceedings in Informatics
  
  Volume: 241
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05793
[Journal Article] On the security number of the Cartesian product of graphs2021
- 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
- Data Source
  KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-21K11752, KAKENHI-PLANNED-20H05793, KAKENHI-PROJECT-18H04091
[Journal Article] Longest common subsequence in sublinear space2021
- 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
- Data Source
  KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-21K11752, KAKENHI-PLANNED-20H05793, KAKENHI-PROJECT-18H04091
[Journal Article] Exploring the Gap Between Treedepth and Vertex Cover Through Vertex?Integrity2021
- 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
- Data Source
  KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-21K11752, KAKENHI-PLANNED-20H05793
[Journal Article] Low-congestion shortcut and graph parameters2021
- 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
- Data Source
  KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-19K11824, KAKENHI-PROJECT-21K11752, KAKENHI-PLANNED-20H05793, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-20H04139
[Journal Article] Reconfiguring Directed Trees in a Digraph2021
- 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
- Data Source
  KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-19K20350, KAKENHI-PROJECT-20K19742, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795
[Journal Article] Finding diverse trees, paths, and more2021
- Author(s)
  Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi
- Journal Title
  
  Proc. of the AAAI Conference on Artificial Intelligence (AAAI 2021)
  
  Volume: 35 Issue: 5 Pages: 3778-3786
- DOI
  10.1609/aaai.v35i5.16495
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PLANNED-20H05793
[Journal Article] Parameterized Complexity of $$(A,\ell )$$-Path Packing2021
- 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
- Data Source
  KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-20K19742, KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-20H00595, KAKENHI-PLANNED-20H05967, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091
[Journal Article] Distributed Reconfiguration of Spanning Trees2021
- 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
- Data Source
  KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-21K11752, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795
[Journal Article] Computational Complexity of Jumping Block Puzzles2021
- 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
- Data Source
  KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-21K11752, KAKENHI-PLANNED-20H05793
[Journal Article] Reconfiguration of regular induced subgraphs2021
- Author(s)
  Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
- Journal Title
  
  arXiv
  
  Volume: --
- Open Access
- Data Source
  KAKENHI-PLANNED-20H05793
[Journal Article] Parameterized Complexity of (A,l)-Path Packing2020
- Author(s)
  Belmonte Remy、Hanaka Tesshu、Kanzaki Masaaki、Kiyomi Masashi、Kobayashi Yasuaki、Kobayashi Yusuke、Lampis Michael、Ono Hirotaka、Otachi Yota
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 12126 Pages: 43-55
- DOI
  10.1007/978-3-030-48966-3_4
- ISBN
  9783030489656, 9783030489663
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-20K19742, KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-17H01698
[Journal Article] Parameterized Complexity of Safe Set2020
- Author(s)
  Belmonte Remy、Hanaka Tesshu、Katsikarelis Ioannis、Lampis Michael、Ono Hirotaka、Otachi Yota
- Journal Title
  
  Journal of Graph Algorithms and Applications
  
  Volume: 24 Issue: 3 Pages: 215-245
- DOI
  10.7155/jgaa.00528
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-18K11157, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-17H01698
[Journal Article] Independent Set Reconfguration Parameterized by Modular-Width2020
- Author(s)
  Remy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
- Journal Title
  
  Algorithmica
  
  Volume: - Issue: 9 Pages: 2586-2605
- DOI
  10.1007/s00453-020-00700-y
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-17H01698, KAKENHI-PROJECT-18K11157, KAKENHI-PROJECT-18H04091
[Journal Article] Token Sliding on Split Graphs2020
- 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
- Data Source
  KAKENHI-PROJECT-18K11157, KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-21K11752
[Journal Article] Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces2020
- Author(s)
  Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, Andre van Renssene, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno
- Journal Title
  
  Computational Geometry: Theory and Applications
  
  Volume: 90 Pages: 1-11
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04091
[Journal Article] Linear-Time Recognition of Double-Threshold Graphs2020
- Author(s)
  Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 12301 Pages: 286-297
- DOI
  10.1007/978-3-030-60440-0_23
- ISBN
  9783030604394, 9783030604400
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-17K00017, KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-20K11670
[Journal Article] Parameterized Orientable Deletion2020
- Author(s)
  Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
- Journal Title
  
  Algorithmica
  
  Volume: - Issue: 7 Pages: 1909-1938
- DOI
  10.1007/s00453-020-00679-6
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-18H04091
[Journal Article] Parameterized complexity of graph burning2020
- Author(s)
  Yasuaki Kobayashi, Yota Otachi
- Journal Title
  
  Leibniz International Proceedings in Informatics
  
  Volume: 180
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-18K11169
[Journal Article] <i>K</i><sub>3</sub> Edge Cover Problem in a Wide Sense2020
- Author(s)
  Chiba Kyohei、Belmonte Remy、Ito Hiro、Lampis Michael、Nagao Atsuki、Otachi Yota
- Journal Title
  
  Journal of Information Processing
  
  Volume: 28 Issue: 0 Pages: 849-858
- DOI
  10.2197/ipsjjip.28.849
- NAID
  130007956350
- ISSN
  1882-6652
- Language
  English
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-20K11671, KAKENHI-PROJECT-18K11157, KAKENHI-PROJECT-18H04091
[Journal Article] Grundy distinguishes treewidth from pathwidth2020
- Author(s)
  Remy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
- Journal Title
  
  Leibniz International Proceedings in Informatics
  
  Volume: 173
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11169
[Journal Article] Symmetric assembly puzzles are hard, beyond a few pieces2020
- Author(s)
  Demaine Erik D.、Korman Matias、Ku Jason S.、Mitchell Joseph S.B.、Otachi Yota、van Renssen Andr?、Roeloffzen Marcel、Uehara Ryuhei、Uno Yushi
- Journal Title
  
  Computational Geometry
  
  Volume: 90 Pages: 101648-101648
- DOI
  10.1016/j.comgeo.2020.101648
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169
[Journal Article] Parameterized complexity of graph burning2020
- Author(s)
  Yasuaki Kobayashi, Yota Otachi
- Journal Title
  
  Leibniz International Proceedings in Informatics
  
  Volume: 180
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-18K11168
[Journal Article] Sublinear-space lexicographic depth-first search for bounded treewidth graphs and planar graphs2020
- Author(s)
  Taisuke Izumi, Yota Otachi
- Journal Title
  
  Leibniz International Proceedings in Informatics
  
  Volume: 168
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-18K11168
[Journal Article] An improved deterministic parameterized algorithm for cactus vertex deletion2020
- Author(s)
  Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
- Journal Title
  
  arXiv
  
  Volume: --
- Open Access
- Data Source
  KAKENHI-PLANNED-20H05793
[Journal Article] Sublinear‐space lexicographic depth‐first search for bounded treewidth graphs and planar2020
- Author(s)
  Taisuke Izumi, Yota Otachi
- Journal Title
  
  Leibniz International Proceedings in Informatics
  
  Volume: 168
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-18K11169
[Journal Article] Subgraph Isomorphism on Graph Classes that Exclude a Substructure2020
- Author(s)
  Bodlaender Hans L.、Hanaka Tesshu、Kobayashi Yasuaki、Kobayashi Yusuke、Okamoto Yoshio、Otachi Yota、van der Zanden Tom C.
- Journal Title
  
  Algorithmica
  
  Volume: 82 Issue: 12 Pages: 3566-3587
- DOI
  10.1007/s00453-020-00737-z
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-20K11670, KAKENHI-PROJECT-20K19742, KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-18H04091
[Journal Article] Grundy distinguishes treewidth from pathwidth2020
- Author(s)
  Remy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
- Journal Title
  
  Leibniz International Proceedings in Informatics
  
  Volume: 173
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168
[Journal Article] Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph2020
- Author(s)
  Alessio Conte, Mamadou Moustapha Kante, Yota Otachi, Takeaki Uno, Kunihiro Wasa
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 818 Pages: 2-11
- DOI
  10.1016/j.tcs.2018.08.009
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-19H01133
[Journal Article] Low-congestion shortcut and graph parameters2019
- Author(s)
  Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi
- Journal Title
  
  Leibniz International Proceedings in Informatics
  
  Volume: 146
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-18K11169
[Journal Article] On Computational Complexity of Pipe Puzzles2019
- Author(s)
  SHIRAYAMA Takumu、SHIGEMURA Takuto、OTACHI Yota、MIYAZAKI Shuichi、UEHARA Ryuhei
- Journal Title
  
  IEICE Trans. Fundamentals
  
  Volume: E102.A Issue: 9 Pages: 1134-1141
- DOI
  10.1587/transfun.E102.A.1134
- NAID
  130007699569
- ISSN
  0916-8508, 1745-1337
- Year and Date
  2019-09-01
- Language
  English
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-20K20311
[Journal Article] How Bad is the Freedom to Flood-It?2019
- Author(s)
  Belmonte Remy、Khosravian Ghadikolaei Mehdi、Kiyomi Masashi、Lampis Michael、Otachi Yota
- Journal Title
  
  Journal of Graph Algorithms and Applications
  
  Volume: 23 Issue: 2 Pages: 111-134
- DOI
  10.7155/jgaa.00486
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11157, KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-18H04091
[Journal Article] Token sliding on split graphs2019
- Author(s)
  Remy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
- Journal Title
  
  Leibniz International Proceedings in Informatics
  
  Volume: 126
- DOI
  10.4230/LIPICS.STACS.2019.13
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169
[Journal Article] A lower bound on opaque sets2019
- Author(s)
  Kawamura Akitoshi、Moriyama Sonoko、Otachi Yota、Pach J?nos
- Journal Title
  
  Computational Geometry
  
  Volume: 80 Pages: 13-22
- DOI
  10.1016/j.comgeo.2019.01.002
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-18H04091
[Journal Article] Low-congestion shortcut and graph parameters2019
- Author(s)
  Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi
- Journal Title
  
  Leibniz International Proceedings in Informatics
  
  Volume: 146
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-18K11168
[Journal Article] Independent Set Reconfiguration Parameterized by Modular-Width2019
- Author(s)
  Belmonte Remy、Hanaka Tesshu、Lampis Michael、Ono Hirotaka、Otachi Yota
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 11789 Pages: 285-297
- DOI
  10.1007/978-3-030-30786-8_22
- ISBN
  9783030307851, 9783030307868
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-17H01698
[Journal Article] Reconfiguration of colorable sets in classes of perfect graphs2019
- Author(s)
  Ito Takehiro、Otachi Yota
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 772 Pages: 111-122
- DOI
  10.1016/j.tcs.2018.11.024
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-16K00004, KAKENHI-PROJECT-18H04091
[Journal Article] On structural parameterizations of firefighting2019
- Author(s)
  Das Bireswar、Enduri Murali Krishna、Kiyomi Masashi、Misra Neeldhara、Otachi Yota、Reddy I. Vinod、Yoshimura Shunya
- Journal Title
  
  Theoretical Computer Science
  
  Volume: - Pages: 79-90
- DOI
  10.1016/j.tcs.2019.02.032
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-18H04091
[Journal Article] Space-Efficient Algorithms for Longest Increasing Subsequence2019
- Author(s)
  Kiyomi Masashi、Ono Hirotaka、Otachi Yota、Schweitzer Pascal、Tarui Jun
- Journal Title
  
  Theory of Computing Systems
  
  Volume: - Issue: 3 Pages: 522-541
- DOI
  10.1007/s00224-018-09908-6
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-17H01698
[Journal Article] Computational Complexity of Robot Arm Simulation Problems2018
- Author(s)
  Feng Tianfeng、Horiyama Takashi、Okamoto Yoshio、Otachi Yota、Saitoh Toshiki、Uno Takeaki、Uehara Ryuhei
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 10979 Pages: 177-188
- DOI
  10.1007/978-3-319-94667-2_15
- ISBN
  9783319946665, 9783319946672
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-15K00009, KAKENHI-PROJECT-16K16006
[Journal Article] Reconfiguration of colorable sets in classes of perfect graphs2018
- Author(s)
  Takehiro Ito, Yota Otachi
- Journal Title
  
  Leibniz International Proceedings in Informatics
  
  Volume: 101
- DOI
  10.4230/LIPIcs.SWAT.2018.27
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-16K00004
[Journal Article] Swapping colored token on graphs2018
- Author(s)
  K. Yamanaka, T. Horiyama, J. M. Keil, D. G. Kirkpatrick, Y. Otachi, T. Saitoh, R. Uehara and Y. Uno
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 729 Pages: 1-10
- DOI
  10.1016/j.tcs.2018.03.016
- NAID
  120005850327
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17K00017, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-16K00002, KAKENHI-PROJECT-16K16006, KAKENHI-PROJECT-20K20311
[Journal Article] A faster parameterized algorithm for Pseudoforest Deletion2018
- Author(s)
  Hans L. Bodlaender , Hirotaka Ono, Yota Otachi
- Journal Title
  
  Discrete Applied Mathematics
  
  Volume: 236 Pages: 42-56
- DOI
  10.1016/j.dam.2017.10.018
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-17H01698, KAKENHI-PROJECT-26540005, KAKENHI-PROJECT-18H04091
[Journal Article] Vertex deletion problems on chordal graphs2018
- Author(s)
  Cao Yixin、Ke Yuping、Otachi Yota、You Jie
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 745 Pages: 75-86
- DOI
  10.1016/j.tcs.2018.05.039
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04091
[Journal Article] On the Classes of Interval Graphs of Limited Nesting and Count of Lengths2018
- Author(s)
  Klavik Pavel、Otachi Yota、Sejnoha Jiri
- Journal Title
  
  Algorithmica
  
  Volume: 81 Issue: 4 Pages: 1490-1511
- DOI
  10.1007/s00453-018-0481-y
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04091
[Journal Article] Parameterized Orientable Deletion2018
- Author(s)
  Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
- Journal Title
  
  Leibniz International Proceedings in Informatics
  
  Volume: 101
- DOI
  10.4230/LIPIcs.SWAT.2018.24
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169
[Journal Article] Finding a chain graph in a bipartite permutation graph2016
- Author(s)
  Masashi Kiyomi, Yota Otachi
- Journal Title
  
  Information Processing Letters
  
  Volume: 印刷中 Issue: 9 Pages: 569-573
- DOI
  10.1016/j.ipl.2016.04.006
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PLANNED-24106004, KAKENHI-PROJECT-25730003
[Journal Article] Extending partial representations of proper and unit interval graphs2016
- Author(s)
  Pavel Klavik, Jan Kratochvil, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, and Tomas Vyskocil
- Journal Title
  
  Algorithmica
  
  Volume: to appear Issue: 4 Pages: 1071-1104
- DOI
  10.1007/s00453-016-0133-z
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-24700130, KAKENHI-PROJECT-25730003, KAKENHI-PROJECT-16K16006
[Journal Article] A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares2016
- Author(s)
  Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno,
- Journal Title
  
  Computational Geometry: Theory and Applications
  
  Volume: 51 Pages: 25-39
- DOI
  10.1016/j.comgeo.2015.10.004
- NAID
  120005954496
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-26330004, KAKENHI-PROJECT-26330009, KAKENHI-PLANNED-24106004, KAKENHI-PLANNED-24106005, KAKENHI-PROJECT-24220003, KAKENHI-PROJECT-25330003, KAKENHI-PROJECT-24700008, KAKENHI-PROJECT-25730003
[Journal Article] Ferrers Dimension of Grid Intersection Graphs2016
- Author(s)
  Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, and Ryuhei Uehara
- Journal Title
  
  Discrete Applied Mathematics
  
  Volume: to appear Pages: 130-135
- DOI
  10.1016/j.dam.2015.05.035
- Peer Reviewed / Open Access / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-24700130, KAKENHI-PROJECT-25730003, KAKENHI-PLANNED-24106004, KAKENHI-PROJECT-26330009, KAKENHI-PROJECT-16K16006
[Journal Article] On the treewidth of toroidal grids2016
- Author(s)
  Yoshio Okamoto, Masashi Kiyomi, and Yota Otachi
- Journal Title
  
  Discrete Applied Mathematics
  
  Volume: 198 Pages: 303-306
- DOI
  10.1016/j.dam.2015.06.027
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-15K00009, KAKENHI-PLANNED-24106004, KAKENHI-PLANNED-24106005, KAKENHI-PROJECT-24220003, KAKENHI-PROJECT-24700008, KAKENHI-PROJECT-25730003
[Journal Article] Polynomial-time algorithms for Subgraph Isomorphism in small graph classes of perfect graphs2016
- Author(s)
  Matsuo Konagaya, Yota Otachi, and Ryuhei Uehara
- Journal Title
  
  Discrete Applied Mathematics
  
  Volume: 199 Pages: 37-45
- DOI
  10.1016/j.dam.2015.01.040
- NAID
  120006380549
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-26330009, KAKENHI-PLANNED-24106004, KAKENHI-PROJECT-25730003
[Journal Article] Linear-Time Algorithm for Sliding Tokens on Trees2015
- Author(s)
  Erik D Demaine, Martin L Demaine, Eli Fox-Epstein, Duc A Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, and Takeshi Yamada
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 600 Pages: 132-142
- DOI
  10.1016/j.tcs.2015.07.037
- NAID
  120006355793
- Peer Reviewed / Acknowledgement Compliant / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-26330009, KAKENHI-PROJECT-26540005, KAKENHI-PUBLICLY-15H00849, KAKENHI-PLANNED-24106004, KAKENHI-PROJECT-25330003, KAKENHI-PROJECT-25730003
[Journal Article] Secure Sets and Defensive Alliances in Graphs: A Faster Algorithm and Improved Bounds2015
- Author(s)
  Kazuyuki Amano, Kyaw May Oo, Yota Otachi, Ryuhei Uehara
- Journal Title
  
  IEICE Trans. Inf. & Syst.
  
  Volume: E98.D Issue: 3 Pages: 486-489
- DOI
  10.1587/transinf.2014FCP0007
- NAID
  130004841873
- ISSN
  0916-8532, 1745-1361
- Language
  English
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PLANNED-24106004, KAKENHI-PROJECT-24500006, KAKENHI-PROJECT-25730003, KAKENHI-PROJECT-26330009
[Journal Article] Completely independent spanning trees in (partial) k-trees2015
- Author(s)
  Masayoshi Matsushita, Yota Otachi, and Toru Araki
- Journal Title
  
  Discussiones Mathematicae Graph Theory
  
  Volume: 35 Issue: 3 Pages: 427-437
- DOI
  10.7151/dmgt.1806
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-24106004, KAKENHI-PROJECT-25730003
[Journal Article] Thin strip graphs2015
- Author(s)
  T. Hayashi, A. Kawamura, Y. Otachi, H. Shinohara, and K. Yamazaki
- Journal Title
  
  Discrete Applied Mathematics, to appear
  
  Volume: - Pages: 203-210
- DOI
  10.1016/j.dam.2015.01.018
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-23240001, KAKENHI-PROJECT-24500007, KAKENHI-PROJECT-25730003, KAKENHI-PLANNED-24106004, KAKENHI-PLANNED-24106002
[Journal Article] Extending partial representations of subclasses of chordal graphs2015
- Author(s)
  Pavel Klavik, Jan Kratochvil, Yota Otachi, and Toshiki Saitoh
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 576 Pages: 85-101
- DOI
  10.1016/j.tcs.2015.02.007
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-24106004, KAKENHI-PROJECT-24700130, KAKENHI-PROJECT-25730003
[Journal Article] A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks2014
- Author(s)
  Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 544 Pages: 14-31
- DOI
  10.1016/j.tcs.2014.04.014
- NAID
  120005893622
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-24106004, KAKENHI-PLANNED-24106005, KAKENHI-PROJECT-24220003, KAKENHI-PROJECT-24700008, KAKENHI-PUBLICLY-25106504, KAKENHI-PROJECT-25330003, KAKENHI-PROJECT-25730003, KAKENHI-PROJECT-26330009
[Journal Article] Lower bounds for treewidth of product graphs2014
- Author(s)
  Kyohei Kozawa, Yota Otachi, Koichi Yamazaki
- Journal Title
  
  Discrete Applied Mathematics
  
  Volume: 162 Pages: 251-258
- DOI
  10.1016/j.dam.2013.08.005
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-24500007, KAKENHI-PROJECT-25730003
[Journal Article] Efficient algorithms for network localization using cores of underlying graphs2014
- Author(s)
  Meng Li, Yota Otachi, Takeshi Tokuyama
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 553 Pages: 18-26
- DOI
  10.1016/j.tcs.2014.02.020
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-24106004, KAKENHI-PROJECT-24650001, KAKENHI-PROJECT-25730003
[Journal Article] Base Location Problems for Base-Monotone Regions2013
- Author(s)
  Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno
- Journal Title
  
  7^<th> International Workshop on Algorithms and Computation
  
  Volume: 7748 Pages: 53-64
- DOI
  10.1007/978-3-642-36065-7_7
- ISBN
  9783642360640, 9783642360657
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-12J07851, KAKENHI-PROJECT-21680001, KAKENHI-PROJECT-22300001, KAKENHI-PROJECT-23700006, KAKENHI-PROJECT-24500008, KAKENHI-PLANNED-24106004, KAKENHI-PLANNED-24106007
[Journal Article] Base-object location problems for base-monotone regions2013
- Author(s)
  J Chun, T. Horiyama, T. Ito, Natsuda Kaothanthong, H. Ono, Y. Otachi, T. Tokuyama, RUehara, and T. Uno
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 555 Pages: 71-84
- DOI
  10.1016/j.tcs.2013.11.030
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-12J07851, KAKENHI-PROJECT-22300001, KAKENHI-PLANNED-24106004, KAKENHI-PLANNED-24106007, KAKENHI-PROJECT-25330002, KAKENHI-PROJECT-25730003, KAKENHI-PROJECT-26330009
[Journal Article] On shortest barriers2013
- Author(s)
  Akitoshi Kawamura, Sonoko Moriyama, and Yota Otachi
- Journal Title
  
  Japan Conference on Discrete and Computational Geometry and Graphs
  
  Volume: 16 Pages: 102-102
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-24106004
[Journal Article] Isomorphism on subgraph-closed graph classes: a complexity dichotomy and intermediate graph classes2013
- Author(s)
  Yota Otachi and Pascal Schweitzer
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 8283 Pages: 111-118
- DOI
  10.1007/978-3-642-45030-3_11
- ISBN
  9783642450297, 9783642450303
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-24106004
[Journal Article] Approximating the path-distance-width for AT-free graphs and graphs in related classes2013
- Author(s)
  Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, and Koichi Yamazaki
- Journal Title
  
  Discrete Applied Mathematics
  
  Volume: -- Pages: 69-77
- DOI
  10.1016/j.dam.2012.11.015
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21700009, KAKENHI-PROJECT-22310089, KAKENHI-PROJECT-23800004, KAKENHI-PLANNED-24106004, KAKENHI-PLANNED-24106005, KAKENHI-PROJECT-24220003, KAKENHI-PROJECT-24700008, KAKENHI-PROJECT-24700130, KAKENHI-PROJECT-25730003
[Journal Article] On the Treewidth of Toroidal Graphs2013
- Author(s)
  Masashi Kiyomi, Yoshio Okamoto, Yota Otachi
- Journal Title
  
  Japan Conference on Discrete and Computational Geometry and Graphs
  
  Volume: 16 Pages: 76-77
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-24106004
[Journal Article] The path-distance-width of hypercubes2013
- Author(s)
  Yota Otachi
- Journal Title
  
  Discussiones Mathematicae Graph Theory
  
  Volume: 33 Issue: 2 Pages: 467-470
- DOI
  10.7151/dmgt.1682
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23800004, KAKENHI-PLANNED-24106004
[Journal Article] Bounded representations of interval and proper interval graphs2013
- Author(s)
  Martin Balko, Pavel Klavik, and Yota Otachi
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 8283 Pages: 535-546
- DOI
  10.1007/978-3-642-45030-3_50
- ISBN
  9783642450297, 9783642450303
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-24106004
[Journal Article] Algorithms for Computing Optimal Image Segmentation using Quadtree Decomposition2012
- Author(s)
  Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, and Takeaki Uno
- Journal Title
  
  Proc. Thailand-Japan Joint Conference on Computational Geometry and Graphs (TJJCCGG 2012)
  
  Volume: -
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-24106004
[Journal Article] On bipartite powers of bigraphs2012
- Author(s)
  Yoshio Okamoto, Yota Otachi, and Ryuhei Uehara
- Journal Title
  
  Discrete Mathematics and Theoretical Computer Science
  
  Volume: 14(2) Pages: 11-20
- NAID
  120005147908
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-24106004
[Journal Article] A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares2012
- Author(s)
  Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, and Yushi Uno
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 7357 Pages: 24-35
- DOI
  10.1007/978-3-642-31155-0_3
- NAID
  120005954496
- ISBN
  9783642311543, 9783642311550
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-21700009, KAKENHI-PROJECT-22310089, KAKENHI-PROJECT-24220003, KAKENHI-PROJECT-24700008, KAKENHI-PROJECT-15H03389, KAKENHI-PLANNED-24106004, KAKENHI-PLANNED-24106005
[Journal Article] Random Generation and Enumeration of Bipartite Permutation Graphs2012
- Author(s)
  T. Saitoh, Y. Otachi, K. Yamanaka, and R. Uehara
- Journal Title
  
  Journal of Discrete Algorithms
  
  Volume: Vol.10 Pages: 84-97
- DOI
  10.1016/j.jda.2011.11.001
- NAID
  120004680901
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23500013, KAKENHI-PROJECT-23800004
[Journal Article] Subgraph isomorphism in graph classes2012
- Author(s)
  Shuji Kijima, Yota Otachi, Toshiki Saitoh, and Takeaki Uno
- Journal Title
  
  Discrete Mathematics
  
  Volume: 312 Pages: 3164-3173
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23800004
[Journal Article] On bipartite powers of bigraphs2012
- Author(s)
  Yoshio Okamoto, Yota Otachi, and Ryuhei Uehara
- Journal Title
  
  Discrete Mathematics & Theoretical Computer Science 14:2 (2012)
  
  Pages: 11-20
- URL
  http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2132
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23800004
[Journal Article] Enumerating All Rooted Trees Including k Leaves2012
- Author(s)
  Masanobu Ishikawa, Katsuhisa Yamanaka, Yota Otachi, and Shin-ichi Nakano
- Journal Title
  
  IEICE Trans. Inf. & Syst.
  
  Volume: E95-D Issue: 3 Pages: 763-768
- DOI
  10.1587/transinf.E95.D.763
- NAID
  10030611576
- ISSN
  0916-8532, 1745-1361
- Language
  English
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23800004
[Journal Article] A 4.31-approximation for the geometric unique coverage problem on unit disks2012
- Author(s)
  Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, and Yushi Uno
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 7676 Pages: 372-381
- DOI
  10.1007/978-3-642-35261-4_40
- NAID
  120005893622
- ISBN
  9783642352607, 9783642352614
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21700009, KAKENHI-PROJECT-24220003, KAKENHI-PROJECT-24700008, KAKENHI-PLANNED-24106004, KAKENHI-PLANNED-24106005
[Journal Article] Efficient enumeration of ordered trees with k leaves2012
- Author(s)
  Katsuhisa Yamanaka, Yota Otachi, and Shin-ichi Nakano
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 442 Pages: 22-27
- DOI
  10.1016/j.tcs.2011.01.017
- NAID
  110006980259
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23800004
[Journal Article] Parameterized complexity of the spanning tree congestion problem2012
- Author(s)
  Hans L. Bodlaender, Fedor V. Fomin, Petr A. Golovach, Yota Otachi, and Erik Jan van Leeuwen
- Journal Title
  
  Algorithmica
  
  Volume: 64 Issue: 1 Pages: 85-111
- DOI
  10.1007/s00453-011-9565-7
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23800004
[Journal Article] Hardness results and an exact exponential algorithm for the spanning tree congestion problem2011
- Author(s)
  Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, and Takeaki Uno
- Journal Title
  
  Journal of Graph Algorithms and Applications
  
  Volume: 15 Issue: 6 Pages: 727-751
- DOI
  10.7155/jgaa.00246
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23800004
[Journal Article] Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem2011
- Author(s)
  Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno
- Journal Title
  
  Journal of Graph Algorithms and Applications
  
  Volume: 15 Pages: 727-751
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23800004
[Presentation] On the complexity of list H-packing for sparse graph classes2024
- Author(s)
  Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
- Organizer
  18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04091
[Presentation] Orientable burning number of graphs2024
- 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
- Data Source
  KAKENHI-PROJECT-21K11752
[Presentation] List variants of packing problems on sparse graphs2024
- Author(s)
  Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
- Organizer
  第196回アルゴリズム研究発表会
- Data Source
  KAKENHI-PLANNED-20H05793
[Presentation] On the complexity of list H-packing for sparse graph classes2024
- Author(s)
  Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
- Organizer
  18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024)
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05793
[Presentation] Structural parameterizations of vertex integrity2024
- Author(s)
  Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi
- Organizer
  18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024)
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05793
[Presentation] Structural parameterizations of vertex integrity2024
- 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
- Data Source
  KAKENHI-PROJECT-21K11752
[Presentation] Dichotomies for tree minor containment with structural parameters2024
- Author(s)
  Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi
- Organizer
  18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024)
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05793
[Presentation] Finding induced subgraphs from graphs with small mim-width2024
- Author(s)
  Yota Otachi, Akira Suzuki, Yuma Tamura
- Organizer
  19th Scandinavian Symposium on Algorithm Theory (SWAT 2024)
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05793
[Presentation] On the complexity of List H-Packing for sparse graph classes2024
- 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
- Data Source
  KAKENHI-PROJECT-21K11752
[Presentation] Orientable burning number of graphs2024
- Author(s)
  Julien Courtiel, Paul Dorbec, Tatsuya Gima, Romain Lecoq, Yota Otachi
- Organizer
  18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024)
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05793
[Presentation] Dichotomies for Tree Minor Containment with structural parameters2024
- 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
- Data Source
  KAKENHI-PROJECT-21K11752
[Presentation] Sequentially swapping tokens: Further on graph classes2023
- 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
- Data Source
  KAKENHI-PROJECT-21K11752
[Presentation] Grouped domination parameterized by vertex cover, twin cover, and beyond2023
- 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
- Data Source
  KAKENHI-PROJECT-21K11752
[Presentation] Collecting Balls on a Line by Robots with Limited Energy2023
- Author(s)
  Nicolas Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Yota Otachi, Hirotaka Ono
- Organizer
  The 23rd Japan?Korea Joint Workshop?on Algorithms and Computation
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-22H00513
[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
- Data Source
  KAKENHI-PROJECT-21K11752
[Presentation] A framework to design approximation algorithms for finding diverse solutions in combinatorial problems2023
- Author(s)
  Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
- Organizer
  37th AAAI Conference on Artificial Intelligence (AAAI 2023)
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05793
[Presentation] On a spectral lower bound of treewidth2023
- Author(s)
  Tatsuya Gima, Tesshu Hanaka,?Kohei Noro, Hirotaka Ono, Yota Otachi
- Organizer
  The 23rd Japan?Korea Joint Workshop?on Algorithms and Computation
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-22H00513
[Presentation] Sequentially swapping tokens: Further on graph classes2023
- Author(s)
  Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi
- Organizer
  48th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2023)
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05793
[Presentation] Structural Parameterizations of Vertex Integrity2023
- Author(s)
  Ryota Murai, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Hirotaka Ono, Yota Otachi
- Organizer
  The 23rd Japan?Korea Joint Workshop?on Algorithms and Computation
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-22H00513
[Presentation] Computational complexity of ball/water sort puzzles2022
- Author(s)
  伊藤健洋, 川原純, 湊真一, 大舘陽太, 斎藤寿樹, 鈴木顕, 上原隆平, 宇野毅明, 山中克久, 吉仲亮
- Organizer
  第16回組合せゲーム・パズル研究集会
- Data Source
  KAKENHI-PLANNED-20H05793
[Presentation] Computing diverse shortest paths efficiently: A theoretical and experimental study2022
- 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
- Data Source
  KAKENHI-PROJECT-18K11169
[Presentation] Reconfiguration of regular induced subgraphs2022
- 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
- Data Source
  KAKENHI-PROJECT-21K11752
[Presentation] Sorting balls and water: Equivalence and computational complexity2022
- 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
- Data Source
  KAKENHI-PROJECT-21K11752
[Presentation] Computational complexity of ball/water sort puzzles2022
- Author(s)
  Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
- Organizer
  Japanese Conference on Combinatorics and its Applications 2022 離散数学とその応用研究集会2022
- Data Source
  KAKENHI-PLANNED-20H05793
[Presentation] Computing diverse shortest paths efficiently: A theoretical and experimental study2022
- 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
- Data Source
  KAKENHI-PROJECT-21K11752
[Presentation] Reconfiguration of regular induced subgraphs2022
- 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
- Data Source
  KAKENHI-PROJECT-18K11169
[Presentation] Extended MSO model checking via small vertex integrity2022
- Author(s)
  Tatsuya Gima, Yota Otachi.
- Organizer
  The 33rd International Symposium on Algorithms and Computation (ISAAC 2022).
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-21K11752
[Presentation] Algorithmic meta-theorems for combinatorial reconfiguration revisited2022
- Author(s)
  Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi
- Organizer
  30th Annual European Symposium on Algorithms (ESA 2022)
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05793
[Presentation] Algorithmic meta-theorems for combinatorial reconfiguration revisited2022
- Author(s)
  Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi.
- Organizer
  The 30th European Symposium on Algorithms (ESA 2022).
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-21K11752
[Presentation] Reconfiguration of regular induced subgraphs2022
- Author(s)
  Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
- Organizer
  16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022)
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05793
[Presentation] Sorting balls and water: Equivalence and computational complexity2022
- Author(s)
  Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
- Organizer
  11th International Conference on Fun with Algorithms (FUN 2022)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04091
[Presentation] Parameterized complexity of non-separating and non-disconnecting paths and sets2022
- 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
- Data Source
  KAKENHI-PROJECT-21K11752
[Presentation] Sorting balls and water: Equivalence and computational complexity2022
- Author(s)
  Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
- Organizer
  11th International Conference on Fun with Algorithms (FUN 2022)
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05793
[Presentation] Parameterized complexity of non-separating and non-disconnecting paths and sets2022
- Author(s)
  Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket Saurabh
- Organizer
  47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05793
[Presentation] Independent set reconfiguration on directed graphs2022
- Author(s)
  Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
- Organizer
  47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05793
[Presentation] Computing diverse shortest paths efficiently: A theoretical and experimental study2022
- 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
- Data Source
  KAKENHI-PROJECT-18K11168
[Presentation] Reconfiguration of regular induced subgraphs2022
- 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
- Data Source
  KAKENHI-PROJECT-18K11168
[Presentation] Independent set reconfiguration on directed graphs2022
- 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
- Data Source
  KAKENHI-PROJECT-21K11752
[Presentation] Reconfiguration of Regular Induced Subgraphs2022
- Author(s)
  Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi and Kunihiro Wasa
- Organizer
  The 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04091
[Presentation] Extended MSO model checking via small vertex integrity2022
- Author(s)
  Tatsuya Gima, Yota Otachi
- Organizer
  33rd International Symposium on Algorithms and Computation (ISAAC 2022)
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05793
[Presentation] Computational complexity of jumping block puzzles2021
- Author(s)
  Masaaki Kanzaki, Yota Otachi, Ryuhei Uehara
- Organizer
  The 27th International Computing and Combinatorics Conference (COCOON 2021)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11169
[Presentation] Exploring the gap between treedepth and vertex cover through vertex integrity2021
- 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
- Data Source
  KAKENHI-PROJECT-18K11168
[Presentation] Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity2021
- 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
- Data Source
  KAKENHI-PROJECT-18H04091
[Presentation] Reconfiguring directed trees in a digraph2021
- Author(s)
  Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
- Organizer
  27th International Computing and Combinatorics Conference (COCOON 2021)
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05793
[Presentation] Distributed Reconfiguration of Spanning Trees2021
- Author(s)
  Yukiko Yamauchi, Naoyuki Kamiyama, Yota Otachi
- Organizer
  International Symposium on Stabilizing, Safety, and Security of Distributed Systems(SSS 2021)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04091
[Presentation] Distributed reconfiguration of spanning trees2021
- 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
- Data Source
  KAKENHI-PROJECT-21K11752
[Presentation] Reconfiguring directed trees in a digraph2021
- 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
- Data Source
  KAKENHI-PROJECT-21K11752
[Presentation] Reconfiguring directed trees in a digraph2021
- 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
- Data Source
  KAKENHI-PROJECT-18K11168
[Presentation] Computational Complexity of Jumping Block Puzzles2021
- Author(s)
  Masaaki Kanzaki, Yota Otachi, and Ryuhei Uehara
- Organizer
  The 27th International Computing and Combinatorics Conference (COCOON 2021)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04091
[Presentation] Reconfiguring Directed Trees in a Digraph2021
- Author(s)
  Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi and Kunihiro Wasa
- Organizer
  The 27th International Computing and Combinatorics Conference (COCOON 2021)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04091
[Presentation] Exploring the gap between treedepth and vertex cover through vertex integrity2021
- 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
- Data Source
  KAKENHI-PROJECT-18K11169
[Presentation] Reconfiguring directed trees in a digraph2021
- 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
- Data Source
  KAKENHI-PROJECT-18K11169
[Presentation] Distributed reconfiguration of spanning trees2021
- 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
- Data Source
  KAKENHI-PROJECT-18K11168
[Presentation] Finding Diverse Trees, Paths, and More2021
- Author(s)
  Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi
- Organizer
  The 35th AAAI Conference on Artificial Intelligence (AAAI-21)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04091
[Presentation] Reconfiguring directed trees in a digraph2021
- Author(s)
  Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
- Organizer
  Workshop on Combinatorial Reconfiguration, affiliated with ICALP 2021
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-20H05793
[Presentation] Computational complexity of jumping block puzzles2021
- Author(s)
  Masaaki Kanzaki, Yota Otachi, Ryuhei Uehara
- Organizer
  The 27th International Computing and Combinatorics Conference (COCOON 2021)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-21K11752
[Presentation] Distributed reconfiguration of spanning trees2021
- 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
- Data Source
  KAKENHI-PROJECT-18K11169
[Presentation] Complexity of reconfiguration of regular induced subgraphs2021
- Author(s)
  Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
- Organizer
  電子情報通信学会コンピュテーション研究会
- Data Source
  KAKENHI-PLANNED-20H05793
[Presentation] Token sliding on directed graphs2021
- Author(s)
  Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Masahiro Takahashi, Yota Otachi, Kunihiro Wasa
- Organizer
  電子情報通信学会コンピュテーション研究会
- Data Source
  KAKENHI-PLANNED-20H05793
[Presentation] Computational complexity of jumping block puzzles2021
- Author(s)
  Masaaki Kanzaki, Yota Otachi, Ryuhei Uehara
- Organizer
  The 27th International Computing and Combinatorics Conference (COCOON 2021)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168
[Presentation] Finding diverse trees, paths, and more2021
- Author(s)
  Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi
- Organizer
  The 35th AAAI Conference on Artificial Intelligence (AAAI 2021)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168
[Presentation] Finding diverse trees, paths, and more2021
- Author(s)
  Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi
- Organizer
  The 35th AAAI Conference on Artificial Intelligence (AAAI 2021)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11169
[Presentation] Exploring the gap between treedepth and vertex cover through vertex integrity2021
- 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
- Data Source
  KAKENHI-PROJECT-21K11752
[Presentation] Parameterized Complexity of Graph Burning2020
- Author(s)
  Yasuaki Kobayashi, Yota Otachi
- Organizer
  IPEC 2020
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04091
[Presentation] Hedonic seat arrangement problems (Extended abstract)2020
- Author(s)
  Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
- Organizer
  The 19th International Conference on Autonomous Agents and Multi‐Agent Systems (AAMAS 2020)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11169
[Presentation] Parameterized complexity of (A, l)-path packing2020
- Author(s)
  Remy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
- Organizer
  The 31st International Workshop on Combinatorial Algorithms (IWOCA 2020)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168
[Presentation] Sublinear-space lexicographic depth-first search for bounded treewidth graphs and planar graphs2020
- Author(s)
  Taisuke Izumi, Yota Otachi
- Organizer
  The 47th International Colloquium on Automata, Languages and Programming (ICALP 2020)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168
[Presentation] Parameterized Complexity of (A,l)-Path Packing2020
- Author(s)
  Remy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
- Organizer
  IWOCA 2020
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04091
[Presentation] Hedonic Seat Arrangement Problems2020
- Author(s)
  Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
- Organizer
  AAMAS 2020
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04091
[Presentation] Grundy distinguishes treewidth from pathwidth2020
- Author(s)
  Remy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
- Organizer
  The 28th European Symposium on Algorithms (ESA 2020)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11169
[Presentation] Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs2020
- Author(s)
  Taisuke Izumi, Yota Otachi
- Organizer
  ICALP 2020
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04091
[Presentation] A Survey on Spanning Tree Congestion2020
- Author(s)
  Yota Otachi
- Organizer
  Treewidth, Kernels, and Algorithms 2020
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04091
[Presentation] Hedonic seat arrangement problems (Extended abstract)2020
- Author(s)
  Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
- Organizer
  The 19th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2020)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168
[Presentation] Parameterized complexity of (A, l)‐path packing2020
- Author(s)
  Remy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
- Organizer
  The 31st International Workshop on Combinatorial Algorithms (IWOCA 2020)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11169
[Presentation] Grundy distinguishes treewidth from pathwidth2020
- Author(s)
  Remy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
- Organizer
  The 28th European Symposium on Algorithms (ESA 2020)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168
[Presentation] Grundy Distinguishes Treewidth from Pathwidth2020
- Author(s)
  Remy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
- Organizer
  ESA 2020
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04091
[Presentation] Linear‐time recognition of double‐threshold graphs2020
- Author(s)
  Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno
- Organizer
  The 46th International Workshop on Graph‐Theoretic Concepts in Computer Science (WG 2020)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11169
[Presentation] Linear-time recognition of double-threshold graphs2020
- Author(s)
  Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno
- Organizer
  The 46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2020)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168
[Presentation] Parameterized complexity of graph burning2020
- Author(s)
  Yasuaki Kobayashi, Yota Otachi
- Organizer
  The 15th International Symposium on Parameterized and Exact Computation (IPEC 2020)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168
[Presentation] Parameterized complexity of graph burning2020
- Author(s)
  Yasuaki Kobayashi, Yota Otachi
- Organizer
  The 15th International Symposium on Parameterized and Exact Computation (IPEC 2020)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11169
[Presentation] Sublinear‐space lexicographic depth‐first search for bounded treewidth graphs and planar graphs2020
- Author(s)
  Taisuke Izumi, Yota Otachi
- Organizer
  The 47th International Colloquium on Automata, Languages and Programming (ICALP 2020)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11169
[Presentation] Linear-Time Recognition of Double-Threshold Graphs2020
- Author(s)
  Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno
- Organizer
  WG 2020
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04091
[Presentation] Independent Set Reconfiguration Parameterized by Modular-Width2019
- Author(s)
  Remy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
- Organizer
  WG 2019
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04091
[Presentation] Parameterized complexity of safe set2019
- Author(s)
  Remy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi.
- Organizer
  The 11th International Conference on Algorithms and Complexity (CIAC 2019)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11169
[Presentation] Independent set reconfiguration parameterized by modular-width2019
- Author(s)
  Remy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi.
- Organizer
  The 45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2019).
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168
[Presentation] Low-congestion shortcut and graph parameters2019
- Author(s)
  Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi.
- Organizer
  The 33rd International Symposium on Distributed Computing (DISC 2019).
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168
[Presentation] Independent set reconfiguration parameterized by modular-width2019
- Author(s)
  Remy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi.
- Organizer
  The 45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2019)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11169
[Presentation] Subgraph Isomorphism on Graph Classes that Exclude a Substructure2019
- Author(s)
  Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
- Organizer
  CIAC 2019
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04091
[Presentation] Subgraph isomorphism on graph classes that exclude a substructure.2019
- Author(s)
  Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom van der Zanden.
- Organizer
  The 11th International Conference on Algorithms and Complexity (CIAC 2019)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11169
[Presentation] Low-congestion shortcut and graph parameters2019
- Author(s)
  Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi.
- Organizer
  The 33rd International Symposium on Distributed Computing (DISC 2019)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11169
[Presentation] Parameterized complexity of safe set2019
- Author(s)
  Remy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi.
- Organizer
  The 11th International Conference on Algorithms and Complexity (CIAC 2019).
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168
[Presentation] Parameterized Complexity of Safe Set2019
- Author(s)
  Remy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
- Organizer
  CIAC 2019
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04091
[Presentation] Token sliding on split graphs2019
- Author(s)
  Remy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
- Organizer
  The 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11169
[Presentation] Low-Congestion Shortcut and Graph Parameters2019
- Author(s)
  Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi
- Organizer
  DISC 2019
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04091
[Presentation] Token sliding on split graphs2019
- Author(s)
  Remy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
- Organizer
  The 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168
[Presentation] Token Sliding on Split Graphs2019
- Author(s)
  Remy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
- Organizer
  STACS 2019, pp. 13:1-13:17
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04091
[Presentation] Subgraph isomorphism on graph classes that exclude a substructure.2019
- Author(s)
  Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom van der Zanden.
- Organizer
  The 11th International Conference on Algorithms and Complexity (CIAC 2019).
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168
[Presentation] How Bad is the Freedom to Flood-It?2018
- Author(s)
  Remy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi
- Organizer
  FUN 2018, pp. 5:1-5:13
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04091
[Presentation] Computational complexity of robot arm simulation problems2018
- Author(s)
  Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara
- Organizer
  The 29th International Workshop on Combinational Algorithms (IWOCA 2018)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11169
[Presentation] Computational Complexity of Robot Arm Simulation Problems2018
- Author(s)
  Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara
- Organizer
  IWOCA 2018, pp. 177-188
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04091
[Presentation] Exact Algorithms for the Max-Min Dispersion Problem2018
- Author(s)
  Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
- Organizer
  FAW 2018, pp. 263-272
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04091
[Presentation] Parameterized Orientable Deletion2018
- Author(s)
  Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
- Organizer
  The 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168
[Presentation] Reconfiguration of Colorable Sets in Classes of Perfect Graphs2018
- Author(s)
  Takehiro Ito, Yota Otachi
- Organizer
  SWAT 2018, pp. 27:1-27:13
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04091
[Presentation] Reconfiguration of colorable sets in classes of perfect graphs2018
- Author(s)
  Takehiro Ito, Yota Otachi
- Organizer
  The 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11169
[Presentation] Computational complexity of robot arm simulation problems2018
- Author(s)
  Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara
- Organizer
  The 29th International Workshop on Combinational Algorithms (IWOCA 2018)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168
[Presentation] Parameterized Orientable Deletion2018
- Author(s)
  Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
- Organizer
  The 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11169
[Presentation] Reconfiguration of colorable sets in classes of perfect graphs2018
- Author(s)
  Takehiro Ito, Yota Otachi
- Organizer
  The 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11168
[Presentation] Parameterized Orientable Deletion2018
- Author(s)
  Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
- Organizer
  SWAT 2018, pp. 24:1-24:13
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04091
[Presentation] Safe sets in graphs: Graph classes and structural parameters2016
- Author(s)
  R. Agueda, N. Cohen, S. Fujita, S. Legay, Y. Manoussakis, Y. Matsui, L. Montero, R. Naserasr, Y. Otachi, T. Sakuma, Z. Tuza, R. Xu
- Organizer
  The 10th Annual International Conference on Combinatorial Optimization and Applications
- Place of Presentation
  Hong Kong, China
- Year and Date
  2016-12-16
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-24106004
[Presentation] Swapping colored tokens on graphs2015
- Author(s)
  Katsuhisa Yamanaka, Takashi Horiyama, David Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, and Yushi Uno
- Organizer
  14th International Symposium on Algorithms and Data Structures (WADS 2015)
- Place of Presentation
  Victoria, BC, Canada
- Year and Date
  2015-08-05
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-25730003
[Presentation] Competitive diffusion on weighted graphs2015
- Author(s)
  Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, and Xiao Zhou
- Organizer
  14th International Symposium on Algorithms and Data Structures (WADS 2015)
- Place of Presentation
  Victoria, BC, Canada
- Year and Date
  2015-08-05
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-25730003
[Presentation] Reconfiguration of cliques in a graph2015
- Author(s)
  Takehiro Ito, Hirotaka Ono, Yota Otachi
- Organizer
  12th Annual Conference on Theory and Applications of Models of Computation (TAMC 2015)
- Place of Presentation
  Singapore
- Year and Date
  2015-05-18
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-25730003
[Presentation] Sliding token on bipartite permutation graphs2015
- Author(s)
  Eli Fox-Epstein, Duc A. Hoang, Yota Otachi, and Ryuhei Uehara
- Organizer
  26th International Symposium on Algorithms and Computation (ISAAC 2015)
- Place of Presentation
  Nagoya Marriott Associa Hotel, Nagoya, Japan
- Year and Date
  2015-12-09
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-25730003
[Presentation] Competitive Diffusion on Weighted Graphs2015
- Author(s)
  Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka and Xiao Zhou
- Organizer
  International Symposium on Algorithms and Data Structures (WADS 2015)
- Place of Presentation
  Victoria, BC, Canada
- Year and Date
  2015-08-05
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-24106004
[Presentation] Reconfiguration of cliques in a graph2015
- Author(s)
  Takehiro Ito, Hirotaka Ono, Yota Otachi
- Organizer
  Annual Conference on Theory and Applications of Models of Computation (TAMC 2015)
- Place of Presentation
  Singapore
- Year and Date
  2015-05-18
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-24106004
[Presentation] Induced minor free graphs: Isomorphism and clique-width2015
- Author(s)
  Remy Belmonte, Yota Otachi, and Pascal Schweitzer
- Organizer
  International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2015)
- Place of Presentation
  Munich, Germany
- Year and Date
  2015-06-17
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-24106004
[Presentation] Swapping Colored Tokens on Graphs2015
- Author(s)
  Katsuhisa Yamanaka, Takashi Horiyama, David Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara and Yushi Uno
- Organizer
  International Symposium on Algorithms and Data Structures (WADS 2015)
- Place of Presentation
  Victoria, BC, Canada
- Year and Date
  2015-08-05
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-24106004
[Presentation] Sliding Token on Bipartite Permutation Graphs2015
- Author(s)
  Eli Fox-Epstein, Duc A. Hoang, Yota Otachi, and Ryuhei Uehara
- Organizer
  International Symposium on Algorithms and Computation (ISAAC 2015)
- Place of Presentation
  Nagoya Marriott Associa Hotel, Nagoya, Japan
- Year and Date
  2015-12-09
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-24106004
[Presentation] Induced minor free graphs: Isomorphism and clique-width2015
- Author(s)
  Remy Belmonte, Yota Otachi, and Pascal Schweitzer
- Organizer
  41st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2015)
- Place of Presentation
  Munich, Germany
- Year and Date
  2015-07-17
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-25730003
[Presentation] Isomorphism on subgraph-closed graph classes: a complexity dichotomy and intermediate graph classes2014
- Author(s)
  大舘陽太，Pascal Schweitzer
- Organizer
  2013年度冬のLAシンポジウム
- Place of Presentation
  京都大学
- Data Source
  KAKENHI-PLANNED-24106004
[Presentation] Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs2014
- Author(s)
  Matsuo Konagaya, Yota Otachi, and Ryuhei Uehara
- Organizer
  情報処理学会アルゴリズム研究会
- Place of Presentation
  中央大学
- Data Source
  KAKENHI-PLANNED-24106004
[Presentation] Depth-First Search Using O(n) Bits2014
- Author(s)
  T. Asano, T. Izumi, M. Kiyomi, M. Konagaya, H. Ono, Y. Otachi, P. Schweitzer, J. Tarui, R. Uehara
- Organizer
  The 25th International Symposium on Algorithms and Computation
- Place of Presentation
  Jeonju, Korea
- Year and Date
  2014-12-17
- Data Source
  KAKENHI-PROJECT-23300001
[Presentation] 遮光線の長さについて2013
- Author(s)
  大舘陽太，河村彰星，森山園子
- Organizer
  2013年度夏のLAシンポジウム
- Place of Presentation
  休暇村志賀島
- Data Source
  KAKENHI-PLANNED-24106004
[Presentation] Bounded representations of interval and proper interval graphs2013
- Author(s)
  Martin Balko, Pavel Klavik, and Yota Otachi
- Organizer
  24th International Symposium on Algorithms and Computation (ISAAC 2013)
- Place of Presentation
  Hong Kong, China
- Data Source
  KAKENHI-PROJECT-25730003
[Presentation] On low congestion spanning trees2013
- Author(s)
  Yota Otachi
- Organizer
  8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications
- Place of Presentation
  Veszprem, Hungary
- Invited
- Data Source
  KAKENHI-PROJECT-25730003
[Presentation] On low congestion spanning trees2013
- Author(s)
  大舘陽太
- Organizer
  KSMAP研究会
- Place of Presentation
  京都大学
- Data Source
  KAKENHI-PLANNED-24106004
[Presentation] Isomorphism on subgraph-closed graph classes: a complexity dichotomy and intermediate graph classes2013
- Author(s)
  Yota Otachi and Pascal Schweitzer
- Organizer
  24th International Symposium on Algorithms and Computation (ISAAC 2013)
- Place of Presentation
  Hong Kong, China
- Data Source
  KAKENHI-PROJECT-25730003
[Presentation] Base location problems for base-monotone regions2013
- Author(s)
  Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, and Takeaki Uno
- Organizer
  7th International Workshop on Algorithms and Computation (WALCOM 2013)
- Place of Presentation
  Kharagpur, India
- Data Source
  KAKENHI-PROJECT-23800004
[Presentation] A 4.31-approximation for the geometric unique coverage problem on unit disks2012
- Author(s)
  Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, and Yushi Uno
- Organizer
  23rd International Symposium on Algorithms and Computation (ISAAC 2012)
- Place of Presentation
  Taipei, Taiwan
- Data Source
  KAKENHI-PROJECT-23800004
[Presentation] A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares2012
- Author(s)
  Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, and Yushi Uno
- Organizer
  13th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2012)
- Place of Presentation
  Helsinki, Finland
- Data Source
  KAKENHI-PROJECT-23800004
[Presentation] Extending partial representations of subclasses of chordal graphs2012
- Author(s)
  Pavel Klavik, Jan Kratochvil, Yota Otachi, and Toshiki Saitoh
- Organizer
  23rd International Symposium on Algorithms and Computation (ISAAC 2012)
- Place of Presentation
  Taipei, Taiwan
- Data Source
  KAKENHI-PROJECT-23800004
[Presentation] Isomorphism for graphs of bounded connected-path-distance-width2012
- Author(s)
  Yota Otachi
- Organizer
  23rd International Symposium on Algorithms and Computation (ISAAC 2012)
- Place of Presentation
  Taipei, Taiwan
- Data Source
  KAKENHI-PROJECT-23800004
[Presentation] Polynomial-Time Algorithm for Sliding Tokens on Trees
- Author(s)
  Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada
- Organizer
  ISAAC 2014
- Place of Presentation
  Jeonju, Korea
- Year and Date
  2014-12-15 – 2014-12-17
- Data Source
  KAKENHI-PLANNED-24106004
[Presentation] Depth-first search using O(n) bits
- Author(s)
  Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, and Ryuhei Uehara
- Organizer
  25th International Symposium on Algorithms and Computation (ISAAC 2014)
- Place of Presentation
  Jeonju, Korea
- Year and Date
  2014-12-15 – 2014-12-17
- Data Source
  KAKENHI-PROJECT-25730003
[Presentation] Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs
- Author(s)
  Matsuo Konagaya, Yota Otachi, Ryuhei Uehara
- Organizer
  TAMC 2014
- Place of Presentation
  Chennai, India
- Year and Date
  2014-04-11 – 2014-04-13
- Data Source
  KAKENHI-PLANNED-24106004
[Presentation] Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs
- Author(s)
  Matsuo Konagaya, Yota Otachi, and Ryuhei Uehara
- Organizer
  11th Annual Conference on Theory and Applications of Models of Computation (TAMC 2014)
- Place of Presentation
  Chennai, India
- Year and Date
  2014-04-11 – 2014-04-13
- Data Source
  KAKENHI-PROJECT-25730003
[Presentation] Intersection Dimension of Bipartite Graphs
- Author(s)
  Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara
- Organizer
  TAMC 2014
- Place of Presentation
  Chennai, India
- Year and Date
  2014-04-11 – 2014-04-13
- Data Source
  KAKENHI-PLANNED-24106004
[Presentation] Extending partial representations of proper and unit interval graphs
- Author(s)
  Pavel Klavik, Jan Kratochvil, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, and Tomas Vyskocil
- Organizer
  14th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2014)
- Place of Presentation
  Copenhagen, Denmark
- Year and Date
  2014-07-02 – 2014-07-04
- Data Source
  KAKENHI-PROJECT-25730003
[Presentation] Polynomial-time algorithm for sliding tokens on trees
- Author(s)
  Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, and Takeshi Yamada
- Organizer
  25th International Symposium on Algorithms and Computation (ISAAC 2014)
- Place of Presentation
  Jeonju, Korea
- Year and Date
  2014-12-15 – 2014-12-17
- Data Source
  KAKENHI-PROJECT-25730003
[Presentation] Extending partial representations of proper and unit interval graphs
- Author(s)
  Pavel Klavik, Jan Kratochvil, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomas Vyskocil
- Organizer
  SWAT 2014
- Place of Presentation
  Copenhagen, Denmark
- Year and Date
  2014-07-02 – 2014-07-04
- Data Source
  KAKENHI-PLANNED-24106004
[Presentation] Reduction techniques for graph isomorphism in the context of width parameters
- Author(s)
  Yota Otachi and Pascal Schweitzer
- Organizer
  14th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2014)
- Place of Presentation
  Copenhagen, Denmark
- Year and Date
  2014-07-02 – 2014-07-04
- Data Source
  KAKENHI-PROJECT-25730003
[Presentation] Intersection dimension of bipartite graphs
- Author(s)
  Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, and Ryuhei Uehara
- Organizer
  11th Annual Conference on Theory and Applications of Models of Computation (TAMC 2014)
- Place of Presentation
  Chennai, India
- Year and Date
  2014-04-11 – 2014-04-13
- Data Source
  KAKENHI-PROJECT-25730003
[Presentation] Depth-First Search Using O(n) Bits
- Author(s)
  Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Yota Otachi, Hirotaka Ono, Pascal Schweitzer, Jun Tarui and Ryuhei Uehara
- Organizer
  ISAAC2014
- Place of Presentation
  Jeonju, Korea
- Year and Date
  2014-12-15 – 2014-12-17
- Data Source
  KAKENHI-PLANNED-24106004
[Presentation] Reduction techniques for graph isomorphism in the context of width parameters
- Author(s)
  Yota Otachi, Pascal Schweitzer
- Organizer
  SWAT 2014
- Place of Presentation
  Copenhagen, Denmark
- Year and Date
  2014-07-02 – 2014-07-04
- Data Source
  KAKENHI-PLANNED-24106004

1. UEHARA Ryuhei (00256471)

# of Collaborated Projects: 3 results

# of Collaborated Products: 20 results
2. ASANO Tetsuo (90113133)

# of Collaborated Projects: 2 results

# of Collaborated Products: 2 results
3. Kiyomi Masashi (30447685)

# of Collaborated Projects: 2 results

# of Collaborated Products: 6 results
4. ITO Takehiro (40431548)

# of Collaborated Projects: 2 results

# of Collaborated Products: 26 results
5. 小野廣隆 (00346826)

# of Collaborated Projects: 2 results

# of Collaborated Products: 12 results
6. 齋藤寿樹 (00590390)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
7. 川原純 (20572473)

# of Collaborated Projects: 2 results

# of Collaborated Products: 1 results
8. 吉仲亮 (80466424)

# of Collaborated Projects: 2 results

# of Collaborated Products: 2 results
9. 小林靖明 (60735083)

# of Collaborated Projects: 2 results

# of Collaborated Products: 22 results
10. 垂井淳 (00260539)

# of Collaborated Projects: 1 results

# of Collaborated Products: 1 results
11. 鈴木顕 (10723562)

# of Collaborated Projects: 1 results

# of Collaborated Products: 2 results
12. 山中克久 (60508836)

# of Collaborated Projects: 1 results

# of Collaborated Products: 1 results
13. 和佐州洋 (00781337)

# of Collaborated Projects: 1 results

# of Collaborated Products: 9 results
14. 山内由紀子 (10546518)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
15. 柳浦睦憲 (10263120)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
16. 脊戸和寿 (20584056)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
17. 土中哲秀 (30824982)

# of Collaborated Projects: 1 results

# of Collaborated Products: 9 results
18. 玉木久夫 (20111354)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
19. Guenter Rote

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
20. Wolfgang Mulzer

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
21. Ovidiu Daescu

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
22. KAWAMURA Akitoshi

# of Collaborated Projects: 0 results

# of Collaborated Products: 1 results
23. 宇野裕之

# of Collaborated Projects: 0 results

# of Collaborated Products: 3 results
24. BELMONTE Remy

# of Collaborated Projects: 0 results

# of Collaborated Products: 2 results
25. 岡本吉央

# of Collaborated Projects: 0 results

# of Collaborated Products: 4 results
26. 斎藤寿樹

# of Collaborated Projects: 0 results

# of Collaborated Products: 5 results
27. 栗田和宏

# of Collaborated Projects: 0 results

# of Collaborated Products: 1 results
28. 中野眞一

# of Collaborated Projects: 0 results

# of Collaborated Products: 1 results
29. 山崎浩一

# of Collaborated Projects: 0 results

# of Collaborated Products: 1 results

Otachi Yota 大舘 陽太

OTACHI Yota 大舘 陽太

Research Projects

Research Products

Co-Researchers

グラフ分解手法と問題記法の多様化による実践的アルゴリズム自動生成Principal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Making treewidth and pathwidth practical

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

超スマート社会時代のアルゴリズム工学 - パラメータ化近似均衡計算

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Refining the graph parameter hierarchy for fine-grained algorithmsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Computer Science Approach for Expanding Combinatorial Reconfiguration: Toward Automatic Generation of Algorithms

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Speeding up FPT algorithms with special tree decompositionsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

General algorithms for fixed-parameter intractable problems

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Research on algorithms and data structures for solving theoretically hard problems in practical time

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Fixed width parameter algorithms for the graph isomorphism problemPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Exploring the Limits of Computation in the Scenario of Constrained Work Space

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Development of Algorithmic Paradigms on Memory-Constrained Computation

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Designing low-congestion sparse networksPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

[Journal Article] Collecting Balls on a Line by Robots with Limited Energy2024

Author(s)

Journal Title

Otachi Yota 大舘陽太

OTACHI Yota 大舘陽太