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

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

Planned Research

Project AreaFusion of Computer Science, Engineering and Mathematics Approaches for Expanding Combinatorial Reconfiguration
Project/Area Number 20H05793
Research Category

Grant-in-Aid for Transformative Research Areas (B)

Allocation TypeSingle-year Grants
Review Section Transformative Research Areas, Section (IV)
Research InstitutionTohoku University

Principal Investigator

ITO Takehiro  東北大学, 情報科学研究科, 教授 (40431548)

Co-Investigator(Kenkyū-buntansha) 和佐 州洋  法政大学, 理工学部, 准教授 (00781337)
山内 由紀子  九州大学, システム情報科学研究院, 教授 (10546518)
小林 靖明  北海道大学, 情報科学研究院, 准教授 (60735083)
大舘 陽太  名古屋大学, 情報学研究科, 准教授 (80610196)
Project Period (FY) 2020-10-02 – 2023-03-31
Project Status Completed (Fiscal Year 2023)
Budget Amount *help
¥40,040,000 (Direct Cost: ¥30,800,000、Indirect Cost: ¥9,240,000)
Fiscal Year 2022: ¥14,560,000 (Direct Cost: ¥11,200,000、Indirect Cost: ¥3,360,000)
Fiscal Year 2021: ¥14,560,000 (Direct Cost: ¥11,200,000、Indirect Cost: ¥3,360,000)
Fiscal Year 2020: ¥10,920,000 (Direct Cost: ¥8,400,000、Indirect Cost: ¥2,520,000)
Keywords組合せ遷移 / グラフアルゴリズム / 列挙アルゴリズム / 分散アルゴリズム
Outline of Research at the Start

A01班は計算機科学を背景分野とし,組合せ遷移に対するアルゴリズム的メタ定理の構築を目指す.現状,組合せ遷移のアルゴリズム開発は,個々の問題に対する事例研究の度合いが強い.本計画研究では,これら個別に開発されたアルゴリズム手法を「統一された設計技法」へと昇華し,これにより組合せ遷移のアルゴリズムを自動生成できるようにすることを目指す.

Outline of Final Research Achievements

In this research, based in the field of computer science, we have published 73 peer-reviewed papers over a period of 3.5 years, including the carryover period. Through these studies, we were not only able to advance case studies of algorithms for various combinatorial reconfiguration problems, but we also succeeded in achieving our goal of establishing algorithmic meta-theorems for combinatorial reconfiguration. Additionally, we have made research advancements by incorporating enumeration and distributed computing methods from closely related fields into combinatorial reconfiguration. Furthermore, we have collaborated with other project groups and researchers from outside the project, enabling us to tackle various expansions in the algorithmic theory of combinatorial reconfiguration.

Academic Significance and Societal Importance of the Research Achievements

本研究のアルゴリズム的メタ定理は,遷移ステップ数をパラメータとせず,グラフ構造指標のみに基づいており,そのようなメタ定理の構築は世界初である.我々のメタ定理によって,優に30を超える組合せ遷移問題が,個別にアルゴリズムを設計することなく解ける.その他,組合せ遷移問題のベンチマークデータの作成・分析,産学連携研究を通した配電網の停電復旧アルゴリズムの開発等,組合せ遷移の新たな研究展開や社会実装に向けた研究も行うことができた.

Report

(4 results)
  • 2023 Final Research Report ( PDF )
  • 2022 Annual Research Report
  • 2021 Annual Research Report
  • 2020 Annual Research Report
  • Research Products

    (177 results)

All 2024 2023 2022 2021 2020 Other

