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