活動情報

論文・受賞

  • A parameterized view to the robust recoverable base problem of matroids under structural uncertainty

    Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    Operations Research Letters, Vol. 50, pp. 370-375, 2022

    • An improved deterministic parameterized algorithm for cactus vertex deletion

      Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
      Theory of Computing Systems, Vol. 66, pp. 502-515, 2022

      • Parameterized complexity of non-separating and non-disconnecting paths and sets

        Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket Saurabh
        Proc. of 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), Leibniz International Proceedings in Informatics, Vol. 241, pp. 6:1-6:15, 2022

        • Algorithmic meta-theorems for combinatorial reconfiguration revisited

          Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi
          Proc. of 30th Annual European Symposium on Algorithms (ESA 2022), Leibniz International Proceedings in Informatics, Vol. 244, pp. 61:1-61:15, 2022

          • Polynomial-delay and polynomial-space enumeration of large maximal matchings

            Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
            Proc. of 48th edition of the International Workshop on Graph-Theoretic Concepts in Computer Science (WG2022), Vol. 13453, pp. 342-355, 2022

            • Linear-delay enumeration for minimal Steiner problems

              Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
              Proc. of 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS 2022), pp. 301-313, 2022

              • Constant amortized time enumeration of Eulerian trails

                Kazuhiro Kurita, Kuniihiro Wasa
                Theoretical Computer Science, Vol. 923, Article 44573, 2022

                • Independent set reconfiguration on directed graphs

                  Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
                  Proc. of 47th International Symposium on Mathematical Foundations of Computer Science, Leibniz International Proceedings in Informatics, Vol. 241, pp. 58:1-58:15, 2022

                  • Shortest reconfiguration of perfect matchings via alternating cycles

                    Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
                    SIAM Journal on Discrete Mathematics, Vol. 36, pp. 1102-1123, 2022

                    • Reconstructing phylogenetic trees from multipartite quartet systems

                      Hiroshi Hirai, Yuni Iwamasa
                      Algorithmica, Vol. 84, pp. 1875-1896, 2022