• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

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

Research Project

Project/Area Number 18H04091
Research Category

Grant-in-Aid for Scientific Research (A)

Allocation TypeSingle-year Grants
Section一般
Review Section Medium-sized Section 60:Information science, computer engineering, and related fields
Research InstitutionJapan Advanced Institute of Science and Technology

Principal Investigator

上原 隆平  北陸先端科学技術大学院大学, 先端科学技術研究科, 教授 (00256471)

Co-Investigator(Kenkyū-buntansha) 齋藤 寿樹  九州工業大学, 大学院情報工学研究院, 准教授 (00590390)
鈴木 顕  東北大学, 情報科学研究科, 准教授 (10723562)
川原 純  京都大学, 情報学研究科, 准教授 (20572473)
伊藤 健洋  東北大学, 情報科学研究科, 教授 (40431548)
山中 克久  岩手大学, 理工学部, 教授 (60508836)
吉仲 亮  東北大学, 情報科学研究科, 准教授 (80466424)
大舘 陽太  名古屋大学, 情報学研究科, 准教授 (80610196)
Project Period (FY) 2018-04-01 – 2023-03-31
Project Status Granted (Fiscal Year 2022)
Budget Amount *help
¥43,550,000 (Direct Cost: ¥33,500,000、Indirect Cost: ¥10,050,000)
Fiscal Year 2022: ¥8,840,000 (Direct Cost: ¥6,800,000、Indirect Cost: ¥2,040,000)
Fiscal Year 2021: ¥7,540,000 (Direct Cost: ¥5,800,000、Indirect Cost: ¥1,740,000)
Fiscal Year 2020: ¥8,320,000 (Direct Cost: ¥6,400,000、Indirect Cost: ¥1,920,000)
Fiscal Year 2019: ¥8,580,000 (Direct Cost: ¥6,600,000、Indirect Cost: ¥1,980,000)
Fiscal Year 2018: ¥10,270,000 (Direct Cost: ¥7,900,000、Indirect Cost: ¥2,370,000)
Keywords高速アルゴリズム / 組合せ遷移問題 / グラフアルゴリズム / 二部決定ダイアグラム / アルゴリズム / 遷移問題 / BDD / データ構造 / 離散構造 / 離散数学 / 計算量 / 列挙アルゴリズム
Outline of Annual Research Achievements

本研究プロジェクトは,離散的な構造上における問題を中心に,その困難性に関する研究を行うプロジェクトであり,いくつかの方向性を持つ.まず解きたい問題を明確にし,定式化を行う.現実の問題をいかに抽象化・モデル化するかによって,問題の困難性は大きく異なって来る.次にその困難性の研究を行う.理論的に困難であれば,理論的な困難さの計算量的な根拠を示すことができる.一方,それが手に負えるとなれば,そこには具体的な解法,すなわちアルゴリズムが導かれる.こうして導かれた効率の良いアルゴリズムを実装し,実用的な速度で動作するかどうかを確認し,さらには元の現実の問題にフィードバックすることができる.
2020年度は新型コロナが急速に拡大し,当初計画していた対面での合宿形式の研究集会を十分に実施することができず,その中で研究方法も含めた模索が必要な年であった.行動が制限される中,研究者同士が柔軟に連絡を取りながら可能な範囲で共同研究を実施できた.理論的な困難性を示せた問題もあれば,効率の良いアルゴリズムを開発できた問題もある.また実際に実装して有効性を示せた問題もあった.
別紙に示す通り,2020年度は書籍3冊(研究書1冊と国際会議の会議録2冊)・査読付きのジャーナル論文18編・国際会議での発表27件を研究成果としてあげることができた.
また2020年の後半には,本研究プロジェクトのメンバーを中心として,学術変革(A)(研究課題名:社会変革の源泉となる革新的アルゴリズム基盤の創出と体系化)および学術変革(B)(研究課題名:組合せ遷移の展開に向けた計算機科学・工学・数学によるアプローチの融合)という大きな研究プロジェクトに採択され,本プロジェクトの研究の方向性をより大規模なものに発展させることができた.

Current Status of Research Progress
Current Status of Research Progress

2: Research has progressed on the whole more than it was originally planned.

Reason

2020年度は新型コロナの感染が拡大する中で,研究方法を模索しながらの共同研究となった.計画では,合宿形式の研究会を実施し,研究に関する問題意識の共有と,方向性の確認をする予定であったが,それは断念せざるを得なかった.その代わり,小規模にかつ継続的に個々のメンバーが連携をしながら研究活動を実施した.最終的には一堂に会しての大規模な合宿は一度も開催できず,状況に応じて可能な範囲で柔軟に共同研究を進めることとなった.そうした困難な状況であったにも関わらず,上記にデータを示した通り,2020年度は,本プロジェクトにおける研究成果は着実にあげることができた.しかしやや小規模なグループ単位での研究活動にとどまっているケースが多く,プロジェクト全体でのまとまった研究は持ち越しとなった.

