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

• Project/Area Number: 18H04091
• Research Category: Grant-in-Aid for Scientific Research (A)
• Allocation Type: Single-year Grants
• Section: 一般
• Review Section: Medium-sized Section 60:Information science, computer engineering, and related fields
• Research Institution: Japan 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: Completed (Fiscal Year 2022)
• Budget Amount: ¥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

最終年度である令和４年度は、国際会議とジャーナル論文への発表を積極的に実施した。大きくは、グラフ上で定義される各種の問題に対する結果と、より幾何的な計算幾何の問題に対する結果に分けることができる。それぞれの分野における問題に対して、計算複雑度を示すことと、具体的な効率の良いアルゴリズムを与えることという２つのアプローチを行い、多くの結果を得ることができた。
グラフ上での問題については、組合せ遷移と呼ばれる分野に分類される問題に対する結果を数多く得ることができた。またNP完全問題やNP困難問題と呼ばれる、理論的に手に負えないとされる問題に対しても、近年活発に研究されている固定パラメータ容易性と呼ばれるアプローチにより、効率の良いアルゴリズムを数多く得ることができた。
計算幾何の問題については、計算折り紙と呼ばれる分野の問題に対する結果を多数得ることができた。特に、展開図とそれを折ることで得られる立体の間の関係について、いくつかの重要な結果が得られた。例えば、「辺をどのように切り開いても必ず重なりを持ってしまう多面体」について、従来知られていたものよりも遥かに小さな具体例が存在することを証明した。また、「多面体を切り開いて得られる展開図から、別の多面体を折ることができるか」という問題について、新たな研究課題を開拓し、非自明な結果を多数得ることができた。
これらの研究テーマは、世界的に見ても最先端の研究課題と新たな研究成果であり、多くの国際共著論文を書くことができ、本研究グループの生産性の高さと研究成果の質の高さを世界レベルでアピールすることができた。

Research Progress Status

令和4年度が最終年度であるため、記入しない。

Strategy for Future Research Activity

令和4年度が最終年度であるため、記入しない。

Research Products

