Rin Saito

a third-year doctoral student at Tohoku University

Email: rin.saito [ at ] dc.tohoku.ac.jp

Aramaki aza Aoba 6-3-09, Aoba-ku Sendai-city Miyagi-pref. 980-8579, Japan

C.V.

  • April 2018 – March 2022: Bachelor of Engineering, Tohoku University
  • April 2022 – March 2024: Master of Information Sciences, Tohoku University
  • April 2024 – Present: Ph.D. Student in Information Sciences, Tohoku University
  • April 2026 – Present: JSPS Research Fellow (DC2)

Research Interests

Graph Algorithms, Parameterized Complexity, Combinatorial Reconfiguration

Refereed Papers

  1. Rin Saito, Yuma Tamura: $k$-Product Lists for (Generalized) Feedback Vertex Sets: A Tool for Designing FPT Algorithms
    To appear in IPEC 2026.
  2. Toranosuke Kokai, Rin Saito, Tatsuhiro Suga, Takahiro Suzuki, Yuma Tamura: Parameterized Complexity of Odd Domination and its Generalization
    Proceedings of COCOON 2026, LNCS, Vol. 16835, pp. 163-176, 2026. DOI arXiv
  3. Hung P. Hoang, Naoto Ohsaka, Rin Saito, Yuma Tamura: On (In)approximability of MaxMin Independent Set Reconfiguration
    Proceedings of ICALP 2026, LIPIcs, vol. 374, 108:1-108:16, 2026. DOI arXiv
  4. Rin Saito, Anouk Sommer, Tatsuhiro Suga, Takahiro Suzuki, Yuma Tamura: Solution Discovery for Vertex Cover, Independent Set, Dominating Set, and Feedback Vertex Set
    Proceedings of SOFSEM 2026, LNCS, Vol. 16448, pp. 432-446, 2026. DOI arXiv
  5. Rin Saito, Takehiro Ito: Parameterized Complexity of Reconfiguring Vertex-Disjoint Shortest Paths
    Proceedings of WALCOM 2026, LNCS, Vol. 16444, pp. 432-447, 2026. DOI
  6. Janosch Fuchs, Rin Saito, Tatsuhiro Suga, Takahiro Suzuki, Yuma Tamura: Coloring Reconfiguration under Color Swapping
    Proceedings of ISAAC 2025, LIPIcs, vol. 359, 33:1-33:21, 2025. DOI arXiv
  7. Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi, Yuto Okada, Rin Saito: Basis Sequence Reconfiguration in the Union of Matroids
    Proceedings of ISAAC 2024, LIPIcs, vol. 322, 38:1-38:16, 2024. DOI arXiv
  8. Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara: Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs
    Journal of Graph Algorithms and Applications, Vol. 28, No. 3, pp. 87-101, 10 September 2024. DOI
    Proceedings of WALCOM 2023, LNCS, Vol. 13973, pp. 191-201, 2023. DOI

Preprints (unpublished)

  1. Tatsuya Gima, Yuni Iwamasa, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi, Rin Saito: Computing diverse pair of solutions for tractable SAT arXiv

Talks

