Yota Otachi

Refereed Papers in International Conferences

  1. Yota Otachi, Akira Suzuki, Yuma Tamura.
    Finding induced subgraphs from graphs with small mim-width.
    The 19th Scandinavian Symposium on Algorithm Theory (SWAT 2024).
    June 12-14, 2024. Helsinki, Finland. Leibniz International Proceedings in Informatics, to appear.
  2. Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou.
    On the complexity of List H-Packing for sparse graph classes.
    The 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024).
    March 18-20, 2024. Kanazawa, Japan. Lecture Notes in Computer Science 14549 (2024) 421-435.
  3. Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi.
    Structural parameterizations of vertex integrity.
    The 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024).
    March 18-20, 2024. Kanazawa, Japan. Lecture Notes in Computer Science 14549 (2024) 406-420.
  4. Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi.
    Dichotomies for Tree Minor Containment with structural parameters.
    The 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024).
    March 18-20, 2024. Kanazawa, Japan. Lecture Notes in Computer Science 14549 (2024) 392-405.
  5. Julien Courtiel, Paul Dorbec, Tatsuya Gima, Romain Lecoq, Yota Otachi.
    Orientable burning number of graphs.
    The 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024).
    March 18-20, 2024. Kanazawa, Japan. Lecture Notes in Computer Science 14549 (2024) 377-391.
  6. Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda.
    Grouped domination parameterized by vertex cover, twin cover, and beyond.
    The 13th International Conference on Algorithms and Complexity (CIAC 2023).
    June 13-16, 2023. Larnaca, Cyprus. Lecture Notes in Computer Science 13898 (2023) 263-277.
  7. Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi.
    A framework to design approximation algorithms for finding diverse solutions in combinatorial problems.
    The 37th AAAI Conference on Artificial Intelligence (AAAI 2023).
    February 7-14, 2023. Washington, D.C., USA. Proceedings of the AAAI Conference on Artificial Intelligence 37:4 (2023) 3968-3976.
  8. Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi.
    Sequentially swapping tokens: Further on graph classes.
    The 48th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2023).
    January 15-19, 2023. Nový Smokovec, Slovakia. Lecture Notes in Computer Science 13878 (2023) 222-235.
  9. Tatsuya Gima, Yota Otachi.
    Extended MSO model checking via small vertex integrity.
    The 33rd International Symposium on Algorithms and Computation (ISAAC 2022).
    December 19-21, 2022. Seoul, Korea (hybrid). Leibniz International Proceedings in Informatics 248 (2022) 20:1-20:15.
  10. Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi.
    Algorithmic meta-theorems for combinatorial reconfiguration revisited.
    The 30th European Symposium on Algorithms (ESA 2022).
    September 5-9, 2022. Potsdam, Germany (hybrid). Leibniz International Proceedings in Informatics 244 (2022) 61:1-61:15.
  11. Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket Saurabh.
    Parameterized complexity of non-separating and non-disconnecting paths and sets.
    The 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022).
    August 22-26, 2022. Vienna, Austria. Leibniz International Proceedings in Informatics 241 (2022) 6:1-6:15.
  12. Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa.
    Independent set reconfiguration on directed graphs.
    The 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022).
    August 22-26, 2022. Vienna, Austria. Leibniz International Proceedings in Informatics 241 (2022) 58:1-58:15.
  13. Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka.
    Sorting balls and water: Equivalence and computational complexity.
    The 11th International Conference on Fun with Algorithms (FUN 2022).
    May 30-June 3, 2022. Island of Favignana, Sicily, Italy. Leibniz International Proceedings in Informatics 226 (2022) 16:1-16:17.
  14. Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa.
    Reconfiguration of regular induced subgraphs.
    The 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022).
    March 24-26, 2022. Jember, Indonesia (hybrid). Lecture Notes in Computer Science 13174 (2022) 35-46.
  15. Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi.
    Computing diverse shortest paths efficiently: A theoretical and experimental study.
    The 36th AAAI Conference on Artificial Intelligence (AAAI 2022).
    February 22-March 1, 2022. Vancouver Canada (held online). Proceedings of the AAAI Conference on Artificial Intelligence 36:4 (2022) 3758-3766.
  16. Yukiko Yamauchi, Naoyuki Kamiyama, Yota Otachi.
    Brief announcement: Distributed reconfiguration of spanning trees.
    The 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2021).
    November 17-20, 2021 (held online). Lecture Notes in Computer Science 13046 (2021) 516-520.
  17. Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa.
    Reconfiguring directed trees in a digraph.
    The 27th International Computing and Combinatorics Conference (COCOON 2021).
    October 24-26, 2021. Tainan, Taiwan (hybrid). Lecture Notes in Computer Science 13025 (2021) 343-354.
  18. Masaaki Kanzaki, Yota Otachi, Ryuhei Uehara.
    Computational complexity of jumping block puzzles.
    The 27th International Computing and Combinatorics Conference (COCOON 2021).
    October 24-26, 2021. Tainan, Taiwan (hybrid). Lecture Notes in Computer Science 13025 (2021) 655-667.
  19. Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi.
    Exploring the gap between treedepth and vertex cover through vertex integrity.
    The 12th International Conference on Algorithms and Complexity (CIAC 2021).
    May 10-12, 2021. Larnaca, Cyprus (held online). Lecture Notes in Computer Science 12701 (2021) 271-285.
  20. Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi.
    Finding diverse trees, paths, and more.
    The 35th AAAI Conference on Artificial Intelligence (AAAI 2021).
    February 2-9, 2021 (held online). Proceedings of the AAAI Conference on Artificial Intelligence 35:5 (2021) 3778-3786.
  21. Yasuaki Kobayashi, Yota Otachi.
    Parameterized complexity of graph burning.
    The 15th International Symposium on Parameterized and Exact Computation (IPEC 2020).
    December 14-18, 2020. Hong Kong, China (held online). Leibniz International Proceedings in Informatics 180 (2020) 21:1-21:10.
  22. Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi.
    Grundy distinguishes treewidth from pathwidth.
    The 28th European Symposium on Algorithms (ESA 2020).
    September 7-9, 2020. Pisa, Italy (held online). Leibniz International Proceedings in Informatics 173 (2020) 14:1-14:19.
  23. Taisuke Izumi, Yota Otachi.
    Sublinear-space lexicographic depth-first search for bounded treewidth graphs and planar graphs.
    The 47th International Colloquium on Automata, Languages and Programming (ICALP 2020).
    July 8-11, 2020. Saarbrücken, Germany (held online). Leibniz International Proceedings in Informatics 168 (2020) 67:1-67:17.
  24. Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno.
    Linear-time recognition of double-threshold graphs.
    The 46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2020).
    June 24-26, 2020. Leeds, UK (held online). Lecture Notes in Computer Science 12301 (2020) 286-297.
  25. Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi.
    Parameterized complexity of (A, ℓ)-path packing.
    The 31st International Workshop on Combinatorial Algorithms (IWOCA 2020).
    June 8-10, 2020. Bordeaux, France (held online). Lecture Notes in Computer Science 12126 (2020) 43-55.
  26. Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden.
    Hedonic seat arrangement problems (Extended abstract).
    The 19th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2020).
    May 9-13, 2020. Auckland, New Zealand (held online). 1777-1779.
  27. Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi.
    Low-congestion shortcut and graph parameters.
    The 33rd International Symposium on Distributed Computing (DISC 2019).
    October 14-18, 2019. Budapest, Hungary. Leibniz International Proceedings in Informatics 146 (2019) 25:1-25:17.
  28. Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi.
    Independent set reconfiguration parameterized by modular-width.
    The 45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2019).
    June 19-21, 2019. Vall de Núria, Catalonia, Spain. Lecture Notes in Computer Science 11789 (2019) 285-297.
  29. Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom van der Zanden.
    Subgraph isomorphism on graph classes that exclude a substructure.
    The 11th International Conference on Algorithms and Complexity (CIAC 2019).
    May 27-29, 2019. Rome, Italy. Lecture Notes in Computer Science 11485 (2019) 87-98.
  30. Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi.
    Parameterized complexity of safe set.
    The 11th International Conference on Algorithms and Complexity (CIAC 2019).
    May 27-29, 2019. Rome, Italy. Lecture Notes in Computer Science 11485 (2019) 38-49.
  31. Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora.
    Token sliding on split graphs.
    The 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019).
    March 13-16, 2019. Berlin, Germany. Leibniz International Proceedings in Informatics 126 (2019) 13:1-13:17.
  32. Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara.
    Computational complexity of robot arm simulation problems.
    The 29th International Workshop on Combinational Algorithms (IWOCA 2018).
    July 16-19, 2018. Singapore. Lecture Notes in Computer Science 10979 (2018) 177-188.
  33. Takehiro Ito, Yota Otachi.
    Reconfiguration of colorable sets in classes of perfect graphs.
    The 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018).
    June 18-20, 2018. Malmö, Sweden. Leibniz International Proceedings in Informatics 101 (2018) 27:1-27:13.
  34. Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora.
    Parameterized Orientable Deletion.
    The 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018).
    June 18-20, 2018. Malmö, Sweden. Leibniz International Proceedings in Informatics 101 (2018) 24:1-24:13.
  35. Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi.
    How bad is the freedom to Flood-It?
    The 9th International Conference on Fun with Algorithms (FUN 2018).
    June 13-15, 2018. La Maddalena, Italy. Leibniz International Proceedings in Informatics 100 (2018) 5:1-5:13.
  36. Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa.
    Exact algorithms for the max-min dispersion problem.
    The 12th International Frontiers of Algorithmics Workshop (FAW 2018).
    May 8-10, 2018. Guangzhou, China. Lecture Notes in Computer Science 10823 (2018) 263-272.
  37. Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui.
    Space-efficient algorithms for longest increasing subsequence.
    The 35th International Symposium on Theoretical Aspects of Computer Science (STACS 2018).
    February 28-March 3, 2018. Caen, France. Leibniz International Proceedings in Informatics 96 (2018) 44:1-44:15.
  38. Yixin Cao, Yuping Ke, Yota Otachi, Jie You.
    Vertex deletion problems on chordal graphs.
    The 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017).
    December 11-15, 2017. Kanpur, India. Leibniz International Proceedings in Informatics 93 (2018) 22:1-22:14.
  39. Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa.
    Efficient enumeration of maximal k-degenerate subgraphs in a chordal graph.
    The 23rd Annual International Computing and Combinatorics Conference (COCOON 2017).
    August 3-5, 2017. Hong Kong, China. Lecture Notes in Computer Science 10392 (2017) 150-161.
  40. Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu.
    Safe sets in graphs: Graph classes and structural parameters.
    The 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2016).
    December 16-18, 2016. Hong Kong, China. Lecture Notes in Computer Science 10043 (2016) 241-253.
  41. Hans L. Bodlaender, Hirotaka Ono, Yota Otachi.
    Degree-constrained orientation of maximum satisfaction: Graph classes and parameterized complexity.
    The 27th International Symposium on Algorithms and Computation (ISAAC 2016).
    December 12-14, 2016. Sydney, Australia. Leibniz International Proceedings in Informatics 64 (2016) 20:1-20:12.
  42. Pavel Klavík, Yota Otachi, Jiří Šejnoha.
    On the classes of interval graphs of limited nesting and count of lengths.
    The 27th International Symposium on Algorithms and Computation (ISAAC 2016).
    December 12-14, 2016. Sydney, Australia. Leibniz International Proceedings in Informatics 64 (2016) 45:1-45:13.
  43. Hans L. Bodlaender, Hirotaka Ono, Yota Otachi.
    A faster parameterized algorithm for Pseudoforest Deletion.
    The 11th International Symposium on Parameterized and Exact Computation (IPEC 2016).
    August 24-26, 2016. Aarhus, Denmark. Leibniz International Proceedings in Informatics 63 (2017) 7:1-7:12.
  44. Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach.
    A lower bound on opaque sets.
    The 32nd International Symposium on Computational Geometry (SoCG 2016).
    June 14-18, 2016. Boston, MA, USA. Leibniz International Proceedings in Informatics 51 (2016) 46:1-46:10.
  45. Eli Fox-Epstein, Duc A. Hoang, Yota Otachi, Ryuhei Uehara.
    Sliding token on bipartite permutation graphs.
    The 26th International Symposium on Algorithms and Computation (ISAAC 2015).
    December 9-11, 2015. Nagoya, Japan. Lecture Notes in Computer Science 9472 (2015) 237-247.
  46. Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S.B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno.
    Symmetric assembly puzzles are hard, beyond a few pieces.
    The 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG2 2015).
    September 14-16, 2015. Kyoto, Japan. Lecture Notes in Computer Science 9943 (2016) 180-192.
  47. Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou.
    Competitive diffusion on weighted graphs.
    The 14th International Symposium on Algorithms and Data Structures (WADS 2015).
    August 5-7, 2015. Victoria, BC, Canada. Lecture Notes in Computer Science 9214 (2015) 422-433.
  48. Katsuhisa Yamanaka, Takashi Horiyama, David Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno.
    Swapping colored tokens on graphs.
    The 14th International Symposium on Algorithms and Data Structures (WADS 2015).
    August 5-7, 2015. Victoria, BC, Canada. Lecture Notes in Computer Science 9214 (2015) 619-628.
  49. Rémy Belmonte, Yota Otachi, Pascal Schweitzer.
    Induced minor free graphs: Isomorphism and clique-width.
    The 41st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2015).
    June 17-19, 2015. Munich, Germany. Lecture Notes in Computer Science 9224 (2016) 299-311.
  50. Takehiro Ito, Hirotaka Ono, Yota Otachi.
    Reconfiguration of cliques in a graph.
    The 12th Annual Conference on Theory and Applications of Models of Computation (TAMC 2015).
    May 18-20, 2015. Singapore. Lecture Notes in Computer Science 9076 (2015) 212-223.
  51. Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada.
    Polynomial-time algorithm for sliding tokens on trees.
    The 25th International Symposium on Algorithms and Computation (ISAAC 2014).
    December 15-17, 2014. Jeonju, Korea. Lecture Notes in Computer Science 8889 (2014) 389-400.
  52. Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara.
    Depth-first search using O(n) bits.
    The 25th International Symposium on Algorithms and Computation (ISAAC 2014).
    December 15-17, 2014. Jeonju, Korea. Lecture Notes in Computer Science 8889 (2014) 553-564.
  53. Yota Otachi, Pascal Schweitzer.
    Reduction techniques for graph isomorphism in the context of width parameters.
    The 14th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2014).
    July 2-4, 2014. Copenhagen, Denmark. Lecture Notes in Computer Science 8503 (2014) 368-379.
  54. 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 14th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2014).
    July 2-4, 2014. Copenhagen, Denmark. Lecture Notes in Computer Science 8503 (2014) 253-264.
  55. Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara.
    Intersection dimension of bipartite graphs.
    The 11th Annual Conference on Theory and Applications of Models of Computation (TAMC 2014).
    April 11-13, 2014. Chennai, India. Lecture Notes in Computer Science 8402 (2014) 323-340.
  56. Matsuo Konagaya, Yota Otachi, Ryuhei Uehara.
    Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs.
    The 11th Annual Conference on Theory and Applications of Models of Computation (TAMC 2014).
    April 11-13, 2014. Chennai, India. Lecture Notes in Computer Science 8402 (2014) 216-228.
  57. Yota Otachi, Pascal Schweitzer.
    Isomorphism on subgraph-closed graph classes: a complexity dichotomy and intermediate graph classes.
    The 24th International Symposium on Algorithms and Computation (ISAAC 2013).
    December 16-18, 2013. Hong Kong, China. Lecture Notes in Computer Science 8283 (2013) 111-118.
  58. Martin Balko, Pavel Klavík, Yota Otachi.
    Bounded representations of interval and proper interval graphs.
    The 24th International Symposium on Algorithms and Computation (ISAAC 2013).
    December 16-18, 2013. Hong Kong, China. Lecture Notes in Computer Science 8283 (2013) 535-546.
  59. Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno.
    Base location problems for base-monotone regions.
    The 7th International Workshop on Algorithms and Computation (WALCOM 2013).
    February 14-16, 2013. Kharagpur, India. Lecture Notes in Computer Science 7748 (2013) 53-64.
  60. Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno.
    A 4.31-approximation for the geometric unique coverage problem on unit disks.
    The 23rd International Symposium on Algorithms and Computation (ISAAC 2012).
    December 19-21, 2012. Taipei, Taiwan. Lecture Notes in Computer Science 7676 (2012) 372-381.
  61. Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh.
    Extending partial representations of subclasses of chordal graphs.
    The 23rd International Symposium on Algorithms and Computation (ISAAC 2012).
    December 19-21, 2012. Taipei, Taiwan. Lecture Notes in Computer Science 7676 (2012) 444-454.
  62. Yota Otachi.
    Isomorphism for graphs of bounded connected-path-distance-width.
    The 23rd International Symposium on Algorithms and Computation (ISAAC 2012).
    December 19-21, 2012. Taipei, Taiwan. Lecture Notes in Computer Science 7676 (2012) 455-464.
  63. Hiroyuki Fukui, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno.
    On complexity of flooding games on graphs with interval representations.
    Thailand-Japan Joint Conference on Computational Geometry and Graphs (TJJCCGG 2012).
    December 6-8, 2012. Bangkok, Thailand. Lecture Notes in Computer Science 8296 (2013) 73-84.
  64. Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno.
    A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares.
    The 13th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2012).
    July 4-6, 2012. Helsinki, Finland. Lecture Notes in Computer Science 7357 (2012) 24-35.
  65. Meng Li, Yota Otachi, Takeshi Tokuyama.
    Efficient algorithms for network localization using cores of underlying graphs.
    The 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS 2011).
    September 8-9, 2011. Saarbrücken, Germany. Lecture Notes in Computer Science 7111 (2012) 101-114.
  66. Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki.
    Approximability of the path-distance-width for AT-free graphs.
    The 37th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2011).
    June 21-24, 2011. Teplá, Czech. Lecture Notes in Computer Science 6986 (2011) 271-282.
  67. Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno.
    Hardness results and an exact exponential algorithm for the spanning tree congestion problem.
    The 8th Annual Conference on Theory and Applications of Models of Computation (TAMC 2011).
    May 23-25, 2011. Tokyo, Japan. Lecture Notes in Computer Science 6648 (2011) 452-462.
  68. Yota Otachi, Hans L. Bodlaender, Erik Jan van Leeuwen.
    Complexity results for the spanning tree congestion problem.
    The 36th International Workshop on Graph Theoretic Concepts in Computer Science (WG 2010).
    June 28-30, 2010. Crete, Greece. Lecture Notes in Computer Science 6410 (2010) 3-14.
  69. Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara.
    Random generation and enumeration of bipartite permutation graphs.
    The 20th International Symposium on Algorithms and Computation (ISAAC 2009).
    December 16-18, 2009. Hawaii, USA. Lecture Notes in Computer Science 5878 (2009) 1104-1113.
  70. Katsuhisa Yamanaka, Yota Otachi, Shin-ichi Nakano.
    Efficient enumeration of ordered trees with k leaves.
    The 3rd Annual Workshop on Algorithms and Computation (WALCOM 2009).
    February 18-20, 2009. Kolkata, India. Lecture Notes in Computer Science 5431 (2009) 141-150.