• [Int'l Joint Research] MIT(米国)
• [Int'l Joint Research] Universite Paris-Dauphine(フランス)
• [Int'l Joint Research] University of Maribor(スロベニア)
• [Int'l Joint Research] MIT(米国)
• [Int'l Joint Research] University of Waterloo(カナダ)
• [Int'l Joint Research] Universiteit Utrecht(オランダ)
• [Journal Article] Enumerating Empty and Surrounding Polygons (2023)
  • Author(s): TERUI Shunta、YAMANAKA Katsuhisa、HIRAYAMA Takashi、HORIYAMA Takashi、KURITA Kazuhiro、UNO Takeaki
  • Journal Title: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Volume: E106.A Issue: 9 Pages: 1082-1091
  • DOI: 10.1587/transfun.2022DMP0007
  • ISSN: 0916-8508, 1745-1337
  • Year and Date: 2023-09-01
  • Peer Reviewed / Open Access
• [Journal Article] DAG-Pathwidth: Graph Algorithmic Analyses of DAG-Type Blockchain Networks (2023)
  • Author(s): Shoji Kasahara, Jun Kawahara, Shin-ichi Minato, Jumpei Mori
  • Journal Title: IEICE Transactions on Information and Systems Volume: E106.D Issue: 3 Pages: 272-283
  • DOI: 10.1587/transinf.2022FCP0007
  • ISSN: 0916-8532, 1745-1361
  • Year and Date: 2023-03-01
  • Peer Reviewed / Open Access
• [Journal Article] Any platonic solid can transform to another by O(1) refoldings (2023)
  • Author(s): Demaine Erik D.、Demaine Martin L.、Diomidov Yevhenii、Kamata Tonan、Uehara Ryuhei、Zhang Hanyu Alice
  • Journal Title: Computational Geometry Volume: 113 Pages: 101995-101995
  • DOI: 10.1016/j.comgeo.2023.101995
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Decremental optimization of vertex-coloring under the reconfiguration framework (2023)
  • Author(s): Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura and Xiao Zhou
  • Journal Title: International Journal of Computer Mathematics: Computer Systems Theory Volume: 8 Issue: 1 Pages: 80-92
  • DOI: 10.1080/23799927.2023.2185543
  • Peer Reviewed
• [Journal Article] Efficient folding algorithms for convex polyhedra (2023)
  • Author(s): Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara
  • Journal Title: Discrete & Computational Geometry Volume: 70 Issue: 4 Pages: 1499-1522
  • DOI: 10.1007/s00454-022-00415-7
  • Peer Reviewed
• [Journal Article] Feedback vertex set reconfiguration in planar graphs (2023)
  • Author(s): Bousquet Nicolas、Hommelsheim Felix、Kobayashi Yusuke、M?hlenthaler Moritz、Suzuki Akira
  • Journal Title: Theoretical Computer Science Volume: 979 Pages: 114188-114188
  • DOI: 10.1016/j.tcs.2023.114188
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Fixed-parameter algorithms for graph constraint logic (2023)
  • 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
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Mathematical Characterizations and Computational Complexity of Anti-Slide Puzzles (2023)
  • Author(s): Ko Minamisawa, Ryuhei Uehara, Masao Hara
  • Journal Title: Theoretical Computer Science Volume: 939 Pages: 216-226
  • DOI: 10.1016/j.tcs.2022.10.026
  • Peer Reviewed / Open Access
• [Journal Article] Monotone edge flips to an orientation of maximum edge-connectivity a la Nash-Williams (2023)
  • 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
  • Peer Reviewed / Open Access
• [Journal Article] On reachable assignments under dichotomous preferences (2023)
  • 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
  • Peer Reviewed / Open Access
• [Journal Article] Path cover problems with length cost (2023)
  • Author(s): Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima and Tsuyoshi Yagita
  • Journal Title: Algorithmica Volume: - Issue: 11 Pages: 3348-3375
  • DOI: 10.1007/s00453-023-01106-2
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Reconfiguration of cliques in a graph (2023)
  • Author(s): Ito Takehiro、Ono Hirotaka、Otachi Yota
  • Journal Title: Discrete Applied Mathematics Volume: 333 Pages: 43-58
  • DOI: 10.1016/j.dam.2023.01.026
  • Peer Reviewed
• [Journal Article] Reconfiguration of spanning trees with degree constraints or diameter constraints (2023)
  • 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
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Reconfiguring (non-spanning) arborescences (2023)
  • Author(s): Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
  • Journal Title: Theoretical Computer Science Volume: 943 Pages: 131-141
  • DOI: 10.1016/j.tcs.2022.12.007
  • Peer Reviewed / Open Access
• [Journal Article] Sorting balls and water: Equivalence and computational complexity (2023)
  • Author(s): Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
  • Journal Title: Theoretical Computer Science Volume: 927 Pages: 114158-114158
  • DOI: 10.1016/j.tcs.2023.114158
  • Peer Reviewed / Open Access
• [Journal Article] Logical Matrix Representations in Map Folding (2022)
  • Author(s): JIA Yiyang、MITANI Jun、UEHARA Ryuhei
  • Journal Title: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Volume: E105.A Issue: 10 Pages: 1401-1412
  • DOI: 10.1587/transfun.2021EAP1165
  • ISSN: 0916-8508, 1745-1337
  • Year and Date: 2022-10-01
  • Peer Reviewed / Open Access
• [Journal Article] Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs (2022)
  • 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
  • Peer Reviewed
• [Journal Article] Reconfiguring <i>k</i>-Path Vertex Covers (2022)
  • Author(s): Duc A. Hoang, Akira Suzuki and Tsuyoshi Yagita
  • Journal Title: IEICE Transactions on Information and Systems Volume: E105.D Issue: 7 Pages: 1258-1272
  • DOI: 10.1587/transinf.2021EDP7177
  • ISSN: 0916-8532, 1745-1361
  • Year and Date: 2022-07-01
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Bicolored Path Embedding Problems Inspired by Protein Folding Models (2022)
  • Author(s): Feng Tianfeng, Giovanni Vigliette, Ryuhei Uehara
  • Journal Title: IEICE Transactions on Information and Systems Volume: E105.D Issue: 3 Pages: 623-633
  • DOI: 10.1587/transinf.2021EDP7206
  • NAID: 130008165624
  • ISSN: 0916-8532, 1745-1361
  • Year and Date: 2022-03-01
  • Peer Reviewed / Open Access
• [Journal Article] Cyclic Shift Problems on Graphs (2022)
  • Author(s): Kwon Kham Sai, Ryuhei Uehara, Giovanni Viglietta
  • Journal Title: IEICE Transactions on Information and Systems Volume: E105.D Issue: 3 Pages: 532-540
  • DOI: 10.1587/transinf.2021FCP0010
  • NAID: 130008165593
  • ISSN: 0916-8532, 1745-1361
  • Year and Date: 2022-03-01
  • Peer Reviewed / Open Access
• [Journal Article] Research on Dissections of a Net of a Cube into Nets of Cubes (2022)
  • Author(s): OKADA Tamami、UEHARA Ryuhei
  • Journal Title: IEICE Transactions on Information and Systems Volume: E105.D Issue: 3 Pages: 459-465
  • DOI: 10.1587/transinf.2021FCP0004
  • NAID: 130008165586
  • ISSN: 0916-8532, 1745-1361
  • Year and Date: 2022-03-01
  • Peer Reviewed / Open Access
• [Journal Article] A parameterized view to the robust recoverable base problem of matroids under structural uncertainty (2022)
  • 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
  • Peer Reviewed / Open Access
• [Journal Article] An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion (2022)
  • Author(s): Aoike Yuuki、Gima Tatsuya、Hanaka Tesshu、Kiyomi Masashi、Kobayashi Yasuaki、Kobayashi Yusuke、Kurita Kazuhiro、Otachi Yota
  • Journal Title: Theory of Computing Systems Volume: 66 Issue: 2 Pages: 502-515
  • DOI: 10.1007/s00224-022-10076-x
  • Peer Reviewed / Open Access
• [Journal Article] Efficient segment folding is hard (2022)
  • Author(s): Horiyama Takashi、Klute Fabian、Korman Matias、Parada Irene、Uehara Ryuhei、Yamanaka Katsuhisa
  • Journal Title: Computational Geometry Volume: 104 Pages: 101860-101860
  • DOI: 10.1016/j.comgeo.2022.101860
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] On robustness against evacuees' unexpected movement in automatic evacuation guiding (2022)
  • Author(s): Jun Kawahara, Takanori Hara, Masahiro Sasabe
  • Journal Title: Computers and Electrical Engineering Volume: 105 Pages: 108531-108531
  • DOI: 10.1016/j.compeleceng.2022.108531
  • Peer Reviewed
• [Journal Article] Parameterized Complexity of Graph Burning (2022)
  • Author(s): Kobayashi Yasuaki、Otachi Yota
  • Journal Title: Algorithmica Volume: 84 Issue: 8 Pages: 2379-2393
  • DOI: 10.1007/s00453-022-00962-8
  • Peer Reviewed / Open Access
• [Journal Article] Parameterized DAWGs: Efficient constructions and bidirectional pattern searches (2022)
  • Author(s): Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
  • Journal Title: Theoretical Computer Science Volume: 933 Pages: 21-42
  • DOI: 10.1016/j.tcs.2022.09.008
  • Peer Reviewed
• [Journal Article] Shortest reconfiguration of perfect matchings via alternating cycles (2022)
  • 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
  • Peer Reviewed
• [Journal Article] Token Shifting on Graphs (2022)
  • Author(s): Win Hlaing Hlaing Myint, Ryuhei Uehara, Giovanni Viglietta
  • Journal Title: International Journal of Computer Mathematics: Computer Systems Theory Volume: 7 Issue: 4 Pages: 223-234
  • DOI: 10.1080/23799927.2022.2118622
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Ununfoldable Polyhedra with 6 Vertices or 6 Faces (2022)
  • Author(s): Hugo A. Akitaya, Erik D. Demaine, David Eppstein, Tomohiro Tachi, Ryuhei Uehara
  • Journal Title: Computational Geometry: Theory and Applications Volume: 103 Pages: 101857-101857
  • DOI: 10.1016/j.comgeo.2021.101857
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Developing a tetramonohedron with minimum cut length (2022)
  • Author(s): Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
  • Journal Title: Computational Geometry: Theory and Applications Volume: 108 Pages: 101903-101903
  • DOI: 10.1016/j.comgeo.2022.101903
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Happy set problem on subclasses of co-comparability graphs (2022)
  • 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
  • Peer Reviewed
• [Journal Article] Linear-Time Recognition of Double-Threshold Graphs (2022)
  • Author(s): Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno
  • Journal Title: Algorithmica 84(4): 1163-1181 (2022) Volume: 84 Issue: 4 Pages: 1163-1181
  • DOI: 10.1007/s00453-021-00921-9
  • Peer Reviewed / Open Access
• [Journal Article] Research on Map Folding with Boundary Order on Simple Fold (2021)
  • Author(s): Yiyang Jia, Jun Mitani, and Ryuhei Uehara
  • Journal Title: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Volume: E104.A Issue: 9 Pages: 1116-1126
  • DOI: 10.1587/transfun.2020DMP0017
  • NAID: 130008081787
  • ISSN: 0916-8508, 1745-1337
  • Year and Date: 2021-09-01
  • Peer Reviewed
• [Journal Article] Max-Min 3-Dispersion Problems (2021)
  • 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
  • Peer Reviewed
• [Journal Article] Parameterized Complexity of $$(A,\ell )$$-Path Packing (2021)
  • Author(s): Belmonte Remy、Hanaka Tesshu、Kanzaki Masaaki、Kiyomi Masashi、Kobayashi Yasuaki、Kobayashi Yusuke、Lampis Michael、Ono Hirotaka、Otachi Yota
  • Journal Title: Algorithmica Volume: 84 Issue: 4 Pages: 871-895
  • DOI: 10.1007/s00453-021-00875-y
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Shortest Reconfiguration of Sliding Tokens on Subclasses of Interval Graphs (2021)
  • Author(s): Takeshi Yamada, Ryuhei Uehara
  • Journal Title: Theoretical Computer Science Volume: 863 Pages: 53-68
  • DOI: 10.1016/j.tcs.2021.02.019
  • Peer Reviewed
• [Journal Article] Algorithms for gerrymandering over graphs (2021)
  • 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
  • Peer Reviewed / Open Access
• [Journal Article] Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs (2021)
  • 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
  • Peer Reviewed
• [Journal Article] On the security number of the Cartesian product of graphs (2021)
  • Author(s): Jakovac Marko、Otachi Yota
  • Journal Title: Discrete Applied Mathematics Volume: 304 Pages: 119-128
  • DOI: 10.1016/j.dam.2021.07.030
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Low-congestion shortcut and graph parameters (2021)
  • Author(s): Kitamura Naoki、Kitagawa Hirotaka、Otachi Yota、Izumi Taisuke
  • Journal Title: Distributed Computing Volume: 34 Issue: 5 Pages: 349-365
  • DOI: 10.1007/s00446-021-00401-x
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Longest common subsequence in sublinear space (2021)
  • Author(s): Kiyomi Masashi、Horiyama Takashi、Otachi Yota
  • Journal Title: Information Processing Letters Volume: 168 Pages: 106084-106084
  • DOI: 10.1016/j.ipl.2020.106084
  • Peer Reviewed
• [Journal Article] Trichotomy for the reconfiguration problem of integer linear systems (2021)
  • Author(s): Kei Kimura, Akira Suzuki
  • Journal Title: Theoretical Computer Science Volume: 856 Pages: 88-109
  • DOI: 10.1016/j.tcs.2020.12.025
  • Peer Reviewed / Open Access
• [Journal Article] Optimal reconfiguration of optimal ladder lotteries (2021)
  • 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
  • Peer Reviewed
• [Journal Article] Complexity of the Maximum <i>k</i>-Path Vertex Cover Problem (2020)
  • Author(s): MIYANO Eiji、SAITOH Toshiki、UEHARA Ryuhei、YAGITA Tsuyoshi、ZANDEN Tom C. van der
  • Journal Title: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Volume: E103.A Issue: 10 Pages: 1193-1201
  • DOI: 10.1587/transfun.2019DMP0014
  • NAID: 130007920231
  • ISSN: 0916-8508, 1745-1337
  • Year and Date: 2020-10-01
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Algorithmic Enumeration of Surrounding Polygons (2020)
  • Author(s): K. Yamanaka, D. Avis, T. Horiyama, Yoshio Okamoto, R. Uehara and T. Yamauchi
  • Journal Title: Discrete Applied Mathematics Volume: online Pages: 1-19
  • DOI: 10.1016/j.dam.2020.03.034
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Parameterized complexity of independent set reconfiguration problems (2020)
  • 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
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Efficient Algorithm for Box Folding (2020)
  • Author(s): Mizunashi Koichi、Horiyama Takashi、Uehara Ryuhei
  • Journal Title: Journal of Graph Algorithms and Applications Volume: 24 Issue: 2 Pages: 89-103
  • DOI: 10.7155/jgaa.00520
  • NAID: 120006775247
  • Peer Reviewed / Open Access
• [Journal Article] Rectangular Unfoldings of Polycubes (2020)
  • 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
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Efficient Algorithm for 2 × <i>n</i> Map Folding with a Box-pleated Crease Pattern (2020)
  • 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
  • Peer Reviewed / Open Access
• [Journal Article] Valid Orderings of Layers When Simple-Folding a Map (2020)
  • 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
  • Peer Reviewed / Open Access
• [Journal Article] Minimum Forcing Sets for Single-vertex Crease Pattern (2020)
  • 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
  • Peer Reviewed / Open Access
• [Journal Article] Diameter of colorings under Kempe changes (2020)
  • 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
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Complexity of the Multi-Service Center Problem (2020)
  • 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
  • Peer Reviewed
• [Journal Article] Parameterized Orientable Deletion (2020)
  • Author(s): Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
  • Journal Title: Algorithmica Volume: - Issue: 7 Pages: 1909-1938
  • DOI: 10.1007/s00453-020-00679-6
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Independent Set Reconfguration Parameterized by Modular-Width (2020)
  • Author(s): Remy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
  • Journal Title: Algorithmica Volume: - Issue: 9 Pages: 2586-2605
  • DOI: 10.1007/s00453-020-00700-y
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Subgraph Isomorphism on Graph Classes that Exclude a Substructure (2020)
  • Author(s): Bodlaender Hans L.、Hanaka Tesshu、Kobayashi Yasuaki、Kobayashi Yusuke、Okamoto Yoshio、Otachi Yota、van der Zanden Tom C.
  • Journal Title: Algorithmica Volume: 82 Issue: 12 Pages: 3566-3587
  • DOI: 10.1007/s00453-020-00737-z
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Parameterized Complexity of Safe Set (2020)
  • Author(s): Belmonte Remy、Hanaka Tesshu、Katsikarelis Ioannis、Lampis Michael、Ono Hirotaka、Otachi Yota
  • Journal Title: Journal of Graph Algorithms and Applications Volume: 24 Issue: 3 Pages: 215-245
  • DOI: 10.7155/jgaa.00528
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] <i>K</i>₃ Edge Cover Problem in a Wide Sense (2020)
  • 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
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Token Sliding on Split Graphs (2020)
  • Author(s): Belmonte Remy、Kim Eun Jung、Lampis Michael、Mitsou Valia、Otachi Yota、Sikora Florian
  • Journal Title: Theory of Computing Systems Volume: Online Issue: 4 Pages: 662-686
  • DOI: 10.1007/s00224-020-09967-8
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs (2020)
  • 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
  • Peer Reviewed
• [Journal Article] Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces (2020)
  • Author(s): Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, Andre van Renssene, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno
  • Journal Title: Computational Geometry: Theory and Applications Volume: 90 Pages: 1-11
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Reconfiguring spanning and induced subgraphs (2020)
  • 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
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Linear-time online algorithm for inferring the shortest path graph from a walk label (2020)
  • 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
  • Peer Reviewed
• [Journal Article] Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph (2020)
  • Author(s): Alessio Conte, Mamadou Moustapha Kante, Yota Otachi, Takeaki Uno, Kunihiro Wasa
  • Journal Title: Theoretical Computer Science Volume: 818 Pages: 2-11
  • DOI: 10.1016/j.tcs.2018.08.009
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] On Computational Complexity of Pipe Puzzles (2019)
  • Author(s): SHIRAYAMA Takumu、SHIGEMURA Takuto、OTACHI Yota、MIYAZAKI Shuichi、UEHARA Ryuhei
  • Journal Title: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Volume: E102.A Issue: 9 Pages: 1134-1141
  • DOI: 10.1587/transfun.E102.A.1134
  • NAID: 130007699569
  • ISSN: 0916-8508, 1745-1337
  • Year and Date: 2019-09-01
  • Peer Reviewed
• [Journal Article] Enumerating Highly-Edge-Connected Spanning Subgraphs (2019)
  • Author(s): Katsuhisa Yamanaka, Yasuko Matsui, and Shin-ichi Nakano
  • Journal Title: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Volume: E102.A Issue: 9 Pages: 1002-1006
  • DOI: 10.1587/transfun.E102.A.1002
  • NAID: 130007699444
  • ISSN: 0916-8508, 1745-1337
  • Year and Date: 2019-09-01
  • Peer Reviewed
• [Journal Article] Exact Exponential Algorithm for Distance-3 Independent Set Problem (2019)
  • Author(s): YAMANAKA Katsuhisa、KAWARAGI Shogo、HIRAYAMA Takashi
  • Journal Title: IEICE Transactions on Information and Systems Volume: E102.D Issue: 3 Pages: 499-501
  • DOI: 10.1587/transinf.2018FCL0002
  • NAID: 130007606619
  • ISSN: 0916-8532, 1745-1361
  • Year and Date: 2019-03-01
  • Peer Reviewed
• [Journal Article] The Complexity of Induced Tree Reconfiguration Problems (2019)
  • Author(s): WASA Kunihiro、YAMANAKA Katsuhisa、ARIMURA Hiroki
  • Journal Title: IEICE Transactions on Information and Systems Volume: E102.D Issue: 3 Pages: 464-469
  • DOI: 10.1587/transinf.2018FCP0010
  • NAID: 130007605874
  • ISSN: 0916-8532, 1745-1361
  • Year and Date: 2019-03-01
  • Peer Reviewed / Open Access
• [Journal Article] The Coloring Reconfiguration Problem on Specific Graph Classes (2019)
  • Author(s): HATANAKA Tatsuhiko、ITO Takehiro、ZHOU Xiao
  • Journal Title: IEICE Transactions on Information and Systems Volume: E102.D Issue: 3 Pages: 423-429
  • DOI: 10.1587/transinf.2018FCP0005
  • NAID: 130007606879
  • ISSN: 0916-8532, 1745-1361
  • Year and Date: 2019-03-01
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns (2019)
  • Author(s): OUCHI Koji、UEHARA Ryuhei
  • Journal Title: IEICE Transactions on Information and Systems Volume: E102.D Issue: 3 Pages: 416-422
  • DOI: 10.1587/transinf.2018FCP0004
  • NAID: 130007607014
  • ISSN: 0916-8532, 1745-1361
  • Year and Date: 2019-03-01
  • Peer Reviewed
• [Journal Article] Reconfiguration of colorable sets in classes of perfect graphs (2019)
  • Author(s): Ito Takehiro、Otachi Yota
  • Journal Title: Theoretical Computer Science Volume: 772 Pages: 111-122
  • DOI: 10.1016/j.tcs.2018.11.024
  • Peer Reviewed
• [Journal Article] Permuted Pattern Matching Algorithms on Multi-Track Strings (2019)
  • Author(s): Diptarama Hendrian, Yohei Ueki, Kazuyuki Narisawa, Ryo Yoshinaka, Ayumi Shinohara
  • Journal Title: Algorithms Volume: 12 Issue: 4 Pages: 73-73
  • DOI: 10.3390/a12040073
  • Peer Reviewed / Open Access
• [Journal Article] Distributional learning of conjunctive grammars and contextual binary feature grammars (2019)
  • 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
  • Peer Reviewed
• [Journal Article] Efficient dynamic dictionary matching with DAWGs and AC-automata (2019)
  • 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
  • Peer Reviewed
• [Journal Article] A lower bound on opaque sets (2019)
  • Author(s): Kawamura Akitoshi、Moriyama Sonoko、Otachi Yota、Pach J?nos
  • Journal Title: Computational Geometry Volume: 80 Pages: 13-22
  • DOI: 10.1016/j.comgeo.2019.01.002
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] On structural parameterizations of firefighting (2019)
  • Author(s): Das Bireswar、Enduri Murali Krishna、Kiyomi Masashi、Misra Neeldhara、Otachi Yota、Reddy I. Vinod、Yoshimura Shunya
  • Journal Title: Theoretical Computer Science Volume: - Pages: 79-90
  • DOI: 10.1016/j.tcs.2019.02.032
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Efficient Construction of Binary Decision Diagrams for Network Reliability with Imperfect Vertices (2019)
  • 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
  • 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 Issue: 2 Pages: 111-134
  • DOI: 10.7155/jgaa.00486
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant (2019)
  • Author(s): Kawahara Jun、Saitoh Toshiki、Yoshinaka Ryo
  • Journal Title: Journal of Graph Algorithms and Applications Volume: 23 Issue: 1 Pages: 29-70
  • DOI: 10.7155/jgaa.00483
  • Peer Reviewed / Open Access
• [Journal Article] Sequentially Swapping Colored Tokens on Graphs (2019)
  • 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 Issue: 1 Pages: 3-27
  • DOI: 10.7155/jgaa.00482
  • NAID: 120006779053
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Function Design for Minimum Multiple-Control Toffoli Circuits of Reversible Adder/Subtractor Blocks and Arithmetic Logic Units (2018)
  • Author(s): ALI Md Belayet、HIRAYAMA Takashi、YAMANAKA Katsuhisa、NISHITANI Yasuaki
  • Journal Title: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Volume: E101.A Issue: 12 Pages: 2231-2243
  • DOI: 10.1587/transfun.E101.A.2231
  • NAID: 130007539011
  • ISSN: 0916-8508, 1745-1337
  • Year and Date: 2018-12-01
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Rep-Cubes: Dissection of a Cube into Nets (2018)
  • Author(s): XU Dawei、HUANG Jinfeng、NAKANE Yuta、YOKOYAMA Tomoo、HORIYAMA Takashi、UEHARA Ryuhei
  • Journal Title: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Volume: E101.A Issue: 9 Pages: 1420-1430
  • DOI: 10.1587/transfun.E101.A.1420
  • NAID: 130007479452
  • ISSN: 0916-8508, 1745-1337
  • Year and Date: 2018-09-01
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Enumerating Floorplans with Columns (2018)
  • Author(s): Katsuhisa Yamanaka, Md. Saidur Rahman and Shin-Ichi Nakano
  • Journal Title: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Volume: E101.A Issue: 9 Pages: 1392-1397
  • DOI: 10.1587/transfun.E101.A.1392
  • NAID: 130007479453
  • ISSN: 0916-8508, 1745-1337
  • Year and Date: 2018-09-01
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Enumerating All Spanning Shortest Path Forests with Distance and Capacity Constraints (2018)
  • Author(s): NAKAHATA Yu、KAWAHARA Jun、HORIYAMA Takashi、KASAHARA Shoji
  • Journal Title: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Volume: E101.A Issue: 9 Pages: 1363-1374
  • DOI: 10.1587/transfun.E101.A.1363
  • NAID: 130007479535
  • ISSN: 0916-8508, 1745-1337
  • Year and Date: 2018-09-01
  • Peer Reviewed
• [Journal Article] Computational Power of Threshold Circuits of Energy at most Two (2018)
  • Author(s): MANIWA Hiroki、OKI Takayuki、SUZUKI Akira、UCHIZAWA Kei、ZHOU Xiao
  • Journal Title: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Volume: E101.A Issue: 9 Pages: 1431-1439
  • DOI: 10.1587/transfun.E101.A.1431
  • NAID: 130007479449
  • ISSN: 0916-8508, 1745-1337
  • Year and Date: 2018-09-01
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] On the Classes of Interval Graphs of Limited Nesting and Count of Lengths (2018)
  • Author(s): Klavik Pavel、Otachi Yota、Sejnoha Jiri
  • Journal Title: Algorithmica Volume: 81 Issue: 4 Pages: 1490-1511
  • DOI: 10.1007/s00453-018-0481-y
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Parameterized complexity of the list coloring reconfiguration problem with graph parameters (2018)
  • 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
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Swapping colored token on graphs (2018)
  • Author(s): K. Yamanaka, T. Horiyama, J. M. Keil, D. G. Kirkpatrick, Y. Otachi, T. Saitoh, R. Uehara and Y. Uno
  • Journal Title: Theoretical Computer Science Volume: 729 Pages: 1-10
  • DOI: 10.1016/j.tcs.2018.03.016
  • NAID: 120005850327
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Bumpy pyramid folding (2018)
  • 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
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Flat foldings of plane graphs with prescribed angles and edge lengths (2018)
  • 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
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] A faster parameterized algorithm for Pseudoforest Deletion (2018)
  • Author(s): Hans L. Bodlaender , Hirotaka Ono, Yota Otachi
  • Journal Title: Discrete Applied Mathematics Volume: 236 Pages: 42-56
  • DOI: 10.1016/j.dam.2017.10.018
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Vertex deletion problems on chordal graphs (2018)
  • Author(s): Cao Yixin、Ke Yuping、Otachi Yota、You Jie
  • Journal Title: Theoretical Computer Science Volume: 745 Pages: 75-86
  • DOI: 10.1016/j.tcs.2018.05.039
  • Peer Reviewed / Int'l Joint Research
• [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 Issue: 8 Pages: 1-23
  • DOI: 10.3390/a11080128
  • NAID: 120006659589
  • Peer Reviewed / Open Access
• [Presentation] Designing algorithms for the shortest path reconfiguration problem using decision diagram operations (2024)
  • Author(s): Shou Ooba, Jun Kawahara, Shin-ichi Minato
  • Organizer: 16th International Conference on Agents and Artificial Intelligence (ICAART 2024)
  • Int'l Joint Research
• [Presentation] On the complexity of list H-packing for sparse graph classes (2024)
  • Author(s): Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
  • Organizer: 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024)
  • Int'l Joint Research
• [Presentation] The shortest path reconfiguration problem based on relaxation of reconfiguration rules (2024)
  • Author(s): Naoki Domon, Akira Suzuki, Yuma Tamura, Xiao Zhou
  • Organizer: 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024)
  • Int'l Joint Research
• [Presentation] On the computational complexity of generalized common shape puzzles (2024)
  • Author(s): Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono, Ryuhei Uehara
  • Organizer: 49th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2024)
  • Int'l Joint Research
• [Presentation] Query learning of minimal deterministic symbolic finite automata separating regular languages (2024)
  • Author(s): Yoshito Kawasaki, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
  • Organizer: 49th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2024)
  • Int'l Joint Research
