2024
  • Journals
    • Katsuhisa Yamanaka and Shin-ichi Nakano, Enumerating Floorplans with Walls, Discrete Applied Mathematics, vol.342, pp.1-11, January 15, 2024.
  • Proceedings
    • Waseem Akram and Katsuhisa Yamanaka, Enumerating At Most k-Out Polygons, Proc. of The 40th European Workshop on Computational Geometry (EuroCG 2024), pp.13:1-13:8, March 13-15, Ioannina, Greece, 2024.

2023
  • Journals
    • Ryuhei Uehara, Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Akira Suzuki, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka, and Toshiki Saitoh, Sorting Balls and Water: Equivalence and Computational Complexity, Theoretical Computer Science, Theoretical Computer Science, vol. 978, 114158(15 pages), November 2, 2023.
    • Shunta Terui, Katsuhisa Yamanaka, Takashi Hirayama, Takashi Horiyama, Kazuhiro Kurita, Takeaki Uno, Enumerating Empty and Surrounding Polygons, IEICE Transactions on Information and Systems, vol.E106-A, no.9, pp.1082-1091, April 3, 2023.
  • Proceedings
    • Yuta Nozaki, Kunihiro Wasa and Katsuhisa Yamanaka, Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries, in Proceedings of The 34th International Workshop on Combinatorial Algorithms (IWOCA2023), Lecture Notes on Computer Science, vol.13889, pp.331-342, Tainan, Taiwan, June 7–10, 2023.
    • Takashi Hirayama, Rin Suzuki, Katsuhisa Yamanaka and Yasuaki Nishitani, Quick Computation of the Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits, in Proceedings of IEEE International Symposium on Multiple-Valued Logic, Matsue, Shimane, Japan, May 22-24, 2023.
  • Workshops
    • 叶 尚弥, 山中克久, 平山貴司, Computational Complexity of Yugo Puzzle,第22回情報科学技術フォーラム, A-034, Sep 6--8, 2023.
    • 岩崎善泰,堀山貴史,松井 泰子,野崎 雄太,脊戸 和寿,山中 克久,ZDD を用いた最適円筒あみだくじの列挙,情報処理学会第192回アルゴリズム研究会研究報告,2023-AL-192(3), pp.1-8, Mar 17, 2023.
    • Taishu Ito, Katsuhisa Yamanaka, Takashi Hirayama, and Yasuaki Kobayashi, Reconfiguration of Linear Extensions, IPSJ SIG Technical Report, vol.2023-AL-191, no.1, pp.1--7, Jan 19, 2023.
    • 松浦清太,平山貴司,山中克久,機械学習を用いたビーム探索による可逆論理回路合成,第36回多値論理とその応用研究会技術報告,pp.70--79,Jan 7--8, 2023.

2022
  • Journals
    • 岡野稀央隆, 山中克久, 松山克胤, おはなし迷路の制作を支援するツールのデザインと実装, The Journal of the Society for Art and Science, vol.21, No.4, pp.199-212, Nov 4, 2022.
    • Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, and Katsuhisa Yamanaka, Efficient segment folding is hard, Computational Geometry, vol.104, 101860, pp.1--13, June, 2022.
    • Taishu Ito, Yusuke Sano, Katsuhisa Yamanaka, and Takashi Hirayama, A polynomial delay algorithm for enumerating 2-edge-connected induced subgraphs, IEICE Transactions on Information and Systems, vol.E105-D, no.3, pp.466-473, Mar, 2022.
    • Yasuaki Kobayashi, Shin-ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, and Katsuhisa Yamanaka: An O(n2)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position. IEICE Transactions on Information and Systems. vol.E105-D, no.3, pp.503-507, May, 2022.
  • Proceedings
    • Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka and Ryo Yoshinaka. Sorting Balls and Water: Equivalence and Computational Complexity, Proc. The 11th International Conference on Fun with Algorithms (FUN2022), LIPIcs, vol 226: 16:1-16:17, May 2022.
  • Preprints
    • 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, arXiv preprint, arxiv:2202.09495, 2022.
  • Workshops
    • 米谷元汰,山中克久,平山貴司,電子コンパスにおけるノイズ推定法の改良,令和4年度 情報処理学会東北支部研究会(岩手大学, Online), 資料番号2022-3-12, 2022. (2022年12月17日, 岩手大学, Online)
    • 今野圭祐,服部龍二,新井田駿介,山中克久,平山貴司,是永敏伸,機械学習モデルを用いたカルボニル伸縮振動予測におけるDFT計算手法の評価,令和4年度 情報処理学会東北支部研究会(岩手大学, Online), 資料番号2022-3-13, 2022. (2022年12月17日, 岩手大学, Online)
    • Yuta Nozaki, Kunihiro Wasa, Katsuhisa Yamanaka, Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries, IEICE Technical Report, vol.122, no.294, COMP2022-21, pp.1-8, Dec 6, 2022.
    • Koki Shinraku, Yazhou He, Katsuhisa Yamanaka, and Takashi Hirayama, Enumeration of Transversal Edge-Partitions, IEICE Technical Report, COMP2022-16, pp.14-20, Oct 26, 2022.
    • 信樂昂輝, カクアシュウ, 山中克久, 平山貴司, Enumeration of Transversal Edge-Partitions, 夏のLAシンポジウム, [S3], Jul, 2022.
    • 伊藤⼤修, ⼭中克久, 平⼭貴司, ⼩林靖明, 線形拡張の遷移問題に関する研究, 2021年度組合せ遷移の学生シンポジウム, 2022. (Online, Mar 9, 2022)
    • Ryohei Ota, Taishu Ito, Katsuhisa Yamanaka, and Takashi Hirayama, Computational Complexity of Kirby, 第16回組合せゲーム・パズル研究集会, 2022, (Online, Mar 7-8, 2022)
    • 太田涼平, 伊藤大修, 山中克久, 平山貴司, Kirby is PSPACE-complete, 情報処理学会 第84回全国大会, 6K-02, 2022. (Mar 3--5, Matsuyama, Ehime, and Online)
    • 高橋青玄, 山口拓也, 柳村海希, 山中克久, 吉田尚恵, 是永敏伸, 木構造に基づく機械学習モデルによるホスフィンの電子的性質予測, 情報処理学会 第84回全国大会, 6S-02, 2022. (Mar 3--5, Matsuyama, Ehime, and Online)

2021
  • Journals
    • Katsuhisa Yamanaka, David Avis, Takashi Horiyama, Yoshio Okamoto, Ryuhei Uehara, and Tanami Yamauchi, Algorithmic enumeration of surrounding polygons, Discrete Applied Mathematics, vol.303, pp.305-313, Nov 15, 2021.
    • Katsuhisa Yamanaka, Takashi Horiyama, Kunihiro Wasa, Optimal reconfiguration of optimal ladder lotteries, Theoretical Computer Science, vol.859, pp.57-69, March 6, 2021.
  • Proceedings
    • Yasuaki Kobayashi, Shin-ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, and Katsuhisa Yamanaka, Max-Min 3-dispersion on a Convex Polygon, Proc. of The 37th European Workshop on Computational Geometry (EuroCG 2021), pp.9:1-9:7, Apr, 2021. (Apr 7-9, 2021, Online)
  • Workshops
    • 高橋青玄, 山口拓也, 柳村海希, 山中克久, 是永敏伸, カルボニル伸縮振動予測における回帰木機械学習モデルの評価, 令和3年度 情報処理学会東北支部研究会(岩手大学, Online), 資料番号2021-3-2, 2021. (2021年12月18日, 岩手大学, Online)
    • 山口拓也, 高橋青玄, 柳村海希, 山中克久, 是永敏伸, 機械学習によるホスフィン配位子のカルボニル伸縮振動予測, 令和3年度 情報処理学会東北支部研究会(岩手大学, Online), 資料番号2021-3-3, 2021. (2021年12月18日, 岩手大学, Online)
    • 高瀬祐, 山中克久, 平山貴司, 河野顕輝, 最小二乗法を用いたノイズ推定による方位計算の評価, 令和3年度 情報処理学会東北支部研究会(岩手大学, Online), 資料番号2021-3-4, 2021. (2021年12月18日, 岩手大学, Online)
    • Ryohei Ota, Taishu Ito, Katsuhisa Yamanaka, and Takashi Hirayama, Kirby is PSPACE-complete, 令和3年度 情報処理学会東北支部研究会(岩手大学, Online), 資料番号2021-3-5, 2021. (2021年12月18日, 岩手大学, Online)
    • Yazhou He, Koki Shinraku, Katsuhisa Yamanaka, and Takashi Hirayama, Enumeration of Transversal Edge-Partitions, 令和3年度 情報処理学会東北支部研究会(岩手大学, Online), 資料番号2021-3-6, 2021. (2021年12月18日, 岩手大学, Online)
    • 田中隆晟, 平山貴司, 山中克久, 可逆論理回路最小化アルゴリズムにおける表圧縮の分離, 令和3年度 情報処理学会東北支部研究会(岩手大学, Online), 資料番号2021-3-7, 2021. (2021年12月18日, 岩手大学, Online)
    • Yasuaki Kobayashi, Shin-ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, Katsuhisa Yamanaka, Max-Min 3-dispersion on a Convex Polygon, IPSJ SIG Technical Report, 2021-AL-183(4), pp.1-4, May, 2021. (2021年5月7-8日, オンライン)
    • 中畑裕, 堀山貴史, 湊真一, 山中克久, 動的計画法に基づくSimple Polygonization列挙アルゴリズムの実験的評価, 情報処理学会 第182回アルゴリズム研究会 研究報告, 2021-AL-182(5), pp.1-8, Mar, 2021. (2021年3月17日, オンライン)

