Yota Otachi - RankMe

225 papers A* 5A 6B 37C 13Misc 6Journal 148Unranked 10

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Biclique Reconfiguration in Bipartite Graphs. CoRR Yota Otachi, Emi Toyoda
2026	B	`conf`	Finding Order-Preserving Subgraphs. WALCOM Haruya Imamura, Yasuaki Kobayashi, Yota Otachi, Toshiki Saitoh, Keita Sato, Asahi Takaoka, Ryo Yoshinaka, Tom C. van der Zanden
2026	B	`conf`	Finding a Maximum Common (Induced) Subgraph: Structural Parameters Revisited. WALCOM Tesshu Hanaka, Yuto Okada, Yota Otachi, Lena Volk
2026	B	`conf`	Forcing a Unique Minimum Spanning Tree and a Unique Shortest Path. WALCOM Tatsuya Gima, Yasuaki Kobayashi, Yota Otachi, Takumi Sato
2026	J	`jnl`	Independent Set Reconfiguration on Directed Graphs. SIAM J. Discret. Math. Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
2026	J	`jnl`	On Edge-Disjoint Maximal Outerplanar Graphs. CoRR Yuto Okada, Yota Otachi, Lena Volk
2026	J	`jnl`	Sequentially swapping tokens: Further on graph classes. J. Comput. Syst. Sci. Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi
2026	J	`jnl`	Spanning tree congestion of proper interval graphs. CoRR Yota Otachi
2025	J	`jnl`	An improved spectral lower bound of treewidth. Inf. Process. Lett. Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi
2025	B	`conf`	Broadcasting Under Structural Restrictions. MFCS Yudai Egami, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz
2025	J	`jnl`	Broadcasting under Structural Restrictions. CoRR Yudai Egami, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz
2025	J	`jnl`	Dichotomies for tree minor containment with structural parameters. Theor. Comput. Sci. Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi
2025	J	`jnl`	Finding Order-Preserving Subgraphs. CoRR Haruya Imamura, Yasuaki Kobayashi, Yota Otachi, Toshiki Saitoh, Keita Sato, Asahi Takaoka, Ryo Yoshinaka, Tom C. van der Zanden
2025	J	`jnl`	Finding a Maximum Common (Induced) Subgraph: Structural Parameters Revisited. CoRR Tesshu Hanaka, Yuto Okada, Yota Otachi, Lena Volk
2025	J	`jnl`	Forcing a unique minimum spanning tree and a unique shortest path. CoRR Tatsuya Gima, Yasuaki Kobayashi, Yota Otachi, Takumi Sato
2025	J	`jnl`	Hedonic seat arrangement problems. Auton. Agents Multi Agent Syst. Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
2025	B	`conf`	Hitting Geodesic Intervals in Structurally Restricted Graphs. IPEC Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada, Yota Otachi, Hayato Takaike
2025	J	`jnl`	Hitting Geodesic Intervals in Structurally Restricted Graphs. CoRR Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada, Yota Otachi, Hayato Takaike
2025	J	`jnl`	Interval Graphs are Reconstructible. CoRR Irene Heinrich, Masashi Kiyomi, Yota Otachi, Pascal Schweitzer
2025	J	`jnl`	On the complexity of list H-packing for sparse graph classes. Theor. Comput. Sci. Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
2025	J	`jnl`	Orientable burning number of graphs. Discret. Appl. Math. Julien Courtiel, Paul Dorbec, Tatsuya Gima, Romain Lecoq, Yota Otachi
2025	B	`conf`	Parameterized Spanning Tree Congestion. MFCS Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz
2025	J	`jnl`	Structural parameterizations of vertex integrity. Theor. Comput. Sci. Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi
2024	J	`jnl`	Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. Algorithmica Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi
2024	J	`jnl`	An improved spectral lower bound of treewidth. CoRR Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi
2024	J	`jnl`	Collecting Balls on a Line by Robots with Limited Energy. IEICE Trans. Inf. Syst. Tesshu Hanaka, Nicolás Honorato Droguett, Kazuhiro Kurita, Hirotaka Ono, Yota Otachi
2024	J	`jnl`	Computational complexity of jumping block puzzles. Theor. Comput. Sci. Masaaki Kanzaki, Yota Otachi, Giovanni Viglietta, Ryuhei Uehara
2024	J	`jnl`	Computing diverse pair of solutions for tractable SAT. CoRR Tatsuya Gima, Yuni Iwamasa, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi, Rin Saito
2024	B	`conf`	Dichotomies for Tree Minor Containment with Structural Parameters. WALCOM Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi
2024	J	`jnl`	Extended MSO Model Checking via Small Vertex Integrity. Algorithmica Tatsuya Gima, Yota Otachi
2024	—	`conf`	Finding Induced Subgraphs from Graphs with Small Mim-Width. SWAT Yota Otachi, Akira Suzuki, Yuma Tamura
2024	J	`jnl`	Finding Induced Subgraphs from Graphs with Small Mim-Width. CoRR Yota Otachi, Akira Suzuki, Yuma Tamura
2024	J	`jnl`	Finding a Reconfiguration Sequence between Longest Increasing Subsequences. IEICE Trans. Inf. Syst. Yuuki Aoike, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
2024	J	`jnl`	Grouped domination parameterized by vertex cover, twin cover, and beyond. Theor. Comput. Sci. Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda
2024	J	`jnl`	On a Spectral Lower Bound of Treewidth. IEICE Trans. Inf. Syst. Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi
2024	B	`conf`	On the Complexity of List H-Packing for Sparse Graph Classes. WALCOM Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
2024	B	`conf`	Orientable Burning Number of Graphs. WALCOM Julien Courtiel, Paul Dorbec, Tatsuya Gima, Romain Lecoq, Yota Otachi
2024	J	`jnl`	Parameterized Spanning Tree Congestion. CoRR Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz
2024	B	`conf`	Structural Parameterizations of Vertex Integrity. WALCOM Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi
2023	A*	`conf`	A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. AAAI Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
2023	J	`jnl`	Dichotomies for Tree Minor Containment with Structural Parameters. CoRR Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi
2023	J	`jnl`	Finding a reconfiguration sequence between longest increasing subsequences. CoRR Yuuki Aoike, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
2023	C	`conf`	Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond. CIAC Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda
2023	J	`jnl`	Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond. CoRR Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda
2023	J	`jnl`	Minimum Consistent Subset for Trees Revisited. CoRR Hiroki Arimura, Tatsuya Gima, Yasuaki Kobayashi, Hiroomi Nochide, Yota Otachi
2023	J	`jnl`	On the complexity of list H-packing for sparse graph classes. CoRR Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
2023	J	`jnl`	Orientable Burning Number of Graphs. CoRR Julien Courtiel, Paul Dorbec, Tatsuya Gima, Romain Lecoq, Yota Otachi
2023	J	`jnl`	Reconfiguration of cliques in a graph. Discret. Appl. Math. Takehiro Ito, Hirotaka Ono, Yota Otachi
2023	J	`jnl`	Reconfiguring (non-spanning) arborescences. Theor. Comput. Sci. Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
2023	B	`conf`	Sequentially Swapping Tokens: Further on Graph Classes. SOFSEM Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi
2023	J	`jnl`	Sorting balls and water: Equivalence and computational complexity. Theor. Comput. Sci. Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
2023	J	`jnl`	Structural Parameterizations of Vertex Integrity. CoRR Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi
2022	J	`jnl`	A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. CoRR Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
2022	A	`conf`	Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. ESA Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi
2022	J	`jnl`	Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. CoRR Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi
2022	J	`jnl`	An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. Theory Comput. Syst. Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
2022	A*	`conf`	Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study. AAAI Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi
2022	J	`jnl`	Exploring the gap between treedepth and vertex cover through vertex integrity. Theor. Comput. Sci. Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
2022	B	`conf`	Extended MSO Model Checking via Small Vertex Integrity. ISAAC Tatsuya Gima, Yota Otachi
2022	J	`jnl`	Extended MSO Model Checking via Small Vertex Integrity. CoRR Tatsuya Gima, Yota Otachi
2022	J	`jnl`	Finding shortest non-separating and non-disconnecting paths. CoRR Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi
2022	J	`jnl`	Grundy Distinguishes Treewidth from Pathwidth. SIAM J. Discret. Math. Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
2022	B	`conf`	Independent Set Reconfiguration on Directed Graphs. MFCS Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
2022	J	`jnl`	Independent set reconfiguration on directed graphs. CoRR Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
2022	J	`jnl`	Linear-Time Recognition of Double-Threshold Graphs. Algorithmica Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno
2022	J	`jnl`	Parameterized Complexity of (A, ℓ )-Path Packing. Algorithmica Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
2022	J	`jnl`	Parameterized Complexity of Graph Burning. Algorithmica Yasuaki Kobayashi, Yota Otachi
2022	B	`conf`	Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets. MFCS Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket Saurabh
2022	B	`conf`	Reconfiguration of Regular Induced Subgraphs. WALCOM Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
2022	J	`jnl`	Sequentially Swapping Tokens: Further on Graph Classes. CoRR Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi
2022	Misc	`conf`	Sorting Balls and Water: Equivalence and Computational Complexity. FUN Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
2022	J	`jnl`	Sorting Balls and Water: Equivalence and Computational Complexity. CoRR Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
2021	Misc	`conf`	Computational Complexity of Jumping Block Puzzles. COCOON Masaaki Kanzaki, Yota Otachi, Ryuhei Uehara
2021	J	`jnl`	Computational Complexity of Jumping Block Puzzles. CoRR Masaaki Kanzaki, Yota Otachi, Ryuhei Uehara
2021	J	`jnl`	Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study. CoRR Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi
2021	C	`conf`	Distributed Reconfiguration of Spanning Trees. SSS Yukiko Yamauchi, Naoyuki Kamiyama, Yota Otachi
2021	C	`conf`	Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity. CIAC Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
2021	J	`jnl`	Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity. CoRR Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
2021	A*	`conf`	Finding Diverse Trees, Paths, and More. AAAI Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi
2021	J	`jnl`	Longest common subsequence in sublinear space. Inf. Process. Lett. Masashi Kiyomi, Takashi Horiyama, Yota Otachi
2021	J	`jnl`	Low-congestion shortcut and graph parameters. Distributed Comput. Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi
2021	J	`jnl`	On the security number of the Cartesian product of graphs. Discret. Appl. Math. Marko Jakovac, Yota Otachi
2021	J	`jnl`	Reconfiguration of Regular Induced Subgraphs. CoRR Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
2021	Misc	`conf`	Reconfiguring Directed Trees in a Digraph. COCOON Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
2021	J	`jnl`	Reconfiguring Directed Trees in a Digraph. CoRR Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
2021	J	`jnl`	Token Sliding on Split Graphs. Theory Comput. Syst. Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
2020	—	`conf`	A Survey on Spanning Tree Congestion. Treewidth, Kernels, and Algorithms Yota Otachi
2020	J	`jnl`	An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. CoRR Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi
2020	J	`jnl`	Efficient enumeration of maximal Theor. Comput. Sci. Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa
2020	J	`jnl`	Finding Diverse Trees, Paths, and More. CoRR Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi
2020	A	`conf`	Grundy Distinguishes Treewidth from Pathwidth. ESA Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
2020	J	`jnl`	Grundy Distinguishes Treewidth from Pathwidth. CoRR Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
2020	A	`conf`	Hedonic Seat Arrangement Problems. AAMAS Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
2020	J	`jnl`	Hedonic Seat Arrangement Problems. CoRR Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
2020	J	`jnl`	Independent Set Reconfiguration Parameterized by Modular-Width. Algorithmica Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
2020	B	`conf`	Linear-Time Recognition of Double-Threshold Graphs. WG Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno
2020	J	`jnl`	Longest Common Subsequence in Sublinear Space. CoRR Masashi Kiyomi, Takashi Horiyama, Yota Otachi
2020	C	`conf`	Parameterized Complexity of (A, ℓ )-Path Packing. IWOCA Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
2020	J	`jnl`	Parameterized Complexity of (A, 𝓁)-Path Packing. CoRR Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
2020	B	`conf`	Parameterized Complexity of Graph Burning. IPEC Yasuaki Kobayashi, Yota Otachi
2020	J	`jnl`	Parameterized Complexity of Graph Burning. CoRR Yasuaki Kobayashi, Yota Otachi
2020	J	`jnl`	Parameterized Complexity of Safe Set. J. Graph Algorithms Appl. Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
2020	J	`jnl`	Parameterized Orientable Deletion. Algorithmica Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
2020	J	`jnl`	Space-Efficient Algorithms for Longest Increasing Subsequence. Theory Comput. Syst. Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui
2020	J	`jnl`	Subgraph Isomorphism on Graph Classes that Exclude a Substructure. Algorithmica Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
2020	A*	`conf`	Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs. ICALP Taisuke Izumi, Yota Otachi
2020	J	`jnl`	Symmetric assembly puzzles are hard, beyond a few pieces. Comput. Geom. Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno
2019	J	`jnl`	A lower bound on opaque sets. Comput. Geom. Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach
2019	J	`jnl`	How Bad is the Freedom to Flood-It? J. Graph Algorithms Appl. Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi
2019	B	`conf`	Independent Set Reconfiguration Parameterized by Modular-Width. WG Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
2019	J	`jnl`	Independent Set Reconfiguration Parameterized by Modular-Width. CoRR Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
2019	J	`jnl`	Linear-Time Recognition of Double-Threshold Graphs. CoRR Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno
2019	A	`conf`	Low-Congestion Shortcut and Graph Parameters. DISC Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi
2019	J	`jnl`	Low-Congestion Shortcut and Graph Parameters. CoRR Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi
2019	J	`jnl`	On Computational Complexity of Pipe Puzzles. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Takumu Shirayama, Takuto Shigemura, Yota Otachi, Shuichi Miyazaki, Ryuhei Uehara
2019	J	`jnl`	On structural parameterizations of firefighting. Theor. Comput. Sci. Bireswar Das, Murali Krishna Enduri, Masashi Kiyomi, Neeldhara Misra, Yota Otachi, I. Vinod Reddy, Shunya Yoshimura
2019	J	`jnl`	On the Classes of Interval Graphs of Limited Nesting and Count of Lengths. Algorithmica Pavel Klavík, Yota Otachi, Jirí Sejnoha
2019	C	`conf`	Parameterized Complexity of Safe Set. CIAC Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
2019	J	`jnl`	Parameterized Complexity of Safe Set. CoRR Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
2019	J	`jnl`	Reconfiguration of colorable sets in classes of perfect graphs. Theor. Comput. Sci. Takehiro Ito, Yota Otachi
2019	C	`conf`	Subgraph Isomorphism on Graph Classes that Exclude a Substructure. CIAC Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
2019	J	`jnl`	Subgraph Isomorphism on Graph Classes that Exclude a Substructure. CoRR Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
2019	A	`conf`	Token Sliding on Split Graphs. STACS Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
2018	J	`jnl`	A faster parameterized algorithm for Pseudoforest Deletion. Discret. Appl. Math. Hans L. Bodlaender, Hirotaka Ono, Yota Otachi
2018	C	`conf`	Computational Complexity of Robot Arm Simulation Problems. IWOCA Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara
2018	J	`jnl`	Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. Algorithmica Hans L. Bodlaender, Hirotaka Ono, Yota Otachi
2018	Misc	`conf`	Exact Algorithms for the Max-Min Dispersion Problem. FAW Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
2018	J	`jnl`	How Bad is the Freedom to Flood-It? CoRR Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi
2018	Misc	`conf`	How Bad is the Freedom to Flood-It?. FUN Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi
2018	J	`jnl`	Induced Minor Free Graphs: Isomorphism and Clique-Width. Algorithmica Rémy Belmonte, Yota Otachi, Pascal Schweitzer
2018	—	`conf`	Parameterized Orientable Deletion. SWAT Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
2018	J	`jnl`	Parameterized Orientable Deletion. CoRR Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora
2018	—	`conf`	Reconfiguration of Colorable Sets in Classes of Perfect Graphs. SWAT Takehiro Ito, Yota Otachi
2018	J	`jnl`	Reconfiguration of Colorable Sets in Classes of Perfect Graphs. CoRR Takehiro Ito, Yota Otachi
2018	J	`jnl`	Safe sets in graphs: Graph classes and structural parameters. J. Comb. Optim. Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Hirotaka Ono, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu
2018	A	`conf`	Space-Efficient Algorithms for Longest Increasing Subsequence. STACS Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui
2018	J	`jnl`	Swapping Colored Tokens on Graphs. CoRR Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
2018	J	`jnl`	Swapping colored tokens on graphs. Theor. Comput. Sci. Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
2018	J	`jnl`	Token Sliding on Split Graphs. CoRR Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
2018	J	`jnl`	Vertex deletion problems on chordal graphs. Theor. Comput. Sci. Yixin Cao, Yuping Ke, Yota Otachi, Jie You
2017	J	`jnl`	Alliances in graphs of bounded clique-width. Discret. Appl. Math. Masashi Kiyomi, Yota Otachi
2017	Misc	`conf`	Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph. COCOON Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa
2017	J	`jnl`	Extending Partial Representations of Interval Graphs. Algorithmica Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh, Tomás Vyskocil
2017	J	`jnl`	Extending Partial Representations of Proper and Unit Interval Graphs. Algorithmica Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil
2017	J	`jnl`	Ferrers dimension of grid intersection graphs. Discret. Appl. Math. Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara
2017	J	`jnl`	Hitori Numbers. J. Inf. Process. Akira Suzuki, Masashi Kiyomi, Yota Otachi, Kei Uchizawa, Takeaki Uno
2017	J	`jnl`	Space-Efficient Algorithms for Longest Increasing Subsequence. CoRR Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui
2017	J	`jnl`	Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces. CoRR Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno
2017	J	`jnl`	Thin strip graphs. Discret. Appl. Math. Takashi Hayashi, Akitoshi Kawamura, Yota Otachi, Hidehiro Shinohara, Koichi Yamazaki
2017	—	`conf`	Vertex Deletion Problems on Chordal Graphs. FSTTCS Yixin Cao, Yuping Ke, Yota Otachi, Jie You
2017	J	`jnl`	Vertex Deletion Problems on Chordal Graphs. CoRR Yixin Cao, Yuping Ke, Yota Otachi, Jie You
2016	B	`conf`	A Faster Parameterized Algorithm for Pseudoforest Deletion. IPEC Hans L. Bodlaender, Hirotaka Ono, Yota Otachi
2016	A*	`conf`	A Lower Bound on Opaque Sets. SoCG Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach
2016	J	`jnl`	A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares. Comput. Geom. Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2016	B	`conf`	Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. ISAAC Hans L. Bodlaender, Hirotaka Ono, Yota Otachi
2016	J	`jnl`	Finding a chain graph in a bipartite permutation graph. Inf. Process. Lett. Masashi Kiyomi, Yota Otachi
2016	J	`jnl`	Induced Minor Free Graphs: Isomorphism and Clique-width. CoRR Rémy Belmonte, Yota Otachi, Pascal Schweitzer
2016	B	`conf`	On the Classes of Interval Graphs of Limited Nesting and Count of Lengths. ISAAC Pavel Klavík, Yota Otachi, Jirí Sejnoha
2016	J	`jnl`	On the treewidth of toroidal grids. Discret. Appl. Math. Masashi Kiyomi, Yoshio Okamoto, Yota Otachi
2016	J	`jnl`	Polynomial-time algorithms for Subgraph Isomorphism in small graph classes of perfect graphs. Discret. Appl. Math. Matsuo Konagaya, Yota Otachi, Ryuhei Uehara
2016	C	`conf`	Safe Sets in Graphs: Graph Classes and Structural Parameters. COCOA Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu
2015	B	`conf`	Competitive Diffusion on Weighted Graphs. WADS Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou
2015	J	`jnl`	Completely independent spanning trees in (partial) Discuss. Math. Graph Theory Toru Araki, Masayoshi Matsushita, Yota Otachi
2015	J	`jnl`	Extending partial representations of subclasses of chordal graphs. Theor. Comput. Sci. Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh
2015	B	`conf`	Induced Minor Free Graphs: Isomorphism and Clique-width. WG Rémy Belmonte, Yota Otachi, Pascal Schweitzer
2015	J	`jnl`	Linear-time algorithm for sliding tokens on trees. Theor. Comput. Sci. Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada
2015	J	`jnl`	On the Classes of Interval Graphs of Limited Nesting and Count of Lengths. CoRR Pavel Klavík, Yota Otachi, Jirí Sejnoha
2015	C	`conf`	Reconfiguration of Cliques in a Graph. TAMC Takehiro Ito, Hirotaka Ono, Yota Otachi
2015	J	`jnl`	Secure Sets and Defensive Alliances in Graphs: A Faster Algorithm and Improved Bounds. IEICE Trans. Inf. Syst. Kazuyuki Amano, Kyaw May Oo, Yota Otachi, Ryuhei Uehara
2015	B	`conf`	Sliding Token on Bipartite Permutation Graphs. ISAAC Eli Fox-Epstein, Duc A. Hoang, Yota Otachi, Ryuhei Uehara
2015	B	`conf`	Swapping Colored Tokens on Graphs. WADS Katsuhisa Yamanaka, Takashi Horiyama, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
2015	—	`conf`	Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces. JCDCGG Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno
2014	J	`jnl`	A 4.31-approximation for the geometric unique coverage problem on unit disks. Theor. Comput. Sci. Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2014	J	`jnl`	A lower bound on opaque sets. CoRR Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach
2014	J	`jnl`	Approximating the path-distance-width for AT-free graphs and graphs in related classes. Discret. Appl. Math. Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki
2014	J	`jnl`	Base-object location problems for base-monotone regions. Theor. Comput. Sci. Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno
2014	J	`jnl`	Computational Complexity of Competitive Diffusion on (Un)weighted Graphs. CoRR Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou
2014	B	`conf`	Depth-First Search Using O(n) Bits. ISAAC Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara
2014	J	`jnl`	Efficient algorithms for network localization using cores of underlying graphs. Theor. Comput. Sci. Meng Li, Yota Otachi, Takeshi Tokuyama
2014	—	`conf`	Extending Partial Representations of Proper and Unit Interval Graphs. SWAT Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil
2014	C	`conf`	Intersection Dimension of Bipartite Graphs. TAMC Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara
2014	J	`jnl`	Lower bounds for treewidth of product graphs. Discret. Appl. Math. Kyohei Kozawa, Yota Otachi, Koichi Yamazaki
2014	B	`conf`	Polynomial-Time Algorithm for Sliding Tokens on Trees. ISAAC Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada
2014	J	`jnl`	Polynomial-Time Algorithm for Sliding Tokens on Trees. CoRR Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada
2014	C	`conf`	Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs. TAMC Matsuo Konagaya, Yota Otachi, Ryuhei Uehara
2014	J	`jnl`	Reconfiguration of Cliques in a Graph. CoRR Takehiro Ito, Hirotaka Ono, Yota Otachi
2014	—	`conf`	Reduction Techniques for Graph Isomorphism in the Context of Width Parameters. SWAT Yota Otachi, Pascal Schweitzer
2014	J	`jnl`	Reduction Techniques for Graph Isomorphism in the Context of Width Parameters. CoRR Yota Otachi, Pascal Schweitzer
2013	B	`conf`	Base Location Problems for Base-Monotone Regions. WALCOM Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno
2013	B	`conf`	Bounded Representations of Interval and Proper Interval Graphs. ISAAC Martin Balko, Pavel Klavík, Yota Otachi
2013	J	`jnl`	Bounded Representations of Interval and Proper Interval Graphs. CoRR Martin Balko, Pavel Klavík, Yota Otachi
2013	B	`conf`	Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes. ISAAC Yota Otachi, Pascal Schweitzer
2013	J	`jnl`	Linear-time Algorithm for Partial Representation Extension of Interval Graphs. CoRR Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh, Tomás Vyskocil
2013	J	`jnl`	The path-distance-width of hypercubes. Discuss. Math. Graph Theory Yota Otachi
2012	B	`conf`	A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks. ISAAC Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2012	—	`conf`	A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares. SWAT Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2012	J	`jnl`	Efficient enumeration of ordered trees with k leaves. Theor. Comput. Sci. Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano
2012	J	`jnl`	Enumerating All Rooted Trees Including IEICE Trans. Inf. Syst. Masanobu Ishikawa, Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano
2012	J	`jnl`	Extending Partial Representations of Proper and Unit Interval Graphs CoRR Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil
2012	J	`jnl`	Extending Partial Representations of Subclasses of Chordal Graphs CoRR Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh
2012	B	`conf`	Extending Partial Representations of Subclasses of Chordal Graphs. ISAAC Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh
2012	B	`conf`	Isomorphism for Graphs of Bounded Connected-Path-Distance-Width. ISAAC Yota Otachi
2012	—	`conf`	On Complexity of Flooding Games on Graphs with Interval Representations. TJJCCGG Hiroyuki Fukui, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2012	J	`jnl`	On bipartite powers of bigraphs. Discret. Math. Theor. Comput. Sci. Yoshio Okamoto, Yota Otachi, Ryuhei Uehara
2012	J	`jnl`	Parameterized Complexity of the Spanning Tree Congestion Problem. Algorithmica Hans L. Bodlaender, Fedor V. Fomin, Petr A. Golovach, Yota Otachi, Erik Jan van Leeuwen
2012	J	`jnl`	Random generation and enumeration of bipartite permutation graphs. J. Discrete Algorithms Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara
2012	J	`jnl`	Subgraph isomorphism in graph classes. Discret. Math. Shuji Kijima, Yota Otachi, Toshiki Saitoh, Takeaki Uno
2011	B	`conf`	Approximability of the Path-Distance-Width for AT-free Graphs. WG Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki
2011	J	`jnl`	Bandwidth and pathwidth of three-dimensional grids CoRR Yota Otachi, Ryohei Suda
2011	J	`jnl`	Bandwidth and pathwidth of three-dimensional grids. Discret. Math. Yota Otachi, Ryohei Suda
2011	C	`conf`	Efficient Algorithms for Network Localization Using Cores of Underlying Graphs. ALGOSENSORS Meng Li, Yota Otachi, Takeshi Tokuyama
2011	C	`conf`	Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. TAMC Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno
2011	J	`jnl`	Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. J. Graph Algorithms Appl. Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno
2011	J	`jnl`	On spanning tree congestion of Hamming graphs CoRR Kyohei Kozawa, Yota Otachi
2011	J	`jnl`	Spanning tree congestion of k-outerplanar graphs. Discret. Math. Hans L. Bodlaender, Kyohei Kozawa, Takayoshi Matsushima, Yota Otachi
2011	J	`jnl`	Spanning tree congestion of rook's graphs. Discuss. Math. Graph Theory Kyohei Kozawa, Yota Otachi
2010	B	`conf`	Complexity Results for the Spanning Tree Congestion Problem. WG Yota Otachi, Hans L. Bodlaender, Erik Jan van Leeuwen
2010	J	`jnl`	The carving-width of generalized hypercubes. Discret. Math. Kyohei Kozawa, Yota Otachi, Koichi Yamazaki
2009	B	`conf`	Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract). WALCOM Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano
2009	J	`jnl`	On spanning tree congestion of graphs. Discret. Math. Kyohei Kozawa, Yota Otachi, Koichi Yamazaki
2009	B	`conf`	Random Generation and Enumeration of Bipartite Permutation Graphs. ISAAC Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara
2009	J	`jnl`	Security number of grid-like graphs. Discret. Appl. Math. Kyohei Kozawa, Yota Otachi, Koichi Yamazaki
2008	J	`jnl`	A lower bound for the vertex boundary-width of complete k-ary trees. Discret. Math. Yota Otachi, Koichi Yamazaki
2008	J	`jnl`	An improved algorithm for the longest induced path problem on k-chordal graphs. Discret. Appl. Math. Tetsuya Ishizeki, Yota Otachi, Koichi Yamazaki
2007	J	`jnl`	Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs. Discret. Appl. Math. Yota Otachi, Yoshio Okamoto, Koichi Yamazaki