活動情報

論文・受賞

  • Polynomial-delay enumeration of large maximal common independent sets in two matroids

    Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
    Proc. of 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023), Leibniz International Proceedings in Informatics, Vol. 272, pp. 58:1-58:14, 2023

    • Reconfiguration of time-respecting arborescences

      Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
      Proc. of 18th Algorithms and Data Structures Symposium (WADS 2023), Lecture Notes in Computer Science, Vol. 14079, pp. 521-532, 2023

      • Reconfiguration of vertex-disjoint shortest paths on graphs

        Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara
        Proc. of 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023), Lecture Notes in Computer Science, Vol. 13973, pp. 191-201, 2023

        • Approximability of the distance independent set problem on regular graphs and planar graphs

          Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
          IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E105-A, pp. 1211-1222, 2022

          • Reconfiguration of cliques in a graph

            Takehiro Ito, Hirotaka Ono, Yota Otachi
            Discrete Applied Mathematics, Vol. 333, pp. 43-58, 2023

            • Sequentially swapping tokens: Further on graph classes

              Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi
              Proc. of 48th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2023), Lecture Notes in Computer Science, Vol. 13878, pp. 222-235, 2023

              • Extended MSO model checking via small vertex integrity

                Tatsuya Gima, Yota Otachi
                Proc. of 33rd International Symposium on Algorithms and Computation (ISAAC 2022), Leibniz International Proceedings in Informatics, Vol. 248, pp. 20:1-20:15, 2022

                • On reachable assignments under dichotomous preferences

                  Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
                  Proc. of 24th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2022), Lecture Notes in Computer Science, Vol. 13753, pp. 650-658, 2022

                  • Graphs with large total angular resolution

                    Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen, Birgit Vogtenhuber
                    Theoretical Computer Science, Vol. 943, pp. 73-88, 2023

                    • Parameterized complexity of optimizing list vertex-coloring through reconfiguration

                      Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao Zhou
                      Proc. of 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023), Lecture Notes in Computer Science, Vol. 13973, pp. 279-290, 2023