2020
  • Journals
    • Takehiro Ito, Marcin Kamiński, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara and Katsuhisa Yamanaka, Parameterized Complexity of Independent Set Reconfiguration Problems, Discrete Applied Mathematics, vol.283, pp.336-345, Sep 15, 2020.
  • Proceedings
    • Shunta Terui, Takashi Hirayama, Takashi Horiyama, Katsuhisa Yamanaka and Takeaki Uno, Enumerating Empty Polygons, Proc. 4th International Workshop on Enumeration Problems and Applications (WEPA 2020), pp.1--4, (5th talk in Session 3), Dec 2020. (Dec 7--10, Online)
    • Yusuke Sano, Katsuhisa Yamanaka, and Takashi Hirayama, A Polynomial Delay Algorithm for Enumerating 2-Edge-Connected Induced Subgraphs, Proc. The 14th International Frontiers of Algorithmics Workshop (FAW 2020), pp.13--24, Lecture Notes in Computer Science, vol.12340, Oct, 2020. (Oct 19--20, Online)
    • Katsuhisa Yamanaka and Shin-ichi Nakano, Floorplans with Walls, Proc. The 16th Annual Conference on Theory and Applications of Models of Computation (TAMC 2020), pp.50--59, Lecture Notes in Computer Science, vol.12337, Oct, 2020. (Oct 18--20, Online)

  • Preprints
    • Yu Nakahata, Takashi Horiyama, Shin-ichi Minato, and Katsuhisa Yamanaka, Compiling Crossing-free Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and Optimization, arXiv preprint, arxiv:2001.08899, 2020.

  • Workshops
    • 佐々木良介, 山中 克久,平山 貴司, 逆探索法による矩形双対の列挙, 令和2年度 情報処理学会東北支部研究会(岩手大, Online), 資料番号2020-3-12, 2020. (2020年12月26日, 岩手大学, Online)
    • Taisyu Ito, Takashi Hirayama, Katsutsugu Matsuyama, Kiotaka Okano, and Katsuhisa Yamanaka, Computational Complexity of Story Maze, 令和2年度 情報処理学会東北支部研究会(岩手大, Online), 資料番号2020-3-13, 2020. (2020年12月26日, 岩手大学, Online)
    • Wang Jianxin, Takashi Hirayama, and Katsuhisa Yamanaka, Finding Surrounding Polygons with Segment Constraints, 令和2年度 情報処理学会東北支部研究会(岩手大, Online), 資料番号2020-3-14, 2020. (2020年12月26日, 岩手大学, Online)
    • Tetsuya Araki, Takashi Horiyama, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, and Katsuhisa Yamanaka, Sorting by Five Prefix Reversals, IPSJ SIG Technical Report, 2020-AL-179(2), pp.1-7, Sep 2020.
    • Yusuke Sano, Katsuhisa Yamanaka, and Takashi Hirayama, Enumerating 2-edge-connected induced subgraphs, IPSJ SIG Technical Report, 2020-AL-177(7), pp.1-7, Mar 2020.

2019
  • Journals
    • Katsuhisa Yamanaka, Yasuko Matsui, and Shin-ichi Nakano, Enumerating highly-edge-connected spanning subgraphs, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol.E102-A, no.9,pp.1002--1006, Sep, 2019.
    • 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.
    • 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.
    • 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 Applications, vol.23, no.1, pp.3--27, Jan, 2019.
  • Proceedings
    • Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, and Katsuhisa Yamanaka, Efficient segment folding is hard, Proc. The 31st Canadian Conference on Computational Geometry (CCCG 2019), pp.177--183, Aug, 2019. (Aug 8--10, Edmonton, Albata, Canada)
    • 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)

  • Workshops
    • Yusuke Sano, Katsuhisa Yamanaka, and Takashi Hirayama, Enumerating all 2-edge-connected induced subgraphs, 令和元年度 情報処理学会東北支部研究会(岩手大), 資料番号2019-3-3, 2019. (2019年12月21日, 岩手大学)
    • Terui Shunta, Takashi Hirayama, Takashi Horiyama, and Katsuhisa Yamanaka,, Enumerating empty polygons, 令和元年度 情報処理学会東北支部研究会(岩手大), 資料番号2019-3-4, 2019. (2019年12月21日, 岩手大学)
    • Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka, Universal sequence of adjacent transpositions, IEICE Technical Report, COMP2019-10, pp.1-5, 2019. (Okayama University, Okayama, Okayama, Sep 2, 2019)
    • Tomoaki Ishikawa, Tanami Yamauchi, Katsuhisa Yamanaka, and Takashi Hirayama, Generating edge-constrained triangulations of large point sets, 情報処理学会 第81回全国大会, 5P-01, 2019. (Mar 14--16, Fukuoka, Fukuoka)
    • Hiroshi Sato, Yusuke Sano, Daiya Watari, Taku Ozaki, Katsuhisa Yamanaka, and Takashi Hirayama, Efficient algorithm for finding diameter of protein-protein interaction networks, 情報処理学会 第81回全国大会, 5P-02, 2019. (Mar 14--16, Fukuoka, Fukuoka)
    • 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)
    • 中畑裕,堀山貴史,湊真一,山中克久, 連結かつ非交差な幾何グラフの列挙,ランダム生成,最適化, 2019年度冬のLAシンポジウム,2月,2020年.

