Yota Otachi
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
63
Venues
19
Active years
2009–2026
Best venue rank
A*
Where they publish
Papers
63 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | IWOCA | Minimum Clique Bicoloring. | Shunsuke Hamada, Yuto Okada, Hirotaka Ono, Yota Otachi |
| 2026 | MFCS | Lower Bounds for Meta-Reconfiguration. | Kord Eickmeyer, Tatsuya Gima, Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz |
| 2026 | WALCOM | Forcing a Unique Minimum Spanning Tree and a Unique Shortest Path. | Tatsuya Gima, Yasuaki Kobayashi, Yota Otachi, Takumi Sato |
| 2026 | WALCOM | Finding a Maximum Common (Induced) Subgraph: Structural Parameters Revisited. | Tesshu Hanaka, Yuto Okada, Yota Otachi, Lena Volk |
| 2026 | WALCOM | Finding Order-Preserving Subgraphs. | Haruya Imamura, Yasuaki Kobayashi, Yota Otachi, Toshiki Saitoh, Keita Sato, Asahi Takaoka, Ryo Yoshinaka, Tom C. van der Zanden |
| 2025 | MFCS | Broadcasting Under Structural Restrictions. | Yudai Egami, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz |
| 2025 | MFCS | Parameterized Spanning Tree Congestion. | Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz |
| 2024 | WALCOM | Orientable Burning Number of Graphs. | Julien Courtiel, Paul Dorbec, Tatsuya Gima, Romain Lecoq, Yota Otachi |
| 2024 | WALCOM | Structural Parameterizations of Vertex Integrity. | Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi |
| 2024 | WALCOM | On the Complexity of List H-Packing for Sparse Graph Classes. | Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou |
| 2024 | WALCOM | Dichotomies for Tree Minor Containment with Structural Parameters. | Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi |
| 2023 | AAAI | A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. | Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi |
| 2023 | CIAC | Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond. | Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda |
| 2023 | SOFSEM | Sequentially Swapping Tokens: Further on Graph Classes. | Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi |
| 2022 | AAAI | Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study. | Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi |
| 2022 | ESA | Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. | Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi |
| 2022 | FUN | Sorting Balls and Water: Equivalence and Computational Complexity. | Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka |
| 2022 | ISAAC | Extended MSO Model Checking via Small Vertex Integrity. | Tatsuya Gima, Yota Otachi |
| 2022 | MFCS | Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets. | Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket Saurabh |
| 2022 | MFCS | Independent Set Reconfiguration on Directed Graphs. | Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa |
| 2022 | WALCOM | Reconfiguration of Regular Induced Subgraphs. | Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa |
| 2021 | AAAI | Finding Diverse Trees, Paths, and More. | Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi |
| 2021 | CIAC | Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity. | Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi |
| 2021 | COCOON | Reconfiguring Directed Trees in a Digraph. | Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa |
| 2021 | COCOON | Computational Complexity of Jumping Block Puzzles. | Masaaki Kanzaki, Yota Otachi, Ryuhei Uehara |
| 2021 | SSS | Distributed Reconfiguration of Spanning Trees. | Yukiko Yamauchi, Naoyuki Kamiyama, Yota Otachi |
| 2020 | ESA | Grundy Distinguishes Treewidth from Pathwidth. | Rmy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi |
| 2020 | ICALP | Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs. | Taisuke Izumi, Yota Otachi |
| 2020 | IWOCA | Parameterized Complexity of (A, ℓ )-Path Packing. | Rmy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi |
| 2020 | WG | Linear-Time Recognition of Double-Threshold Graphs. | Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno |
| 2019 | CIAC | Parameterized Complexity of Safe Set. | Rmy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi |
| 2019 | CIAC | Subgraph Isomorphism on Graph Classes that Exclude a Substructure. | Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden |
| 2019 | STACS | Token Sliding on Split Graphs. | Rmy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora |
| 2019 | WG | Independent Set Reconfiguration Parameterized by Modular-Width. | Rmy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi |
| 2018 | FAW | Exact Algorithms for the Max-Min Dispersion Problem. | Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa |
| 2018 | FUN | How Bad is the Freedom to Flood-It?. | Rmy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi |
| 2018 | IWOCA | Computational Complexity of Robot Arm Simulation Problems. | Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara |
| 2018 | STACS | Space-Efficient Algorithms for Longest Increasing Subsequence. | Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui |
| 2017 | COCOON | Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph. | Alessio Conte, Mamadou Moustapha Kant, Yota Otachi, Takeaki Uno, Kunihiro Wasa |
| 2016 | COCOA | Safe Sets in Graphs: Graph Classes and Structural Parameters. | Raquel gueda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu |
| 2016 | ISAAC | Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. | Hans L. Bodlaender, Hirotaka Ono, Yota Otachi |
| 2016 | ISAAC | On the Classes of Interval Graphs of Limited Nesting and Count of Lengths. | Pavel Klavk, Yota Otachi, Jir Sejnoha |
| 2015 | ISAAC | Sliding Token on Bipartite Permutation Graphs. | Eli Fox-Epstein, Duc A. Hoang, Yota Otachi, Ryuhei Uehara |
| 2015 | TAMC | Reconfiguration of Cliques in a Graph. | Takehiro Ito, Hirotaka Ono, Yota Otachi |
| 2015 | WADS | Competitive Diffusion on Weighted Graphs. | Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou |
| 2015 | WADS | Swapping Colored Tokens on Graphs. | Katsuhisa Yamanaka, Takashi Horiyama, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno |
| 2015 | WG | Induced Minor Free Graphs: Isomorphism and Clique-width. | Rmy Belmonte, Yota Otachi, Pascal Schweitzer |
| 2014 | ISAAC | Depth-First Search Using O(n) Bits. | Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara |
| 2014 | ISAAC | Polynomial-Time Algorithm for Sliding Tokens on Trees. | Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada |
| 2014 | TAMC | Intersection Dimension of Bipartite Graphs. | Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara |
| 2014 | TAMC | Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs. | Matsuo Konagaya, Yota Otachi, Ryuhei Uehara |
| 2013 | ISAAC | Bounded Representations of Interval and Proper Interval Graphs. | Martin Balko, Pavel Klavk, Yota Otachi |
| 2013 | ISAAC | Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes. | Yota Otachi, Pascal Schweitzer |
| 2013 | WALCOM | Base Location Problems for Base-Monotone Regions. | Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno |
| 2012 | ISAAC | A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks. | Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno |
| 2012 | ISAAC | Extending Partial Representations of Subclasses of Chordal Graphs. | Pavel Klavk, Jan Kratochvl, Yota Otachi, Toshiki Saitoh |
| 2012 | ISAAC | Isomorphism for Graphs of Bounded Connected-Path-Distance-Width. | Yota Otachi |
| 2011 | Algosensors | Efficient Algorithms for Network Localization Using Cores of Underlying Graphs. | Meng Li, Yota Otachi, Takeshi Tokuyama |
| 2011 | TAMC | Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. | Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno |
| 2011 | WG | Approximability of the Path-Distance-Width for AT-free Graphs. | Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki |
| 2010 | WG | Complexity Results for the Spanning Tree Congestion Problem. | Yota Otachi, Hans L. Bodlaender, Erik Jan van Leeuwen |
| 2009 | ISAAC | Random Generation and Enumeration of Bipartite Permutation Graphs. | Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara |
| 2009 | WALCOM | Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract). | Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano |