Journal papers
  1. Kunihiro Wasa, Katsuhisa Yamanaka, and Hiroki Arimura, The complexity of induced tree reconfiguration problems, IEICE Transactions on Information and Systems, vol.E102-D, no.3,pp.464--469, Mar, 2019.

  2. Katsuhisa Yamanaka, Syogo Kawaragi, and Takashi Hirayama, Exact exponential algorithm for distance-3 independent set problem, IEICE Transactions on Information and Systems, vol.E102-D, no.3, pp.499--501, Mar, 2019.

  3. Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, and Takeaki Uno, Sequentially swapping colored tokens on graphs, Journal of Graph Algorithms and Its Applications, vol.23, no.1, pp.3--27, Jan, 2019.

  4. M.D. Belayet Ali, Takashi Hirayama, Katsuhisa Yamanaka, and Yasuaki Nishitani, Function design for minimum multiple-control Toffoli circuits of reversible adder/subtractor blocks and arithmetic logic units vol.E101-A, no.12, pp.2231--2243, Dec. 2018.

  5. Katsuhisa Yamanaka, Md. Saidur Rahman and Shin-ichi Nakano, Enumerating floorplans with columns, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol.E101-A, no.9, pp.1392--1397, Sep 1, 2018.

  6. Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno, Swapping colored tokens on graphs, Theoretical Computer Science, vol.729, pp.1--10, Jun 12, 2018.

  7. Katsuhisa Yamanaka and Shin-ichi Nakano, Enumeration, Counting, and Random Generation of Ladder Lotteries, IEICE Transactions on Information and Systems, vol.E100-D, no.3, pp.444--451, Mar 1, 2017.

  8. Katsuhisa Yamanaka and Shin-ichi Nakano, Uniformly random generation of floorplans, IEICE Transactions on Information and Systems, vol.E99-D, no.3, pp.624--629, Mar, 2016.

  9. Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, and Takeaki Uno, Swapping labeled tokens on graphs, Theoretical Computer Science, vol.586, pp.81-94, 27th June 2015.

  10. Katsuhisa Yamanaka and Shin-ichi Nakano, Another optimal binary representation of mosaic floorplans, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol.E98-A, no.6, pp.1223-1224, 1st June 2015.

  11. Takashi Hirayama, Hayato Sugawara, Katsuhisa Yamanaka, and Yasuaki Nishitani, A lower bound on the gate count of Toffoli-based reversible logic circuits, IEICE Transactions on Information and Systems, vol.E97-D, no.9, pp.2253-2261, Sep, 2014.

  12. Katsuhisa Yamanaka and Shin-ichi Nakano, Efficient enumeration of all ladder lotteries with k bars, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol.E97-A, no.6, pp.1163-1170, Jun, 2014.

  13. Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno and Koichi Yamazaki, Approximating the path-distance-width for AT-free graphs and graphs in related classes, Discrete Applied Mathematics, vol.168, pp.69-77, May 11, 2014.

  14. Shin-ichi Nakano and Katsuhisa Yamanaka, A compact encoding of rectangular drawings with edge lengths, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol.E96-A, no.6, pp.1032-1035, Jun, 2013.

  15. Katsuhisa Yamanaka, Yota Otachi and Shin-ichi Nakano, Efficient enumeration of ordered trees with k leaves, Theoretical Computer Science, Vol.442, pp.22-27, Jun 1, 2012.

  16. Masanobu Ishikawa, Katsuhisa Yamanaka, Yota Otachi and Shin-ichi Nakano, Enumerating all rooted trees including k leaves, IEICE Transactions on Information and Systems, vol.E95-D, no.3, pp.763-768, Mar, 2012.

  17. Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka and Ryuhei Uehara, Random generation and enumeration of bipartite permutation graphs, Journal of Discrete Algorithms, vol.10, pp.84-97, Jan, 2012.

  18. Ryohei Suda, Shin-ichi Nakano and Katsuhisa Yamanaka, Compact codings of grid rectangular drawings, IEICE Transactions on Information and Systems, (in Japanese), vol.J94-D, no.12, pp.2031-2036, 1st, Dec, 2011.

  19. Katsuhisa Yamanaka and Shin-ichi Nakano, A compact encoding of plane triangulations with efficient query supports, Information Processing Letters, vol.110, no.18-19, pp.803-809, Sep 15, 2010.

  20. Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi and Ryuhei Uehara, Random generation and enumeration of proper interval graphs, IEICE Transactions on Information and Systems, vol.E93-D, no.7, pp.1816-1823, Jul 1, 2010.

  21. Katsuhisa Yamanaka, Shin-ichi Nakano, Yasuko Matsui, Ryuhei Uehara and Kento Nakada, Efficient enumeration of all ladder lotteries and its application, Theoretical Computer Science, vol.411, pp.1714-1722, Mar 28, 2010.

  22. Katsuhisa Yamanaka and Shin-ichi Nakano, Listing all plane graphs, Journal of Graph Algorithms and Its Applications, vol.13, no.1, pp.5-18, Feb, 2009.

  23. Naoyuki Kamiyama, Yuuki Kiyonari, Eiji Miyano, Shuichi Miyazaki and Katsuhisa Yamanaka, Computational complexity of university interview timetabling, IEICE Transaction on Information and Systems, vol.E92-D, no.2, pp.130-140, Feb 1, 2009.

  24. Katsuhisa Yamanaka and Shin-ichi Nakano, A compact encoding of rectangular drawings with efficient query supports, IEICE Transaction on Fundamentals of Electronics, Communications and Computer Sciences, vol.E91-A, no.9, pp.2284-2291, Sep 1, 2008.

  25. Kouto Sekine, Katsuhisa Yamanaka and Shin-ichi Nakano, Enumeration of permutaions, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol.J91-A, no.5, pp.543-549, May 1, 2008. (in Japanese)

  26. Katsuhisa Yamanaka, Shin-ichiro Kawano, Yosuke Kikuchi, and Shin-ichi Nakano, Constant time generation of integer partitions, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol.E90-A, no.5, pp.888-895, May 1, 2007.

  27. Satoshi Yoshii, Daisuke Chigira, Katsuhisa Yamanaka, and Shin-ichi Nakano, Constant generation of rectangular drawing with exactly n faces, IEICE Transaction on Fundamentals of Electronics, Communications and Computer Sciences, vol.89-A, no.9, pp.2445-2450, Sep 1, 2006.

  28. Katsuhisa Yamanaka and Shin-ichi Nakano, Coding floorplans with fewer bits, IEICE Transaction on Fundamentals of Electronics, Communications and Computer Sciences, vol.E89-A, no.5, pp.1181-1185, May 1, 2006.

  29. 山中 克久, 中野眞一, リアライザの列挙, 電子情報通信学会和文誌D, vol.J87-D1 no.12 pp.1043-1050, Dec 1, 2004.
    (Translated)
    Katsuhisa Yamanaka and Shin-ichi Nakano, Generating all realizers, Electronics and Communication in Japan, Part2, Vol.89, Issue 7, pp.40-47, 2006.



Proceedings
  1. Katsuhisa Yamanaka, Takashi Horiyama, Yoshio Okamoto, Ryuhei Uehara, and Tanami Yamauchi, Algorithmic enumeration of surrounding polygons, Proc. The 35th European Workshop on Computational Geometry (EuroCG 2019), Mar, 2019. (Mar 18--20, Utrecht, Netherland)
  2. Katsuhisa Yamanaka, Takashi Horiyama, Takeaki Uno, Kunihiro Wasa, Ladder-lottery realization, Proc. The 30th Canadian Conference on Computational Geometry (CCCG 2018), pp.61--67, Aug, 2018. (Aug 8--10, Winnipeg, Manitoba, Canada)

  3. Katsuhisa Yamanaka, Yasuko Matsui, and Shin-Ichi Nakano, More Routes for Evacuation, Proc. of The 24th International Computing and Combinatorics Conference (COCOON 2018), Lecture Notes in Computer Science, vol.10976, pp.76--83, 2018. (Qingdao, China during July 2-4, 2018)

  4. Katsuhisa Yamanaka, Md. Saidur Raman, and Shin-ichi Nakano, Floorplans with columns, Proc. 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2017), Lecture Notes in Computer Science, vol.10627, pp.33--40, Dec, 2017. (Shanghai, China, Dec 16-18, 2017)

  5. Takashi Horiyama, Kunihiro Wasa, and Katsuhisa Yamanaka, Reconfiguring optimal ladder lotteries, in Proceedings of the 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (JH2017), pp.217--224, 2017. (Budapest, Hungary, May 22--25, 2017)

  6. Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, and Takeaki Uno, Sequentially Swapping Colored Tokens on Graphs, in Proceedings of Workshop on Algorithms and Computation 2017, (WALCOM 2017) Lecture Notes in Computer Science, vol.10167, pp.435--447, 2017. (Hsinchu, Taiwan, Mar 29--31, 2017)

  7. Md. Belayet Ali, Takashi Hirayama, Katsuhisa Yamanaka, and Yasuaki Nishitani, Design of n-bit reversible adder with LNN architecture, in Proceeding of The 12th International Conference on Foundations of Computer Science (FCS 2016), pp.32--37, Jul, 2016.

  8. Md. Belayet Ali, Takashi Hirayama, Katsuhisa Yamanaka, and Yasuaki Nishitani, New two-qubit gate library with entanglement, in Proceeding of The 46th IEEE International Symposium on Multiple-Valued Logic, pp.235--239, May, 2016.

  9. Kunihiro Wasa, Katsuhisa Yamanaka, and Hiroki Arimura, The complexity of induced tree reconfiguration problems, in Proceeding of The 10th International Conference on Language and Automata Theory and Applications, Lecture Notes in Computer Science, vol.9618, pp.330--342, Mar, 2016.

  10. Katsuhisa Yamanaka, Takafumi Ohmori, Takashi Hirayama, and Yasuaki Nishitani, (2.6n+2)-bit code of slicing floorplans, in Proceeding of The 18th Japan Conference on Discrete and Computational Geometry and Graphs, pp.50--51, Sep 14--16, 2015 (Kyoto, Japan).

  11. Katsuhisa Yamanaka, Takashi Horiyama, David Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, and Yushi Uno, Swapping colored tokens on graphs, in Proceeding of The 14th International Symposium on Algorithms and Data Structures, Lecture Notes in Computer Science, vol.9214, pp.619-628, Aug 5-7, 2015.

  12. Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, and Xiao Zhou, Competitive diffusion on weighted graphs, in Proceeding of The 14th International Symposium on Algorithms and Data Structures, Lecture Notes in Computer Science, vol.9214, pp.422-433, Aug 5-7, 2015.

  13. Katsuhisa Yamanaka and Shin-ichi Nakano, Enumeration, counting, and random generation of ladder Lotteries, in Proceedings of the 9th International Frontiers of Algorithmics Workshop(FAW2015), Lecture Notes in Computer Science, vol.9130, pp.294-303, Jul 3-5, 2015.

  14. Katsuhisa Yamanaka and Shin-ichi Nakano, Uniformly random generation of floorplans(Extended abstract), the 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, pp.188--195, 2015 (June 2--5, Fukuoka).

  15. Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, and Takeaki Uno, Swapping Labeled Tokens on Graphs, in Proceedings of the 7th International Conference on FUN with Algorithms, Lecture Notes in Computer Science, vol.8496, pp.364--375, 2014.

  16. Takehiro Ito, Marcin Kamiński, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara and Katsuhisa Yamanaka, On the Parameterized Complexity for Token Jumping on Graphs, in Proceedings of the 11th Annual Conference on Theory and Applications of Models of Computation (TAMC 2014), Lecture Notes in Computer Science, vol. 8402, pp.341-351, 2014 (Chennai, India, April 11-13, 2014).

  17. Takashi Hirayama, Tatsuro Murayama, Katsuhisa Yamanaka, and Yasuaki Nishitani, A Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits, in Proceedings of Reed-Muller Workshop 2013, pp.15--20, 2013 (24--25,May,2013, Toyama, Japan).

  18. Tomoki Aiuchi, Katsuhisa Yamanaka, Takashi Hirayama, Yasuaki Nishitani, Coding Ladder Lotteries, in Proceedings of European Workshop on Computational Geometory (EuroCG 2013), pp.151--154, 2013. (Braunschweig, Germany, 17--20,Mar,2013)

  19. Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno and Koichi Yamazaki,
    Approximability of the Path-Distance-Width for AT-free Graphs, in Proceedings of The 37th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2011), Lecture Notes in Computer Science, vol.6986, pp.271-282, June 21-24, 2011, DOI: 10.1007/978-3-642-25870-1_25.

  20. Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka and Ryuhei Uehara, Random Generation and Enumeration of Bipartite Permutation Graphs, in Proceedings of 20th International Symposium on Algorithms and Computation(ISAAC 2009), pp.1104-1113, 2009. (Hawaii, USA, Dec 16-18, 2009)

  21. Yosuke Kikuchi, Katsuhisa Yamanaka and Shin-ichi Nakano, Enumerating all graphical sequences (Extended Abstract), in Proceedings of The 7th Japan Conference on Computational Geometry and Graphs (JCCGG 2009), pp.61-62, 2009. (Kanazawa, Japan, Nov 11-13, 2009)

  22. Katsuhisa Yamanaka and Shin-ichi Nakano, Efficient enumeration of all ladder lotteries with k bars (Extended Abstract), in Proceedings of The 7th Japan Conference on Computational Geometry and Graphs (JCCGG 2009), pp.63-64, 2009. (Kanazawa, Japan, 11-13th/Nov/2009)

  23. Yosuke Kikuchi, Katsuhisa Yamanaka and Shin-ichi Nakano, A simple generation of d-dimensional partitions, in Proceedings of The 12th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 2009), pp.60-67, 2009. (Seoul, Korea, 4-5th/July/2009).

  24. Katsuhisa Yamanaka, Shin-ichi Nakano, Yasuko Matsui, Ryuhei Uehara and Kento Nakada, Efficient enumeration of pseudoline arrangements,
    in Proceedings of 25th European Workshop on Computational Geometry (EuroCG), pp.143-146, 2009. (Belgium, Brussels, 16-18th/Mar/2009).

  25. Katsuhisa Yamanaka, Yota Otachi and Shin-ichi Nakano Efficient enumeration of ordered trees with k leaves, in Proceedings of Workshop on Algorithms and Computation 2009, (WALCOM 2009) Lecture Notes in Computer Science, vol.5431, pp.141--150, 2009. (India, Kolkata, Feb 18-20, 2009)

  26. Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi and Ryuhei Uehara, Random generation and enumeration of proper interval graphs, in Proceedings of Workshop on Algorithms and Computation 2009, (WALCOM 2009) Lecture Notes in Computer Science, vol.5431, pp.177--189, 2009. (India, Kolkata, 2009/02/18--20)

  27. Katsuhisa Yamanaka and Shin-ichi Nakano, Listing all plane graphs, in Proceedings of Workshop on Algorithms and Computation 2008, (WALCOM 2008) Lecture Notes in Computer Science, vol.4921, pp.210--221, 2008. (Bangladesh, Dhaka, 2008/02/07--08)

  28. Katsuhisa Yamanaka and Shin-ichi Nakano, A compact encoding of plane triangulation with efficient query supports, in Proceedings of Workshop on Algorithms and Computation 2008 (WALCOM 2008), Lecture Notes in Computer Science, vol.4921, pp.120--131, 2008. (Bangladesh, Dhaka, 2008/02/07--08)

  29. Katsuhisa Yamanaka and Shin-ichi Nakano, A compact encoding of rectangular drawing with efficient query supports, The 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM'07), Lecture Notes in Computer Science, vol.4508, pp.68--81, 2007. (Portland, OR, USA, 2007/06/06-08).

  30. Katsuhisa Yamanaka, Shin-ichiro Kawano, Yosuke Kikuchi, and Shin-ichi Nakano, Constant time generation of integer partitions, in Proceedings of The 9th Japan-Korea Joint Workshop on Algorithms and Computation, pp.57--64, Jul 4-5, 2006. (2006/07/04--05 Hokkaido Univ., Hokkaido, Japan)

  31. Katsuhisa Yamanaka, Shin-ichi Nakano, Coding Floorplans with Fewer Bits, in Proceedings of 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Application, pp. 401-406, Jul 3-6, 2005. (2005/6/3--6, Budapest, Hungary)