2018
  • Journals
    • 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, IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, vol.E101-A, no.12, pp.2231--2243, Dec. 2018.
    • 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.
    • Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, and Yushi Uno, Swapping colored tokens on graphs, Theoretical Computer Science, vol.729, pp.1--10, Jun 12, 2018.
  • Proceedings
    • 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)
    • 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)
  • Workshops
    • 石川知明, 山内大七洋, 山中克久, 平山貴司 大規模点群における辺制約付き三角形分割の生成, 平成30年度 情報処理学会東北支部研究会(岩手大), 資料番号2018-1, 2018. (2018年12月15日, 岩手大学)
    • 佐藤浩, 佐野祐輔, 亘理大也, 山中克久, 尾崎拓, 平山貴司, タンパク質相互作用ネットワークの高速な直径計算アルゴリズム, 平成30年度 情報処理学会東北支部研究会(岩手大), 資料番号2018-2, 2018. (2018年12月15日, 岩手大学)
    • Nishat Tasmin, 平山貴司, 山中克久, FPGA synthesis of dynamic learning tree with high-level programming language, 平成30年度 情報処理学会東北支部研究会(岩手大), 資料番号2018-7, 2018. (2018年12月15日, 岩手大学)
    • 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.)
    • 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)
2017
  • Paper
    • 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.
  • Proceedings
    • Katsuhisa Yamanaka, Saidur Raman, and Shin-ichi Nakano, Floorplans with columns, in Proceedings of 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2017), Lecture Notes in Computer Science, vol.10627, pp.33--40, Dec, 2017. (Dec 16-18, Shanghai, China)
    • 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)
    • 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 International Conference and Workshops on Algorithms and Computation 2017 (WALCOM 2017), Lecture Notes in Computer Science, vol.10167, pp.435--447, Mar, 2017. (Hsinchu, Taiwan, Mar 29--31, 2017)
  • Workshops, etc
    • 鈴木凜, 平山貴司, 山中克久, 西谷泰昭, 可逆論理回路におけるToffoliゲート数の下界を高速に計算するアルゴリズム, 平成29年度 情報処理学会東北支部研究会(岩手大), 資料番号2017-3-1, 2017. (2017年12月16日, 岩手大学)
    • 海沼滉樹, 平山貴司, 山中克久, 関数の集合に対する可逆論理回路の最小化, 平成29年度 情報処理学会東北支部研究会(岩手大), 資料番号2017-3-2, 2017. (2017年12月16日, 岩手大学)
    • 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日, 岩手大学)
    • 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日, 岩手大学)
    • 成田勇気, 山中克久, 平山貴司, ペンダントグラフ上のトークン整列問題 平成29年度 情報処理学会東北支部研究会(岩手大), 資料番号2017-3-10, 2017. (2017年12月16日, 岩手大学)
    • 横田明裕, 平山貴司, 山中克久, 西谷泰昭, アントコロニー最適化アルゴリズムのトークン整列問題への応用 平成29年度 情報処理学会東北支部研究会(岩手大), 資料番号2017-3-11, 2017. (2017年12月16日, 岩手大学)
    • 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.
    • Katsuhisa Yamanaka, Masatoshi Murakami, Takashi Hirayama, and Nishitani yasuaki, 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.
    • 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)

2016
  • Paper
    • 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.
  • Proceedings
    • 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.
    • 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.
    • 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, vol.9618, pp.330-342, Mar, 2016.
  • Workshops, etc
    • 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日, 岩手大学)
    • 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日, 岩手大学)
    • 山中克久,(招待講演) トークン整列問題への誘い -あみだくじをグラフへ一般化, 電子情報通信学会技術研究報告, CAS2016-72, p.97, 2016. (Kobe Institute of Computing, Kobe, Hyogo, Nov 25, 2016)
    • 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)
    • 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)
    • 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, 2016 (Sendai, Japan).

