Katsuhisa Yamanaka's HomePage

2010

Journal paper
- 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.

2009

Journal papers
- Katsuhisa Yamanaka and Shin-ichi Nakano,
  "Listing All Plane Graphs,"
  Journal of Graph Algorithms and Its 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日.