Yamanaka Katsuhisa

ヤマナカカツヒサ | Yamanaka Katsuhisa

Homepage URL (1)： http://www.kono.cis.iwate-u.ac.jp/~yamanaka/

Research field (1)： Information theory

Research keywords (6)： Algorithm theory , Enumeration , Graph theory , グラフアルゴリズム , Combinatorial reconfiguration , Computational complexity

Research theme for competitive and other funds (10)：

2023 - 2028 可逆論理回路合成におけるゲート数最小化の理論的限界に関する研究
2019 - 2022 Computational complexity on enumeration problems on big data analysis and applications of high-speed enumeration algorithms
2018 - 2022 理論的に困難な問題を現実的な時間で解くアルゴリズムとデータ構造の研究
2016 - 2019 列挙問題の難しさ解明に基づいた超高速列挙アルゴリズムの開発
2012 - 2017 Development towards innovative data structure utilizing methodology of limit of computation

Show all

Papers (56)：

Koki Shinraku, Katsuhisa Yamanaka, Takashi Hirayama. Efficient enumeration of transversal edge-partitions. Discrete Applied Mathematics. 2025. 361. 276-287
Takashi Hirayama, Rin Suzuki, Katsuhisa Yamanaka, Yasuaki Nishitani. New Bounds for Quick Computation of the Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits. IEICE Transactions on Information and Systems. 2024. E107.D. 8. 940-948
Katsuhisa Yamanaka, Shin-ichi Nakano. Enumerating Floorplans with Walls. Discrete Applied Mathematics. 2024. 342. 1-11
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka. Sorting balls and water: Equivalence and computational complexity. Theoretical Computer Science. 2023. 978. 114158-114158
Yuta Nozaki, Kunihiro Wasa, Katsuhisa Yamanaka. Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries. Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries, in Proceedings of The 34th International Workshop on Combinatorial Algorithms (IWOCA2023), Lecture Notes in Computer Science. 2023. 13889. 331-342

ｍore...

MISC (68)：

Waseem Akram, Katsuhisa Yamanaka. Efficient Enumeration of At Most k-Out Polygons. Proc. of The 6th Workshop on Enumeration Problems and Applications (WEPA2024). 2024
Aito Ochi, Katsuhisa Yamanaka, Takashi Hirayama. The Computational Complexity of Minimal Distance k-Dominating Set Enumeration. Proc. The 6th Workshop on Enumeration Problems and Applications (WEPA2024). 2024
Kyohei Sangodo, Katsuhisa Yamanaka, Takashi Hirayama. Mystery Tower is Computationally Hard. Proc. of Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3). 2024. 47-48
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka. Sorting Balls and Water: Equivalence and Computational Complexity. CoRR. 2022. abs/2202.09495
Yu Nakahata, Takashi Horiyama, Shin-ichi Minato, Katsuhisa Yamanaka. Compiling Crossing-free Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and Optimization. CoRR. 2020. abs/2001.08899

ｍore...

Education (3)：

Professional career (1)：

Committee career (7)：

Show all

Awards (5)：

2021/06 - 電子情報通信学会情報・システムソサイエティ査読功労賞
2021 - IPSJ Yamashita SIG Research Award Sorting by Five Prefix Reversals
2017/05 - 電子情報通信学会システムと信号処理サブソサイエティ貢献賞
2012 - Research Award Compact Codes of Rooted Trees
2010 - IPSJ Computer Science Research Award for Young Scientists Efficient Enumeration of All Pseudoline Arrangement

Association Membership(s) (3)：

LA シンポジウム , 情報処理学会 , 電子情報処理学会

※ Researcher’s information displayed in J-GLOBAL is based on the information registered in researchmap. For details, see here.

Return to Previous Page