2015
  • Papers
    • 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.
    • 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.
  • Proceedings
    • 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).
    • 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, pp.619-628, Aug 5-7, 2015.
    • 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, pp.422-433, Aug 5-7, 2015.
    • 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), LNCS, vol.9130, pp.294-303, Jul 3-5, 2015 (Guilin, China).
    • 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, June 2-5, 2015 (Fukuoka, Japan).
  • Workshops, etc
    • Katsuhisa Yamanaka, Takashi Horiyama, David Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno, Computational Complexity of Colored Token Swapping Problem, IPSJ SIG Technical Report 2015-AL-156-2, pp.1-4 Jan 21-22, 2016 (Sakunami, Sendai, Miyagi).
    • 安井岳,山中克久,平山貴司,西谷泰昭, スレッショルドグラフ上のトークン整列問題, 平成27年度情報処理学会東北支部研究会開催報告(岩手大), 資料番号2015-2, 2015年12月19日.
    • 阿部滉太,山中克久,平山貴司,西谷泰昭, 木上のトークン整列問題に対する発見的アルゴリズム, 平成27年度情報処理学会東北支部研究会開催報告(岩手大), 資料番号2015-3, 2015年12月19日.
    • 佐藤洋司,西谷泰昭,平山貴司,山中克久, Rubyの単体テストを並列分散実行するフレームワークの開発, 平成27年度情報処理学会東北支部研究会開催報告(岩手大), 資料番号2015-4, 2015年12月19日.
    • 鈴木凜,平山貴司,山中克久,西谷泰昭, 可逆論理回路におけるToffoliゲート数の下界の高速な計算法, 平成27年度情報処理学会東北支部研究会開催報告(岩手大), 資料番号2015-11, 2015年12月19日.
    • 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, Fukuoka).
    • 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--4th, 2015 (Hyogo, Japan).
    • 和佐州洋, 山中克久, 有村博紀, 極大誘導木遷移問題, 情報処理学会第153回アルゴリズム研究会 2015-AL-153-13, pp.1-6, Jun 12-13, 2015(北海道札幌市定山渓).
    • 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, Hokkaido).
  • Survey
    • Katsuhisa Yamanaka, Recent developments in floorplan representations, Interdisciplinary Information Sciences, no.4, vol.21, pp.371-399, Dec 17, 2015.

2014
  • Papers
    • 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 1, 2014.
    • 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 1, 2014.
    • 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.
  • Proceedings
    • 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 (Lipari, Sicilia, Italy, July 1-3).
    • 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).
  • Workshops, etc
    • 松尾亘,山中克久,平山貴司,西谷泰昭, 可逆論理回路合成のためのAND-EXOR論理式の簡単化アルゴリズム, 平成26年度第2回情報処理学会東北支部研究会開催報告(岩手大), 資料番号2014-2-1, 2014年12月20日.
    • 吉田隆宏,西谷泰昭,平山貴司,山中克久, 最適あみだくじの符号化, 平成26年度第2回情報処理学会東北支部研究会開催報告(岩手大), 資料番号2014-2-2, 2014年12月20日.
    • 菅原隼人,平山貴司,山中克久,西谷泰昭, 可逆論理回路におけるToffoliゲート数の下界の改良, 平成26年度第2回情報処理学会東北支部研究会開催報告(岩手大), 資料番号2014-2-3, 2014年12月20日.
    • 小出淳市,山中克久,平山貴司,西谷泰昭,今野晃市, 底辺付き内部極大平面グラフの列挙, 平成26年度第2回情報処理学会東北支部研究会開催報告(岩手大), 資料番号2014-2-4, 2014年12月20日.
    • 安井岳,阿部滉太,山中克久,平山貴司, Swapping Labeled Tokens on Complete Split Graphs, 平成26年度第2回情報処理学会東北支部研究会開催報告(岩手大), 資料番号2014-2-5, 2014年12月20日.
    • 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, 2014 (Ishigaki, Okinawa, 20-21,Nov,2014).
    • Takafumi Ohmori, Katsuhisa Yamanaka, Takashi Hirayama, Yasuaki Nishitani, Compact codes of slicing floorplans, LA Symposium 2014 (summer), [A-6], 2014, (Iwakuni, Yamaguchi, July 17th-19th, 2014).
    • 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).
    • Takafumi Ohmori, Katsuhisa Yamanaka, Takashi Hirayama, 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).
    • 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)

2013
  • Journal papers
    • 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.
  • Proceeding
    • Takashi Hirayama, Tatsuro Murayama, Katsuhisa Yamanaka, and Yasuaki Nishitani, "A Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits,"
      Proc. Reed-Muller Workshop 2013, pp.15--20, 2013
      (24--25,May,2013, Toyama, Japan).
    • Tomoki Aiuchi, Katsuhisa Yamanaka, Takashi Hirayama, Yasuaki Nishitani, "Coding Ladder Lotteries,"
      Proc. European Workshop on Computational Geometory (EuroCG 2013), pp.151--154, 2013.
      (Braunschweig, Germany, 17--20,Mar,2013)
  • Workshops, etc
    • 高松義晴,平山貴司,山中克久,西谷泰昭, セルオートマトンを使った誤り訂正符号の符号語長の削減, 平成25年度第4回情報処理学会東北支部研究会開催報告, 資料番号2013-4-1, 2013年12月21日.
    • 大森隆文,山中克久,平山貴司,西谷泰昭, スライシングフロアプランのコンパクトな符号, 平成25年度第4回情報処理学会東北支部研究会開催報告, 資料番号2013-4-2, 2013年12月21日.
    • 赤沼洋介,西谷泰昭,平山貴司,山中克久, Kademliaにおけるレプリケーション周期の乱数化による重複操作の削減, 平成25年度第4回情報処理学会東北支部研究会開催報告, 資料番号2013-4-4, 2013年12月21日.
    • 熊倉佑介,西谷泰昭,平山貴司,山中克久, 階層型DHTにおけるchurn環境下でのデータ到達性, 平成25年度第4回情報処理学会東北支部研究会開催報告, 資料番号2013-4-5, 2013年12月21日.
    • Katsuhisa Yamanaka and Shin-ichi Nakano, Uniformly random generation of floorplans, IPSJ SIG Technical Report 2013-AL-145-12, 6-7th,Nov,2013.
    • Katsuhisa Yamanaka and Shin-ichi Nakano, "Uniformly random generation of floorplans"
      Scheduling Symposium, pp.95-100, (21th-22th,Sep,2013).
    • Katsuhisa Yamanaka and Shin-ichi Nakano, Another optimal binary representation of mosaic floorplans
      IPSJ SIG Technical Report 2013-AL-144-11, (17th-18th,May,2013).

2012
  • Journal papers
    • 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.
    • 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.
    • 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, 2012.
  • Workshop, etc
    • 村山達郎,平山貴司,山中克久,西谷泰昭, "可逆論理回路におけるToffoliゲート数の下界とその評価", 第3回情報処理学会東北支部研究会開催報告, 資料番号2012-3-6, 2012年12月.
    • 太田大輔,西谷泰昭,平山貴司,山中克久, "アントコロニー彩色アルゴリズムの収束性", 第3回情報処理学会東北支部研究会開催報告, 資料番号2012-3-11, 2012年12月.
    • Tomoki Aiuchi, Katsuhisa Yamanaka, Takashi Hirayama, Yasuaki Nishitani, "Coding Ladder Lotteries,"
      IPSJ SIG Technical Report 2012-AL-142-10, (2nd,Nov,2012).
    • Katsuhisa Yamanaka, "Compact codes of rooted trees,"
      Proc. The 25th Workshop on Circuits and Systems (KWS25), D-1-1-1, pp.190-195, 2012
    • Katsuhisa Yamanaka, "A compact encoding of rooted trees,"
      IPSJ SIG Technical Report 2012-AL-138-4, 2012
    • 後藤聖貴,西谷泰昭,平山貴司,山中克久, "アントコロニー最適化を用いた時間枠付き車両ルーティング問題の解法,"
      第4回情報処理学会東北支部研究会開催報告, 資料番号2011-4-4, 2012年1月.
    • 川上勝也,西谷泰昭,平山貴司,山中克久, "CUDA環境におけるバンクコンフリクトを回避した3-SAT問題の解法,"
      第4回情報処理学会東北支部研究会開催報告, 資料番号2011-4-5, 2012年1月.

2011
  • Journal paper
    • 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, 2011.
  • Proceeding
    • 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,"
      Proc. The 37th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2011), Lecture Notes in Computer Science, vol.6986, pp.271-282, 2011, DOI: 10.1007/978-3-642-25870-1_25.
  • Workshops etc.
    • Shin-ichi Nakano and Katsuhisa Yamanaka, "A compact encoding of rectangular drawings with edge lengths,", IPSJ SIG Technical Report 2011-AL-136-1, 2011.
    • 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, 2011.
    • 須田亮平, 中野眞一, 山中克久, "格子方形描画のコンパクトな符号,"
      第73回 情報処理学会 全国大会, 1K-2, 2011.
      (東京工業大学, 3月2日〜4日)
    • 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], 2011.

2010
  • Journal papers
    • 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, 2010.
    • 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, 2010.
    • 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, 2010.
  • Workshops etc.
    • 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, 2010.
      (Hakodate National College of Technology, 22th/Sep/2010)
    • 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)

