Published Papers - YAMANAKA Katsuhisa

Efficient enumeration of transversal edge-partitions

Koki Shinraku, Katsuhisa Yamanaka, Takashi Hirayama

Discrete Applied Mathematics   ( 361 ) 276 - 287   2025.01  [Refereed]

Bulletin of University, Institute, etc.  Multiple authorship

Efficient Enumeration of At Most k-Out Polygons

Waseem Akram and Katsuhisa Yamanaka

Proc. of The 6th Workshop on Enumeration Problems and Applications     2024.10  [Refereed]

Bulletin of University, Institute, etc.  Multiple authorship

The Computational Complexity of Minimal Distance k-Dominating Set Enumeration

Aito Ochi, Katsuhisa Yamanaka and Takashi Hirayama

Proc. of The 6th Workshop on Enumeration Problems and Applications     2024.10  [Refereed]

Bulletin of University, Institute, etc.  Multiple authorship

An Improved Lower Bound on the Gate Count for Toffoli-Based Reversible Logic Circuits Realizing Given Reversible Functions

Takashi Hirayama, Ryo Endo and Katsuhisa Yamanaka

Journal of Multiple-Valued Logic and Soft Computing   45 ( 1-3 ) 31 - 51   2024.10  [Refereed]

Bulletin of University, Institute, etc.  Multiple authorship

Mystery Tower is Computationally Hard

Kyohei Sangodo, Katsuhisa Yamanaka and Takashi Hirayama

Proc. of Japan Conference on Discrete and Computational Geometry, Graphs, and Games     2024.09  [Refereed]

Bulletin of University, Institute, etc.  Multiple authorship

New Bounds for Quick Computation of the Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits

Takashi Hirayama, Rin Suzuki, Katsuhisa Yamanaka and Yasuaki Nishitani

IEICE Transactions on Information and Systems   E107-D ( 8 ) 940 - 948   2024.08  [Refereed]

Bulletin of University, Institute, etc.  Multiple authorship

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

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

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

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