Workshops etc.
  1. Katsuhisa Yamanaka, Takashi Horiyama, Yoshio Okamoto, Ryuhei Uehara, and Tanami Yamauchi, Enumerating Surrounding Polygons, IPSJ SIG Technical Report, 2019-AL-172(3), pp.1--4, Mar 2019. (Mar 5, 2019, Yonezawa, Yamagata)

  2. 石川知明, 山内大七洋, 山中克久, 平山貴司 大規模点群における辺制約付き三角形分割の生成, 平成30年度 情報処理学会東北支部研究会(岩手大), 資料番号2018-1, 2018. (2018年12月15日, 岩手大学)

  3. 佐藤浩, 佐野祐輔, 亘理大也, 山中克久, 尾崎拓, 平山貴司, タンパク質相互作用ネットワークの高速な直径計算アルゴリズム, 平成30年度 情報処理学会東北支部研究会(岩手大), 資料番号2018-2, 2018. (2018年12月15日, 岩手大学)

  4. Nishat Tasmin, 平山貴司, 山中克久, FPGA synthesis of dynamic learning tree with high-level programming language, 平成30年度 情報処理学会東北支部研究会(岩手大), 資料番号2018-7, 2018. (2018年12月15日, 岩手大学)

  5. Katsuhisa Yamanaka, Md.Saidur Rahman, and Shin-ichi Nakano, Enumerating Floorplans with Columns, IEICE Technical Report, COMP2018-40, pp.55--59, 2018. (Dec 12, 2018, Tohoku Univ.)

  6. Katsuhisa Yamanaka, Takashi Horiyama, Takeaki Uno, Kunihiro Wasa, The complexity of ladder-lottery realization problem, IPSJ SIG Technical Report, 2018-AL-170(1), pp.1--6, Nov 2018. (Nov 12, 2018, Atami, Shizuoka)

  7. 海沼滉樹, 平山貴司, 山中克久, 関数の集合に対する可逆論理回路の SAT による最小化, 第41回 多値論理フォーラム, no.14, 2018.

  8. 鈴木凜, 平山貴司, 山中克久, 西谷泰昭, 可逆論理回路におけるToffoliゲート数の下界を高速に計算するアルゴリズム, 平成29年度 情報処理学会東北支部研究会(岩手大), 資料番号2017-3-1, 2017. (2017年12月16日, 岩手大学)

  9. 海沼滉樹, 平山貴司, 山中克久, 関数の集合に対する可逆論理回路の最小化, 平成29年度 情報処理学会東北支部研究会(岩手大), 資料番号2017-3-2, 2017. (2017年12月16日, 岩手大学)

  10. Shogo Kawaragi, Katsuhisa Yamanaka, and Takashi Hirayama, A simple exact-exponential algorithm for finding a maximum distance-d independent set, 平成29年度 情報処理学会東北支部研究会(岩手大), 資料番号2017-3-7, 2017. (2017年12月16日, 岩手大学)

  11. Yusuke Sano, Katsuhisa Yamanaka, and Takashi Hirayama, Enumerating induced cycles on an undirected graph using Read and Tarjan's algorithm 平成29年度 情報処理学会東北支部研究会(岩手大), 資料番号2017-3-8, 2017. (2017年12月16日, 岩手大学)

  12. 成田勇気, 山中克久, 平山貴司, ペンダントグラフ上のトークン整列問題 平成29年度 情報処理学会東北支部研究会(岩手大), 資料番号2017-3-10, 2017. (2017年12月16日, 岩手大学)

  13. 横田明裕, 平山貴司, 山中克久, 西谷泰昭, アントコロニー最適化アルゴリズムのトークン整列問題への応用 平成29年度 情報処理学会東北支部研究会(岩手大), 資料番号2017-3-11, 2017. (2017年12月16日, 岩手大学)

  14. Katsuhisa Yamanaka, Takashi Hirayama, Hiroki Kaga, Naoki Katoh, Yasuaki Nishitani, Toshiki Saitoh, and Kunihiro Wasa, Enumerating all 2-edge-connected subgraphs, Proc. 21st Conference of the International Federation of Operational Research Societies (IFORS), 2017.

  15. Katsuhisa Yamanaka, Masatoshi Murakami, Takashi Hirayama, and Yasuaki Nishitani, On the number of edge-constrained triangulations without the general position assumption, Proc. The 30th Workshop on Circuits and Systems (KWS30), pp.165--170, 2017. (May 11--12, 2017, Kitakyushu, Fukuoka)

  16. Masatoshi Murakami, Katsuhisa Yamanaka, Takashi Hirayama, and Yasuaki Nishitani, Implementation of enumerating all edge-constrained triangulations without the general position assumption, IPSJ SIG Technical Report, 2017-AL-161(6), pp.1--4, Jan 2017. (Jan 17, 2017, Morioka, Iwate)

  17. Hiroki Kaga, Katsuhisa Yamanaka, Takashi Hirayama, and Yasuaki Nishitani, A family forest of 2-edge-connected induced subgraphs, 平成28年度 情報処理学会東北支部研究会(岩手大), 資料番号2016-3-1, 2016. (2016年12月17日, 岩手大学)

  18. Masatoshi Murakami, Katsuhisa Yamanaka, Takashi Hirayama, and Yasuaki Nishitani, Implementation of enumerating all edge-constrained triangulations without the general position assumption, 資料番号2016-3-2, 2016. (2016年12月17日, 岩手大学)

  19. 山中克久,(招待講演) トークン整列問題への誘い -あみだくじをグラフへ一般化, 電子情報通信学会技術研究報告, CAS2016-72, p.97, 2016. (Kobe Institute of Computing, Kobe, Hyogo, Nov 25, 2016)

  20. Md. Belayet Ali, Takashi Hirayama, Katsuhisa Yamanaka, and Yasuaki Nishitani, Design of reversible adder with LNN architecture, 第39回多値論理フォーラム, vol.39, no.8, pp.1--8, 2016. (Morioka, Sep 10-11, 2016)

  21. Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, and Takeaki Uno, Computational Complexity of Sequential Token Swapping Problem, IEICE Technical Report, COMP2016-13, pp.115-121, 2016. (Ishikawaken-kyoiku-kaikan, Kanazawa, Ishikawa, Jun 24-25, 2016)

  22. Katsuhisa Yamanaka, Takashi Horiyama, David Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, and Yushi Uno, Computational Complexity of Colored Token Swapping Problem, IPSJ SIG Technical Report 2016-AL-156-2, pp.1-4, Jan 21-22, 2016 (Sakunami, Sendai, Japan).

  23. 安井岳,山中克久,平山貴司,西谷泰昭, スレッショルドグラフ上のトークン整列問題, 平成27年度情報処理学会東北支部研究会開催報告(岩手大), 資料番号2015-2, 2015年12月19日.

  24. 阿部滉太,山中克久,平山貴司,西谷泰昭, 木上のトークン整列問題に対する発見的アルゴリズム, 平成27年度情報処理学会東北支部研究会開催報告(岩手大), 資料番号2015-3, 2015年12月19日.

  25. 佐藤洋司,西谷泰昭,平山貴司,山中克久, Rubyの単体テストを並列分散実行するフレームワークの開発, 平成27年度情報処理学会東北支部研究会開催報告(岩手大), 資料番号2015-4, 2015年12月19日.

  26. 鈴木凜,平山貴司,山中克久,西谷泰昭, 可逆論理回路におけるToffoliゲート数の下界の高速な計算法, 平成27年度情報処理学会東北支部研究会開催報告(岩手大), 資料番号2015-11, 2015年12月19日.

  27. 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, IPSJ SIG Technical Report 2015-AL-154-8, pp.1-6, Sep 28, 2015 (Fukuoka, Japan).

  28. Masatoshi Murakami, Katsuhisa Yamanaka, Takashi Hirayama, and Yasuaki Nishitani, Vizualizing flip graphs, in Proceeding of The 28th Workshop on Circuits and Systems, pp.288-293, Aug 3-4, 2015 (Hyogo, Japan).

  29. 和佐州洋, 山中克久, 有村博紀, 極大誘導木遷移問題, 情報処理学会第153回アルゴリズム研究会 2015-AL-153-13, pp.1-6, Jun 12-13, 2015(北海道札幌市定山渓).

  30. Gaku Yasui, Kouta Abe, Katsuhisa Yamanaka, and Takashi Hirayama, Swapping labeled tokens on complete split graphs, IPSJ SIG Technical Report 2015-AL-153-14, pp.1-4, Jun 12-13, 2015(Jozankei, Sapporo, Japan).

  31. 松尾亘,山中克久,平山貴司,西谷泰昭, 可逆論理回路合成のためのAND-EXOR論理式の簡単化アルゴリズム, 平成26年度第2回情報処理学会東北支部研究会開催報告(岩手大), 資料番号2014-2-1, 2014年12月20日.

  32. 吉田隆宏,西谷泰昭,平山貴司,山中克久, 最適あみだくじの符号化, 平成26年度第2回情報処理学会東北支部研究会開催報告(岩手大), 資料番号2014-2-2, 2014年12月20日.

  33. 菅原隼人,平山貴司,山中克久,西谷泰昭, 可逆論理回路におけるToffoliゲート数の下界の改良, 平成26年度第2回情報処理学会東北支部研究会開催報告(岩手大), 資料番号2014-2-3, 2014年12月20日.

  34. 小出淳市,山中克久,平山貴司,西谷泰昭,今野晃市, 底辺付き内部極大平面グラフの列挙, 平成26年度第2回情報処理学会東北支部研究会開催報告(岩手大), 資料番号2014-2-4, 2014年12月20日.

  35. 安井岳,阿部滉太,山中克久,平山貴司, Swapping Labeled Tokens on Complete Split Graphs, 平成26年度第2回情報処理学会東北支部研究会開催報告(岩手大), 資料番号2014-2-5, 2014年12月20日.

  36. Katsuhisa Yamanaka and Shin-ichi Nakano, Enumeration, counting, and random generation of ladder lotteries, IPSJ SIG Technical Report 2014-AL-150-8, pp.1-7, Nov 20-21, 2014 (Ishigaki, Okinawa, Japan).

  37. Takafumi Ohmori, Katsuhisa Yamanaka, Takashi Hirayama, and Yasuaki Nishitani, Compact codes of slicing floorplans, LA Symposium 2014 (summer), [A-6], 2014, (Iwakuni, Yamaguchi, July 17th-19th, 2014).

  38. Takehiro Ito, Marcin Kamiński, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara and Katsuhisa Yamanaka, FPT algorithms for token jumping on graphs, IPSJ SIG Technical Report 2014-AL-148-2, pp.1-4, 2014 (Yamato-ya, Matsuyama, Ehime, 13th-14th,Jun,2014).

  39. Takafumi Ohmori, Katsuhisa Yamanaka, Takashi Hirayama, and Yasuaki Nishitani, Compact codes of slicing floorplans, IPSJ SIG Technical Report 2014-AL-148-6, pp.1-5, 2014 (Yamato-ya, Matsuyama, Ehime, 13th-14th,Jun,2014).

  40. Jun-ichi Koide, Katsuhisa Yamanaka, Takashi Hirayama, and Yasuaki Nishitani,
    Constant-time delay generation of based plane triangulations, IEICE Technical Report, COMP2013-73, pp.91-98, 2014. (Meiji University, 10th/Mar/2014)

  41. 高松義晴,平山貴司,山中克久,西谷泰昭, セルオートマトンを使った誤り訂正符号の符号語長の削減, 平成25年度第4回情報処理学会東北支部研究会開催報告, 資料番号2013-4-1, 2013年12月21日.

  42. 大森隆文,山中克久,平山貴司,西谷泰昭, スライシングフロアプランのコンパクトな符号, 平成25年度第4回情報処理学会東北支部研究会開催報告, 資料番号2013-4-2, 2013年12月21日.

  43. 赤沼洋介,西谷泰昭,平山貴司,山中克久, Kademliaにおけるレプリケーション周期の乱数化による重複操作の削減, 平成25年度第4回情報処理学会東北支部研究会開催報告, 資料番号2013-4-4, 2013年12月21日.

  44. 熊倉佑介,西谷泰昭,平山貴司,山中克久, 階層型DHTにおけるchurn環境下でのデータ到達性, 平成25年度第4回情報処理学会東北支部研究会開催報告, 資料番号2013-4-5, 2013年12月21日.

  45. Katsuhisa Yamanaka and Shin-ichi Nakano, Uniformly random generation of floorplans, IPSJ SIG Technical Report 2013-AL-145-12, pp.1-5, Nov 6-7, 2013.

  46. Katsuhisa Yamanaka and Shin-ichi Nakano, Uniformly random generation of floorplans, Scheduling Symposium 2013, pp.95-100, (21th-22th,Sep,2013).

  47. Katsuhisa Yamanaka and Shin-ichi Nakano, Another optimal binary representation of mosaic floorplans, IPSJ SIG Technical Report 2013-AL-144-11, pp.1-3, (17th-18th,May,2013).

  48. 高橋亮太,平山貴司,山中克久,西谷泰昭, 十進乗算順序回路のテスト法, 第3回情報処理学会東北支部研究会開催報告, 資料番号2012-3-5, 2012年12月.

  49. 村山達郎,平山貴司,山中克久,西谷泰昭, 可逆論理回路におけるToffoliゲート数の下界とその評価, 第3回情報処理学会東北支部研究会開催報告, 資料番号2012-3-6, 2012年12月.

  50. 太田大輔,西谷泰昭,平山貴司,山中克久, アントコロニー彩色アルゴリズムの収束性, 第3回情報処理学会東北支部研究会開催報告, 資料番号2012-3-11, 2012年12月.

  51. Tomoki Aiuchi, Katsuhisa Yamanaka, Takashi Hirayama, Yasuaki Nishitani, Coding Ladder Lotteries, IPSJ SIG Technical Report 2012-AL-142-10, (2nd,Nov,2012).

  52. Katsuhisa Yamanaka, Compact codes of rooted trees, in Proceedings of The 25th Workshop on Circuits and Systems (KWS25), D-1-1-1, pp.190-195, 2012. (Jul 30--31, 2012, Awaji, Hyogo)

  53. Katsuhisa Yamanaka, A compact encoding of rooted trees, IPSJ SIG Technical Report 2012-AL-138-4, pp.1-6, Jan 28, 2012

  54. 後藤聖貴,西谷泰昭,平山貴司,山中克久, アントコロニー最適化を用いた時間枠付き車両ルーティング問題の解法, 第4回情報処理学会東北支部研究会開催報告, 資料番号2011-4-4, 2012年1月.

  55. 川上勝也,西谷泰昭,平山貴司,山中克久, CUDA環境におけるバンクコンフリクトを回避した3-SAT問題の解法, 第4回情報処理学会東北支部研究会開催報告, 資料番号2011-4-5, 2012年1月.

  56. Shin-ichi Nakano and Katsuhisa Yamanaka, A compact encoding of rectangular drawings with edge lengths, IPSJ SIG Technical Report 2011-AL-136-1, Sep 6, 2011.

  57. Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Kijima Shuji, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, and Koichi Yamazaki, Approximating the path-distance-width for k-cocomparability graphs, IPSJ SIG Technical Report 2010-AL-134-1, pp.1-8, Mar 7, 2011.

  58. 須田亮平, 中野眞一, 山中克久, 格子方形描画のコンパクトな符号, 第73回 情報処理学会 全国大会, 1K-2, Mar 2-4, 2011. (東京工業大学, 3月2日〜4日, 2011)

  59. Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Kijima Shuji, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, and Koichi Yamazaki, Approximating the path-distance-width for k-cocomparability graphs, LA Symposium 2010 (winter), [12], Jan, 2011.

  60. Masanobu Ishikawa, Katsuhisa Yamanaka, Yota Otachi and Shin-ichi Nakano, Enumerating all rooted trees including k leaves, IPSJ SIG Technical Report 2010-AL-131-6, pp.1-8, Sep 22, 2010. (Hakodate National College of Technology, 22th/Sep/2010)

  61. Masanobu Ishikawa, Katsuhisa Yamanaka, Yota Otachi and Shin-ichi Nakano, Enumerating all rooted trees including k leaves, JSIAM 2010 Annual Meeting (Discrete System), D3-3, 2010. (Meiji University, 6--9th/Sep/2010)

  62. 菊地洋右, 山中克久, 中野眞一, グラフ的列の列挙, 第126回 アルゴリズム研究会研究報告, 2009-AL-126-2, pp.1-6, Sep 15, 2009. (鳥取環境大学, 15th/Sep/2009)

  63. Katsuhisa Yamanaka and Shin-ichi Nakano, Efficient enumeration of all ladder lotteries with k bars, IPSJ SIG Technical Report, 2009-AL-126-1, pp.1-8, Sep 15, 2009. (Tottori University of Enviromental Studies, 15th/Sep/2009)

  64. Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka and Ryuhei Uehara, Random generation and enumeration of bipartite permutation graphs, IEICE Technical Report, COMP2009-30, pp.35-42, 2009. (Tottori University of Enviromental Studies, 14th/Sep/2009)

  65. Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka and Ryuhei Uehara, Random generation and enumeration of bipartite permutation graphs, LA Symposium 2009, [21], 2009. (Matsushima, Miyagi, 22-25th/Jul/2009)

  66. Katsuhisa Yamanaka, Shin-ichi Nakano, Yasuko Matsui, Ryuhei Uehara, and Kento Nakada, Efficient enumeration of all pseudoline arrangement, IPSJ SIG Technical Reports 2009-AL-124-1, pp.1-6, 2009. (The Institute of Medical Science, The University of Tokyo, 5th/May/2009)

  67. 小久保侑紀, 星守, 小早川倫広, 山中克久, 大森匡, 類似度のランクに基づくクラスタリング手法と類似検索への応用, DEIM 2009, B6-3, Mar 8-10, 2009. (ヤマハリゾートつま恋, 8-10th/Mar/2009)

  68. Katsuhisa Yamanaka, Shin-ichi Nakano, Yasuko Matsui, Ryuhei Uehara and Kento Nakada, Efficient enumeration of all ladder lotteries, IEICE Technical Report, COMP2008-56, pp.17-23, Mar 2, 2008. (Tokyo Institute of Technology, 2nd/Mar/2009)

  69. Yosuke Kikuchi, Katsuhisa Yamanaka and Shin-ichi Nakano, A simple generation of multi-dimensional partitions, IEICE Technical Report, COMP2008-46-53, pp.23-29/IPSJ SIG Technical Reports 2008-AL-121, pp.23-29, 2008. (Gunma University, Ikaho, 2nd-4th/Dec/2008)

  70. Katsuhisa Yamanaka, Shin-ichi Nakano, Yasuko Matsui, Ryuhei Uehara and Kento Nakada, Efficient enumeration of all ladder lotteries, in Proceedings of The 20th Workshop on Topological Graph Theory, pp.150-151, Nov 25-28, 2008. (Yokohama National University)

  71. Yota Otachi, Katsuhisa Yamanaka and Shin-ichi Nakano, Efficient enumeration of ordered trees with k leaves, IPSJ SIG Technical Reports, 2008-AL-119, pp.69-76, Sep 12, 2008. (Nagoya Institute of Technology)

  72. Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi and Ryuhei Uehara, Random generation and enumeration of proper interval graphs, LA Symposium (summer), [22], 2008. (休暇村 南紀勝浦, 2008/07/22-24)

  73. Kazuyuki Amano, Shin-ichi Nakano and Katsuhisa Yamanaka, On the number of rectangular erawings: exact counting and lower and upper bounds, IPSJ SIG Technical Technical Reports, 2007-AL-115, pp.33-40, Nov 30, 2007. (Niigata Univ.)

  74. Katsuhisa Yamanaka, Zhangjian Li and Shin-ichi Nakano, Listing All Plane Graphs, IPSJ SIG Technical Reports, 2007-AL-114, pp.17-24, Sep 21, 2007. (Toyohashi University of Technology)

  75. 関根航人, 山中克久, 中野眞一, 順列の列挙, LA Symposium (summer), [S9], 2007. (能登千里浜, 2007/07/18-20)

  76. 山中克久, 中野眞一, クエリを高速にサポートする方形描画のコンパクトなコード化, 電子情報通信学会 2006年 総合大会 シンポジウム講演(B) DS-1 COMP-NHC 学生シンポジウム 国士舘大学 世田谷キャンパス, 2006年3月24-26日.

  77. 山中克久, 川野晋一朗, 菊地洋右, 中野眞一, 整数分割の列挙, 情報処理学会研究報告, 2006-AL-104, pp.27-34, Jan 20, 2006 (慶応義塾大学矢上キャンパス).

  78. 山中 克久, 中野眞一, クエリを高速にサポートする方形描画のコンパクトなコード化, 情報処理学会研究報告, 2005-AL-102, pp.35-42, Sep 16, 2005 大阪大学豊中キャンパス基礎工学部, 2005年9月16日.

  79. Katsuhisa Yamanaka, Shin-ichi Nakano, Compact Encoding of Plane Triangulations with Efficient Query Support, 情報処理学会研究報告, 2005-AL-101, pp.35-42, May 19, 2005 (九州大学箱崎キャンパス).

  80. Katsuhisa Yamanaka, Shin-ichi Nakano, Coding floorplans with fewer bits, 情報処理学会研究報告, 2005-AL-99, pp.33-39, Jan 20, 2005 (東京大学 医科学研究所).

  81. 山中 克久, 中野眞一, リアライザの列挙, LA Symposium (summer), 淡路国際夢舞台, Jul 14-17, 2004.

  82. 山中 克久, 中野眞一, リアライザの列挙, 情報処理学会研究報告, 2004-AL-93, pp.25-32, Jan 30, 2004(中央大学).

Survey papers
  1. Katsuhisa Yamanaka,
    Recent developments in floorplan representations, Interdisciplinary Information Sciences, no.4, vol.21, pp.371-399, Dec 17, 2015.

Book
  1. Katsuhisa Yamanaka, Permutation Enumeration, Encyclopedia of Algorithms, pp.1559-1564, Jul 30, 2016.