2009
  • Journal papers
    • Katsuhisa Yamanaka and Shin-ichi Nakano, "Listing All Plane Graphs,"
      Journal of Graph Algorithms and Applications, Vol.13, No.1, pp.5-18, 2009.

    • 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, 2009.
  • Proceedings
    • Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka and Ryuhei Uehara, "Random Generation and Enumeration of Bipartite Permutation Graphs,"
      Proc. 20th International Symposium on Algorithms and Computation (ISAAC 2009), pp.1104-1113, 2009.
      (Hawaii, USA, 16-18/December/2009)
    • Yosuke Kikuchi, Katsuhisa Yamanaka and Shin-ichi Nakano
      "Enumerating All Graphical Sequences (Extended Abstract),"
      Proc. The 7th Japan Conference on Computational Geometry and Graphs (JCCGG 2009), pp.61-62, 2009.
      (Kanazawa, Japan, 11-13th/Nov/2009)
    • Katsuhisa Yamanaka and Shin-ichi Nakano, "Efficient Enumeration of All Ladder Lotteries with k Bars (Extended Abstract),"
      Proc. The 7th Japan Conference on Computational Geometry and Graphs (JCCGG 2009), pp.63-64, 2009.
      (Kanazawa, Japan, 11-13th/Nov/2009)
    • Yosuke Kikuchi, Katsuhisa Yamanaka and Shin-ichi Nakano, "A Simple Generation of d-dimensional Partitions," Proc. of The 12th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 2009), pp.60-67, 2009.
      (Seoul, Korea, 4-5th/July/2009).
    • Katsuhisa Yamanaka, Shin-ichi Nakano, Yasuko Matsui, Ryuhei Uehara and Kento Nakada, "Efficient Enumeration of Pseudoline Arrangements,"
      Proc. of 25th European Workshop on Computational Geometry (EuroCG), pp.143-146, 2009.
      (Belgium, Brussels, 16-18th/Mar/2009).
    • Katsuhisa Yamanaka, Yota Otachi and Shin-ichi Nakano
      "Efficient Enumeration of Ordered Trees with k Leaves,"
      Proc. of Workshop on Algorithms and Computation 2009, (WALCOM 2009) LNCS 5431, pp.141-150, 2009.
      (India, Kolkata, 18-20th/Feb/2009)
    • Toshiki Saito, Katsuhisa Yamanaka, Masashi Kiyomi and Ryuhei Uehara, "Random Generation and Enumeration of Proper Interval Graphs,"
      Proc. of Workshop on Algorithms and Computation 2009, (WALCOM 2009) LNCS 5431, pp.177-189, 2009.
      (India, Kolkata, 18-20th/Feb/2009)
  • Workshops, etc.
    • 菊地洋右, 山中克久, 中野眞一
      "グラフ的列の列挙,"
      第126回 アルゴリズム研究会 2009-AL-126-2, 2009.
      (鳥取環境大学, 15th/Sep/2009)
    • Katsuhisa Yamanaka and Shin-ichi Nakano, "Efficient Enumeration of All Ladder Lotteries with k Bars,"
      IPSJ SIG Technical Report 2009-AL-126-1, 2009.
      (Tottori University of Enviromental Studies, 15th/Sep/2009)
    • 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)
    • 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)
    • 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, 2009.
      (The Institute of Medical Science, The University of Tokyo, 5th/May2009)
    • 小久保侑紀, 星守, 小早川倫広, 山中克久, 大森匡, "類似度のランクに基づくクラスタリング手法と類似検索への応用,"
      DEIM 2009, B6-3, 2009.
      (ヤマハリゾートつま恋, 8-10th/Mar/2009)
    • 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, 2008.
      (Tokyo Institute of Technology, 2nd/Mar/2009)

2008
  • Journal papers
    • Katsuhisa Yamanaka and Shin-ichi NAKANO
      "A Compact Encoding of Rectangular Drawings with Efficient Query Supports"
      IEICE Trans. Fundamentals, vol.E91-A, no.9, pp.2284--2291, 2008.
    • Kouto SEKINE, Katsuhisa YAMANAKA and Shin-ichi NAKANO
      "Enumeration of Permutaions"
      IEICE Trans. Fundamentals, vol.J91-A, no.5, pp.543-549, 2008. (in Japanese)

  • Proceedings
    • Katsuhisa Yamanaka and Shin-ichi Nakano
      "Listing All Plane Graphs", Proc. of Workshop on Algorithms and Computation 2008, (WALCOM 2008)
      LNCS 4921, pp.210--221, 2008. (Bangladesh, Dhaka, 2008/02/07--08)
    • Katsuhisa Yamanaka and Shin-ichi Nakano
      "A Compact Encoding of Plane Triangulation with Efficient Query Supports,"
      Proc. of Workshop on Algorithms and Computation 2008, (WALCOM 2008)
      LNCS 4921, pp.120--131, 2008. (Bangladesh, Dhaka, 2008/02/07--08)
  • Workshops etc.
    • 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, 12/2-4)
    • Katsuhisa Yamanaka, Shin-ichi Nakano, Yasuko Matsui, Ryuhei Uehara and Kento Nakada, "Efficient Enumeration of All Ladder Lotteries,"
      The 20th Workshop on Topological Graph Theory, 2008.
      (Yokohama National University, 2008/11/25--28)
    • Yota Otachi, Katsuhisa Yamanaka and Shin-ichi Nakano, "Efficient Enumeration of Ordered Trees with k Leaves,"
      IPSJ SIG Technical Reports 2008-AL-119, 2008. (Nagoya Institute of Technology, 2008/09/12)
    • Toshiki Saito, Katsuhisa Yamanaka, Masashi Kiyomi and Ryuhei Uehara, "Random Generation and Enumeration of Proper Interval Graphs", 計算機科学の理論とその応用(夏のLAシンポジウム), [22], 2008. (休暇村 南紀勝浦, 2008/07/22-24)