All Int'l Joint Research (9 results) Journal Article (92 results) (of which Int'l Joint Research: 12 results,  Peer Reviewed: 73 results,  Open Access: 60 results) Presentation (74 results) (of which Int'l Joint Research: 48 results,  Invited: 4 results) Remarks (1 results) Patent(Industrial Property Rights) (1 results)

  • [Int'l Joint Research] NISER Bhubaneswar/Institute of Mathematical Sciences(インド)

    • Related Report
      2022 Annual Research Report
  • [Int'l Joint Research] University of Bremen(ドイツ)

    • Related Report
      2022 Annual Research Report
  • [Int'l Joint Research] Universite Grenoble Alpes/Universite de Lyon/Universite de Bordeaux(フランス)

    • Related Report
      2022 Annual Research Report
  • [Int'l Joint Research] マリボル大学(スロベニア)

    • Related Report
      2021 Annual Research Report
  • [Int'l Joint Research] ボルドー大学/リヨン大学/パリ・ドーフィン大学(フランス)

    • Related Report
      2021 Annual Research Report
  • [Int'l Joint Research] ドルトムント工科大学(ドイツ)

    • Related Report
      2020 Annual Research Report
  • [Int'l Joint Research] グルノーブル・アルプ大学(フランス)

    • Related Report
      2020 Annual Research Report
  • [Int'l Joint Research] カンピーナス州立大学/フルミネンセ連邦大学(ブラジル)

    • Related Report
      2020 Annual Research Report
  • [Int'l Joint Research] カリフォルニア大学サンタバーバラ校(米国)

    • Related Report
      2020 Annual Research Report
  • [Journal Article] Finding a Reconfiguration Sequence between Longest Increasing Subsequences2024

    • Author(s)
      Yuuki Aoike, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
    • Journal Title

      IEICE Transactions on Information and Systems

      Volume: E107.D Issue: 4 Pages: 559-563

    • DOI

      10.1587/transinf.2023EDL8067

    • ISSN
      0916-8532, 1745-1361
    • Year and Date
      2024-04-01
    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] On a Spectral Lower Bound of Treewidth2024

    • Author(s)
      GIMA Tatsuya、HANAKA Tesshu、NORO Kohei、ONO Hirotaka、OTACHI Yota
    • Journal Title

      IEICE Transactions on Information and Systems

      Volume: E107.D Issue: 3 Pages: 328-330

    • DOI

      10.1587/transinf.2023FCL0002

    • ISSN
      0916-8532, 1745-1361
    • Year and Date
      2024-03-01
    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [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 Transactions on Information and Systems

      Volume: E107.D Issue: 3 Pages: 325-327

    • DOI

      10.1587/transinf.2023FCL0003

    • ISSN
      0916-8532, 1745-1361
    • Year and Date
      2024-03-01
    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [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
    • Related Report
      2022 Annual Research Report
    • Peer Reviewed
  • [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
    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Int'l Joint Research
  • [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
    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [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
    • Related Report
      2022 Annual Research Report
    • Peer Reviewed
  • [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

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover2024

    • Author(s)
      Horiyama Takashi、Kobayashi Yasuaki、Ono Hirotaka、Seto Kazuhisa、Suzuki Ryu
    • Journal Title

      Proceedings of the AAAI Conference on Artificial Intelligence

      Volume: 38 Issue: 18 Pages: 20726-20734

    • DOI

      10.1609/aaai.v38i18.30060

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] CoRe Challenge 2022/2023: Empirical evaluations for independent set reconfiguration problems (Extended Abstract)2024

    • Author(s)
      Takehide Soh, Tomoya Tanjo, Yoshio Okamoto, Takehiro Ito
    • Journal Title

      Proc. of 17th International Symposium on Combinatorial Search (SoCS 2024)

      Volume: -

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

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Scalable hard instances for independent set reconfiguration2024

    • Author(s)
      Takehide Soh, Takumu Watanabe, Jun Kawahara, Akira Suzuki, Takehiro Ito
    • Journal Title

      Proc. of 22nd Symposium on Experimental Algorithms (SEA 2024), Leibniz International Proceedings in Informatics

      Volume: 301

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [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

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [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
    • Related Report
      2022 Annual Research Report
    • Peer Reviewed
  • [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

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Monotone edge flips to an orientation of maximum edge-connectivity a la Nash-Williams2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      ACM Transactions on Algorithms

      Volume: 19 Issue: 1 Pages: 6-6

    • DOI

      10.1145/3561302

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Reconfiguration of vertex-disjoint shortest paths on graphs2023

    • Author(s)
      Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara
    • Journal Title

      Proc. of 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023), Lecture Notes in Computer Science

      Volume: 13973 Pages: 191-201

    • DOI

      10.1007/978-3-031-27051-2_17

    • ISBN
      9783031270505, 9783031270512
    • Related Report
      2022 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Reconfiguration of spanning trees with degree constraints or diameter constraints2023

    • Author(s)
      Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki and Kunihiro Wasa
    • Journal Title

      Algorithmica

      Volume: - Issue: 9 Pages: 2779-2816

    • DOI

      10.1007/s00453-023-01117-z

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] ZDD-based algorithmic framework for solving shortest reconfiguration problems2023

    • Author(s)
      Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama and Takahisa Toda
    • Journal Title

      Proceedings of the 20th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2023), Lecture Notes in Computer Science (LNCS)

      Volume: 13884 Pages: 1-17

    • DOI

      10.1007/978-3-031-33271-5_12

    • ISBN
      9783031332708, 9783031332715
    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Fixed-parameter algorithms for graph constraint logic2023

    • Author(s)
      Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Muhlenthaler, Akira Suzuki
    • Journal Title

      Theoretical Computer Science

      Volume: 959 Pages: 113863-113863

    • DOI

      10.1016/j.tcs.2023.113863

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries2023

    • Author(s)
      Nozaki Yuta、Wasa Kunihiro、Yamanaka Katsuhisa
    • Journal Title

      Proceedings of the 34th International Workshop on Combinatorial Algorithms (IWOCA 2023)

      Volume: - Pages: 331-342

    • DOI

      10.1007/978-3-031-34347-6_28

    • ISBN
      9783031343469, 9783031343476
    • Related Report
      2022 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Reconfiguration of colorings in triangulations of the sphere2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      Proc. of 39th International Symposium on Computational Geometry (SoCG 2023), Leibniz International Proceedings in Informatics

      Volume: 258

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [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

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Reconfiguration of Time-Respecting Arborescences2023

    • Author(s)
      Ito Takehiro、Iwamasa Yuni、Kamiyama Naoyuki、Kobayashi Yasuaki、Kobayashi Yusuke、Maezawa Shun-ichi、Suzuki Akira
    • Journal Title

      Algorithms and Data Structures (WADS 2023)

      Volume: 14079 Pages: 521-532

    • DOI

      10.1007/978-3-031-38906-1_34

    • ISBN
      9783031389054, 9783031389061
    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Rerouting planar curves and disjoint paths2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      Proc. of 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023), Leibniz International Proceedings in Informatics

      Volume: 261

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Algorithmic theory of qubit routing2023

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Journal Title

      Proc. of 18th Algorithms and Data Structures Symposium (WADS 2023), Lecture Notes in Computer Science

      Volume: 14079 Pages: 533-546

    • DOI

      10.1007/978-3-031-38906-1_35

    • ISBN
      9783031389054, 9783031389061
    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Hardness of finding combinatorial shortest paths on graph associahedra2023

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
    • Journal Title

      Proc. of 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023), Leibniz International Proceedings in Informatics

      Volume: 261

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Polynomial-delay enumeration of large maximal common independent sets in two matroids2023

    • Author(s)
      Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
    • Journal Title

      Proc. of 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023), Leibniz International Proceedings in Informatics

      Volume: 272

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Algorithmic study for power restoration in electrical distribution networks2023

    • Author(s)
      Jun Kawahara, Chuta Yamaoka, Takehiro Ito, Akira Suzuki, Daisuke Iioka, Shuhei Sugimura, Seiya Goto, Takayuki Tanabe
    • Journal Title

      Proc. of 4th Asia Pacific Conference of the Prognostics and Health Management (PHMAP 2023)

      Volume: 4 Pages: 1-3

    • Related Report
      2022 Annual Research Report
  • [Journal Article] On reachable assignments under dichotomous preferences2023

    • Author(s)
      Ito Takehiro、Kakimura Naonori、Kamiyama Naoyuki、Kobayashi Yusuke、Nozaki Yuta、Okamoto Yoshio、Ozeki Kenta
    • Journal Title

      Theoretical Computer Science

      Volume: 979 Pages: 114196-114196

    • DOI

      10.1016/j.tcs.2023.114196

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [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

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Solving reconfiguration problems of first-order expressible properties of graph vertices with Boolean satisfiability2023

    • Author(s)
      Takahisa Toda, Takehiro Ito, Jun Kawahara, Takehide Soh, Akira Suzuki, Junichi Teruyama
    • Journal Title

      Proc. of 35th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2023)

      Volume: - Pages: 294-302

    • DOI

      10.1109/ictai59109.2023.00050

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [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

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs2022

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: E105.A Issue: 9 Pages: 1211-1222

    • DOI

      10.1587/transfun.2021DMP0017

    • ISSN
      0916-8508, 1745-1337
    • Year and Date
      2022-09-01
    • Related Report
      2022 Annual Research Report
    • Peer Reviewed
  • [Journal Article] An <i>O</i>(<i>n</i><sup>2</sup>)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position2022

    • Author(s)
      KOBAYASHI Yasuaki、NAKANO Shin-ichi、UCHIZAWA Kei、UNO Takeaki、YAMAGUCHI Yutaro、YAMANAKA Katsuhisa
    • Journal Title

      IEICE Transactions on Information and Systems

      Volume: E105.D Issue: 3 Pages: 503-507

    • DOI

      10.1587/transinf.2021FCP0013

    • NAID

      130008165607

    • ISSN
      0916-8532, 1745-1361
    • Year and Date
      2022-03-01
    • Related Report
      2021 Annual Research Report
    • Peer Reviewed
  • [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

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] A parameterized view to the robust recoverable base problem of matroids under structural uncertainty2022

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Journal Title

      Operations Research Letters

      Volume: 50 Issue: 3 Pages: 370-375

    • DOI

      10.1016/j.orl.2022.05.001

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [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

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Constant amortized time enumeration of Eulerian trails2022

    • Author(s)
      Kurita Kazuhiro、Wasa Kunihiro
    • Journal Title

      Theoretical Computer Science

      Volume: 923 Pages: 1-12

    • DOI

      10.1016/j.tcs.2022.04.048

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Linear-Delay Enumeration for Minimal Steiner Problems2022

    • Author(s)
      Kobayashi Yasuaki、Kurita Kazuhiro、Wasa Kunihiro
    • Journal Title

      PODS '22: Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems

      Volume: - Pages: 301-313

    • DOI

      10.1145/3517804.3524148

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Reforming an envy-free matching2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      arXiv

      Volume: --

    • Related Report
      2022 Annual Research Report
    • Open Access
  • [Journal Article] ZDD-based algorithmic framework for solving shortest reconfiguration problems2022

    • Author(s)
      Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda
    • Journal Title

      arXiv

      Volume: -

    • Related Report
      2022 Annual Research Report
    • Open Access
  • [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

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

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings2022

    • Author(s)
      Kobayashi Yasuaki、Kurita Kazuhiro、Wasa Kunihiro
    • Journal Title

      48TH INTERNATIONAL WORKSHOP ON GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE

      Volume: - Pages: 342-355

    • DOI

      10.1007/978-3-031-15914-5_25

    • ISBN
      9783031159138, 9783031159145
    • Related Report
      2022 Annual Research Report
    • Peer Reviewed
  • [Journal Article] On reachable assignments under dichotomous preferences2022

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      Proc. of 24th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2022), Lecture Notes in Computer Science

      Volume: 13753 Pages: 650-658

    • DOI

      10.1007/978-3-031-21203-1_43

    • ISBN
      9783031212024, 9783031212031
    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [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

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [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

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Rerouting planar curves and disjoint paths2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      arXiv

      Volume: -

    • Related Report
      2022 Annual Research Report
    • Open Access
  • [Journal Article] Reconfiguration of colorings in triangulations of the sphere2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      arXiv

      Volume: -

    • Related Report
      2022 Annual Research Report
    • Open Access
  • [Journal Article] Happy set problem on subclasses of co-comparability graphs2022

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki and Yuma Tamura
    • Journal Title

      Algorithmica

      Volume: - Issue: 11 Pages: 1-21

    • DOI

      10.1007/s00453-022-01081-0

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

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Reforming an envy-free matching2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      Proc. of 36th AAAI Conference on Artificial Intelligence (AAAI 2022)

      Volume: 36 Issue: 5 Pages: 5084-5091

    • DOI

      10.1609/aaai.v36i5.20441

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Reconfiguration of spanning trees with degree constraint or diameter constraint2022

    • Author(s)
      Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
    • Journal Title

      arXiv

      Volume: --

    • Related Report
      2021 Annual Research Report
    • Open Access / Int'l Joint Research
  • [Journal Article] An approximation algorithm for k-best enumeration of minimal connected edge dominating sets with cardinality constraints2022

    • Author(s)
      Kazuhiro Kurita, Kunihiro Wasa
    • Journal Title

      arXiv

      Volume: --

    • Related Report
      2021 Annual Research Report
    • Open Access
  • [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: --

    • Related Report
      2021 Annual Research Report
    • Open Access
  • [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

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Monotone edge flips to an orientation of maximum edge-connectivity ? la Nash-Williams2022

    • Author(s)
      Ito Takehiro、Iwamasa Yuni、Kakimura Naonori、Kamiyama Naoyuki、Kobayashi Yusuke、Maezawa Shun-ichi、Nozaki Yuta、Okamoto Yoshio、Ozeki Kenta
    • Journal Title

      Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)

      Volume: なし Pages: 1342-1355

    • DOI

      10.1137/1.9781611977073.56

    • ISBN
      9781611977073
    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Open Access
  • [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: --

    • Related Report
      2021 Annual Research Report
    • Open Access
  • [Journal Article] Finding shortest non-separating and non-disconnecting paths2022

    • Author(s)
      Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi
    • Journal Title

      arXiv

      Volume: --

    • Related Report
      2021 Annual Research Report
    • Open Access
  • [Journal Article] Reconfiguration of spanning trees with degree constraint or diameter constraint2022

    • Author(s)
      Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
    • Journal Title

      Proc. of 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), Leibniz International Proceedings in Informatics

      Volume: 219

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Happy set problem on subclasses of co-comparability graphs2022

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura
    • Journal Title

      Proc. of 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022), Lecture Notes in Computer Science

      Volume: 13174 Pages: 149-160

    • DOI

      10.1007/978-3-030-96731-4_13

    • ISBN
      9783030967307, 9783030967314
    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Invitation to combinatorial reconfiguration2022

    • Author(s)
      Takehiro Ito
    • Journal Title

      Proc. of 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022), Lecture Notes in Computer Science

      Volume: 13174 Pages: 26-31

    • DOI

      10.1007/978-3-030-96731-4_3

    • NAID

      40021497349

    • ISBN
      9783030967307, 9783030967314
    • Related Report
      2021 Annual Research Report
  • [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
    • Related Report
      2021 Annual Research Report
    • Peer Reviewed
  • [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: --

    • Related Report
      2021 Annual Research Report
    • Open Access
  • [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

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Shortest reconfiguration of perfect matchings via alternating cycles2022

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Journal Title

      SIAM Journal on Discrete Mathematics

      Volume: 36 Issue: 2 Pages: 1102-1123

    • DOI

      10.1137/20m1364370

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Max-Min 3-Dispersion Problems2021

    • Author(s)
      Takashi Horiyama, Shin-ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, and Kunihiro Wasa
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: E104.A Issue: 9 Pages: 1101-1107

    • DOI

      10.1587/transfun.2020DMP0003

    • NAID

      130008081864

    • ISSN
      0916-8508, 1745-1337
    • Year and Date
      2021-09-01
    • Related Report
      2021 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Finding a maximum minimal separator: Graph classes and fixed-parameter tractability2021

    • Author(s)
      Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita
    • Journal Title

      Theoretical Computer Science

      Volume: 865 Pages: 131-140

    • DOI

      10.1016/j.tcs.2021.03.006

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Open Access
  • [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
    • Related Report
      2021 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Algorithms for gerrymandering over graphs2021

    • Author(s)
      Ito Takehiro、Kamiyama Naoyuki、Kobayashi Yusuke、Okamoto Yoshio
    • Journal Title

      Theoretical Computer Science

      Volume: 868 Pages: 30-45

    • DOI

      10.1016/j.tcs.2021.03.037

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Polynomial-delay enumeration of large maximal matchings2021

    • Author(s)
      Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
    • Journal Title

      arXiv

      Volume: --

    • NAID

      130008051609

    • Related Report
      2021 Annual Research Report
    • Open Access
  • [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

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] A (probably) optimal algorithm for Bisection on bounded-treewidth graphs2021

    • Author(s)
      Hanaka Tesshu、Kobayashi Yasuaki、Sone Taiga
    • Journal Title

      Theoretical Computer Science

      Volume: 873 Pages: 38-46

    • DOI

      10.1016/j.tcs.2021.04.023

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed
  • [Journal Article] A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number2021

    • Author(s)
      Kurita Kazuhiro、Wasa Kunihiro、Uno Takeaki、Arimura Hiroki
    • Journal Title

      Theoretical Computer Science

      Volume: - Pages: 32-41

    • DOI

      10.1016/j.tcs.2021.05.008

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

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed
  • [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
    • Related Report
      2021 Annual Research Report
    • Peer Reviewed
  • [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
    • Related Report
      2021 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Monotone edge flips to an orientation of maximum edge-connectivity a la Nash-Williams2021

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      arXiv

      Volume: --

    • Related Report
      2021 Annual Research Report
    • Open Access
  • [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

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Efficient enumeration of dominating sets for sparse graphs2021

    • Author(s)
      Kurita Kazuhiro、Wasa Kunihiro、Arimura Hiroki、Uno Takeaki
    • Journal Title

      Discrete Applied Mathematics

      Volume: 303 Pages: 283-295

    • DOI

      10.1016/j.dam.2021.06.004

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Reconfiguration of regular induced subgraphs2021

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
    • Journal Title

      arXiv

      Volume: --

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

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

    • Related Report
      2021 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [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
  • [Journal Article] Computing the Largest Bond and the Maximum Connected Cut of a Graph2021

    • Author(s)
      Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Ueverton S. Souza
    • Journal Title

      Algorithmica

      Volume: 83 Issue: 5 Pages: 1421-1458

    • DOI

      10.1007/s00453-020-00789-1

    • Related Report
      2020 Annual Research Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] Constant amortized time enumeration of eulerian trails2021

    • Author(s)
      Kazuhiro Kurita, Kunihiro Wasa
    • Journal Title

      arXiv

      Volume: --

    • Related Report
      2020 Annual Research Report
    • 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] A note on exponential-time algorithms for linearwidth2020

    • Author(s)
      Yasuaki Kobayashi, Yu Nakahata
    • Journal Title

      arXiv

      Volume: --

    • Related Report
      2020 Annual Research Report
    • Open Access
  • [Journal Article] Fixed-parameter algorithms for graph constraint logic2020

    • Author(s)
      Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Muhlenthaler, Akira Suzuki
    • Journal Title

      arXiv

      Volume: --

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

    • Related Report
      2020 Annual Research Report
    • Open Access
  • [Presentation] CoRe Challenge 2022/2023: Empirical evaluations for independent set reconfiguration problems (Extended Abstract)2024

    • Author(s)
      Takehide Soh, Tomoya Tanjo, Yoshio Okamoto, Takehiro Ito
    • Organizer
      17th International Symposium on Combinatorial Search (SoCS 2024)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [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)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [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)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [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)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [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)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [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)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Scalable hard instances for independent set reconfiguration2024

    • Author(s)
      Takehide Soh, Takumu Watanabe, Jun Kawahara, Akira Suzuki, Takehiro Ito
    • Organizer
      22nd Symposium on Experimental Algorithms (SEA 2024)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Theoretical aspects of generating instances with unique solutions: Pre-assignment models for unique vertex cover2024

    • Author(s)
      Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono, Kazuhisa Seto, Ryu Suzuki
    • Organizer
      38th AAAI Conference on Artificial Intelligence (AAAI 2024)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [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回アルゴリズム研究発表会
    • Related Report
      2022 Annual Research Report
  • [Presentation] Reconfiguration of vertex-disjoint shortest paths on graphs2023

    • Author(s)
      Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara
    • Organizer
      17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Reconfiguration of time-respecting arborescences2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
    • Organizer
      18th Algorithms and Data Structures Symposium (WADS 2023)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Algorithmic theory of qubit routing2023

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Organizer
      18th Algorithms and Data Structures Symposium (WADS 2023)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] ZDD-based algorithmic framework for solving shortest reconfiguration problems2023

    • Author(s)
      Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda
    • Organizer
      20th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2023)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Reconfiguration and enumeration of optimal cyclic ladder lotteries2023

    • Author(s)
      Yuta Nozaki, Katsuhisa Yamanaka, Kunihiro Wasa
    • Organizer
      34th International Workshop on Combinatorial Algorithms (IWOCA 2023)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Solving reconfiguration problems of first-order expressible properties of graph vertices with Boolean satisfiability2023

    • Author(s)
      Takahisa Toda, Takehiro Ito, Jun Kawahara, Takehide Soh, Akira Suzuki, Junichi Teruyama
    • Organizer
      35th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2023)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [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)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Reconfiguration of colorings in triangulations of the sphere2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      39th International Symposium on Computational Geometry (SoCG 2023)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Three open problems on combinatorial reconfiguration2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      3rd Workshop on Combinatorial Reconfiguration, affiliated with ICALP 2023
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Algorithmic theory of qubit routing2023

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Organizer
      3rd Workshop on Combinatorial Reconfiguration, affiliated with ICALP 2023
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [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)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Polynomial-delay enumeration of large maximal common independent sets in two matroids2023

    • Author(s)
      Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
    • Organizer
      48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Hardness of finding combinatorial shortest paths on graph associahedra2023

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
    • Organizer
      50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Rerouting planar curves and disjoint paths2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Algorithmic study for power restoration in electrical distribution networks2023

    • Author(s)
      Jun Kawahara, Chuta Yamaoka, Takehiro Ito, Akira Suzuki, Daisuke Iioka, Shuhei Sugimura, Seiya Goto, Takayuki Tanabe
    • Organizer
      Asia-Pacific Conference of the Prognostics and Health Management (PHM) Society 2023
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Invitation to combinatorial reconfiguration2023

    • Author(s)
      Takehiro Ito
    • Organizer
      Minisymposium on Combinatorial Reconfiguration in ICIAM 2023
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] 時間制約付き有向木の遷移2023

    • Author(s)
      伊藤 健洋, 岩政 勇仁, 神山 直之, 小林 靖明, 小林 佑輔, 前澤 俊一, 鈴木 顕
    • Organizer
      2023年度夏のLAシンポジウム
    • Related Report
      2022 Annual Research Report
  • [Presentation] 直並列グラフに含まれる極小誘導シュタイナー部分グラフの効率良い列挙2023

    • Author(s)
      大野木 駿, 和佐 州洋
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Related Report
      2022 Annual Research Report
  • [Presentation] 弦グラフの部分クラスにおける極大誘導部分グラフ列挙への多項式遅延アルゴリズム2023

    • Author(s)
      佐藤 嶺, 小林 靖明, 栗田 和宏, 和佐 州洋
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Related Report
      2022 Annual Research Report
  • [Presentation] 事故復旧を考慮した配電系統構成の最適化に関する検討2023

    • Author(s)
      杉村 修平, 金子 曜久, 林 泰弘, 野崎 哲平, 鈴木 顕, 伊藤 健洋, 田邊隆之
    • Organizer
      電力技術/電力系統技術合同研究会
    • Related Report
      2022 Annual Research Report
  • [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)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] On reachable assignments under dichotomous preferences2022

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, and Kenta Ozeki
    • Organizer
      24th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2022)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [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)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Invitation to combinatorial reconfiguration2022

    • Author(s)
      Takehiro Ito
    • Organizer
      33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research / Invited
  • [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)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Linear-delay enumeration for minimal Steiner problems2022

    • Author(s)
      Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
    • Organizer
      41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS 2022)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [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)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [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)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Polynomial-delay and polynomial-space enumeration of large maximal matchings2022

    • Author(s)
      Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
    • Organizer
      48th edition of the International Workshop on Graph-Theoretic Concepts in Computer Science (WG2022)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Invitation to combinatorial reconfiguration2022

    • Author(s)
      Takehiro Ito
    • Organizer
      4th International Workshop on Combinatorial Reconfiguration (CoRe 2022)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Polynomial-delay and polynomial-space enumeration of large maximal matchings2022

    • Author(s)
      Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
    • Organizer
      5th Workshop on Enumeration Problems and Applications (WEPA 2022)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Hardness of braided quantum circuit optimization in the surface code2022

    • Author(s)
      Kunihiro Wasa, Shin Nishio, Koki Suetsugu, Michael Hanks, Ashley Stephens, Yu Yokoi, Kae Nemoto
    • Organizer
      Quantum Resource Estimation (QRE2022)
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] 球面の三角形分割の彩色遷移2022

    • Author(s)
      伊藤 健洋,岩政 勇仁,小林 佑輔,前澤 俊一,野崎 雄太,岡本 吉央,小関 健太
    • Organizer
      2022年度応用数学合同研究集会
    • Related Report
      2022 Annual Research Report
  • [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
    • Related Report
      2022 Annual Research Report
  • [Presentation] 直並列グラフに含まれる極小誘導シュタイナー部分グラフの効率良い列挙に向けて2022

    • Author(s)
      大野木 駿,和佐 州洋
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Related Report
      2022 Annual Research Report
  • [Presentation] Reconfiguration and enumeration of optimal cyclic ladder lotteries2022

    • Author(s)
      Yuta Nozaki, Kunihiro Wasa, Katsuhisa Yamanaka
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Related Report
      2022 Annual Research Report
  • [Presentation] 球面の三角形分割の彩色遷移2022

    • Author(s)
      伊藤 健洋,岩政 勇仁,小林 佑輔,前澤 俊一,野崎 雄太,岡本 吉央,小関 健太
    • Organizer
      日本オペレーションズ・リサーチ学会 2022年秋季研究発表会
    • Related Report
      2022 Annual Research Report
  • [Presentation] ZDDを用いた組合せ遷移ソルバー2022

    • Author(s)
      伊藤 健洋, 川原 純, 中畑 裕, 宋 剛秀, 鈴木 顕, 照山 順一, 戸田 貴久
    • Organizer
      日本オペレーションズ・リサーチ学会 2022年秋季研究発表会
    • Related Report
      2022 Annual Research Report
  • [Presentation] 配電損失最小化問題に対する組合せ遷移的アプローチ2022

    • Author(s)
      畠山 航, 鈴木 顕, 伊藤 健洋, 周 暁, 杉村 修平, 田邊 隆之
    • Organizer
      日本オペレーションズ・リサーチ学会 2022年秋季研究発表会
    • Related Report
      2022 Annual Research Report
  • [Presentation] Monotone edge flips to an orientation of maximum edge-connectivity a la Nash-Williams2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      2022 ACM-SIAM Symposium on Discrete Algorithms (SODA 2022)
    • Related Report
      2021 Annual Research Report
    • Int'l Joint Research
  • [Presentation] 難しい列挙問題に対するアプローチ2022

    • Author(s)
      和佐 州洋
    • Organizer
      第119回人工知能基本問題研究会
    • Related Report
      2021 Annual Research Report
    • Invited
  • [Presentation] Algorithms for happy set problem on interval graphs and permutation graphs2022

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura
    • Organizer
      第186回アルゴリズム研究発表会
    • Related Report
      2021 Annual Research Report
  • [Presentation] 有界モデル検査による独立集合遷移問題の解法に関する考察(On solving independent set reconfiguration problems with bounded model checking)2022

    • Author(s)
      戸田 貴久, 伊藤 健洋, 川原 純, 宋 剛秀, 鈴木 顕, 照山 順一
    • Organizer
      第186回アルゴリズム研究発表会
    • Related Report
      2021 Annual Research Report
  • [Presentation] 連結な極小辺支配集合の近似的なトップ-K列挙2022

    • Author(s)
      栗田 和宏, 和佐 州洋
    • Organizer
      2021年度冬のLAシンポジウム, 京都大学数理解析研究所RIMS共同研究(公開型), 情報社会を支える計算機科学の基礎理論
    • Related Report
      2021 Annual Research Report
  • [Presentation] ZDDを用いた組合せ遷移ソルバーについての考察2022

    • Author(s)
      伊藤 健洋, 川原 純, 宋 剛秀, 鈴木 顕, 照山 順一, 戸田 貴久
    • Organizer
      2021年度冬のLAシンポジウム, 京都大学数理解析研究所RIMS共同研究(公開型), 情報社会を支える計算機科学の基礎理論
    • Related Report
      2021 Annual Research Report
  • [Presentation] Monotone edge flips to an orientation of maximum edge-connectivity a la Nash-Williams2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Related Report
      2021 Annual Research Report
    • Invited
  • [Presentation] Computational complexity of ball/water sort puzzles2022

    • Author(s)
      伊藤 健洋, 川原 純, 湊 真一, 大舘 陽太, 斎藤 寿樹, 鈴木 顕, 上原 隆平, 宇野 毅明, 山中 克久, 吉仲 亮
    • Organizer
      第16回組合せゲーム・パズル研究集会
    • Related Report
      2021 Annual Research Report
  • [Presentation] Reconfiguration of spanning trees with degree constraint or diameter constraint2022

    • Author(s)
      Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
    • Organizer
      39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)
    • Related Report
      2021 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Happy set problem on subclasses of co-comparability graphs2022

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura
    • Organizer
      16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022)
    • Related Report
      2021 Annual Research Report
    • Int'l Joint Research
  • [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)
    • Related Report
      2021 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Invitation to combinatorial reconfiguration2022

    • Author(s)
      Takehiro Ito
    • Organizer
      16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022)
    • Related Report
      2021 Annual Research Report
    • Int'l Joint Research / Invited
  • [Presentation] Max-min 3-dispersion on a convex polygon2021

    • Author(s)
      Yasuaki Kobayashi, Shin-ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, Katsuhisa Yamanaka
    • Organizer
      37th European Workshop on Computational Geometry (EuroCG 2021)
    • Related Report
      2021 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Reformist envy-free item allocations: algorithms and complexity2021

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      第183回情報処理学会アルゴリズム研究会
    • Related Report
      2021 Annual Research Report
  • [Presentation] Constant amortized time enumeration of Eulerian trails2021

    • Author(s)
      栗田 和宏, 和佐 州洋
    • Organizer
      第183回情報処理学会アルゴリズム研究会
    • Related Report
      2021 Annual Research Report
  • [Presentation] 大きな極大マッチングの多項式遅延列挙2021

    • Author(s)
      栗田 和宏, 小林 靖明, 和佐 州洋
    • Organizer
      2021年度人工知能学会全国大会
    • Related Report
      2021 Annual Research Report
  • [Presentation] Reconfiguration of envy-free item allocations2021

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      Workshop on Combinatorial Reconfiguration, affiliated with ICALP 2021
    • Related Report
      2021 Annual Research Report
    • Int'l Joint Research
  • [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
    • Related Report
      2021 Annual Research Report
    • Int'l Joint Research
  • [Presentation] 組合せ遷移への招待2021

    • Author(s)
      伊藤 健洋
    • Organizer
      離散数学とその応用研究集会2021
    • Related Report
      2021 Annual Research Report
  • [Presentation] Hardness results on generalized Puyopuyo2021

    • Author(s)
      Hiroshi Eto, Hironori Kiya, Hirotaka Ono
    • Organizer
      14th Annual Meeting of the Asian Association for Algorithms and Computation (AAAC 2021)
    • Related Report
      2021 Annual Research Report
    • Int'l Joint Research
  • [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)
    • Related Report
      2021 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Complexity of reconfiguration of regular induced subgraphs2021

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Related Report
      2021 Annual Research Report
  • [Presentation] Token sliding on directed graphs2021

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Masahiro Takahashi, Yota Otachi, Kunihiro Wasa
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Related Report
      2021 Annual Research Report
  • [Presentation] 区間グラフに対するハミルトン閉路遷移問題2021

    • Author(s)
      佐藤 颯介, 鈴木 顕, 伊藤 健洋, 周 暁
    • Organizer
      電子情報通信学会 2021年 総合大会 COMP 学生シンポジウム
    • Related Report
      2020 Annual Research Report
  • [Presentation] Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with cardinality constraints2020

    • Author(s)
      Kazuhiro Kurita, Yasuaki Kobayashi, Kunihiro Wasa
    • Organizer
      4th International Workshop on Enumeration Problems and Applications (WEPA 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 M?hlenthaler, Akira Suzuki
    • Organizer
      15th International Symposium on Parameterized and Exact Computation (IPEC 2020)
    • Related Report
      2020 Annual Research Report
    • Int'l Joint Research
  • [Remarks] 学術変革領域研究(B)「組合せ遷移」Webサイト

    • URL

      https://core.dais.is.tohoku.ac.jp/

    • Related Report
      2022 Annual Research Report 2021 Annual Research Report 2020 Annual Research Report
  • [Patent(Industrial Property Rights)] 電力融通システム、電力融通方法、電力融通プログラム2022

    • Inventor(s)
      伊藤健洋,鈴木顕,飯岡大輔,川原純,他4名
    • Industrial Property Rights Holder
      東北大学,中部大学,京都大学,明電舎
    • Industrial Property Rights Type
      特許
    • Industrial Property Number
      2022-130841
    • Filing Date
      2022
    • Related Report
      2022 Annual Research Report

URL: 

Published: 2020-10-30   Modified: 2025-01-30  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi