Yota Otachi

Curriculum Vitae

me on zoom

Name: Yota Otachi
Born: April, 1982 (Japan)
Email: otachi (at) nagoya-u.jp

Current Position and Address

Associate Professor.
Department of Mathematical Informatics, Graduate School of Informatics, Nagoya University.
Furocho, Chikusa-ku, Nagoya, 464-8601, Japan

Research Interests

Graph Algorithms, Algorithmic Graph Theory, Fixed-Parameter Tractability, Exact Exponential Algorithms.

Education

B.E. in Computer Science, Gunma University, 2005.
M.E. in Computer Science, Gunma University, 2007.
Ph.D. in Engineering, Gunma University, 2010.

Ph.D. thesis: Treewidth and related graph parameters
Supervised by Prof. Koichi Yamazaki

Occupation

April 2008 - March 2009: Research Assistant at Gunma University
April 2009 - March 2010: JSPS Research Fellow (DC2) at Gunma University
April 2010 - March 2011: JSPS Research Fellow (PD) at Tohoku University
April 2011 - March 2012: Assistant Professor at Tohoku University
April 2012 - April 2017: Assistant Professor at JAIST
May 2017 - February 2020: Associate Professor at Kumamoto University
March 2020 - present: Associate Professor at Nagoya University

August 2015 - January 2016: Visiting Researcher at Simon Fraser University

Research Activities

Publications

See journal papers and proceedings. See also my dblp, Google Scholar, and ORCID iD iconORCID iD entries.

Awards

  • The best paper award, WALCOM 2024, March 2024
    Title: Structural parameterizations of vertex integrity
    Authors: Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, and Yota Otachi
  • JSAI Incentive Award, June 2021
    Title: Algorithms for Finding Diverse Subgraphs
    Authors: Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, and Yota Otachi
  • IPSJ Yamashita SIG Research Award, March 2019
    Title: Space-efficient algorithms for longest increasing subsequence
    Authors: Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, and Jun Tarui
  • The 16th EATCS/LA Presentation Award, February 2018
    Title: Space-efficient algorithms for longest increasing subsequence
    Authors: Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, and Jun Tarui
  • The 15th EATCS/LA Presentation Award, February 2017
    Title: A faster parameterized algorithm for Pseudoforest Deletion
    Authors: Hans L. Bodlaender, Hirotaka Ono, and Yota Otachi
  • JAIST President Award, October 2015.
  • IPSJ Computer Science Research Award for Young Scientists, September 2011
    Title: Spanning tree congestion of k-outerplanar graphs
    Authors: Hans L. Bodlaender, Kyohei Kozawa, Takayoshi Matsushima, and Yota Otachi

Grants

  • April 2021 - March 2026: JSPS Grant-in-Aid for Scientific Research (C)
    [21K11752] Refining the graph parameter hierarchy for fine-grained algorithms
  • April 2019 - March 2021 March 2022 (extended): Bilateral Program (CNRS, France)
    [JPJSBP 120192912] PARAGA - Parameterized Approximation Graph Algorithms
  • April 2018 - March 2021 March 2022 (extended): JSPS Grant-in-Aid for Scientific Research (C)
    [18K11168] Speeding up FPT algorithms with special tree decompositions
  • September 2018: Bilateral Program Seminar (NWO, The Netherlands)
    Computations on Networks with a Tree-Structure: From Theory to Practice
  • April 2017 - March 2019: Bilateral Program (MAEDI, Sakura Program, France)
    [38593YJ] GRAPA - Graph Algorithms for Parameterized Approximation
  • April 2013 - March 2016: JSPS Grant-in-Aid for Young Scientists (B)
    [25730003] Fixed width parameter algorithms for the graph isomorphism problem
  • September 2011 - March 2013: JSPS Grant-in-Aid for Research Activity Start-up
    [23800004] Designing low-congestion sparse networks
  • April 2009 - March 2011: JSPS Research Fellowship for Young Scientists
    [21-6878] Treewidth and related graph parameters

Program Committee Member

  • The 24th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 2024). August 2-3, 2024, in Seoul, Korea.
  • The 19th Scandinavian Symposium on Algorithm Theory (SWAT 2024). June 12-14, 2024, in Helsinki, Finland.
  • The 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024). March 18-20, 2024, in Kanazawa, Japan.
  • The 23rd Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2023). June 24-25, 2023, in Nagoya, Japan.
  • The 48th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2022). June 22-24, 2022 in Tübingen, Germany.
  • The 32nd International Symposium on Algorithms and Computation (ISAAC 2021). December 6-8, 2021 in Fukuoka, Japan.
  • The 14th International Frontiers of Algorithmics Workshop (FAW 2020). May 29-31, 2020 in Haikou, China.
  • The 13th International Symposium on Parameterized and Exact Computation (IPEC 2019). September 11-13, 2019 in Munich, Germany.
  • The 11th International Conference on Algorithms and Complexity (CIAC 2019). May 27-29, 2019 in Rome, Italy.
  • The 1st Computational Intelligence in Information Systems (CIIS 2016), Special Session on Computational Complexity and Algorithms (SoCCA). November 18-20, 2016 in Bandar Seri Begawan, Brunei Darussalam.
  • The 42nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2016). June 22-24, 2016 in İstanbul, Turkey.
  • The 12th Annual Conference on Theory and Applications of Models of Computation (TAMC 2015). May 18-20, 2015 in Singapore.

Editorial Work

  • Editor of IEICE Transactions (A) English and Japanese Editions. May 2013 - May 2017.

Membership

  • IEICE - The Institute of Electronics, Information and Communication Engineers
  • IPSJ - Information Processing Society of Japan
  • LA Symposium