What's new

  • December 27, 2020: "Longest common subsequence in sublinear space" by Masashi Kiyomi, Takashi Horiyama, and Yota Otachi was accepted to Information Processing Letters.
  • December 22, 2020: "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 CIAC 2021.
  • December 1, 2020: "Finding diverse trees, paths, and more" by Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, and Yota Otachi was accepted to AAAI 2021.
  • September 19, 2020: "Parameterized complexity of graph burning" by Yasuaki Kobayashi and Yota Otachi was accepted to IPEC 2020.
  • September 12, 2020: "K3 edge cover problem in a wide sense" by Kyohei Chiba, Rémy Belmonte, Hiro Ito, Michael Lampis, Atsuki Nagao, and Yota Otachi was accepted to Journal of Information Processing.
  • June 18, 2020: "Grundy distinguishes treewidth from pathwidth" by Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, and Yota Otachi was accepted to ESA 2020.
  • June 12, 2020: "Subgraph isomorphism on graph classes that exclude a substructure" by Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, and Tom van der Zanden was accepted to Algorithmica.
  • April 27, 2020: "Linear-time recognition of double-threshold graphs" by Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, and Yushi Uno was accepted to WG 2020.
  • April 16, 2020: "Sublinear-space lexicographic depth-first search for bounded treewidth graphs and planar graphs" by Taisuke Izumi and Yota Otachi was accepted to ICALP 2020.
  • April 12, 2020: "Parameterized complexity of safe set" by Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, and Yota Otachi was accepted to Journal of Graph Algorithms and Applications .
  • March 12, 2020: "Independent set reconfiguration parameterized by modular-width" by Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, and Yota Otachi was accepted to Algorithmica.
  • March 9, 2020: "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 IWOCA 2020.
  • March 1, 2020: Yota Otachi joined Nagoya Univesity.
  • January 15, 2020: "Hedonic seat arrangement problems" by Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, and Tom C. van der Zanden was accepted as an extended abstract to AAMAS 2020.
  • January 13, 2020: "Parameterized Orientable Deletion" by Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, and Florian Sikora was accepted to Algorithmica.
  • January 7, 2020: "Token sliding on split graphs" by Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, and Florian Sikora was accepted to Theory of Computing Systems.