Strategy for Future Research Activity

2021年以降は引き続き新型コロナ禍にあり,密な合宿形式の研究会は依然として実施が困難な状況が続いた.しかし,徐々にハイブリッド式の研究会にも慣れ,柔軟な運用で開催したり,個別にオンラインのツールを活用することで研究を続けた.怪我の功名として,こうした遠隔ツールを活用しての連携を深めながらの研究スタイルが確立されつつある.今後は新型コロナの状況を見ながらも,ポストコロナ,あるいはウィズコロナの研究スタイルを確立しつつ,継続して研究を進める方針である.
特にこうした社会状況を踏まえて,新たな問題意識や新たなビッグデータも蓄積しつつあるため,本プロジェクトのような,大規模な離散構造上の困難な問題への需要は高まっていると考えられる.そこで,こうした新たな問題も取り入れつつ,発展的に研究プロジェクトを進めていく方針である.

Report

(3 results)
  • 2020 Annual Research Report
  • 2019 Annual Research Report
  • 2018 Annual Research Report

Research Products

(127 results)

All 2021 2020 2019 2018 Other

All Int'l Joint Research (3 results) Journal Article (52 results) (of which Int'l Joint Research: 29 results,  Peer Reviewed: 52 results,  Open Access: 25 results) Presentation (66 results) (of which Int'l Joint Research: 66 results) Book (4 results) Remarks (1 results) Funded Workshop (1 results)

  • [Int'l Joint Research] MIT(米国)

    • Related Report
      2019 Annual Research Report
  • [Int'l Joint Research] University of Waterloo(カナダ)

    • Related Report
      2019 Annual Research Report
  • [Int'l Joint Research] Universiteit Utrecht(オランダ)

    • Related Report
      2019 Annual Research Report
  • [Journal Article] Trichotomy for the reconfiguration problem of integer linear systems2021

    • Author(s)
      Kei Kimura, Akira Suzuki
    • Journal Title

      Theoretical Computer Science

      Volume: 856 Pages: 88-109

    • DOI

      10.1016/j.tcs.2020.12.025

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs2021

    • Author(s)
      Yuma Tamura, Takehiro Ito and Xiao Zhou
    • Journal Title

      Theoretical Computer Science

      Volume: 849 Pages: 227-236

    • DOI

      10.1016/j.tcs.2020.10.026

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Optimal reconfiguration of optimal ladder lotteries2021

    • Author(s)
      Katsuhisa Yamanaka, Takashi Horiyama, Kunihiro Wasa
    • Journal Title

      Theoretical Computer Science

      Volume: 859 Pages: 57-69

    • DOI

      10.1016/j.tcs.2021.01.009

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Token Sliding on Split Graphs2021

    • Author(s)
      Belmonte Remy、Kim Eun Jung、Lampis Michael、Mitsou Valia、Otachi Yota、Sikora Florian
    • Journal Title

      Theory of Computing Systems

      Volume: Online Pages: 662-686

    • DOI

      10.1007/s00224-020-09967-8

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Parameterized complexity of independent set reconfiguration problems2020

    • Author(s)
      Ito Takehiro、Kaminski Marcin、Ono Hirotaka、Suzuki Akira、Uehara Ryuhei、Yamanaka Katsuhisa
    • Journal Title

      Discrete Applied Mathematics

      Volume: - Pages: 336-345

    • DOI

      10.1016/j.dam.2020.01.022

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] Complexity of the Maximum <i>k</i>-Path Vertex Cover Problem2020

    • Author(s)
      MIYANO Eiji、SAITOH Toshiki、UEHARA Ryuhei、YAGITA Tsuyoshi、ZANDEN Tom C. van der
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E103.A Issue: 10 Pages: 1193-1201

    • DOI

      10.1587/transfun.2019dmp0014

      10.1587/transfun.2019DMP0014

    • NAID

      130007920231

    • ISSN
      0916-8508, 1745-1337
    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Efficient Algorithm for Box Folding2020

    • Author(s)
      Mizunashi Koichi、Horiyama Takashi、Uehara Ryuhei
    • Journal Title

      Journal of Graph Algorithms and Applications

      Volume: 24 Pages: 89-103

    • DOI

      10.7155/jgaa.00520

    • NAID

      120006775247

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Rectangular Unfoldings of Polycubes2020

    • Author(s)
      L. Demaine Martin、A. Hearn Robert、Hoshido Junnosuke、Ku Jason、Uehara Ryuhei
    • Journal Title

      Journal of Information Processing

      Volume: 28 Issue: 0 Pages: 841-845

    • DOI

      10.2197/ipsjjip.28.841

    • NAID

      130007956353

    • ISSN
      1882-6652
    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Efficient Algorithm for 2 × <i>n</i> Map Folding with a Box-pleated Crease Pattern2020

    • Author(s)
      Jia Yiyang、Mitani Jun、Uehara Ryuhei
    • Journal Title

      Journal of Information Processing

      Volume: 28 Issue: 0 Pages: 806-815

    • DOI

      10.2197/ipsjjip.28.806

    • NAID

      130007956330

    • ISSN
      1882-6652
    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Valid Orderings of Layers When Simple-Folding a Map2020

    • Author(s)
      Jia Yiyang、Mitani Jun、Uehara Ryuhei
    • Journal Title

      Journal of Information Processing

      Volume: 28 Issue: 0 Pages: 816-824

    • DOI

      10.2197/ipsjjip.28.816

    • NAID

      130007956337

    • ISSN
      1882-6652
    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Minimum Forcing Sets for Single-vertex Crease Pattern2020

    • Author(s)
      Ouchi Koji、Uehara Ryuhei
    • Journal Title

      Journal of Information Processing

      Volume: 28 Issue: 0 Pages: 800-805

    • DOI

      10.2197/ipsjjip.28.800

    • NAID

      130007956331

    • ISSN
      1882-6652
    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Diameter of colorings under Kempe changes2020

    • Author(s)
      Bonamy Marthe、Heinrich Marc、Ito Takehiro、Kobayashi Yusuke、Mizuta Haruka、Muehlenthaler Moritz、Suzuki Akira、Wasa Kunihiro
    • Journal Title

      Theoretical Computer Science

      Volume: 838 Pages: 45-57

    • DOI

      10.1016/j.tcs.2020.05.033

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Complexity of the Multi-Service Center Problem2020

    • Author(s)
      Takehiro Ito, Naonori Kakimura, and Yusuke Kobayashi
    • Journal Title

      Theoretical Computer Science

      Volume: 842 Pages: 18-27

    • DOI

      10.1016/j.tcs.2020.07.021

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Parameterized Orientable Deletion2020

    • Author(s)
      Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
    • Journal Title

      Algorithmica

      Volume: - Pages: 1909-1938

    • DOI

      10.1007/s00453-020-00679-6

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [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: - Pages: 2586-2605

    • DOI

      10.1007/s00453-020-00700-y

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [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 Pages: 3566-3587

    • DOI

      10.1007/s00453-020-00737-z

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [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 Pages: 215-245

    • DOI

      10.7155/jgaa.00528

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [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
    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs2020

    • Author(s)
      Yamazaki Kazuaki、Saitoh Toshiki、Kiyomi Masashi、Uehara Ryuhei
    • Journal Title

      Theoretical Computer Science

      Volume: 806 Pages: 310-322

    • DOI

      10.1016/j.tcs.2019.04.017

    • NAID

      120006648102

    • Related Report
      2019 Annual Research Report
    • Peer Reviewed
  • [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

    • Related Report
      2019 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Reconfiguring spanning and induced subgraphs2020

    • Author(s)
      Hanaka Tesshu、Ito Takehiro、Mizuta Haruka、Moore Benjamin、Nishimura Naomi、Subramanya Vijay、Suzuki Akira、Vaidyanathan Krishna
    • Journal Title

      Theoretical Computer Science

      Volume: 806 Pages: 553-566

    • DOI

      10.1016/j.tcs.2019.09.018

    • Related Report
      2019 Annual Research Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] Linear-time online algorithm for inferring the shortest path graph from a walk label2020

    • Author(s)
      Shintaro Narisada, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
    • Journal Title

      Theoretical Computer Science

      Volume: 812 Pages: 187-202

    • DOI

      10.1016/j.tcs.2019.10.029

    • Related Report
      2019 Annual Research Report
    • Peer Reviewed
  • [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

    • Related Report
      2019 Annual Research Report
    • Peer Reviewed / Int'l Joint Research
  • [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

      10.1587/transfun.E102.A.1134

    • NAID

      130007699569

    • ISSN
      0916-8508, 1745-1337
    • Related Report
      2019 Annual Research Report
    • Peer Reviewed
  • [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

    • Related Report
      2019 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Enumerating Highly-Edge-Connected Spanning Subgraphs2019

    • Author(s)
      Katsuhisa Yamanaka, Yasuko Matsui, and Shin-ichi Nakano
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E102-A Issue: 9 Pages: 1002-1006

    • DOI

      10.1587/transfun.e102.a.1002

      10.1587/transfun.E102.A.1002

    • NAID

      130007699444

    • ISSN
      0916-8508, 1745-1337
    • Related Report
      2019 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Permuted Pattern Matching Algorithms on Multi-Track Strings2019

    • Author(s)
      Diptarama Hendrian, Yohei Ueki, Kazuyuki Narisawa, Ryo Yoshinaka, Ayumi Shinohara
    • Journal Title

      Algorithms

      Volume: 12 Pages: 73-73

    • DOI

      10.3390/a12040073

    • Related Report
      2019 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Distributional learning of conjunctive grammars and contextual binary feature grammars2019

    • Author(s)
      Ryo Yoshinaka
    • Journal Title

      Journal of Computer and System Sciences

      Volume: 104 Pages: 359-374

    • DOI

      10.1016/j.jcss.2017.07.004

    • Related Report
      2019 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Efficient dynamic dictionary matching with DAWGs and AC-automata2019

    • Author(s)
      Diptarama Hendrian, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara
    • Journal Title

      Theoretical Computer Science

      Volume: 792 Pages: 161-172

    • DOI

      10.1016/j.tcs.2018.04.016

    • Related Report
      2019 Annual Research Report
    • Peer Reviewed
  • [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

    • Related Report
      2019 Annual Research Report
    • Peer Reviewed / Int'l Joint Research
  • [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

    • Related Report
      2019 Annual Research Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] Efficient Construction of Binary Decision Diagrams for Network Reliability with Imperfect Vertices2019

    • Author(s)
      Jun Kawahara, Koki Sonoda, Takeru Inoue, and Shoji Kasahara
    • Journal Title

      Reliability Engineering & System Safety

      Volume: 188 Pages: 142-154

    • DOI

      10.1016/j.ress.2019.03.026

    • Related Report
      2018 Annual Research Report
    • Peer Reviewed
  • [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 Pages: 111-134

    • DOI

      10.7155/jgaa.00486

    • Related Report
      2018 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant2019

    • Author(s)
      Kawahara Jun、Saitoh Toshiki、Yoshinaka Ryo
    • Journal Title

      Journal of Graph Algorithms and Applications

      Volume: 23 Pages: 29-70

    • DOI

      10.7155/jgaa.00483

    • Related Report
      2018 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Sequentially Swapping Colored Tokens on Graphs2019

    • Author(s)
      Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, and Takeaki Uno
    • Journal Title

      Journal of Graph Algorithms and Applications

      Volume: 23 Pages: 3-27

    • DOI

      10.7155/jgaa.00482

    • NAID

      120006779053

    • Related Report
      2018 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Exact Exponential Algorithm for Distance-3 Independent Set Problem2019

    • Author(s)
      YAMANAKA Katsuhisa、KAWARAGI Shogo、HIRAYAMA Takashi
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E102.D Issue: 3 Pages: 499-501

    • DOI

      10.1587/transinf.2018fcl0002

      10.1587/transinf.2018FCL0002

    • NAID

      130007606619

    • ISSN
      0916-8532, 1745-1361
    • Related Report
      2018 Annual Research Report
    • Peer Reviewed
  • [Journal Article] The Complexity of Induced Tree Reconfiguration Problems2019

    • Author(s)
      WASA Kunihiro、YAMANAKA Katsuhisa、ARIMURA Hiroki
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E102.D Issue: 3 Pages: 464-469

    • DOI

      10.1587/transinf.2018fcp0010

      10.1587/transinf.2018FCP0010

    • NAID

      130007605874

    • ISSN
      0916-8532, 1745-1361
    • Related Report
      2018 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] The Coloring Reconfiguration Problem on Specific Graph Classes2019

    • Author(s)
      HATANAKA Tatsuhiko、ITO Takehiro、ZHOU Xiao
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E102.D Issue: 3 Pages: 423-429

    • DOI

      10.1587/transinf.2018fcp0005

      10.1587/transinf.2018FCP0005

    • NAID

      130007606879

    • ISSN
      0916-8532, 1745-1361
    • Related Report
      2018 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns2019

    • Author(s)
      OUCHI Koji、UEHARA Ryuhei
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E102.D Issue: 3 Pages: 416-422

    • DOI

      10.1587/transinf.2018fcp0004

      10.1587/transinf.2018FCP0004

    • NAID

      130007607014

    • ISSN
      0916-8532, 1745-1361
    • Related Report
      2018 Annual Research Report
    • Peer Reviewed
  • [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 Pages: 1490-1511

    • DOI

      10.1007/s00453-018-0481-y

    • Related Report
      2018 Annual Research Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] Parameterized complexity of the list coloring reconfiguration problem with graph parameters2018

    • Author(s)
      Hatanaka Tatsuhiko、Ito Takehiro、Zhou Xiao
    • Journal Title

      Theoretical Computer Science

      Volume: 739 Pages: 65-79

    • DOI

      10.1016/j.tcs.2018.05.005

    • Related Report
      2018 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [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

    • Related Report
      2018 Annual Research Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] Bumpy pyramid folding2018

    • Author(s)
      Abel Zachary R.、Demaine Erik D.、Demaine Martin L.、Ito Hiro、Snoeyink Jack、Uehara Ryuhei
    • Journal Title

      Computational Geometry

      Volume: 75 Pages: 22-31

    • DOI

      10.1016/j.comgeo.2018.06.007

    • NAID

      120006676394

    • Related Report
      2018 Annual Research Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] Flat foldings of plane graphs with prescribed angles and edge lengths2018

    • Author(s)
      Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna Lubiw, Ryuhei Uehara
    • Journal Title

      JoCG

      Volume: 9(1) Pages: 74-93

    • DOI

      10.20382/JOCG.V9I1A3

    • NAID

      120006490003

    • Related Report
      2018 Annual Research Report
    • Peer Reviewed / Int'l Joint Research
  • [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

    • Related Report
      2018 Annual Research Report
    • Peer Reviewed / Int'l Joint Research
  • [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

    • Related Report
      2018 Annual Research Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] "DenseZDD: A Compact and Fast Index for Families of Sets"2018

    • Author(s)
      Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, and Kunihiko Sadakane
    • Journal Title

      Algorithms

      Volume: Vol.11, No.8 Pages: 128-128

    • DOI

      10.3390/a11080128

    • NAID

      120006659589

    • Related Report
      2018 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Function Design for Minimum Multiple-Control Toffoli Circuits of Reversible Adder/Subtractor Blocks and Arithmetic Logic Units2018

    • Author(s)
      ALI Md Belayet、HIRAYAMA Takashi、YAMANAKA Katsuhisa、NISHITANI Yasuaki
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E101.A Issue: 12 Pages: 2231-2243

    • DOI

      10.1587/transfun.e101.a.2231

      10.1587/transfun.E101.A.2231

    • NAID

      130007539011

    • ISSN
      0916-8508, 1745-1337
    • Related Report
      2018 Annual Research Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] Rep-Cubes: Dissection of a Cube into Nets2018

    • Author(s)
      XU Dawei、HUANG Jinfeng、NAKANE Yuta、YOKOYAMA Tomoo、HORIYAMA Takashi、UEHARA Ryuhei
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E101.A Issue: 9 Pages: 1420-1430

    • DOI

      10.1587/transfun.e101.a.1420

      10.1587/transfun.E101.A.1420

    • NAID

      130007479452

    • ISSN
      0916-8508, 1745-1337
    • Related Report
      2018 Annual Research Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] Enumerating Floorplans with Columns2018

    • Author(s)
      Katsuhisa Yamanaka, Md. Saidur Rahman and Shin-Ichi Nakano
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E101-A Issue: 9 Pages: 1392-1397

    • DOI

      10.1587/transfun.e101.a.1392

      10.1587/transfun.E101.A.1392

    • NAID

      130007479453

    • ISSN
      0916-8508, 1745-1337
    • Related Report
      2018 Annual Research Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] Enumerating All Spanning Shortest Path Forests with Distance and Capacity Constraints2018

    • Author(s)
      NAKAHATA Yu、KAWAHARA Jun、HORIYAMA Takashi、KASAHARA Shoji
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E101.A Issue: 9 Pages: 1363-1374

    • DOI

      10.1587/transfun.e101.a.1363

      10.1587/transfun.E101.A.1363

    • NAID

      130007479535

    • ISSN
      0916-8508, 1745-1337
    • Related Report
      2018 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Computational Power of Threshold Circuits of Energy at most Two2018

    • Author(s)
      MANIWA Hiroki、OKI Takayuki、SUZUKI Akira、UCHIZAWA Kei、ZHOU Xiao
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E101.A Issue: 9 Pages: 1745-1337

    • DOI

      10.1587/transfun.e101.a.1431

      10.1587/transfun.E101.A.1431

    • NAID

      130007479449

    • ISSN
      0916-8508, 1745-1337
    • Related Report
      2018 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Presentation] Mathematical Characterizations and Computational Complexity of Anti-Slide Puzzles2021

    • Author(s)
      Ko Minamisawa, Ryuhei Uehara, Masao Hara
    • Organizer
      WALCOM 2021
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Cyclic Shift Problems on Graphs2021

    • Author(s)
      Giovanni Viglietta, Ryuhei Uehara, Kwon Kham Sai
    • Organizer
      WALCOM 2021
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs2021

    • Author(s)
      Kazuaki Yamazaki, Mengze Qian, Ryuhei Uehara
    • Organizer
      WALCOM 2021
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes2021

    • Author(s)
      Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender
    • Organizer
      WALCOM 2021
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Efficient Folding Algorithms for Regular Polyhedra2020

    • Author(s)
      Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara
    • Organizer
      CCCG 2020
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots2020

    • Author(s)
      Giuseppe Antonio Di Luna, Ryuhei Uehara, Giovanni Viglietta, Yukiko Yamauchi
    • Organizer
      DISC 2020
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Reconfiguration of Spanning Trees with Many or Few Leaves2020

    • Author(s)
      Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
    • Organizer
      ESA 2020
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Minimization and Parameterized Variants of Vertex Partition Problems on Graphs2020

    • Author(s)
      Yuma Tamura, Takehiro Ito, Xiao Zhou
    • Organizer
      ISAAC 2020
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Fixed-Parameter Algorithms for Graph Constraint Logic2020

    • Author(s)
      Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Muhlenthaler, Akira Suzuki
    • Organizer
      IPEC 2020
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [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
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Presentation] A Survey on Spanning Tree Congestion2020

    • Author(s)
      Yota Otachi
    • Organizer
      Treewidth, Kernels, and Algorithms 2020
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Grundy Distinguishes Treewidth from Pathwidth2020

    • Author(s)
      Remy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
    • Organizer
      ESA 2020
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs2020

    • Author(s)
      Taisuke Izumi, Yota Otachi
    • Organizer
      ICALP 2020
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [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
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Parameterized Complexity of Graph Burning2020

    • Author(s)
      Yasuaki Kobayashi, Yota Otachi
    • Organizer
      IPEC 2020
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Linear-Time Recognition of Double-Threshold Graphs2020

    • Author(s)
      Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno
    • Organizer
      WG 2020
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Enumerating All Subgraphs Under Given Constraints Using Zero-Suppressed Sentential Decision Diagrams2020

    • Author(s)
      Yu Nakahata, Masaaki Nishino, Jun Kawahara, Shin-ichi Minato
    • Organizer
      SEA 2020
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Decremental Optimization of Dominating Sets Under the Reconfiguration Framework2020

    • Author(s)
      Alexandre Blanche, Haruka Mizuta, Paul Ouvrard, Akira Suzuki
    • Organizer
      IWOCA 2020
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Presentation] DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures2020

    • Author(s)
      Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
    • Organizer
      CPM 2020
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Grammar Compression with Probabilistic Context-Free Grammar2020

    • Author(s)
      Hiroaki Naganuma, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara, Naoki Kobayashi
    • Organizer
      DCC 2020
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Presentation] AOBA: An Online Benchmark Tool for Algorithms in Stringology2020

    • Author(s)
      Ryu Wakimoto, Satoshi Kobayashi, Yuki Igarashi, Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
    • Organizer
      SOFSEM 2020
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Presentation] An Extension of Linear-size Suffix Tries for Parameterized Strings2020

    • Author(s)
      Katsuhito Nakashima, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
    • Organizer
      SOFSEM 2020
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Parallel Duel-and-Sweep Algorithm for the Order-Preserving Pattern Matching2020

    • Author(s)
      Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
    • Organizer
      SOFSEM 2020
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Computing Covers Under Substring Consistent Equivalence Relations2020

    • Author(s)
      Natsumi Kikuchi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
    • Organizer
      SPIRE 2020
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Fast and Linear-Time String Matching Algorithms Based on the Distances of q-Gram Occurrences2020

    • Author(s)
      Satoshi Kobayashi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
    • Organizer
      SEA 2020
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Presentation] A Polynomial Delay Algorithm for Enumerating 2-Edge-Connected Induced Subgraphs2020

    • Author(s)
      Yusuke Sano, Katsuhisa Yamanaka, Takashi Hirayama
    • Organizer
      FAW 2020
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Floorplans with Walls2020

    • Author(s)
      Katsuhisa Yamanaka, Shin-Ichi Nakano
    • Organizer
      TAMC 2020
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Efficient Enumeration of Non-isomorphic Ptolemaic Graphs2020

    • Author(s)
      Dat Hoang Tran, Ryuhei Uehara
    • Organizer
      The 14th International Conference and Workshops on Algorithms and Computation (WALCOM 2020)
    • Related Report
      2019 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Shortest Reconfiguration of Colorings Under Kempe Changes2020

    • Author(s)
      Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Muhlenthaler, Akira Suzuki, Kunihiro Wasa
    • Organizer
      STACS 2020
    • Related Report
      2019 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Reconfiguring k-path Vertex Covers2020

    • Author(s)
      Duc A. Hoang, Akira Suzuki, Tsuyoshi Yagita
    • Organizer
      WALCOM 2020
    • Related Report
      2019 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Trichotomy for the Reconfiguration Problem of Integer Linear Systems2020

    • Author(s)
      Kei Kimura, Akira Suzuki
    • Organizer
      WALCOM 2020
    • Related Report
      2019 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration2020

    • Author(s)
      Yu Nakahata, Jun Kawahara, Takashi Horiyama, Shin-ichi Minato
    • Organizer
      WALCOM 2020
    • Related Report
      2019 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs2020

    • Author(s)
      Yuma Tamura, Takehiro Ito, Xiao Zhou
    • Organizer
      WALCOM 2020
    • Related Report
      2019 Annual Research Report
    • Int'l Joint Research
  • [Presentation] On the Complexity of Lattice Puzzles2019

    • Author(s)
      Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki, Ryuhei Uehara
    • Organizer
      The 30th International Symposium on Algorithms and Computation (ISAAC 2019)
    • Related Report
      2019 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Reconfiguring Undirected Paths2019

    • Author(s)
      Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno
    • Organizer
      WADS 2019
    • Related Report
      2019 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Max-Min 3-dispersion Problems2019

    • Author(s)
      Takashi Horiyama, Shin-ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
    • Organizer
      COCOON 2019
    • Related Report
      2019 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Shortest Reconfiguration Sequence for Sliding Tokens on Spiders2019

    • Author(s)
      Duc A. Hoang, Amanj Khorramian, Ryuhei Uehara
    • Organizer
      The 11th International Conference on Algorithms and Complexity (CIAC 2019)
    • Related Report
      2019 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Diameter of Colorings Under Kempe Changes2019

    • Author(s)
      Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Muhlenthaler, Akira Suzuki, Kunihiro Wasa
    • Organizer
      COCOON 2019
    • Related Report
      2019 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Incremental Optimization of Independent Sets Under the Reconfiguration Framework2019

    • Author(s)
      Takehiro Ito, Haruka Mizuta, Naomi Nishimura, Akira Suzuki
    • Organizer
      COCOON 2019
    • Related Report
      2019 Annual Research Report
    • Int'l Joint Research
  • [Presentation] A Fast Algorithm for Combinatorial Hotspot Mining Based on Spatial Scan Statistic2019

    • Author(s)
      Shin-ichi Minato, Jun Kawahara, Fumio Ishioka, Masahiro Mizuta, Koji Kurihara
    • Organizer
      SDM 2019
    • Related Report
      2019 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Algorithms for Gerrymandering over Graphs2019

    • Author(s)
      Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Organizer
      AAMAS 2019
    • Related Report
      2019 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Shortest Reconfiguration of Perfect Matchings via Alternating Cycles2019

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Organizer
      ESA 2019
    • Related Report
      2019 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Reconfiguration of Minimum Steiner Trees via Vertex Exchanges2019

    • Author(s)
      Haruka Mizuta, Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
    • Organizer
      MFCS 2019
    • Related Report
      2019 Annual Research Report
    • Int'l Joint Research
  • [Presentation] The Perfect Matching Reconfiguration Problem2019

    • Author(s)
      Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Muhlenthaler, Kunihiro Wasa
    • Organizer
      MFCS 2019
    • Related Report
      2019 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Shortest Reconfiguration of Matchings2019

    • Author(s)
      Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito, Moritz Muhlenthaler
    • Organizer
      WG 2019
    • Related Report
      2019 Annual Research Report
    • Int'l Joint Research
  • [Presentation] An Improvement of the Franek-Jennings-Smyth Pattern Matching Algorithm2019

    • Author(s)
      Satoshi Kobayashi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
    • Organizer
      Stringology 2019
    • Related Report
      2019 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Query Learning Algorithm for Residual Symbolic Finite Automata2019

    • Author(s)
      Kaizaburo Chubachi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
    • Organizer
      GandALF 2019
    • Related Report
      2019 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Parameterized Complexity of Safe Set2019

    • Author(s)
      Remy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
    • Organizer
      CIAC 2019
    • Related Report
      2019 Annual Research Report
    • Int'l Joint Research
  • [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
    • Related Report
      2019 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Low-Congestion Shortcut and Graph Parameters2019

    • Author(s)
      Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi
    • Organizer
      DISC 2019
    • Related Report
      2019 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Independent Set Reconfiguration Parameterized by Modular-Width2019

    • Author(s)
      Remy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
    • Organizer
      WG 2019
    • Related Report
      2019 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Colorful Frontier-based Search: Implicit Enumeration of Chordal and Interval Subgraphs2019

    • Author(s)
      Jun Kawahara, Toshiki Saitoh, Hirofumi Suzuki, and Ryo Yoshinaka
    • Organizer
      Special Event on Analysis of Experimental Algorithms (SEA^2 2019), to appear
    • Related Report
      2018 Annual Research Report
    • Int'l Joint Research
  • [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
    • Related Report
      2018 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Efficient Algorithm for Box Folding2019

    • Author(s)
      Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara
    • Organizer
      WALCOM 2019, pp. 277-288
    • Related Report
      2018 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Algorithms for Coloring Reconfiguration Under Recolorability Constraints2018

    • Author(s)
      Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou
    • Organizer
      ISAAC 2018, pp. 37:1-37:13
    • Related Report
      2018 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Aggregating Crowd Opinions Using Shapley Value Regression2018

    • Author(s)
      Yuko Sakurai, Jun Kawahara, Satoshi Oyama
    • Organizer
      MIWAI 2018, pp. 151-160
    • Related Report
      2018 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Linear-Time Online Algorithm Inferring the Shortest Path from a Walk2018

    • Author(s)
      Shintaro Narisada, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
    • Organizer
      SPIRE 2018, pp. 311-324
    • Related Report
      2018 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Ladder-Lottery Realization2018

    • Author(s)
      Katsuhisa Yamanaka, Takashi Horiyama, Takeaki Uno, Kunihiro Wasa
    • Organizer
      CCCG 2018, pp. 61-67
    • Related Report
      2018 Annual Research Report
    • Int'l Joint Research
  • [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
    • Related Report
      2018 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Reconfiguring Spanning and Induced Subgraphs2018

    • Author(s)
      Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan
    • Organizer
      COCOON 2018, pp. 428-440
    • Related Report
      2018 Annual Research Report
    • Int'l Joint Research
  • [Presentation] More Routes for Evacuation2018

    • Author(s)
      Katsuhisa Yamanaka, Yasuko Matsui, Shin-Ichi Nakano
    • Organizer
      COCOON 2018, pp. 76-83
    • Related Report
      2018 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Parameterized Orientable Deletion2018

    • Author(s)
      Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
    • Organizer
      SWAT 2018, pp. 24:1-24:13
    • Related Report
      2018 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Enumeration of Cryptarithms Using Deterministic Finite Automata2018

    • Author(s)
      Yuki Nozaki, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
    • Organizer
      CIAA 2018, pp. 286-298
    • Related Report
      2018 Annual Research Report
    • Int'l Joint Research
  • [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
    • Related Report
      2018 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Reconfiguration of Colorable Sets in Classes of Perfect Graphs2018

    • Author(s)
      Takehiro Ito, Yota Otachi
    • Organizer
      SWAT 2018, pp. 27:1-27:13
    • Related Report
      2018 Annual Research Report
    • Int'l Joint Research
  • [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
    • Related Report
      2018 Annual Research Report
    • Int'l Joint Research
  • [Book] Proceedings of the 15th International Conference and Workshops2021

    • Author(s)
      Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy
    • Total Pages
      345
    • Publisher
      Springer
    • ISBN
      9783030682101
    • Related Report
      2020 Annual Research Report
  • [Book] Introduction to Computational Origami - The World of New Computational Geometry2020

    • Author(s)
      Ryuhei Uehara
    • Total Pages
      217
    • Publisher
      Springer
    • ISBN
      9789811544699
    • Related Report
      2020 Annual Research Report
  • [Book] Proceedings of the 10th International Conference on Fun with Algorithms2020

    • Author(s)
      Martin Farach-Colton, Giuseppe Prencipe, Ryuhei Uehara
    • Total Pages
      416
    • Publisher
      Schloss Dagstuhl
    • ISBN
      9783959771450
    • Related Report
      2020 Annual Research Report
  • [Book] First Course in Algorithms Through Puzzles2019

    • Author(s)
      Ryuhei Uehara
    • Total Pages
      175
    • Publisher
      Springer
    • ISBN
      9789811331879
    • Related Report
      2018 Annual Research Report
  • [Remarks] Graph Catalogs

    • URL

      http://www.jaist.ac.jp/~uehara/graphs/

    • Related Report
      2019 Annual Research Report
  • [Funded Workshop] The 15th International Conference and Workshops on Algorithms and Computing (WALCOM 2021)2021

    • Related Report
      2020 Annual Research Report

URL: 

Published: 2018-04-23   Modified: 2022-12-28  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi