What's new

  • November 19, 2022: "A framework to design approximation algorithms for finding diverse solutions in combinatorial problems" by Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, and Yota Otachi was accepted to AAAI 2023.
  • September 30, 2022: "Sequentially swapping tokens: Further on graph classes" by Hironori Kiya, Yuto Okada, Hirotaka Ono, and Yota Otachi was accepted to SOFSEM 2023.
  • August 31, 2022: "Extended MSO model checking via small vertex integrity" by Tatsuya Gima and Yota Otachi was accepted to ISAAC 2022.
  • June 21, 2022: Two papers "Parameterized complexity of non-separating and non-disconnecting paths and sets" by Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, and Saket Saurabh, and "Independent set reconfiguration on directed graphs" by Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, and Kunihiro Wasa were accepted to MFCS 2022.
  • June 20, 2022: "Algorithmic meta-theorems for combinatorial reconfiguration revisited" by Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, and Yota Otachi was accepted to ESA 2022.
  • April 15, 2022: "Grundy distinguishes treewidth from pathwidth" by Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, and Yota Otachi was accepted to SIAM Journal on Discrete Mathematics.
  • March 23, 2022: "Sorting balls and water: Equivalence and computational complexity" by Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, and Ryo Yoshinaka was accepted to FUN 2022.
  • March 16, 2022: "An improved deterministic parameterized algorithm for cactus vertex deletion" by Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, and Yota Otachi was accepted to Theory of Computing Systems.
  • March 16, 2022: "Parameterized complexity of graph burning" by Yasuaki Kobayashi and Yota Otachi was accepted to Algorithmica.
  • March 13, 2022: "Exploring the gap between treedepth and vertex cover through vertex integrity" by Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, and Yota Otachi was accepted to Theoretical Computer Science.
  • December 11, 2021: "Linear-time recognition of double-threshold graphs" by Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, and Yushi Uno was accepted to Algorithmica.
  • December 1, 2021: "Computing diverse shortest paths efficiently: A theoretical and experimental study" by Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, and Yota Otachi was accepted to AAAI 2022.
  • November 20, 2021: "Reconfiguration of regular induced subgraphs" by Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, and Kunihiro Wasa was accepted to WALCOM 2022.
  • September 26, 2021: "Parameterized complexity of (A, ℓ)-path packing" by Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, and Yota Otachi was accepted to Algorithmica.
  • September 20, 2021: "Brief announcement: Distributed reconfiguration of spanning trees" by Yukiko Yamauchi, Naoyuki Kamiyama, and Yota Otachi was accepted to SSS 2021.
  • August 15, 2021: Two papers "Computational complexity of jumping block puzzles" by Masaaki Kanzaki, Yota Otachi, and Ryuhei Uehara, and "Reconfiguring directed trees in a digraph" by Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, and Kunihiro Wasa were accepted to COCOON 2021.
  • August 8, 2021: "Low-congestion shortcut and graph parameters" by Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, and Taisuke Izumi was accepted to Distributed Computing.
  • July 19, 2021: "On the security number of the Cartesian product of graphs" by Marko Jakovac and Yota Otachi was accepted to Discrete Applied Mathematics.
  • June 21, 2021: Yota Otachi (jointly with Tesshu Hanaka, Yasuaki Kobayashi, and Kazuhiro Kurita) received JSAI Incentive Award.