• [Presentation] Combinatorial reconfiguration with answer set programming: Algorithms, encodings, and empirical analysis (2023)
  • Author(s): Yuya Yamada, Mutsunori Banbara, Katsumi Inoue, Torsten Schaub, Ryuhei Uehara
  • Organizer: 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023)
  • Int'l Joint Research
• [Presentation] Efficient non-isomorphic graph enumeration algorithms for subclasses of perfect graphs (2023)
  • Author(s): Jun Kawahara, Toshiki Saitoh, Hirokazu Takeda, Ryo Yoshinaka, Yui Yoshioka
  • Organizer: 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023)
  • Int'l Joint Research
• [Presentation] Inferring strings from position heaps in linear time (2023)
  • Author(s): Koshiro Kumagai, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
  • Organizer: 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023)
  • Int'l Joint Research
• [Presentation] Overlapping edge unfoldings for archimedean solids and (anti)prisms (2023)
  • Author(s): Takumi Shiota, Toshiki Saitoh
  • Organizer: 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023)
  • Int'l Joint Research
• [Presentation] Parameterized complexity of optimizing list vertex-coloring through reconfiguration (2023)
  • Author(s): Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao Zhou
  • Organizer: 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023)
  • Int'l Joint Research
• [Presentation] Reconfiguration of time-respecting arborescences (2023)
  • 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)
  • Int'l Joint Research
• [Presentation] ZDD-based algorithmic framework for solving shortest reconfiguration problems (2023)
  • 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)
  • Int'l Joint Research
• [Presentation] On the routing problems in graphs with ordered forbidden transitions (2023)
  • Author(s): Kota Kumakura, Akira Suzuki, Yuma Tamura, Xiao Zhou
  • Organizer: 29th International Computing and Combinatorics Conference (COCOON 2023)
  • Int'l Joint Research
• [Presentation] Extending distributional learning from positive data and membership queries (2023)
  • Author(s): Makoto Kanazawa, Ryo Yoshinaka
  • Organizer: 30th International Conference on Graphics and Interaction (ICGI 2023)
  • Int'l Joint Research
• [Presentation] Identification of substitutable context-free languages over infinite alphabets from positive data (2023)
  • Author(s): Yutaro Numaya, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
  • Organizer: 30th International Conference on Graphics and Interaction (ICGI 2023)
  • Int'l Joint Research
• [Presentation] Efficient parameterized pattern matching in sublinear space (2023)
  • Author(s): Haruki Ideguchi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
  • Organizer: 30th International Symposium on String Processing and Information Retrieval (SPIRE 2023)
  • Int'l Joint Research
• [Presentation] Reconfiguration and enumeration of optimal cyclic ladder lotteries (2023)
  • Author(s): Yuta Nozaki, Kunihiro Wasa, Katsuhisa Yamanaka
  • Organizer: 34th International Workshop on Combinatorial Algorithms (IWOCA 2023)
  • Int'l Joint Research
• [Presentation] Solving reconfiguration problems of first-order expressible properties of graph vertices with Boolean satisfiability (2023)
  • 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)
  • Int'l Joint Research
• [Presentation] Reconfiguration of colorings in triangulations of the sphere (2023)
  • 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)
  • Int'l Joint Research
• [Presentation] Hardness of finding combinatorial shortest paths on graph associahedra (2023)
  • 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)
  • Int'l Joint Research
• [Presentation] Rerouting planar curves and disjoint paths (2023)
  • 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)
  • Int'l Joint Research
• [Presentation] Quick computation of the lower bound on the gate count of toffoli-based reversible logic circuits (2023)
  • Author(s): Takashi Hirayama, Rin Suzuki, Katsuhisa Yamanaka, Yasuaki Nishitani
  • Organizer: 53rd IEEE International Symposium on Multiple-Valued Logic (ISMVL 2023)
  • Int'l Joint Research
• [Presentation] Rolling polyhedra on tessellations (2022)
  • Author(s): Akira Baes, Erik D. Demaine, Martin L. Demaine, Elizabeth Hartung, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara, Yushi Uno, Aaron Williams
  • Organizer: 11th International Conference on Fun with Algorithms (FUN 2022)
  • Int'l Joint Research
• [Presentation] Sorting balls and water: Equivalence and computational complexity (2022)
  • Author(s): Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
  • Organizer: 11th International Conference on Fun with Algorithms (FUN 2022)
  • Int'l Joint Research
• [Presentation] On reachable assignments under dichotomous preferences (2022)
  • Author(s): Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
  • Organizer: 24th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2022)
  • Int'l Joint Research
