List of Papers in 2019

Refereed Papers in Journals

  1. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto,
    Minimum-Cost b-Edge Dominating Sets on Trees,
    Algorithmica,
    Vol. 81, Issue 1, pp. 343-366, January 2019. DOI
  2. 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, January 2019. DOI
  3. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto,
    Reconfiguration of Maximum-Weight b-Matchings in a Graph,
    Journal of Combinatorial Optimization,
    Vol. 37, Issue 2, pp. 454-464, February 2019. DOI
  4. Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,
    The Coloring Reconfiguration Problem on Specific Graph Classes,
    IEICE Trans. on Information and Systems,
    Vol. E102-D, No. 3, pp. 423-429, March 2019. DOI
  5. Takehiro Ito and Yota Otachi,
    Reconfiguration of Colorable Sets in Classes of Perfect Graphs,
    Theoretical Computer Science,
    Vol. 772, pp. 111-122, June 2019. DOI

Refereed Papers in International Conferences

  1. Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto,
    Algorithms for Gerrymandering over Graphs,
    in Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS 2019),
    pp. 1413-1421, 2019. DOI
  2. Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito and Moritz Mühlenthaler,
    Shortest Reconfiguration of Matchings,
    in Proceedings of the 45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2019),
    Lecture Notes in Computer Science, Vol. 11789, pp. 162-174, 2019. DOI
  3. Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki and Kunihiro Wasa,
    Diameter of Colorings Under Kempe Changes,
    in Proceedings of the 25th International Computing and Combinatorics Conference (COCOON 2019),
    Lecture Notes in Computer Science, Vol. 11653, pp. 52-64, 2019. DOI
  4. Takehiro Ito, Haruka Mizuta, Naomi Nishimura and Akira Suzuki,
    Incremental Optimization of Independent Sets Under the Reconfiguration Framework,
    in Proceedings of the 25th International Computing and Combinatorics Conference (COCOON 2019),
    Lecture Notes in Computer Science, Vol. 11653, pp. 313-324, 2019. DOI
  5. Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno and Kunihiro Wasa,
    Max-Min 3-dispersion Problems,
    in Proceedings of the 25th International Computing and Combinatorics Conference (COCOON 2019),
    Lecture Notes in Computer Science (LNCS), vol. 11653, pp. 291-300, 2019. DOI
  6. Haruka Mizuta, Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,
    Reconfiguration of Minimum Steiner Trees via Vertex Exchanges,
    in Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019),
    Leibniz International Proceedings in Informatics, Vol. 138, pp. 79:1-79:11, 2019. DOI
  7. Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler and Kunihiro Wasa,
    The Perfect Matching Reconfiguration Problem,
    in Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019),
    Leibniz International Proceedings in Informatics, Vol. 138, pp. 80:1-80:14, 2019. DOI
  8. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto,
    Shortest Reconfiguration of Perfect Matchings via Alternating Cycles,
    in Proceedings of the 27th Annual European Symposium on Algorithms (ESA 2019),
    Leibniz International Proceedings in Informatics, Vol. 144, pp. 61:1-61:15, 2019. DOI

Other Manuscripts in International Conferences

  1. Alexandre Blanché, Paul Ouvrard, Haruka Mizuta and Akira Suzuki,
    Optimizing dominating sets under constrained transformation,
    in Proceedings of the fifth Bordeaux Graph Workshop (BGW 2019), pp. 62-64, 2019.
  2. Takehiro Ito, Haruka Mizuta, Naomi Nishimura and Akira Suzuki,
    Optimizing independent sets under constrained transformation,
    The 11th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (HJ 2019), 2019.

Domestic Conferences, symposiums, etc.

  1. Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki and Krishna Vaidyanathan,
    Reconfiguring spanning and induced subgraphs,
    研究報告アルゴリズム(AL), 2019-AL-171(4), pp. 1-6, 2019.
  2. 菊池 正太，鈴木 顕，伊藤 健洋，周 暁,
    グラフ上のパケットルーティング問題のパラメータ複雑性に関する研究,
    Shota Kikuchi, Akira Suzuki, Takehiro Ito, Xiao Zhou,
    Parameterized complexity of the packet routing problem on graphs,
    情報処理学会第81回全国大会, 6B-01, pp. 1-177-1-178, 2019.
  3. 岩本 裕二，水田 遥河，鈴木 顕，伊藤 健洋，周 暁,
    グラフ上の経路固定サーバ割当問題のパラメータ複雑性,
    Yuji Iwamoto, Haruka Mizuta, Akira Suzuki, Takehiro Ito, Xiao Zhou,
    Parameterized complexity of the server assignment problem under a given routing table,
    情報処理学会第81回全国大会, 6B-02, pp. 1-179-1-180, 2019.
  4. 鈴木 顕,
    組合せ遷移最適化について,
    情報工学実践セミナー 特別講演, 九州工業大学, 2019.
  5. 大澤 弘基，鈴木 顕，伊藤 健洋，周 暁,
    点彩色の有向制約付き遷移問題について,
    京都大学 数理解析研究所 共同研究 (公開型), 数理計画問題に対する理論とアルゴリズムの研究, 2019.
  6. 田村 祐馬，伊藤 健洋，周 暁,
    フィードバック独立点集合問題の近似困難性,
    京都大学 数理解析研究所 共同研究 (公開型), 数理計画問題に対する理論とアルゴリズムの研究, 2019.
  7. 伊藤 健洋，川原 純，湊 真一，大舘 陽太，斎藤 寿樹，鈴木 顕，上原 隆平，宇野 毅明，山中 克久，吉仲 亮,
    隣接互換による最短長ユニバーサル列,
    Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka,
    Shortest universal sequences of adjacent transpositions,
    電子情報通信学会技術研究報告, vol. 119, no. 191, COMP2019-10, pp. 1-5, 2019.
  8. Duc A. Hoang, Akira Suzuki, Tsuyoshi Yagita,
    Algorithms for k-path vertex cover reconfiguration problem,
    H.A. デュック，鈴木 顕，八木田 剛,
    kパス頂点被覆遷移問題に対するアルゴリズム,
    電子情報通信学会技術研究報告, vol. 119, no. 191, COMP2019-17, pp. 35-42, 2019.
  9. 杉村 修平，田邊 隆之，鈴木 顕，伊藤 健洋，周 暁,
    放射状系統作成による配電損失最小化手法と切替手順の算出手法,
    電力技術／電力系統技術合同研究会, 研究会資料, no. 2, PE-19-083, PSE-19-095, 2019.
  10. 鈴木 顕,
    遷移最適化でより良い未来を目指そう,
    第76回情報科学談話会, 東北大学, 2019.
  11. Duc A. Hoang, Akira Suzuki, Tsuyoshi Yagita,
    k-パス頂点被覆の遷移問題について,
    九州地区におけるOR若手研究交流会, 日本オペレーションズ・リサーチ学会 九州支部, 2019.