Katsuhisa Yamanaka

75 papers B 10C 5Misc 5Journal 48Unranked 6
YearRankTypeTitle / Venue / Authors
2025 J jnl
Efficient Enumeration of At Most
CoRR
Waseem Akram, Katsuhisa Yamanaka
2025 J jnl
Efficient enumeration of transversal edge-partitions.
Discret. Appl. Math.
Koki Shinraku, Katsuhisa Yamanaka, Takashi Hirayama
2025 J jnl
Mystery Tower is Computationally Hard.
J. Inf. Process.
Kyohei Sangodo, Katsuhisa Yamanaka, Takashi Hirayama
2025 J jnl
Reconfiguration and enumeration of optimal cyclic ladder lotteries.
Theor. Comput. Sci.
Yuta Nozaki, Kunihiro Wasa, Katsuhisa Yamanaka
2025 J jnl
Special Issue on Selected Papers from the 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024): Guest Editors' Foreword.
J. Graph Algorithms Appl.
Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen
2024 — conf
An Improved Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits.
ISMVL
Takashi Hirayama, Ryo Endo, Katsuhisa Yamanaka
2024 J jnl
Enumerating floorplans with walls.
Discret. Appl. Math.
Katsuhisa Yamanaka, Shin-Ichi Nakano
2024 J jnl
New Bounds for Quick Computation of the Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits.
IEICE Trans. Inf. Syst.
Takashi Hirayama, Rin Suzuki, Katsuhisa Yamanaka, Yasuaki Nishitani
2024 J jnl
Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries.
CoRR
Yuta Nozaki, Kunihiro Wasa, Katsuhisa Yamanaka
2024 B ed.
WALCOM: Algorithms and Computation - 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18-20, 2024, Proceedings
WALCOM
Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen
2023 J jnl
Enumerating Empty and Surrounding Polygons.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Shunta Terui, Katsuhisa Yamanaka, Takashi Hirayama, Takashi Horiyama, Kazuhiro Kurita, Takeaki Uno
2023 — conf
Quick Computation of the Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits.
ISMVL
Takashi Hirayama, Rin Suzuki, Katsuhisa Yamanaka, Yasuaki Nishitani
2023 C conf
Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries.
IWOCA
Yuta Nozaki, Kunihiro Wasa, Katsuhisa Yamanaka
2023 J jnl
Sorting balls and water: Equivalence and computational complexity.
Theor. Comput. Sci.
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
2022 J jnl
A Polynomial Delay Algorithm for Enumerating 2-Edge-Connected Induced Subgraphs.
IEICE Trans. Inf. Syst.
Taishu Ito, Yusuke Sano, Katsuhisa Yamanaka, Takashi Hirayama
2022 J jnl
An
IEICE Trans. Inf. Syst.
Yasuaki Kobayashi, Shin-Ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, Katsuhisa Yamanaka
2022 J jnl
Efficient segment folding is hard.
Comput. Geom.
Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka
2022 Misc conf
Sorting Balls and Water: Equivalence and Computational Complexity.
FUN
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
2022 J jnl
Sorting Balls and Water: Equivalence and Computational Complexity.
CoRR
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
2021 J jnl
Algorithmic enumeration of surrounding polygons.
Discret. Appl. Math.
Katsuhisa Yamanaka, David Avis, Takashi Horiyama, Yoshio Okamoto, Ryuhei Uehara, Tanami Yamauchi
2021 J jnl
Optimal reconfiguration of optimal ladder lotteries.
Theor. Comput. Sci.
Katsuhisa Yamanaka, Takashi Horiyama, Kunihiro Wasa
2020 Misc conf
A Polynomial Delay Algorithm for Enumerating 2-Edge-Connected Induced Subgraphs.
FAW
Yusuke Sano, Katsuhisa Yamanaka, Takashi Hirayama
2020 J jnl
Compiling Crossing-free Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and Optimization.
CoRR
Yu Nakahata, Takashi Horiyama, Shin-ichi Minato, Katsuhisa Yamanaka
2020 J jnl
Efficient Segment Folding is Hard.
CoRR
Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka
2020 C conf
Floorplans with Walls.
TAMC
Katsuhisa Yamanaka, Shin-Ichi Nakano
2020 J jnl
Parameterized complexity of independent set reconfiguration problems.
Discret. Appl. Math.
Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka
2019 — conf
Ecient Segment Folding is Hard.
CCCG
Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka
2019 J jnl
Enumerating Highly-Edge-Connected Spanning Subgraphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Katsuhisa Yamanaka, Yasuko Matsui, Shin-Ichi Nakano
2019 J jnl
Exact Exponential Algorithm for Distance-3 Independent Set Problem.
IEICE Trans. Inf. Syst.
Katsuhisa Yamanaka, Shogo Kawaragi, Takashi Hirayama
2019 J jnl
Sequentially Swapping Colored Tokens on Graphs.
J. Graph Algorithms Appl.
Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno
2019 J jnl
The Complexity of Induced Tree Reconfiguration Problems.
IEICE Trans. Inf. Syst.
Kunihiro Wasa, Katsuhisa Yamanaka, Hiroki Arimura
2018 J jnl
Enumerating Floorplans with Columns.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Katsuhisa Yamanaka, Md. Saidur Rahman, Shin-Ichi Nakano
2018 J jnl
Function Design for Minimum Multiple-Control Toffoli Circuits of Reversible Adder/Subtractor Blocks and Arithmetic Logic Units.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Md Belayet Ali, Takashi Hirayama, Katsuhisa Yamanaka, Yasuaki Nishitani
2018 — conf
Ladder-Lottery Realization.
CCCG
Katsuhisa Yamanaka, Takashi Horiyama, Takeaki Uno, Kunihiro Wasa
2018 Misc conf
More Routes for Evacuation.
COCOON
Katsuhisa Yamanaka, Yasuko Matsui, Shin-Ichi Nakano
2018 J jnl
Swapping Colored Tokens on Graphs.
CoRR
Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
2018 J jnl
Swapping colored tokens on graphs.
Theor. Comput. Sci.
Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
2017 J jnl
Enumeration, Counting, and Random Generation of Ladder Lotteries.
IEICE Trans. Inf. Syst.
Katsuhisa Yamanaka, Shin-Ichi Nakano
2017 — conf
Floorplans with Columns.
COCOA (1)
Katsuhisa Yamanaka, Md. Saidur Rahman, Shin-Ichi Nakano
2017 B conf
Sequentially Swapping Colored Tokens on Graphs.
WALCOM
Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno
2016 — conf
New Two-Qubit Gate Library with Entanglement.
ISMVL
Md Belayet Ali, Takashi Hirayama, Katsuhisa Yamanaka, Yasuaki Nishitani
2016 — ch.
Permutation Enumeration.
Encyclopedia of Algorithms
Katsuhisa Yamanaka
2016 C conf
The Complexity of Induced Tree Reconfiguration Problems.
LATA
Kunihiro Wasa, Katsuhisa Yamanaka, Hiroki Arimura
2016 J jnl
Uniformly Random Generation of Floorplans.
IEICE Trans. Inf. Syst.
Katsuhisa Yamanaka, Shin-Ichi Nakano
2015 J jnl
Another Optimal Binary Representation of Mosaic Floorplans.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Katsuhisa Yamanaka, Shin-Ichi Nakano
2015 B conf
Competitive Diffusion on Weighted Graphs.
WADS
Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou
2015 Misc conf
Enumeration, Counting, and Random Generation of Ladder Lotteries.
FAW
Katsuhisa Yamanaka, Shin-Ichi Nakano
2015 B conf
Swapping Colored Tokens on Graphs.
WADS
Katsuhisa Yamanaka, Takashi Horiyama, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
2015 J jnl
Swapping labeled tokens on graphs.
Theor. Comput. Sci.
Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
2014 J jnl
A Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits.
IEICE Trans. Inf. Syst.
Takashi Hirayama, Hayato Sugawara, Katsuhisa Yamanaka, Yasuaki Nishitani
2014 J jnl
Approximating the path-distance-width for AT-free graphs and graphs in related classes.
Discret. Appl. Math.
Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki
2014 J jnl
Computational Complexity of Competitive Diffusion on (Un)weighted Graphs.
CoRR
Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou
2014 J jnl
Efficient Enumeration of All Ladder Lotteries with
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Katsuhisa Yamanaka, Shin-Ichi Nakano
2014 C conf
On the Parameterized Complexity for Token Jumping on Graphs.
TAMC
Takehiro Ito, Marcin Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka
2014 Misc conf
Swapping Labeled Tokens on Graphs.
FUN
Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
2013 J jnl
A Compact Encoding of Rectangular Drawings with Edge Lengths.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Shin-Ichi Nakano, Katsuhisa Yamanaka
2012 J jnl
Efficient enumeration of ordered trees with k leaves.
Theor. Comput. Sci.
Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano
2012 J jnl
Enumerating All Rooted Trees Including
IEICE Trans. Inf. Syst.
Masanobu Ishikawa, Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano
2012 J jnl
Random generation and enumeration of bipartite permutation graphs.
J. Discrete Algorithms
Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara
2011 B conf
Approximability of the Path-Distance-Width for AT-free Graphs.
WG
Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki
2010 J jnl
A compact encoding of plane triangulations with efficient query supports.
Inf. Process. Lett.
Katsuhisa Yamanaka, Shin-Ichi Nakano
2010 J jnl
Efficient enumeration of all ladder lotteries and its application.
Theor. Comput. Sci.
Katsuhisa Yamanaka, Shin-Ichi Nakano, Yasuko Matsui, Ryuhei Uehara, Kento Nakada
2010 J jnl
Random Generation and Enumeration of Proper Interval Graphs.
IEICE Trans. Inf. Syst.
Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara
2009 J jnl
Computational Complexities of University Interview Timetabling.
IEICE Trans. Inf. Syst.
Naoyuki Kamiyama, Yuuki Kiyonari, Eiji Miyano, Shuichi Miyazaki, Katsuhisa Yamanaka
2009 B conf
Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract).
WALCOM
Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano
2009 J jnl
Listing All Plane Graphs.
J. Graph Algorithms Appl.
Katsuhisa Yamanaka, Shin-Ichi Nakano
2009 B conf
Random Generation and Enumeration of Bipartite Permutation Graphs.
ISAAC
Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara
2009 B conf
Random Generation and Enumeration of Proper Interval Graphs.
WALCOM
Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara
2008 B conf
A Compact Encoding of Plane Triangulations with Efficient Query Supports.
WALCOM
Katsuhisa Yamanaka, Shin-Ichi Nakano
2008 J jnl
A Compact Encoding of Rectangular Drawings with Efficient Query Supports.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Katsuhisa Yamanaka, Shin-Ichi Nakano
2008 B conf
Listing All Plane Graphs.
WALCOM
Katsuhisa Yamanaka, Shin-Ichi Nakano
2007 C conf
A Compact Encoding of Rectangular Drawings with Efficient Query Supports.
AAIM
Katsuhisa Yamanaka, Shin-Ichi Nakano
2007 J jnl
Constant Time Generation of Integer Partitions.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Katsuhisa Yamanaka, Shin-ichiro Kawano, Yosuke Kikuchi, Shin-Ichi Nakano
2006 J jnl
Coding Floorplans with Fewer Bits.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Katsuhisa Yamanaka, Shin-Ichi Nakano
2006 J jnl
Constant Time Generation of Rectangular Drawings with Exactly
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Satoshi Yoshii, Daisuke Chigira, Katsuhisa Yamanaka, Shin-Ichi Nakano