default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKatsuhisa Yamanaka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j37]Katsuhisa Yamanaka
, Shin-Ichi Nakano:
Enumerating floorplans with walls. Discret. Appl. Math. 342: 1-11 (2024)- [j36]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 Trans. Inf. Syst. 107(8): 940-948 (2024) - [c25]Takashi Hirayama, Ryo Endo, Katsuhisa Yamanaka:
An Improved Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits. ISMVL 2024: 120-125 - [e1]Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen:
WALCOM: Algorithms and Computation - 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18-20, 2024, Proceedings. Lecture Notes in Computer Science 14549, Springer 2024, ISBN 978-981-97-0565-8 [contents] - [i6]Yuta Nozaki, Kunihiro Wasa, Katsuhisa Yamanaka:
Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries. CoRR abs/2405.16408 (2024) - 2023
- [j35]Shunta Terui, Katsuhisa Yamanaka, Takashi Hirayama, Takashi Horiyama, Kazuhiro Kurita, Takeaki Uno:
Enumerating Empty and Surrounding Polygons. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106(9): 1082-1091 (2023) - [j34]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. Theor. Comput. Sci. 978: 114158 (2023) - [c24]Takashi Hirayama, Rin Suzuki, Katsuhisa Yamanaka, Yasuaki Nishitani:
Quick Computation of the Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits. ISMVL 2023: 153-157 - [c23]Yuta Nozaki, Kunihiro Wasa, Katsuhisa Yamanaka:
Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries. IWOCA 2023: 331-342 - 2022
- [j33]Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka:
Efficient segment folding is hard. Comput. Geom. 104: 101860 (2022) - [j32]Taishu Ito, Yusuke Sano, Katsuhisa Yamanaka, Takashi Hirayama:
A Polynomial Delay Algorithm for Enumerating 2-Edge-Connected Induced Subgraphs. IEICE Trans. Inf. Syst. 105-D(3): 466-473 (2022) - [j31]Yasuaki Kobayashi, Shin-Ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, Katsuhisa Yamanaka:
An O(n2)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position. IEICE Trans. Inf. Syst. 105-D(3): 503-507 (2022) - [c22]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. FUN 2022: 16:1-16:17 - [i5]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 abs/2202.09495 (2022) - 2021
- [j30]Katsuhisa Yamanaka, David Avis, Takashi Horiyama, Yoshio Okamoto, Ryuhei Uehara, Tanami Yamauchi:
Algorithmic enumeration of surrounding polygons. Discret. Appl. Math. 303: 305-313 (2021) - [j29]Katsuhisa Yamanaka, Takashi Horiyama, Kunihiro Wasa:
Optimal reconfiguration of optimal ladder lotteries. Theor. Comput. Sci. 859: 57-69 (2021) - 2020
- [j28]Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka:
Parameterized complexity of independent set reconfiguration problems. Discret. Appl. Math. 283: 336-345 (2020) - [c21]Yusuke Sano, Katsuhisa Yamanaka, Takashi Hirayama:
A Polynomial Delay Algorithm for Enumerating 2-Edge-Connected Induced Subgraphs. FAW 2020: 13-24 - [c20]Katsuhisa Yamanaka, Shin-Ichi Nakano:
Floorplans with Walls. TAMC 2020: 50-59 - [i4]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 abs/2001.08899 (2020) - [i3]Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka:
Efficient Segment Folding is Hard. CoRR abs/2012.11062 (2020)
2010 – 2019
- 2019
- [j27]Kunihiro Wasa, Katsuhisa Yamanaka, Hiroki Arimura:
The Complexity of Induced Tree Reconfiguration Problems. IEICE Trans. Inf. Syst. 102-D(3): 464-469 (2019) - [j26]Katsuhisa Yamanaka, Shogo Kawaragi, Takashi Hirayama:
Exact Exponential Algorithm for Distance-3 Independent Set Problem. IEICE Trans. Inf. Syst. 102-D(3): 499-501 (2019) - [j25]Katsuhisa Yamanaka, Yasuko Matsui, Shin-Ichi Nakano:
Enumerating Highly-Edge-Connected Spanning Subgraphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 1002-1006 (2019) - [j24]Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno:
Sequentially Swapping Colored Tokens on Graphs. J. Graph Algorithms Appl. 23(1): 3-27 (2019) - [c19]Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka:
Ecient Segment Folding is Hard. CCCG 2019: 177-183 - 2018
- [j23]Katsuhisa Yamanaka, Md. Saidur Rahman, Shin-Ichi Nakano:
Enumerating Floorplans with Columns. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(9): 1392-1397 (2018) - [j22]Md Belayet Ali, Takashi Hirayama, Katsuhisa Yamanaka, Yasuaki Nishitani:
Function Design for Minimum Multiple-Control Toffoli Circuits of Reversible Adder/Subtractor Blocks and Arithmetic Logic Units. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(12): 2231-2243 (2018) - [j21]Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno:
Swapping colored tokens on graphs. Theor. Comput. Sci. 729: 1-10 (2018) - [c18]Katsuhisa Yamanaka, Takashi Horiyama, Takeaki Uno, Kunihiro Wasa:
Ladder-Lottery Realization. CCCG 2018: 61-67 - [c17]Katsuhisa Yamanaka, Yasuko Matsui, Shin-Ichi Nakano:
More Routes for Evacuation. COCOON 2018: 76-83 - [i2]Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno:
Swapping Colored Tokens on Graphs. CoRR abs/1803.06816 (2018) - 2017
- [j20]Katsuhisa Yamanaka, Shin-Ichi Nakano:
Enumeration, Counting, and Random Generation of Ladder Lotteries. IEICE Trans. Inf. Syst. 100-D(3): 444-451 (2017) - [c16]Katsuhisa Yamanaka, Md. Saidur Rahman, Shin-Ichi Nakano:
Floorplans with Columns. COCOA (1) 2017: 33-40 - [c15]Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno:
Sequentially Swapping Colored Tokens on Graphs. WALCOM 2017: 435-447 - 2016
- [j19]Katsuhisa Yamanaka, Shin-Ichi Nakano:
Uniformly Random Generation of Floorplans. IEICE Trans. Inf. Syst. 99-D(3): 624-629 (2016) - [c14]Md Belayet Ali, Takashi Hirayama, Katsuhisa Yamanaka, Yasuaki Nishitani:
New Two-Qubit Gate Library with Entanglement. ISMVL 2016: 235-240 - [c13]Kunihiro Wasa, Katsuhisa Yamanaka, Hiroki Arimura:
The Complexity of Induced Tree Reconfiguration Problems. LATA 2016: 330-342 - [r1]Katsuhisa Yamanaka:
Permutation Enumeration. Encyclopedia of Algorithms 2016: 1559-1564 - 2015
- [j18]Katsuhisa Yamanaka, Shin-Ichi Nakano:
Another Optimal Binary Representation of Mosaic Floorplans. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(6): 1223-1224 (2015) - [j17]Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno:
Swapping labeled tokens on graphs. Theor. Comput. Sci. 586: 81-94 (2015) - [c12]Katsuhisa Yamanaka, Shin-Ichi Nakano:
Enumeration, Counting, and Random Generation of Ladder Lotteries. FAW 2015: 294-303 - [c11]Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou:
Competitive Diffusion on Weighted Graphs. WADS 2015: 422-433 - [c10]Katsuhisa Yamanaka, Takashi Horiyama, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno:
Swapping Colored Tokens on Graphs. WADS 2015: 619-628 - 2014
- [j16]Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki:
Approximating the path-distance-width for AT-free graphs and graphs in related classes. Discret. Appl. Math. 168: 69-77 (2014) - [j15]Katsuhisa Yamanaka, Shin-Ichi Nakano:
Efficient Enumeration of All Ladder Lotteries with k Bars. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(6): 1163-1170 (2014) - [j14]Takashi Hirayama, Hayato Sugawara, Katsuhisa Yamanaka, Yasuaki Nishitani:
A Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits. IEICE Trans. Inf. Syst. 97-D(9): 2253-2261 (2014) - [c9]Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno:
Swapping Labeled Tokens on Graphs. FUN 2014: 364-375 - [c8]Takehiro Ito, Marcin Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka:
On the Parameterized Complexity for Token Jumping on Graphs. TAMC 2014: 341-351 - [i1]Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou:
Computational Complexity of Competitive Diffusion on (Un)weighted Graphs. CoRR abs/1412.3334 (2014) - 2013
- [j13]Shin-Ichi Nakano, Katsuhisa Yamanaka:
A Compact Encoding of Rectangular Drawings with Edge Lengths. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(6): 1032-1035 (2013) - 2012
- [j12]Masanobu Ishikawa, Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano:
Enumerating All Rooted Trees Including k Leaves. IEICE Trans. Inf. Syst. 95-D(3): 763-768 (2012) - [j11]Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara:
Random generation and enumeration of bipartite permutation graphs. J. Discrete Algorithms 10: 84-97 (2012) - [j10]Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano:
Efficient enumeration of ordered trees with k leaves. Theor. Comput. Sci. 442: 22-27 (2012) - 2011
- [c7]Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki:
Approximability of the Path-Distance-Width for AT-free Graphs. WG 2011: 271-282 - 2010
- [j9]Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara:
Random Generation and Enumeration of Proper Interval Graphs. IEICE Trans. Inf. Syst. 93-D(7): 1816-1823 (2010) - [j8]Katsuhisa Yamanaka, Shin-Ichi Nakano:
A compact encoding of plane triangulations with efficient query supports. Inf. Process. Lett. 110(18-19): 803-809 (2010) - [j7]Katsuhisa Yamanaka, Shin-Ichi Nakano, Yasuko Matsui, Ryuhei Uehara, Kento Nakada:
Efficient enumeration of all ladder lotteries and its application. Theor. Comput. Sci. 411(16-18): 1714-1722 (2010)
2000 – 2009
- 2009
- [j6]Naoyuki Kamiyama, Yuuki Kiyonari, Eiji Miyano, Shuichi Miyazaki, Katsuhisa Yamanaka:
Computational Complexities of University Interview Timetabling. IEICE Trans. Inf. Syst. 92-D(2): 130-140 (2009) - [j5]Katsuhisa Yamanaka, Shin-Ichi Nakano:
Listing All Plane Graphs. J. Graph Algorithms Appl. 13(1): 5-18 (2009) - [c6]Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara:
Random Generation and Enumeration of Bipartite Permutation Graphs. ISAAC 2009: 1104-1113 - [c5]Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano:
Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract). WALCOM 2009: 141-150 - [c4]Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara:
Random Generation and Enumeration of Proper Interval Graphs. WALCOM 2009: 177-189 - 2008
- [j4]Katsuhisa Yamanaka, Shin-Ichi Nakano:
A Compact Encoding of Rectangular Drawings with Efficient Query Supports. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(9): 2284-2291 (2008) - [c3]Katsuhisa Yamanaka, Shin-Ichi Nakano:
A Compact Encoding of Plane Triangulations with Efficient Query Supports. WALCOM 2008: 120-131 - [c2]Katsuhisa Yamanaka, Shin-Ichi Nakano:
Listing All Plane Graphs. WALCOM 2008: 210-221 - 2007
- [j3]Katsuhisa Yamanaka, Shin-ichiro Kawano, Yosuke Kikuchi, Shin-Ichi Nakano:
Constant Time Generation of Integer Partitions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(5): 888-895 (2007) - [c1]Katsuhisa Yamanaka, Shin-Ichi Nakano:
A Compact Encoding of Rectangular Drawings with Efficient Query Supports. AAIM 2007: 68-81 - 2006
- [j2]Katsuhisa Yamanaka, Shin-Ichi Nakano:
Coding Floorplans with Fewer Bits. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(5): 1181-1185 (2006) - [j1]Satoshi Yoshii, Daisuke Chigira, Katsuhisa Yamanaka, Shin-Ichi Nakano:
Constant Time Generation of Rectangular Drawings with Exactly n Faces. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(9): 2445-2450 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