• [Presentation] Computing the parameterized burrows-Wheeler transform online (2022)
  • Author(s): Daiki Hashimoto, Diptarama Hendrian, Dominik Koppl, Ryo Yoshinaka, Ayumi Shinohara
  • Organizer: 29th International Symposium on String Processing and Information Retrieval (SPIRE 2022)
  • Int'l Joint Research
• [Presentation] Parallel algorithm for pattern matching problems under substring consistent equivalence relations (2022)
  • Author(s): Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
  • Organizer: 33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022)
  • Int'l Joint Research
• [Presentation] Algorithms for coloring reconfiguration under recolorability digraphs (2022)
  • Author(s): Soichiro Fujii, Yuni Iwamasa, Kei Kimura, Akira Suzuki
  • Organizer: 33rd International Symposium on Algorithms and Computation (ISAAC 2022)
  • Int'l Joint Research
• [Presentation] Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares (2022)
  • Author(s): Hugo Akitaya, Erik Demaine, Matias Korman, Irina Kostitsyna, Irene Parada, Willem Sonke, Bettina Speckmann, Ryuhei Uehara and Jules Wulms
  • Organizer: 38th European Workshop on Computational Geometry (EuroCG 2022)
  • Int'l Joint Research
• [Presentation] Happy Set Problem on Subclasses of Co-comparability Graphs (2022)
  • Author(s): Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki and Yuma Tamura
  • Organizer: The 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022)
  • Int'l Joint Research
• [Presentation] Reconfiguration of Regular Induced Subgraphs (2022)
  • Author(s): Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi and Kunihiro Wasa
  • Organizer: The 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022)
  • Int'l Joint Research
• [Presentation] Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint (2022)
  • Author(s): Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki and Kunihiro Wasa
  • Organizer: The 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)
  • Int'l Joint Research
• [Presentation] Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity a la Nash-Williams (2022)
  • Author(s): Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto and Kenta Ozeki
  • Organizer: The ACM-SIAM Symposium on Discrete Algorithms (SODA 2022)
  • Int'l Joint Research
• [Presentation] Path cover problems with length cost (2022)
  • Author(s): Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima and Tsuyoshi Yagita
  • Organizer: The 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022)
  • Int'l Joint Research
• [Presentation] Token Shifting on Graphs (2021)
  • Author(s): Win Hlaing Hlaing Myint, Ryuhei Uehara, and Giovanni Viglietta
  • Organizer: The 27th International Computing and Combinatorics Conference (COCOON 2021)
  • Int'l Joint Research
• [Presentation] Computational Complexity of Jumping Block Puzzles (2021)
  • Author(s): Masaaki Kanzaki, Yota Otachi, and Ryuhei Uehara
  • Organizer: The 27th International Computing and Combinatorics Conference (COCOON 2021)
  • Int'l Joint Research
• [Presentation] Multilayer tiles (2021)
  • Author(s): Kota Chida, Erik Demaine, Martin Demaine, David Eppstein, Adam Hesterberg, Takashi Horiyama, John Iacono, Hiro Ito, Stefan Langerman, and Ryuhei Uehara
  • Organizer: The 23rd Thailand-Japan Conference on Discrete and Computational Geometry, Graphs, and Games (TJCDCG3 2020+1)
  • Int'l Joint Research
• [Presentation] Logical Matrix Representations in Map Folding (2021)
  • Author(s): Yiyang Jia, Jun Mitani and Ryuhei Uehara
  • Organizer: The 23rd Thailand-Japan Conference on Discrete and Computational Geometry, Graphs, and Games (TJCDCG3 2020+1)
  • Int'l Joint Research
• [Presentation] Any Regular Polyhedron Can Transform to Another by O(1) Refoldings (2021)
  • Author(s): Erik D. Demaine, Martin L. Demaine, Yevhenii Diomidov, Tonan Kamata, Ryuhei Uehara, and Hanyu Alice Zhang
  • Organizer: The 33rd Canadian Conference on Computational Geometry (CCCG 2021)
  • Int'l Joint Research
• [Presentation] Bicolored Path Embedding Problems in Protein Folding Models (2021)
  • Author(s): Tianfeng Feng, Ryuhei Uehara and Giovanni Viglietta
  • Organizer: The 37th European Workshop on Computational Geometry (EuroCG 2021)
  • Int'l Joint Research
• [Presentation] Reconfiguring Directed Trees in a Digraph (2021)
  • Author(s): Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi and Kunihiro Wasa
  • Organizer: The 27th International Computing and Combinatorics Conference (COCOON 2021)
  • Int'l Joint Research
• [Presentation] Decremental optimization of vertex-coloring under the reconfiguration framework (2021)
  • Author(s): Yusuke Yanagisawa, Yuma Tamura, Akira Suzuki and Xiao Zhou
  • Organizer: The 27th International Computing and Combinatorics Conference (COCOON 2021)
  • Int'l Joint Research
• [Presentation] A Hierarchy of Context-Free Languages Learnable from Positive Data and Membership Queries (2021)
  • Author(s): Makoto Kanazawa, Ryo Yoshinaka
  • Organizer: International Conference on Grammatical Inference (ICGI 2021)
  • Int'l Joint Research
• [Presentation] Inside-Outside Algorithm for Macro Grammars (2021)
  • Author(s): Ryuta Kambe, Naoki Kobayashi, Ryosuke Sato, Ayumi Shinohara, Ryo Yoshinaka
  • Organizer: International Conference on Grammatical Inference (ICGI 2021)
  • Int'l Joint Research
• [Presentation] Query Learning Algorithm for Symbolic Weighted Finite Automata (2021)
  • Author(s): Kaito Suzuki, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
  • Organizer: International Conference on Grammatical Inference (ICGI 2021)
  • Int'l Joint Research
• [Presentation] Finding Diverse Trees, Paths, and More (2021)
  • Author(s): Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi
  • Organizer: The 35th AAAI Conference on Artificial Intelligence (AAAI-21)
  • Int'l Joint Research
• [Presentation] Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity (2021)
  • Author(s): Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
  • Organizer: The 12th International Conference on Algorithms and Complexity (CIAC 2021)
  • Int'l Joint Research
• [Presentation] Distributed Reconfiguration of Spanning Trees (2021)
  • Author(s): Yukiko Yamauchi, Naoyuki Kamiyama, Yota Otachi
  • Organizer: International Symposium on Stabilizing, Safety, and Security of Distributed Systems(SSS 2021)
  • Int'l Joint Research
• [Presentation] Mathematical Characterizations and Computational Complexity of Anti-Slide Puzzles (2021)
  • Author(s): Ko Minamisawa, Ryuhei Uehara, Masao Hara
  • Organizer: WALCOM 2021
  • Int'l Joint Research
• [Presentation] Cyclic Shift Problems on Graphs (2021)
  • Author(s): Giovanni Viglietta, Ryuhei Uehara, Kwon Kham Sai
  • Organizer: WALCOM 2021
  • Int'l Joint Research
• [Presentation] Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs (2021)
  • Author(s): Kazuaki Yamazaki, Mengze Qian, Ryuhei Uehara
  • Organizer: WALCOM 2021
  • Int'l Joint Research
• [Presentation] Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes (2021)
  • Author(s): Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender
  • Organizer: WALCOM 2021
  • Int'l Joint Research
• [Presentation] Efficient Folding Algorithms for Regular Polyhedra (2020)
  • Author(s): Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara
  • Organizer: CCCG 2020
  • Int'l Joint Research
