List of Papers in 2014

Refereed Papers in Journals

1. Taku Okada, Akira Suzuki, Takehiro Ito and Xiao Zhou,
   On the Minimum Caterpillar Problem in Digraphs,
   IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E97-A, No. 3, pp. 848-857, March 2014. DOI
2. Kazuhide Nishikawa, Takao Nishizeki and Xiao Zhou,
   Bandwidth consecutive multicolorings of graphs,
   Theoretical Computer Science (TCS), 532, pp. 64-72, May 2014. DOI
3. Takehiro Ito, Kazuto Kawamura, Hirotaka Ono and Xiao Zhou,
   Reconfiguration of List L(2,1)-Labelings in a Graph,
   Theoretical Computer Science, Vol. 544, pp. 84-97, August 2014. DOI
4. 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,
   Theoretical Computer Science, Vol. 544, pp. 14-31, August 2014. DOI
5. Yuichi Asahiro, Hiroshi Eto, Takehiro Ito and Eiji Miyano,
   Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree,
   Theoretical Computer Science, Vol. 550, pp. 21-35, September 2014. DOI
6. Takehiro Ito and Erik D. Demaine,
   Approximability of the Subset Sum Reconfiguration Problem, (erratum)
   Journal of Combinatorial Optimization, Vol. 28, Issue 3, pp. 639-654, October 2014. DOI
7. Kei Uchizawa, Takanori Aoki, Takehiro Ito and Xiao Zhou,
   Generalized Rainbow Connectivity of Graphs,
   Theoretical Computer Science, Vol. 555, pp. 35-42, October 2014. DOI
8. Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara and Takeaki Uno,
   Base-Object Location Problems for Base-Monotone Regions,
   Theoretical Computer Science, Vol. 555, pp. 71-84, October 2014. DOI

Refereed Papers in International Conferences

1. 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. DOI
2. 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 (FUN 2014),
   Lecture Notes in Computer Science, Vol. 8496, pp. 364-375, 2014. DOI
3. Akira Suzuki, Amer E. Mouawad and Naomi Nishimura,
   Reconfiguration of Dominating Sets,
   in Proceedings of the 20th International Computing and Combinatorics Conference (COCOON 2014),
   Lecture Notes in Computer Science (LNCS), Vol. 8591, pp. 405-416, 2014. DOI
4. Yuma Tamura, Takehiro Ito and Xiao Zhou,
   Deterministic Algorithms for the Independent Feedback Vertex Set Problem,
   in Proceedings of the 25th International Workshop on Combinatorial Algorithms (IWOCA 2014),
   Lecture Notes in Computer Science, Vol. 8986, pp. 351-363, 2015. DOI
5. Takehiro Ito, Hiroyuki Nooka and Xiao Zhou,
   Reconfiguration of Vertex Covers in a Graph,
   in Proceedings of the 25th International Workshop on Combinatorial Algorithms (IWOCA 2014),
   Lecture Notes in Computer Science, Vol. 8986, pp. 164-175, 2015. DOI
6. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto,
   Minimum-Cost b-Edge Dominating Sets on Trees,
   in Proceedings of the 25th Annual International Symposium on Algorithms and Computation (ISAAC 2014),
   Lecture Notes in Computer Science (LNCS), Vol. 8889, pp. 195-207, 2014. DOI
7. Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara and Takeshi Yamada,
   Polynomial-Time Algorithm for Sliding Tokens on Trees,
   in Proceedings of the 25th Annual International Symposium on Algorithms and Computation (ISAAC 2014),
   Lecture Notes in Computer Science (LNCS), Vol. 8889, pp. 389-400, 2014. DOI
8. Takehiro Ito, Marcin Kamiński and Hirotaka Ono,
   Fixed-Parameter Tractability of Token Jumping on Planar Graphs,
   in Proceedings of the 25th Annual International Symposium on Algorithms and Computation (ISAAC 2014),
   Lecture Notes in Computer Science (LNCS), Vol. 8889, pp. 208-219, 2014. DOI
9. Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,
   The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs,
   in Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2014),
   Lecture Notes in Computer Science (LNCS), Vol. 8881, pp. 314-328, 2014. DOI
10. Yusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad and Xiao Zhou,
    The Minimum Vulnerability Problem on Graphs,
    in Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2014),
    Lecture Notes in Computer Science (LNCS), Vol. 8881, pp. 299-313, 2014. DOI

Other Manuscripts in International Conferences

1. Yuichi Asahiro, Hiroshi Eto, Takehiro Ito and Eiji Miyano,
   Maximum r-Regular Induced Subgraph Problems for Chordal Bipartite Graphs,
   in Proceedings of the 7th Annual Meeting of Asian Association for Algorithms and Computation (AAAC 2014), p. 18, 2014.
2. Yuma Tamura, Takehiro Ito and Xiao Zhou,
   The Independent Feedback Vertex Set Problem,
   in Proceedings of the 17th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 2014), pp. 11-18, 2014.

Domestic Conferences, symposiums, etc.

1. 大日野 肇，伊藤 健洋，鈴木 顕，内澤 啓，周 暁,
   グラフの経路固定サーバ割当問題に関する研究,
   2013年度冬のLAシンポジウム, pp. 10.1-10.4, 2014.
2. 山中 克久，エリック ドメイン，伊藤 健洋，川原 純，清見 礼，岡本 吉央，斎藤 寿樹，鈴木 顕，内澤 啓，宇野 毅明,
   グラフ上のラベル付きトークン整列問題,
   電子情報通信学会技術研究報告，Vol.114, No.19, COMP2014-2, pp. 5-12, 2014.
3. 鈴木 顕，Amer Mouawad，Naomi Nishimura,
   支配集合の遷移可能性,
   電子情報通信学会技術研究報告，Vol.114, No.19, COMP2014-5, pp. 29-35, 2014.
4. 伊藤健洋，Marcin Kamiński，小野廣隆，鈴木 顕，上原隆平，山中克久,
   FPT algorithms for Token Jumping on Graphs,
   研究報告アルゴリズム(AL), 2014-AL-148(2), pp. 1-4, 2014.