Published Papers - YAMANAKA Katsuhisa
-
Enumerating At Most k-Out Polygons
Waseem Akram and Katsuhisa Yamanaka
Proceedings of The 40th European Workshop on Computational Geometry (EuroCG 2024) 2024.03 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
Enumerating Floorplans with Walls
Katsuhisa Yamanaka and Shin-ichi Nakano
Discrete Applied Mathematics 2024.01 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
Sorting Balls and Water: Equivalence and Computational Complexity
Ryuhei Uehara, Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Akira Suzuki, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka, and Toshiki Saitoh
Theoretical Computer Science 2023.11 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
Enumerating Empty and Surrounding Polygons
Shunta Terui, Katsuhisa Yamanaka, Takashi Hirayama, Takashi Horiyama, Kazuhiro Kurita, and Takeaki Uno
IEICE Transactions on Information and Systems 2023.09 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries
Yuta Nozaki, Kunihiro Wasa and Katsuhisa Yamanaka
Proceedings of The 34th International Workshop on Combinatorial Algorithms (IWOCA2023) 2023.06 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
Quick Computation of the Lower Bound on the Gate Count of Toffoli-Based Reversible
Takashi Hirayama, Rin Suzuki, Katsuhisa Yamanaka and Yasuaki Nishitani
Proceedings of IEEE International Symposium on Multiple-Valued Logic(ISMVL2023) 2023.05 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
Efficient segment folding is hard
Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, and Katsuhisa Yamanaka
Computational Geometry 2022.06 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
Sorting Balls and Water: Equivalence and Computational Complexity
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka and Ryo Yoshinaka
Proc. The 11th International Conference on Fun with Algorithms (FUN2022) 2022.05 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
A polynomial delay algorithm for enumerating 2-edge-connected induced subgraphs
Taishu Ito, Yusuke Sano, Katsuhisa Yamanaka, and Takashi Hirayama
IEICE Transactions on Information and Systems 2022.03 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
An O(n^2)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position
Yasuaki Kobayashi, Shin-ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, and Katsuhisa Yamanaka
IEICE Transactions on Information and Systems 2022.03 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
Max-Min 3-dispersion on a Convex Polygon
Yasuaki Kobayashi, Shin-ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, and Katsuhisa Yamanaka
Proc. of The 37th European Workshop on Computational Geometry (EuroCG 2021) 2021.04 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
Optimal reconfiguration of optimal ladder lotteries
Katsuhisa Yamanaka, Takashi Horiyama, and Kunihiro Wasa
Theoretical Computer Science 2021.03 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
Enumerating Empty Polygons
Shunta Terui, Takashi Hirayama, Takashi Horiyama, Katsuhisa Yamanaka and Takeaki Uno
Proc. 4th International Workshop on Enumeration Problems and Applications (WEPA 2020) 2020.12 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
A Polynomial Delay Algorithm for Enumerating 2-Edge-Connected Induced Subgraphs
Yusuke Sano, Katsuhisa Yamanaka, and Takashi Hirayama
Proc. The 14th International Frontiers of Algorithmics Workshop (FAW 2020) 2020.10 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
Enumerating Surrounding Polygons
山中克久，堀山貴史，岡本吉央，上原隆平，山内大七洋
情報処理学会研究報告 1 - 4 2019.03
Others Multiple authorship
-
Exact exponential algorithm for distance-3 independent set problem
山中克久, 河原木渉吾, 平山貴司
電子情報通信学会英文論文誌D 2019.03 [Refereed]
Academic Journal Multiple authorship
-
The complexity of induced tree reconfiguration problems
和佐州洋，山中克久, 有村博紀
電子情報通信学会英文論文誌D 2019.03 [Refereed]
Academic Journal Multiple authorship
-
Enumerating Floorplans with Columns
山中克久，ムハンマド・サイドゥール・ラーマン，中野眞一
電子情報通信学会技術研究報告 55 - 59 2018.12
Others Multiple authorship
-
Function design for minimum multiple-control Toffoli circuits of reversible adder/subtractor blocks and arithmetic logic units
ベライェット・アリ，平山貴司，山中克久，西谷泰昭
電子情報通信学会英文論文誌A 2018.12 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
The complexity of ladder-lottery realization problem
山中克久，堀山貴史，宇野毅明，和佐州洋
情報処理学会研究報告 1 - 6 2018.11
Others Multiple authorship
-
Enumerating floorplans with columns
山中克久，ムハンマド・サイドゥール・ラーマン，中野眞一
電子情報通信学会英文論文誌A 2018.09 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
More Routes for Evacuation
山中克久，松井泰子，中野眞一
コンピューターサイエンス会議録 10976 76 - 83 2018.07 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
Swapping colored tokens on graphs
山中克久，堀山貴史，マーク・カイル，ディビッド・カークパトリック，大舘陽太，斎藤寿樹，上原隆平，宇野裕之
理論計算機科学 2018.06 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
Floorplans with columns
山中克久，ムハンマド・サイドゥール・ラーマン，中野眞一
コンピューターサイエンス会議録 2017.12 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
Reconfiguring Optimal Ladder Lotteries
堀山貴史，和佐州洋，山中克久
ハンガリー日本離散数学とその応用に関するシンポジウム 2017.05 [Refereed]
Others Multiple authorship
-
On the number of edge-constrained triangulations without the general position assumption
山中克久，村上雅俊，平山貴司，西谷泰昭
回路とシステムワークショップ論文集 2017.05 [Refereed]
Others Multiple authorship
-
Sequentially Swapping Colored Tokens on Graphs
山中克久，エリック・デマイン，堀山貴史，河村彰星，中野眞一，岡本吉央，斎藤寿樹，鈴木顕，上原隆平
コンピューターサイエンス会議録 2017.03 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
Enumeration, Counting, and Random Generation of Ladder Lotteries
山中克久，中野眞一
電子情報通信学会英文論文誌D 2017.03 [Refereed]
Academic Journal Multiple authorship
-
Design of n-bit reversible adder with LNN architecture
ベライェット・アリ，平山貴司，山中克久，西谷泰昭
コンピュータ科学の基礎に関する国際会議論文集 2016.07
Bulletin of University, Institute, etc. Multiple authorship
-
Computational Complexity of Sequential Token Swapping Problem
山中克久，エリック・デマイン，堀山貴史，河村彰星，中野眞一，岡本吉央，斎藤寿樹，上原隆平，宇野毅明
電子情報通信学会技術研究報告 2016.06
Others Multiple authorship
-
Design of reversible adder with LNN architecture
ベライェット・アリ，平山貴司，山中克久，西谷泰昭
第39回多値論理フォーラム予稿集 2016.06
Others Multiple authorship
-
New two-qubit gate library with entanglement
ベライェット・アリ，平山貴司，山中克久，西谷泰昭
多値論理に関する国際シンポジウム論文集 2016.05 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
The complexity of induced tree reconfiguration problems
和佐州洋, 山中克久, 有村博紀
コンピューターサイエンス会議録 2016.03 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
Uniformly random generation of floorplans
山中克久，中野眞一
電子情報通信学会英文論文誌A 2016.03 [Refereed]
Academic Journal Multiple authorship
-
Computational Complexity of Colored Token Swapping Problem
山中克久，堀山貴史，デイビッド・カークパトリック，大舘陽太，斎藤寿樹，上原隆平，宇野裕之
情報処理学会研究報告 2016.01
Others Multiple authorship
-
Implementation of enumerating all edge-constrained triangulations without the general position assumption
村上雅俊，山中克久，平山貴司，西谷泰昭
情報処理学会研究報告 2016.01
Others Multiple authorship
-
Recent developments in floorplan representations
山中克久
学際的情報科学 2015.12 [Refereed]
Academic Journal Single Work
-
Computational complexity of competitive diffusion on (un)weighted graphs
伊藤健洋，大舘陽太，斎藤寿樹，佐藤永幸，鈴木顕，内澤啓，上原隆平，山中克久，周暁
情報処理学会研究報告 2015.09
Others Multiple authorship
-
(2.6n+2)-bit code of slicing floorplans
山中克久，大森隆史，平山貴司，西谷泰昭
離散計算幾何学とグラフに関する日本会議 2015.09 [Refereed]
Others Multiple authorship
-
Vizualizing flip graphs
村上雅俊，山中克久，平山貴司，西谷泰昭
回路とシステムワークショップ論文集 2015.08 [Refereed]
Others Multiple authorship
-
Enumeration, counting, and random generation of ladder lotteries
山中克久，中野眞一
コンピューターサイエンス会議録 2015.07 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
Swapping Labeled Tokens on Graphs
山中克久，エリック ドメイン，伊藤健洋，川原純，清見礼，岡本吉央，斎藤寿樹，鈴木顕，内澤啓，宇野毅明
理論計算機科学 2015.06 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
Swapping labeled tokens on complete split graphs
安井岳，阿部滉太，山中克久，平山貴司
情報処理学会研究報告 2015.06
Others Multiple authorship
-
Uniformly random generation of floorplans
山中克久，中野眞一
ハンガリー日本離散数学とその応用に関するシンポジウム 2015.06 [Refereed]
Others Multiple authorship
-
Another optimal binary representation of mosaic floorplans
山中克久，中野眞一
電子情報通信学会英文論文誌A 2015.06 [Refereed]
Academic Journal Multiple authorship
-
Enumeration, counting, and random generation of ladder lotteries
山中克久，中野眞一
情報処理学会研究報告 2014.11
Others Multiple authorship
-
A lower bound on the gate count of Toffoli-based reversible logic circuits
平山貴司，菅原隼人，山中克久，西谷泰昭
電子情報通信学会英文論文誌D 2014.09 [Refereed]
Academic Journal Multiple authorship
-
Swapping Labeled Tokens on Graphs
山中克久，エリック ドメイン，伊藤健洋，川原純，清見礼，岡本吉央，斎藤寿樹，鈴木顕，内澤啓，宇野毅明
コンピューターサイエンス会議録 2014.07 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
Compact codes of slicing floorplans
大森隆史，山中克久，平山貴司，西谷泰昭
情報処理学会研究報告 2014.06
Others Multiple authorship
-
FPT algorithms for token jumping on graphs
伊藤健洋, マーチン・カミンスキ, 小野廣隆, 鈴木顕, 上原隆平, 山中克久
情報処理学会研究報告 2014.06
Others Multiple authorship
-
Efficient Enumeration of All Ladder Lotteries with k Bars
山中克久，中野眞一
電子情報通信学会英文論文誌A 2014.06 [Refereed]
Academic Journal Multiple authorship
-
Approximability of the Path-Distance-Width for AT-free Graphs
大舘陽太，斎藤寿樹，山中克久，来嶋秀治，岡本吉央，小野廣隆，宇野裕之，山崎浩一
離散応用数学 2014.05 [Refereed]
Academic Journal Multiple authorship
-
On the Parameterized Complexity for Token Jumping on Graphs
伊藤健洋, マーチン・カミンスキ, 小野廣隆, 鈴木顕, 上原隆平, 山中克久
コンピューターサイエンス会議録 8402 341 - 351 2014.04 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
Uniformly Random Generation of Floorplans
山中克久，中野眞一
情報処理学会研究報告 2013.11 [Refereed]
Others Multiple authorship
-
Uniformly Random Generation of Floorplans
山中克久，中野眞一
スケジューリングシンポジウム論文集 2013.09 [Refereed]
Others Multiple authorship
-
A compact encoding of rectangular drawings with edge lengths,
中野眞一，山中克久
電子情報通信学会論文誌 2013.06 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
A Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits
平山貴司，村山達郎，山中克久，西谷泰昭
リードマラーワークショップ 2013.05 [Refereed]
Others Multiple authorship
-
Coding Ladder Lotteries
相内友揮，山中克久，平山貴司，西谷泰昭
計算幾何に関するヨーロッパワークショップ 2013.03 [Refereed]
Others Multiple authorship
-
Coding Ladder Lotteries
相内友揮，山中克久，平山貴司，西谷泰昭
情報処理学会研究報告 2012-AL-142-10 2012.11 [Refereed]
Others Multiple authorship
-
A compact encoding of rooted trees
山中克久
回路とシステムワークショップ論文集 2012.07 [Refereed]
Others Single Work
-
Efficient Enumeration of Ordered Trees with k Leaves
山中克久，大舘陽太，中野眞一
理論計算機科学 ( 442 ) 22 - 27 2012.06 [Refereed]
Academic Journal Multiple authorship
-
Another optimal binary representation of mosaic floorplans
山中克久，中野眞一
情報処理学会研究報告 2012.05 [Refereed]
Others Multiple authorship
-
Enumerating all rooted trees including k leaves
石川雅信，山中克久，大舘陽太，中野眞一
電子情報通信学会英文論文誌D E95-D ( 3 ) 763 - 768 2012.03 [Refereed]
Academic Journal Multiple authorship
-
A compact encoding of rooted trees
山中克久
情報処理学会研究報告 2012-AL-138 2012.01
Academic Journal Single Work
-
Random Generation and Enumeration of Bipartite Permutation Graphs
斎藤寿樹，大舘陽太，山中克久，上原隆平
離散アルゴリズム論文誌 ( 10 ) 84 - 97 2012.01 [Refereed]
Academic Journal Multiple authorship
-
Compact Codings of Grid Rectangular Drawings
IEICE Transactions on Information and Systems J94-D ( 12 ) 2031 - 2036 2011.12 [Refereed]
Academic Journal Multiple authorship
-
A compact encoding of rectangular drawings with edge lengths,
中野眞一，山中克久
情報処理学会研究報告 2011-AL-136-1 2011.09
Academic Journal Multiple authorship
-
Approximability of the Path-Distance-Width for AT-free Graphs
大舘陽太，斎藤寿樹，山中克久，来嶋秀治，岡本吉央，小野廣隆，宇野裕之，山崎浩一
コンピューターサイエンス会議録 ( 6986 ) 271 - 282 2011.06 [Refereed]
Academic Journal Multiple authorship