International Talks

  1. Toranosuke Kokai, Rin Saito, Tatsuhiro Suga, Takahiro Suzuki, Yuma Tamura: Parameterized Complexity of Odd Domination and its Generalization
    The 32nd International Computing and Combinatorics Conference (COCOON 2026), Singapore, Singapore, July 23-25, 2026.
  2. Rin Saito, Yuma Tamura: k-Product Lists for (Generalized) Feedback Vertex Sets: A Tool for Designing FPT Algorithms
    The 17th Annual Meeting of Asian Association for Algorithms and Computation (AAAC 2026), Qingdao, China, May 23-24, 2026.
  3. Rin Saito: Graph Algorithmic Developments in Combinatorial Reconfiguration
    NYCU Theory Day, Hsinchu, Taiwan, April 21–23, 2026.
  4. Rin Saito, Takehiro Ito: Parameterized Complexity of Reconfiguring Vertex-Disjoint Shortest Paths
    The 20th International Conference and Workshops on Algorithms and Computation (WALCOM 2026), Perugia, Italy, March 4-6, 2026.
  5. Janosch Fuchs, Rin Saito, Tatsuhiro Suga, Takahiro Suzuki, Yuma Tamura: Coloring Reconfiguration under Color Swapping
    The 36th International Symposium on Algorithms and Computation (ISAAC 2025), Tainan, Taiwan, December 7-10, 2025.
  6. Rin Saito and Takehiro Ito: Complexity of Reconfiguring Vertex-Disjoint Shortest Paths
    The 16th Annual Meeting of Asian Association for Algorithms and Computation (AAAC 2025), Hong Kong, China, May 31 and June 1, 2025.
  7. Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi, Yuto Okada, Rin Saito: Basis Sequence Reconfiguration in the Union of Matroids
    The 35th International Symposium on Algorithms and Computation (ISAAC 2024), Sydney, Australia, December 8-11, 2024.
  8. Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi, Yuto Okada, Rin Saito: Basis Sequence Reconfiguration in the Union of Matroids
    The 5th International Workshop on Combinatorial Reconfiguration (CoRe 2024), Fukuoka, Japan, October 7-11, 2024.
  9. Rin Saito, Hiroshi Eto, Takehiro Ito and Ryuhei Uehara: Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs
    The 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023), Hsinchu, Taiwan, March 22–24, 2023.
  10. Rin Saito, Hiroshi Eto, Takehiro Ito: Reconfiguration of vertex-disjoint shortest paths on split graphs
    The 4th International Workshop on Combinatorial Reconfiguration (CoRe 2022), Banff, Canada, May 8-13, 2022.

Domestic Talks (in Japanese)

  1. 斉藤 凜: 極小フィードバック頂点集合に対するコンパクト表現の一般化
    第35回列挙アルゴリズムセミナー , 群馬大学伊香保研修所, 2025年3月5日-7日.
  2. 土中 哲秀, 岩政 勇仁, 小林 靖明, 岡田 優斗, 斉藤 凜: マトロイドの基の組の遷移問題
    電子情報通信学会 コンピュテーション研究会 , 東北大学, 2024年10月24日.
  3. 斉藤 凜: グラフ上の詰め込みと組合せ遷移
    離散数学とその応用研究集会2024 , 山形大学, 2024年8月19日-21日.
  4. 土中 哲秀, 岩政 勇仁, 小林 靖明, 岡田 優斗, 斉藤 凜: マトロイドの基の組の遷移問題
    日本オペレーションズ・リサーチ学会 研究部会「最適化の理論とアルゴリズム:未来を担う若手研究者の集い 2024」,茨城, 2024年5月18-19日.
  5. 儀間 達也, 岩政 勇仁, 小林 靖明, 栗田 和宏, 大舘 陽太, 斉藤 凜: Computing diverse pair of solutions for SAT
    2024年電子情報通信学会 総合大会 COMP-AFSA 学生シンポジウム, 広島, 2024年3月5日-6日.
  6. 儀間 達也, 岩政 勇仁, 小林 靖明, 栗田 和宏, 大舘 陽太, 斉藤 凜: Computing diverse pair of solutions for SAT
    2023年度冬のLAシンポジウム, 京都, 2024年2月19日–21日.
  7. 斉藤 凜, 江藤 宏, 伊藤 健洋, 上原隆平: 点素最短パス遷移問題に対するアルゴリズム
    科研費・学術変革領域研究(B)「組合せ遷移の展開に向けた計算機科学・工学・数学によるアプローチの融合」2022 年度「組合せ遷移」学生シンポジウム, 宮城, 2023年2月22日.
  8. 斉藤 凜, 江藤 宏, 伊藤 健洋, 上原隆平: 点素最短パス遷移の計算複雑性
    電気情報通信学会コンピュテーション研究会, 愛媛, 2022年12月6日.

Awards

  1. 東北大学 情報科学研究科 第33回 博士後期課程学生発表会 ベストプレゼンテーション賞 Link
  2. 最適化の理論とアルゴリズム：未来を担う若手研究者の集い2024 優秀発表賞 Link

Misc