活動情報

論文・受賞

  • Reallocation problems with minimum completion time

    Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono
    Proc. of 28th International Computing and Combinatorics Conference (COCOON 2022), Lecture Notes in Computer Science, Vol. 13595, pp. 292-304, 2022
    • DAG-pathwidth: Graph algorithmic Analyses of DAG-type blockchain networks

      Shoji Kasahara, Jun Kawahara, Shin-ichi Minato, Jumpei Mori
      IEICE Transactions on Information and Systems, Vol. E106.D, pp. 272-283, 2023
      • Reconfiguration of colorings in triangulations of the sphere

        Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
        Proc. of 39th International Symposium on Computational Geometry (SoCG 2023), Leibniz International Proceedings in Informatics, Vol. 258, pp. 43:1-43:16, 2023
        • Path cover problems with length cost

          Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita
          Algorithmica, Vol. 85, pp. 3348-3375, 2023
          • On computing a center persistence diagram

            Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu
            Proc. of 24th International Symposium on Fundamentals of Computation Theory (FCT 2023), Lecture Notes in Computer Science, Vol. 14292, pp. 262-275, 2023
            • Sorting balls and water: Equivalence and computational complexity

              Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
              Theoretical Computer Science, Vol. 978, Article 114158, 2023
              • A spanning tree with at most $k$ leaves in a $K_{1,p}$-free graph

                Kenta Ozeki, Masao Tsugaki
                The Electronic Journal of Combinatorics, Vol. 30, Article 4.29, 2023
                • Note on fair game edge-connectivity of graphs

                  Michitaka Furuya, Naoki Matsumoto, Yumiko Ohno, Kenta Ozeki
                  Discrete Applied Mathematics, Vol. 333, pp. 132-135, 2023
                  • A graph minor condition for graphs to be k-linked

                    Shun-ichi Maezawa
                    European Journal of Combinatorics, Vol. 116, Article 103874, 2024
                    • Hamiltonian cycle reconfiguration with answer set programming

                      Takahiro Hirate, Mutsunori Banbara, Katsumi Inoue, Xiao-Nan Lu, Hidetomo Nabeshima, Torsten Schaub, Takehide Soh, Naoyuki Tamura
                      Proc. of 18th European Conference on Logics in Artificial Intelligence (JELIA 2023), Lecture Notes in Artificial Intelligence, Vol. 14238, pp. 262-277, 2023