List of Papers in 2020

Refereed Papers in Journals

  1. Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki and Krishna Vaidyanathan,
    Reconfiguring Spanning and Induced Subgraphs,
    Theoretical Computer Science,
    Vol. 806, pp. 553-566, February 2020. DOI
  2. 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, September 2020. 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,
    Theoretical Computer Science,
    Vol. 838, pp. 45-57, October 2020. DOI

Refereed Papers in International Conferences

  1. Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki and Kunihiro Wasa,
    Shortest Reconfiguration of Colorings Under Kempe Changes,
    in Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020),
    Leibniz International Proceedings in Informatics, Vol. 154, pp. 35:1-35:14, 2020. DOI
  2. Duc A. Hoang, Akira Suzuki and Tsuyoshi Yagita,
    Reconfiguring k-path vertex covers,
    in Proceedings of the 14th International Conference and Workshop on Algorithms and Computation (WALCOM 2020),
    Lecture Notes in Computer Science, Vol. 12049, pp. 133-145, 2020. DOI
  3. Yuma Tamura, Takehiro Ito and Xiao Zhou,
    Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs,
    in Proceedings of the 14th International Conference and Workshop on Algorithms and Computation (WALCOM 2020),
    Lecture Notes in Computer Science, Vol. 12049, pp. 286-295, 2020. DOI
  4. Kei Kimura and Akira Suzuki,
    Trichotomy for the reconfiguration problem of integer linear systems,
    in Proceedings of the 14th International Conference and Workshop on Algorithms and Computation (WALCOM 2020),
    Lecture Notes in Computer Science, Vol. 12049, pp. 336-341, 2020. DOI
  5. Alexandre Blanché, Paul Ouvrard, Haruka Mizuta and Akira Suzuki,
    Decremental optimization of dominating sets under the reconfiguration framework,
    in Proceedings of the 31st International Workshop on Combinatorial Algorithms (IWOCA 2020),
    Lecture Notes in Computer Science, vol. 12126, pp. 69-82, 2020. DOI
  6. Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki and Kunihiro Wasa,
    Reconfiguration of spanning trees with many or few leaves,
    in Proceedings of the 28th Annual European Symposium on Algorithms (ESA 2020),
    Leibniz International Proceedings in Informatics, vol. 173, pp. 24:1-24:15, 2020. DOI
  7. Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler and Akira Suzuki,
    Fixed-parameter algorithms for graph constraint logic,
    in Proceedings of the 15th International Symposium on Parameterized and Exact Computation (IPEC 2020),
    Leibniz International Proceedings in Informatics, vol. 180, pp. 15:1-15:15, 2020. DOI
  8. Yuma Tamura, Takehiro Ito and Xiao Zhou,
    Minimization and Parameterized Variants of Vertex Partition Problems on Graphs,
    in Proceedings of the 31st International Symposium on Algorithms and Computation (ISAAC2020),
    Leibniz International Proceedings in Informatics, vol. 181, pp. 40:1-40:13, 2020. DOI

Domestic Conferences, symposiums, etc.

  1. 木村 慧，鈴木 顕,
    Computational complexity of the reconfiguration problem of integer linear systems,
    2019年度冬のLAシンポジウム, 京都大学数理解析研究所RIMS共同研究（公開型）, アルゴリズムと計算理論の新潮流, 2020.
  2. 木村 慧，鈴木 顕,
    整数計画における遷移問題の計算量,
    日本応用数理学会, 第16回 研究部会連合発表会, 2020.
  3. 鈴木 顕,
    異世界アルゴリズム,
    LAシンポジウム会誌, 第75号, pp.23-26, 2020.
  4. Yuma Tamura, Takehiro Ito and Xiao Zhou,
    Approximation of the Independent Feedback Vertex Set Problem,
    情報処理学会 第177回アルゴリズム研究会, Vol. 2020-AL-177(10), pp. 1-5, 2020.
  5. 木村 慧，鈴木 顕,
    整数計画における遷移問題の計算量,
    日本応用数理学会, 2020年度 年会, 2020.
  6. 川原 純，斎藤 寿樹，鈴木 顕，高瀬 敏行，山中 克久,
    Treedepth Problemに対する厳密解アルゴリズム,
    電子情報通信学会九州支部　2020年度（第28回）学生会講演会, 2020.
  7. 鈴木 顕,
    アルゴリズムのチカラ　～あなたのスマホはサクサク？もっさり？～,
    東北大学電気系公開講座, 2020年度オープンキャンパス 模擬講義, 2020.
  8. Yuma Tamura, Takehiro Ito and Xiao Zhou,
    Minimizing a Vertex Set Satisfying Specific Graph Properties,
    情報処理学会 第180回アルゴリズム研究会, vol. 2020-AL-180(4), pp. 1-7, 2020.