• [Presentation] Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots (2020)
  • Author(s): Giuseppe Antonio Di Luna, Ryuhei Uehara, Giovanni Viglietta, Yukiko Yamauchi
  • Organizer: DISC 2020
  • Int'l Joint Research
• [Presentation] Reconfiguration of Spanning Trees with Many or Few Leaves (2020)
  • Author(s): Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
  • Organizer: ESA 2020
  • Int'l Joint Research
• [Presentation] Minimization and Parameterized Variants of Vertex Partition Problems on Graphs (2020)
  • Author(s): Yuma Tamura, Takehiro Ito, Xiao Zhou
  • Organizer: ISAAC 2020
  • Int'l Joint Research
• [Presentation] Fixed-Parameter Algorithms for Graph Constraint Logic (2020)
  • Author(s): Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Muhlenthaler, Akira Suzuki
  • Organizer: IPEC 2020
  • Int'l Joint Research
• [Presentation] Hedonic Seat Arrangement Problems (2020)
  • Author(s): Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
  • Organizer: AAMAS 2020
  • Int'l Joint Research
• [Presentation] A Survey on Spanning Tree Congestion (2020)
  • Author(s): Yota Otachi
  • Organizer: Treewidth, Kernels, and Algorithms 2020
  • Int'l Joint Research
• [Presentation] Grundy Distinguishes Treewidth from Pathwidth (2020)
  • Author(s): Remy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
  • Organizer: ESA 2020
  • Int'l Joint Research
• [Presentation] Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs (2020)
  • Author(s): Taisuke Izumi, Yota Otachi
  • Organizer: ICALP 2020
  • Int'l Joint Research
• [Presentation] Parameterized Complexity of (A,l)-Path Packing (2020)
  • Author(s): Remy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
  • Organizer: IWOCA 2020
  • Int'l Joint Research
• [Presentation] Parameterized Complexity of Graph Burning (2020)
  • Author(s): Yasuaki Kobayashi, Yota Otachi
  • Organizer: IPEC 2020
  • Int'l Joint Research
• [Presentation] Linear-Time Recognition of Double-Threshold Graphs (2020)
  • Author(s): Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno
  • Organizer: WG 2020
  • Int'l Joint Research
• [Presentation] Enumerating All Subgraphs Under Given Constraints Using Zero-Suppressed Sentential Decision Diagrams (2020)
  • Author(s): Yu Nakahata, Masaaki Nishino, Jun Kawahara, Shin-ichi Minato
  • Organizer: SEA 2020
  • Int'l Joint Research
• [Presentation] Decremental Optimization of Dominating Sets Under the Reconfiguration Framework (2020)
  • Author(s): Alexandre Blanche, Haruka Mizuta, Paul Ouvrard, Akira Suzuki
  • Organizer: IWOCA 2020
  • Int'l Joint Research
• [Presentation] DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures (2020)
  • Author(s): Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
  • Organizer: CPM 2020
  • Int'l Joint Research
• [Presentation] Grammar Compression with Probabilistic Context-Free Grammar (2020)
  • Author(s): Hiroaki Naganuma, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara, Naoki Kobayashi
  • Organizer: DCC 2020
  • Int'l Joint Research
• [Presentation] AOBA: An Online Benchmark Tool for Algorithms in Stringology (2020)
  • Author(s): Ryu Wakimoto, Satoshi Kobayashi, Yuki Igarashi, Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
  • Organizer: SOFSEM 2020
  • Int'l Joint Research
• [Presentation] An Extension of Linear-size Suffix Tries for Parameterized Strings (2020)
  • Author(s): Katsuhito Nakashima, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
  • Organizer: SOFSEM 2020
  • Int'l Joint Research
• [Presentation] Parallel Duel-and-Sweep Algorithm for the Order-Preserving Pattern Matching (2020)
  • Author(s): Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
  • Organizer: SOFSEM 2020
  • Int'l Joint Research
• [Presentation] Computing Covers Under Substring Consistent Equivalence Relations (2020)
  • Author(s): Natsumi Kikuchi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
  • Organizer: SPIRE 2020
  • Int'l Joint Research
• [Presentation] Fast and Linear-Time String Matching Algorithms Based on the Distances of q-Gram Occurrences (2020)
  • Author(s): Satoshi Kobayashi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
  • Organizer: SEA 2020
  • Int'l Joint Research
• [Presentation] A Polynomial Delay Algorithm for Enumerating 2-Edge-Connected Induced Subgraphs (2020)
  • Author(s): Yusuke Sano, Katsuhisa Yamanaka, Takashi Hirayama
  • Organizer: FAW 2020
  • Int'l Joint Research
• [Presentation] Floorplans with Walls (2020)
  • Author(s): Katsuhisa Yamanaka, Shin-Ichi Nakano
  • Organizer: TAMC 2020
  • Int'l Joint Research
• [Presentation] Efficient Enumeration of Non-isomorphic Ptolemaic Graphs (2020)
  • Author(s): Dat Hoang Tran, Ryuhei Uehara
  • Organizer: The 14th International Conference and Workshops on Algorithms and Computation (WALCOM 2020)
  • Int'l Joint Research
• [Presentation] Shortest Reconfiguration of Colorings Under Kempe Changes (2020)
  • Author(s): Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Muhlenthaler, Akira Suzuki, Kunihiro Wasa
  • Organizer: STACS 2020
  • Int'l Joint Research
• [Presentation] Reconfiguring k-path Vertex Covers (2020)
  • Author(s): Duc A. Hoang, Akira Suzuki, Tsuyoshi Yagita
  • Organizer: WALCOM 2020
  • Int'l Joint Research
• [Presentation] Trichotomy for the Reconfiguration Problem of Integer Linear Systems (2020)
  • Author(s): Kei Kimura, Akira Suzuki
  • Organizer: WALCOM 2020
  • Int'l Joint Research
• [Presentation] Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration (2020)
  • Author(s): Yu Nakahata, Jun Kawahara, Takashi Horiyama, Shin-ichi Minato
  • Organizer: WALCOM 2020
  • Int'l Joint Research
• [Presentation] Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs (2020)
  • Author(s): Yuma Tamura, Takehiro Ito, Xiao Zhou
  • Organizer: WALCOM 2020
  • Int'l Joint Research
• [Presentation] On the Complexity of Lattice Puzzles (2019)
  • Author(s): Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki, Ryuhei Uehara
  • Organizer: The 30th International Symposium on Algorithms and Computation (ISAAC 2019)
  • Int'l Joint Research
• [Presentation] Reconfiguring Undirected Paths (2019)
  • Author(s): Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno
  • Organizer: WADS 2019
  • Int'l Joint Research
• [Presentation] Max-Min 3-dispersion Problems (2019)
  • Author(s): Takashi Horiyama, Shin-ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
  • Organizer: COCOON 2019
  • Int'l Joint Research
• [Presentation] Shortest Reconfiguration Sequence for Sliding Tokens on Spiders (2019)
  • Author(s): Duc A. Hoang, Amanj Khorramian, Ryuhei Uehara
  • Organizer: The 11th International Conference on Algorithms and Complexity (CIAC 2019)
  • Int'l Joint Research
