List of Papers in 2012

Papers

  1. Takehiro Ito, Kazuto Kawamura and Xiao Zhou
    "An improved sufficient condition for reconfiguration of list edge-colorings in a tree"
    IEICE Trans. on Information and Systems, Vol. E95-D, No. 3, pp. 737-745, March 2012. DOI
  2. Takehiro Ito, Takao Nishizeki, Michael Schroder, Takeaki Uno and Xiao Zhou
    "Partitioning a weighted tree into subtrees with weights in a given range"
    Algorithmica, Vol. 62, Numbers 3-4, pp. 823-841, April 2012. DOI
  3. Xiao Zhou, Takashi Hikino and Takao Nishizeki
    "Small grid drawings of planar graphs with balanced partition"
    Journal of Combinatorial Optimization, 24, pp. 99-115, August 2012. DOI
  4. Takehiro Ito, Marcin Kamiński and Erik D. Demaine
    "Reconfiguration of List Edge-Colorings in a Graph"
    Discrete Applied Mathematics, Vol. 160, Issue 15, pp. 2199-2207, October 2012. DOI
  5. Takehiro Ito, Takuya Hara, Xiao Zhou and Takao Nishizeki
    "Minimum cost partitions of trees with supply and demand"
    Algorithmica, 64, pp. 400-415, November 2012. DOI

International Conferences

  1. Kazuhide Nishikawa, Takao Nishizeki and Xiao Zhou
    "Algorithms for bandwidth consecutive multicolorings of graphs"
    in Proceedings of FAW-AAIM 2012, Lect. Notes in Computer Science, Springer, 7285, pp. 117-128, 2012. DOI
  2. Akira Suzuki, Kei Uchizawa and Takeaki Uno
    "Hitori number"
    Proceedings of the 6th International Conference on Fun with Algorithms (FUN 2012),
    Lecture Notes in Computer Science (LNCS), Vol. 7288, pp. 334-345, 2012. DOI
  3. Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno and Yushi Uno
    "A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares"
    in Proceedings of the 13th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2012),
    Lecture Notes in Computer Science, Vol. 7357, pp. 24-35, 2012. DOI
  4. Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki and Ryuhei Uehara
    "Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete"
    in Proceedings of the 24th Canadian Conference on Computational Geometry (CCCG 2012),
    pp. 219-224, 2012.DOI
  5. Yiming Li, Zhiqian Ye and Xiao Zhou
    "Algorithm for cost non-preemptive scheduling of partial k-trees"
    In Proceedings of the 2012 Symposium on Applied and Engineering Mathematics (AEM 2012), pp. 233-236, 2012. DOI
  6. Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara and Takeaki Uno
    "Algorithms for Computing Optimal Image Segmentation Using Quadtree Decomposition"
    in Proceedings of Thailand-Japan Joint Conference on Computational Geometry and Graphs (TJJCCGG 2012),
    pp. 23-24, 2012.
    (* This paper is on experimental results of the algorithms in our paper in WALCOM 2013.)
  7. Takehiro Ito, Kazuto Kawamura, Hirotaka Ono and Xiao Zhou
    "Reconfiguration of list L(2,1)-labelings in a graph"
    in Proceedings of the 23th Annual International Symposium on Algorithms and Computation (ISAAC 2012), Lecture Notes in Computer Science, Springer, 7676, pp. 34-43, 2012. DOI
  8. Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno and Yushi Uno
    "A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks"
    in Proceedings of the 23rd Annual International Symposium on Algorithms and Computation (ISAAC 2012),
    Lecture Notes in Computer Science, Vol. 7676, pp. 372-381, 2012. DOI

国内会議

  1. 鈴木 顕，内澤 啓，宇野 毅明
    "ひとりにしてくれ数"
    組合せゲーム・パズル ミニプロジェクト 第７回ミニ研究集会, 7-7, 2012.
  2. 佐藤永幸・内澤　啓・伊藤健洋・周　暁
    "グラフ上の拡散競争ゲームの計算複雑さ"
    電子情報通信学会技術研究報告，Vol.111, No.494, COMP2011-49, pp. 17-22, 2012.
  3. Akira Suzuki，Kei Uchizawa，Takeaki Uno
    "Hitori number"
    電子情報通信学会 2012年 総合大会 COMP 学生シンポジウム，DS-1-5, 2012.
  4. 堀山貴史・伊藤健洋・ガオタントン ナスダ・小野廣隆・大舘陽太・徳山　豪・上原隆平・宇野毅明
    "基単調図形に分割可能な最大重み領域を得る基線の配置問題"
    電子情報通信学会技術研究報告，Vol.112, No.21, COMP2012-6, pp. 37-43, 2012.
  5. Takehiro Ito・Shin-ichi Nakano・Yoshio Okamoto・Yota Otachi・Ryuhei Uehara・Takeaki Uno・Yushi Uno
    "Approximation for the Geometric Unique Coverage Problem on Unit Squares"
    電子情報通信学会技術研究報告，Vol.112, No.93, COMP2012-24, pp. 95-101, 2012.
  6. Takashi Horiyama・Takehiro Ito・Keita Nakatsuka・Akira Suzuki・Ryuhei Uehara
    "On the Complexity of Packing Trominoes"
    電子情報通信学会技術研究報告，Vol.112, No.272, COMP2012-40, pp. 37-43, 2012.
  7. 伊藤健洋・川村一斗・小野廣隆・周　暁
    "グラフのリストL(2,1)ラベリングの遷移可能性"
    電子情報通信学会技術研究報告，Vol.112, No.340, COMP2012-49, pp. 33-40, 2012.