活動情報

論文・受賞

  • 国際プログラミング競技会 XCSP3 Competition 2022 Main CSP部門 第2位

    宋 剛秀 (神戸大学),Daniel Le Berre (CRIL-CNRS),鍋島 英知 (山梨大学),番原 睦則 (名古屋大学),田村 直之 (神戸大学)
    2022年8月3日受賞
    • Submodular reassignment problem for reallocating agents to tasks with synergy effects

      Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
      Discrete Optimization, Vol. 44, pp. 100631, 2022
      • The Alon-Tarsi number of K5-minor-free graphs

        Toshiki Abe, Seog-Jin Kim, Kenta Ozeki
        Discrete Mathematics, Vol. 345, pp. 112764, 2022
        • Covering projective planar graphs with three forests

          Raiji Mukae, Kenta Ozeki, Terukazu Sano, Ryuji Tazume
          Discrete Mathematics, Vol. 345, pp. 112748, 2022
          • Parameterized complexity of (A, l)-path packing

            Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
            Algorithmica, Vol. 84, pp. 871-895, 2022
            • Approximability of monotone submodular function maximization under cardinality and matroid constraints in the streaming model

              Chien-Chung Huang, Naonori Kakimura, Simon Mauras, Yuichi Yoshida
              SIAM Journal on Discrete Mathematics, Vol. 36, pp. 355-382, 2022
              • A forbidden pair for connected graphs to have spanning k-trees

                Shun-ichi Maezawa, Kenta Ozeki
                Journal of Graph Theory, Vol. 99, pp. 509-519, 2022
                • Reconfiguration of regular induced subgraphs

                  Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
                  Proc. of 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022), Lecture Notes in Computer Science, Vol. 13174, pp. 35-46, 2022
                  • Path cover problems with length cost

                    Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita
                    Proc. of 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022), Lecture Notes in Computer Science, Vol. 13174, pp. 396-408, 2022
                    • Happy set problem on subclasses of co-comparability graphs

                      Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura
                      Proc. of 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022), Lecture Notes in Computer Science, Vol. 13174, pp. 149-160, 2022