• [Presentation] Diameter of Colorings Under Kempe Changes (2019)
  • Author(s): Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Muhlenthaler, Akira Suzuki, Kunihiro Wasa
  • Organizer: COCOON 2019
  • Int'l Joint Research
• [Presentation] Incremental Optimization of Independent Sets Under the Reconfiguration Framework (2019)
  • Author(s): Takehiro Ito, Haruka Mizuta, Naomi Nishimura, Akira Suzuki
  • Organizer: COCOON 2019
  • Int'l Joint Research
• [Presentation] A Fast Algorithm for Combinatorial Hotspot Mining Based on Spatial Scan Statistic (2019)
  • Author(s): Shin-ichi Minato, Jun Kawahara, Fumio Ishioka, Masahiro Mizuta, Koji Kurihara
  • Organizer: SDM 2019
  • Int'l Joint Research
• [Presentation] Algorithms for Gerrymandering over Graphs (2019)
  • Author(s): Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
  • Organizer: AAMAS 2019
  • Int'l Joint Research
• [Presentation] Shortest Reconfiguration of Perfect Matchings via Alternating Cycles (2019)
  • Author(s): Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
  • Organizer: ESA 2019
  • Int'l Joint Research
• [Presentation] Reconfiguration of Minimum Steiner Trees via Vertex Exchanges (2019)
  • Author(s): Haruka Mizuta, Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
  • Organizer: MFCS 2019
  • Int'l Joint Research
• [Presentation] The Perfect Matching Reconfiguration Problem (2019)
  • Author(s): Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Muhlenthaler, Kunihiro Wasa
  • Organizer: MFCS 2019
  • Int'l Joint Research
• [Presentation] Shortest Reconfiguration of Matchings (2019)
  • Author(s): Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito, Moritz Muhlenthaler
  • Organizer: WG 2019
  • Int'l Joint Research
• [Presentation] An Improvement of the Franek-Jennings-Smyth Pattern Matching Algorithm (2019)
  • Author(s): Satoshi Kobayashi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
  • Organizer: Stringology 2019
  • Int'l Joint Research
• [Presentation] Query Learning Algorithm for Residual Symbolic Finite Automata (2019)
  • Author(s): Kaizaburo Chubachi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
  • Organizer: GandALF 2019
  • Int'l Joint Research
• [Presentation] Parameterized Complexity of Safe Set (2019)
  • Author(s): Remy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
  • Organizer: CIAC 2019
  • Int'l Joint Research
• [Presentation] Subgraph Isomorphism on Graph Classes that Exclude a Substructure (2019)
  • Author(s): Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
  • Organizer: CIAC 2019
  • Int'l Joint Research
• [Presentation] Low-Congestion Shortcut and Graph Parameters (2019)
  • Author(s): Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi
  • Organizer: DISC 2019
  • Int'l Joint Research
• [Presentation] Independent Set Reconfiguration Parameterized by Modular-Width (2019)
  • Author(s): Remy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
  • Organizer: WG 2019
  • Int'l Joint Research
• [Presentation] Colorful Frontier-based Search: Implicit Enumeration of Chordal and Interval Subgraphs (2019)
  • Author(s): Jun Kawahara, Toshiki Saitoh, Hirofumi Suzuki, and Ryo Yoshinaka
  • Organizer: Special Event on Analysis of Experimental Algorithms (SEA^2 2019), to appear
  • Int'l Joint Research
• [Presentation] Token Sliding on Split Graphs (2019)
  • Author(s): Remy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
  • Organizer: STACS 2019, pp. 13:1-13:17
  • Int'l Joint Research
• [Presentation] Efficient Algorithm for Box Folding (2019)
  • Author(s): Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara
  • Organizer: WALCOM 2019, pp. 277-288
  • Int'l Joint Research
• [Presentation] Algorithms for Coloring Reconfiguration Under Recolorability Constraints (2018)
  • Author(s): Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou
  • Organizer: ISAAC 2018, pp. 37:1-37:13
  • Int'l Joint Research
• [Presentation] Aggregating Crowd Opinions Using Shapley Value Regression (2018)
  • Author(s): Yuko Sakurai, Jun Kawahara, Satoshi Oyama
  • Organizer: MIWAI 2018, pp. 151-160
  • Int'l Joint Research
• [Presentation] Linear-Time Online Algorithm Inferring the Shortest Path from a Walk (2018)
  • Author(s): Shintaro Narisada, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
  • Organizer: SPIRE 2018, pp. 311-324
  • Int'l Joint Research
• [Presentation] Ladder-Lottery Realization (2018)
  • Author(s): Katsuhisa Yamanaka, Takashi Horiyama, Takeaki Uno, Kunihiro Wasa
  • Organizer: CCCG 2018, pp. 61-67
  • Int'l Joint Research
• [Presentation] Computational Complexity of Robot Arm Simulation Problems (2018)
  • Author(s): Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara
  • Organizer: IWOCA 2018, pp. 177-188
  • Int'l Joint Research
• [Presentation] Reconfiguring Spanning and Induced Subgraphs (2018)
  • Author(s): Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan
  • Organizer: COCOON 2018, pp. 428-440
  • Int'l Joint Research
• [Presentation] More Routes for Evacuation (2018)
  • Author(s): Katsuhisa Yamanaka, Yasuko Matsui, Shin-Ichi Nakano
  • Organizer: COCOON 2018, pp. 76-83
  • Int'l Joint Research
• [Presentation] Parameterized Orientable Deletion (2018)
  • Author(s): Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
  • Organizer: SWAT 2018, pp. 24:1-24:13
  • Int'l Joint Research
• [Presentation] Enumeration of Cryptarithms Using Deterministic Finite Automata (2018)
  • Author(s): Yuki Nozaki, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
  • Organizer: CIAA 2018, pp. 286-298
  • 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
  • Int'l Joint Research
• [Presentation] Reconfiguration of Colorable Sets in Classes of Perfect Graphs (2018)
  • Author(s): Takehiro Ito, Yota Otachi
  • Organizer: SWAT 2018, pp. 27:1-27:13
  • Int'l Joint Research
• [Presentation] Exact Algorithms for the Max-Min Dispersion Problem (2018)
  • Author(s): Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
  • Organizer: FAW 2018, pp. 263-272
  • Int'l Joint Research
• [Book] Proceedings of the 15th International Conference and Workshops (2021)
  • Author(s): Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy
  • Total Pages: 345
  • Publisher: Springer
  • ISBN: 9783030682101
• [Book] Introduction to Computational Origami - The World of New Computational Geometry (2020)
  • Author(s): Ryuhei Uehara
  • Total Pages: 217
  • Publisher: Springer
  • ISBN: 9789811544699
• [Book] Proceedings of the 10th International Conference on Fun with Algorithms (2020)
  • Author(s): Martin Farach-Colton, Giuseppe Prencipe, Ryuhei Uehara
  • Total Pages: 416
  • Publisher: Schloss Dagstuhl
  • ISBN: 9783959771450
• [Book] First Course in Algorithms Through Puzzles (2019)
  • Author(s): Ryuhei Uehara
  • Total Pages: 175
  • Publisher: Springer
  • ISBN: 9789811331879
• [Remarks] Graph Catalogs
  • URL: http://www.jaist.ac.jp/~uehara/graphs/
• [Funded Workshop] The 15th International Conference and Workshops on Algorithms and Computing (WALCOM 2021) (2021)