2007
  • Journal Paper
    • Katsuhisa Yamanaka, Shin-ichiro Kawano, Yosuke Kikuchi, and Shin-ichi Nakano
      "Constant Time Generation of Integer Partitions,"
      IEICE Trans. Fundamentals, Vol.E90-A, no.5, pp.888-895, (2007)
  • Proceeding
    • 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), LNCS 4508, 2007. (Portland, OR, USA, 2007/06/06-08).

  • Workshops etc.
    • Kazuyuki Amano, Shin-ichi Nakano and Katsuhisa Yamanaka, "On the Number of Rectangular Drawings: Exact Counting and Lower and Upper Bounds,"
      IPSJ SIG Technical Technical Reports 2007-AL-115, 2007. (Niigata Univ., 2008/11/30)
    • Katsuhisa Yamanaka, Zhangjian Li and Shin-ichi Nakano
      "Listing All Plane Graphs,"
      IPSJ SIG Technical Technical Reports 2007-AL-114, 2007. (Toyohashi University of Technology, 2007/9/21)
    • 関根航人, 山中克久, 中野眞一, "順列の列挙,"
      計算機科学の理論とその応用(夏のLAシンポジウム), [S9], 2007. (能登千里浜, 2007/07/18-20)

2006
  • Journal Papers
    • Satoshi Yoshii, Daisuke Chigira, Katsuhisa Yamanaka, and Shin-ichi Nakano, "Constant Generation of Rectangular Drawing with Exactly n Faces,"
      IEICE Trans. Fundamentals, Vol.89-A, no.9, pp.2445-2450, (2006).
    • Katsuhisa Yamanaka and Shin-ichi Nakano, "Coding Floorplans with Fewer Bits,"
      IEICE Trans. Fundamentals, Vol.E89-A, no. 5, pp.1181-1185, (2006).
  • Proceeding
    • Katsuhisa Yamanaka, Shin-ichiro Kawano, Yosuke Kikuchi, and Shin-ichi Nakano
      "Constant Time Generation of Integer Partitions,"
      Proc. of The 9th Japan-Korea Joint Workshop on Algorithms and Computation, pp.57--64, (2006). (2006/07/04--05 Hokkaido Univ., Hokkaido, Japan)
  • Workshops etc.
    • 山中克久, 中野眞一, "クエリを高速にサポートする方形描画のコンパクトなコード化,"
      電子情報通信学会 2006年 総合大会 シンポジウム講演(B) DS-1 COMP-NHC 学生シンポジウム 国士舘大学 世田谷キャンパス, 2006年3月24-26日.
    • 山中克久, 川野晋一朗, 菊地洋右, 中野眞一, "整数分割の列挙,"
      情報処理学会 第104回アルゴリズム研究会, 慶応義塾大学矢上キャンパス, 2006年1月20日.

2005
  • Proceeding
    • Katsuhisa Yamanaka, Shin-ichi Nakano, "Coding Floorplans with Fewer Bits,"
      Proc. of 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Application, pp. 401-406, (2005) (2005/6/3--6, Budapest, Hungary)
  • Workshops etc.
    • 山中 克久, 中野眞一, "クエリを高速にサポートする方形描画のコンパクトなコード化,"
      情報処理学会 第102回アルゴリズム研究会, 大阪大学豊中キャンパス基礎工学部, 2005年9月16日.
    • Katsuhisa Yamanaka, Shin-ichi Nakano, "Compact Encoding of Plane Triangulations with Efficient Query Support,"
      情報処理学会 第101回アルゴリズム研究会, 九州大学箱崎キャンパス, 2005年5月19日.
    • Katsuhisa Yamanaka, Shin-ichi Nakano, "Coding Floorplans with Fewer Bits"
      情報処理学会 第99回アルゴリズム研究会, 東京大学 医科学研究所, 2005年1月20日.

2004
  • Journal Paper
    • 山中 克久, 中野眞一, "リアライザの列挙,"
      電子情報通信学会和文誌 2004年12月号掲載.
      (Also translated in)
      Katsuhisa Yamanaka and Shin-ichi Nakano, "Generating All Realizers,"
      Electronics and Communication in Japan, Part2, Vol.89, Issue 7, (2006), pp.40-47
  • Workshops etc.
    • 山中 克久, 中野眞一, リアライザの列挙, 計算機科学の理論とその応用(夏のLAシンポジウム), 淡路国際夢舞台, 2004年7月14-17日.
    • 山中 克久, 中野眞一, リアライザの列挙, 情報処理学会 第93回アルゴリズム研究会, 中央大学, 2004年1月30日.