Yota Otachi

Invited Talks

  1. Yota Otachi.
    Graph isomorphism problem on the H-subgraph-free graphs.
    The Japanese-Swiss Workshop on Combinatorics and Computational Geometry.
    June 4-6, 2014 in Tokyo, Japan.
  2. Yota Otachi.
    On low congestion spanning trees.
    The 8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications.
    June 4-7, 2013 in Veszprém, Hungary.

Other Publications

  1. Yota Otachi.
    A survey on spanning tree congestion.
    Treewidth, Kernels, and Algorithms. Essays dedicated to Hans L. Bodlaender on the occasion of his 60th birthday.
    Lecture Notes in Computer Science 12160, 165-172, November 2020.
  2. Yota Otachi.
    Designing low-congestion networks with structural graph theory.
    Interdisciplinary Information Sciences 17, 197-216, November 2011.

Presentations at International Workshops

  1. Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi.
    An improved spectral lower bound of treewidth.
    The Indonesia-Japan Conference on Discrete and Computational Geometry, Graphs, and Games (IJCDCG3).
    September 22-24, 2023 in Bali, Indonesia.
  2. Hiroki Arimura, Tatsuya Gima, Yasuaki Kobayashi, Hiroomi Nochide, Yota Otachi.
    Minimum Consistent Subset for Trees Revisited.
    The 23rd Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2023).
    June 24-25, 2023 in Nagoya, Japan.
  3. Ryota Murai, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Hirotaka Ono, Yota Otachi.
    Structural parameterizations of vertex integrity.
    The 23rd Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2023).
    June 24-25, 2023 in Nagoya, Japan.
  4. Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi.
    On a spectral lower bound of treewidth.
    The 23rd Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2023).
    June 24-25, 2023 in Nagoya, Japan.
  5. Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Yota Otachi, Hirotaka Ono.
    Collecting balls on a line by robots with limited energy.
    The 23rd Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2023).
    June 24-25, 2023 in Nagoya, Japan.
  6. Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa.
    Reconfiguring directed trees in a digraph.
    Workshop on Combinatorial Reconfiguration, affiliated with ICALP 2021.
    July 12, 2021 in Glasgow, Scotland (held online).
  7. Takumu Shriayama, Yota Otachi, Ryuhei Uehara.
    On computational complexity of pipe puzzles.
    The 21st Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2018).
    August 26-27, 2018 in Fukuoka, Japan.
  8. Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach.
    A lower bound on opaque sets.
    The 31st European Workshop on Computational Geometry (EuroCG 2015).
    March 15-18, 2015 in Ljubljana, Slovenia.
  9. Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi.
    On shortest barriers.
    The 16th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG2 2013).
    September 17-19, 2013 in Tokyo, Japan.
  10. Masashi Kiyomi, Yoshio Okamoto, Yota Otachi.
    On the treewidth of toroidal grids.
    The 16th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG2 2013).
    September 17-19, 2013 in Tokyo, Japan.
  11. Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil.
    Extending partial representations of proper and unit interval graphs.
    The 29th European Workshop on Computational Geometry (EuroCG 2013).
    March 17-20, 2013 in Braunschweig, Germany.
  12. Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno.
    Algorithms for computing optimal image segmentation using quadtree decomposition.
    Thailand-Japan Joint Conference on Computational Geometry and Graphs (TJJCCGG 2012).
    December 6-8, 2012 in Bangkok, Thailand.
  13. Shuji Kijima, Yota Otachi, Toshiki Saitoh, Takeaki Uno.
    Subgraph isomorphism in graph classes.
    The 14th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 2011).
    July 8-9, 2011, in Busan, Korea.
  14. Meng Li, Yota Otachi, Takeshi Tokuyama.
    On the point set reconstruction from graphs.
    The 4th Annual Meeting of Asian Association for Algorithms and Computation (AAAC 2011).
    April 16-17, 2011, in Hsinchu, Taiwan.
  15. Yoshio Okamoto, Yota Otachi, Ryuhei Uehara.
    Bipartite powers of interval bigraphs.
    China-Japan Joint Conference on Computational Geometry, Graphs and Applications (CGGA 2010).
    November 3-6, 2010, in Dalian, China.
  16. Hans L. Bodlaender, Kyohei Kozawa, Takayoshi Matsushima, Yota Otachi.
    Spanning tree congestion of k-outerplanar graphs.
    The 13th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2010).
    July 23-24, 2010, in Kanazawa, Japan.
  17. Masanobu Furuse, Yota Otachi, Koichi Yamazaki.
    Reformulation of the scheme for computing tree-width and minimum fill-in.
    The 7th Japan Conference on Computational Geometry and Graphs (JCCGG 2009).
    November 11-13, 2009 in Kanazawa, Japan.
  18. Kyohei Kozawa, Yota Otachi, Koichi Yamazaki.
    A lower bound for tree-width of Cartesian product graphs.
    The 6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications.
    May 16-19, 2009 in Budapest, Hungary.