活動情報

論文・受賞

  • Quantaloidal approach to constraint satisfaction

    Soichiro Fujii, Yuni Iwamasa, Kei Kimura
    Proc. of 4th International Conference on Applied Category Theory (ACT 2021), Electronic Proceedings in Theoretical Computer Science, Vol. 372, pp. 289-305, 2022

    • Parameterized complexity of graph burning

      Yasuaki Kobayashi, Yota Otachi
      Algorithmica, Vol. 84, pp. 2379-2393, 2022

      • Unlabeled multi-robot motion planning with tighter separation bounds

        Bahareh Banyassady, Mark de Berg, Karl Bringmann, Kevin Buchin, Henning Fernau, Dan Halperin, Irina Kostitsyna, Yoshio Okamoto, Stijn Slot
        Proc. of 38th International Symposium on Computational Geometry (SoCG 2022), Leibniz International Proceedings in Informatics, Vol. 224, pp. 12:1-12:16, 2022

        • On the kernel of the surgery map restricted to the 1-loop part

          Yuta Nozaki, Masatoshi Sato, Masaaki Suzuki
          Journal of Topology, Vol. 15, pp. 587-619, 2022

          • Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams

            Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
            Proc. of Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022), pp. 1342-1355, 2022

            • Linear-time recognition of double-threshold graphs

              Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno
              Algorithmica, Vol. 84, pp. 1163-1181, 2022

              • Reforming an envy-free matching

                Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
                Proc. of 36th AAAI Conference on Artificial Intelligence (AAAI 2022), Vol. 36, pp. 5084-5091, 2022

                • Online task assignment problems with reusable resources

                  Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
                  Proc. of 36th AAAI Conference on Artificial Intelligence (AAAI 2022), Vol. 36, pp. 5199-5207, 2021

                  • Computing diverse shortest paths efficiently: A theoretical and experimental study

                    Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi
                    Proc. of 36th AAAI Conference on Artificial Intelligence (AAAI 2022), Vol. 36, pp. 3758-3766, 2022

                    • Maximum properly colored trees in edge-colored graphs

                      Jie Hu, Hao Li, Shun-ichi Maezawa
                      Journal of Combinatorial Optimization, Vol. 44, pp. 154-171, 2022