|
Affiliation |
IWATE University Faculty of Science and Engineering Department of Science and Engineering Intelligence Information Course |
|
Position |
Professor |
|
Year of Birth |
1980 |
|
Laboratory Address |
〒0208551 Ueda 4-3-5, Morioka |
|
Mail Address |
|
YAMANAKA Katsuhisa
|
|
|
Research Interests 【 display / non-display 】
-
graph theory
-
Algorithm theory
Course Subject 【 display / non-display 】
-
2018
Basic Seminar for the first-year students
-
2018
Network Laboratory
-
2018
Formal Languages and Automata
-
2018
Advanced Algorithms
-
2018
Networks Laboratory
Published Papers 【 display / non-display 】
-
Mystery tower is computationally hard
Kyohei Sangodo, Katsuhisa Yamanaka, and Takashi Hirayama
Journal of Information Processing ( 33 ) 1092 - 1100 2025.12 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries
Yuta Nozaki, Kunihiro Wasa, and Katsuhisa Yamanaka
Theoretical Computer Science ( 1053 ) 1 - 16 2025.10 [Refereed]
Bulletin of University, Institute, etc. Multiple authorship
-
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
Presentations 【 display / non-display 】
-
Enumeration and Reconfiguration of Ladder Lotteries
Oral Presentation(General)
2021.12 -
FPGA synthesis of dynamic learning tree with high-level programming language
Oral Presentation(General) Nishat Tasmin
2018.12 -
Enumerating induced cycles on an undirected graph using Read and Tarjan's algorithm
Oral Presentation(General)
2017.12 -
A simple exact-exponential algorithm for finding a maximum distance-d independent set
Oral Presentation(General)
2017.12 -
Implementation of enumerating all edge-constrained triangulations without the general position assumption
Oral Presentation(General)
2016.12