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
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
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
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