Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs. - Yota Otachi; Yoshio Okamoto; Koichi Yamazaki (Discret. Appl. Math., 2007)

An improved algorithm for the longest induced path problem on k-chordal graphs. - Tetsuya Ishizeki; Yota Otachi; Koichi Yamazaki (Discret. Appl. Math., 2008)

A lower bound for the vertex boundary-width of complete k-ary trees. - Yota Otachi; Koichi Yamazaki (Discret. Math., 2008)

Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract). - Katsuhisa Yamanaka; Yota Otachi; Shin-Ichi Nakano (WALCOM, 2009)

Security number of grid-like graphs. - Kyohei Kozawa; Yota Otachi; Koichi Yamazaki (Discret. Appl. Math., 2009)

On spanning tree congestion of graphs. - Kyohei Kozawa; Yota Otachi; Koichi Yamazaki (Discret. Math., 2009)

Complexity Results for the Spanning Tree Congestion Problem. - Yota Otachi; Hans L. Bodlaender; Erik Jan van Leeuwen (WG, 2010)

The carving-width of generalized hypercubes. - Kyohei Kozawa; Yota Otachi; Koichi Yamazaki (Discret. Math., 2010)

Approximability of the Path-Distance-Width for AT-free Graphs. - Yota Otachi; Toshiki Saitoh; Katsuhisa Yamanaka; Shuji Kijima; Yoshio Okamoto; Hirotaka Ono 001; Yushi Uno; Koichi Yamazaki (WG, 2011)

On spanning tree congestion of Hamming graphs - Kyohei Kozawa; Yota Otachi (CoRR, 2011)

Spanning tree congestion of k-outerplanar graphs. - Hans L. Bodlaender; Kyohei Kozawa; Takayoshi Matsushima; Yota Otachi (Discret. Math., 2011)

Bandwidth and pathwidth of three-dimensional grids. - Yota Otachi; Ryohei Suda (Discret. Math., 2011)

Spanning tree congestion of rook's graphs. - Kyohei Kozawa; Yota Otachi (Discuss. Math. Graph Theory, 2011)

Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. - Yoshio Okamoto; Yota Otachi; Ryuhei Uehara; Takeaki Uno (J. Graph Algorithms Appl., 2011)

Isomorphism for Graphs of Bounded Connected-Path-Distance-Width. - Yota Otachi (ISAAC, 2012)

On Complexity of Flooding Games on Graphs with Interval Representations. - Hiroyuki Fukui; Yota Otachi; Ryuhei Uehara; Takeaki Uno; Yushi Uno (TJJCCGG, 2012)

Parameterized Complexity of the Spanning Tree Congestion Problem. - Hans L. Bodlaender; Fedor V. Fomin; Petr A. Golovach; Yota Otachi; Erik Jan van Leeuwen (Algorithmica, 2012)

Subgraph isomorphism in graph classes. - Shuji Kijima; Yota Otachi; Toshiki Saitoh; Takeaki Uno (Discret. Math., 2012)

On bipartite powers of bigraphs. - Yoshio Okamoto; Yota Otachi; Ryuhei Uehara (Discret. Math. Theor. Comput. Sci., 2012)

Enumerating All Rooted Trees Including k Leaves. - Masanobu Ishikawa; Katsuhisa Yamanaka; Yota Otachi; Shin-Ichi Nakano (IEICE Trans. Inf. Syst., 2012)

Random generation and enumeration of bipartite permutation graphs. - Toshiki Saitoh; Yota Otachi; Katsuhisa Yamanaka; Ryuhei Uehara (J. Discrete Algorithms, 2012)

Efficient enumeration of ordered trees with k leaves. - Katsuhisa Yamanaka; Yota Otachi; Shin-Ichi Nakano (Theor. Comput. Sci., 2012)

Bounded Representations of Interval and Proper Interval Graphs. - Martin Balko; Pavel Klavík; Yota Otachi (ISAAC, 2013)

Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes. - Yota Otachi; Pascal Schweitzer (ISAAC, 2013)

Base Location Problems for Base-Monotone Regions. - Jinhee Chun; Takashi Horiyama; Takehiro Ito; Natsuda Kaothanthong; Hirotaka Ono 001; Yota Otachi; Takeshi Tokuyama; Ryuhei Uehara; Takeaki Uno (WALCOM, 2013)

Linear-time Algorithm for Partial Representation Extension of Interval Graphs. - Pavel Klavík; Jan Kratochvíl; Yota Otachi; Toshiki Saitoh; Tomás Vyskocil (CoRR, 2013)

The path-distance-width of hypercubes. - Yota Otachi (Discuss. Math. Graph Theory, 2013)

Depth-First Search Using O(n) Bits. - Tetsuo Asano; Taisuke Izumi; Masashi Kiyomi; Matsuo Konagaya; Hirotaka Ono 001; Yota Otachi; Pascal Schweitzer; Jun Tarui; Ryuhei Uehara (ISAAC, 2014)

Polynomial-Time Algorithm for Sliding Tokens on Trees. - Erik D. Demaine; Martin L. Demaine; Eli Fox-Epstein; Duc A. Hoang 001; Takehiro Ito; Hirotaka Ono 001; Yota Otachi; Ryuhei Uehara; Takeshi Yamada (ISAAC, 2014)

Reduction Techniques for Graph Isomorphism in the Context of Width Parameters. - Yota Otachi; Pascal Schweitzer (SWAT, 2014)

Intersection Dimension of Bipartite Graphs. - Steven Chaplick; Pavol Hell; Yota Otachi; Toshiki Saitoh; Ryuhei Uehara (TAMC, 2014)

Computational Complexity of Competitive Diffusion on (Un)weighted Graphs. - Takehiro Ito; Yota Otachi; Toshiki Saitoh; Hisayuki Satoh; Akira Suzuki 001; Kei Uchizawa; Ryuhei Uehara; Katsuhisa Yamanaka; Xiao Zhou 001 (CoRR, 2014)

Lower bounds for treewidth of product graphs. - Kyohei Kozawa; Yota Otachi; Koichi Yamazaki (Discret. Appl. Math., 2014)

Approximating the path-distance-width for AT-free graphs and graphs in related classes. - Yota Otachi; Toshiki Saitoh; Katsuhisa Yamanaka; Shuji Kijima; Yoshio Okamoto; Hirotaka Ono 001; Yushi Uno; Koichi Yamazaki (Discret. Appl. Math., 2014)

Base-object location problems for base-monotone regions. - Jinhee Chun; Takashi Horiyama; Takehiro Ito; Natsuda Kaothanthong; Hirotaka Ono 001; Yota Otachi; Takeshi Tokuyama; Ryuhei Uehara; Takeaki Uno (Theor. Comput. Sci., 2014)

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 (Theor. Comput. Sci., 2014)

Efficient algorithms for network localization using cores of underlying graphs. - Meng Li; Yota Otachi; Takeshi Tokuyama (Theor. Comput. Sci., 2014)

Sliding Token on Bipartite Permutation Graphs. - Eli Fox-Epstein; Duc A. Hoang 001; Yota Otachi; Ryuhei Uehara (ISAAC, 2015)

Competitive Diffusion on Weighted Graphs. - Takehiro Ito; Yota Otachi; Toshiki Saitoh; Hisayuki Satoh; Akira Suzuki 001; Kei Uchizawa; Ryuhei Uehara; Katsuhisa Yamanaka; Xiao Zhou 001 (WADS, 2015)

Swapping Colored Tokens on Graphs. - Katsuhisa Yamanaka; Takashi Horiyama; David G. Kirkpatrick; Yota Otachi; Toshiki Saitoh; Ryuhei Uehara; Yushi Uno (WADS, 2015)

Completely independent spanning trees in (partial) k-trees. - Toru Araki; Masayoshi Matsushita; Yota Otachi (Discuss. Math. Graph Theory, 2015)

Secure Sets and Defensive Alliances in Graphs: A Faster Algorithm and Improved Bounds. - Kazuyuki Amano; Kyaw May Oo; Yota Otachi; Ryuhei Uehara (IEICE Trans. Inf. Syst., 2015)

Linear-time algorithm for sliding tokens on trees. - Erik D. Demaine; Martin L. Demaine; Eli Fox-Epstein; Duc A. Hoang 001; Takehiro Ito; Hirotaka Ono 001; Yota Otachi; Ryuhei Uehara; Takeshi Yamada (Theor. Comput. Sci., 2015)

Extending partial representations of subclasses of chordal graphs. - Pavel Klavík; Jan Kratochvíl; Yota Otachi; Toshiki Saitoh (Theor. Comput. Sci., 2015)

Safe Sets in Graphs: Graph Classes and Structural Parameters. - Raquel Águeda; Nathann Cohen; Shinya Fujita 001; Sylvain Legay; Yannis Manoussakis; Yasuko Matsui; Leandro Montero; Reza Naserasr; Yota Otachi; Tadashi Sakuma; Zsolt Tuza; Renyu Xu (COCOA, 2016)

A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares. - Takehiro Ito; Shin-Ichi Nakano; Yoshio Okamoto; Yota Otachi; Ryuhei Uehara; Takeaki Uno; Yushi Uno (Comput. Geom., 2016)

On the treewidth of toroidal grids. - Masashi Kiyomi; Yoshio Okamoto; Yota Otachi (Discret. Appl. Math., 2016)

Polynomial-time algorithms for Subgraph Isomorphism in small graph classes of perfect graphs. - Matsuo Konagaya; Yota Otachi; Ryuhei Uehara (Discret. Appl. Math., 2016)

Finding a chain graph in a bipartite permutation graph. - Masashi Kiyomi; Yota Otachi (Inf. Process. Lett., 2016)

Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph. - Alessio Conte; Mamadou Moustapha Kanté; Yota Otachi; Takeaki Uno; Kunihiro Wasa (COCOON, 2017)

Extending Partial Representations of Proper and Unit Interval Graphs. - Pavel Klavík; Jan Kratochvíl; Yota Otachi; Ignaz Rutter; Toshiki Saitoh; Maria Saumell; Tomás Vyskocil (Algorithmica, 2017)

Extending Partial Representations of Interval Graphs. - Pavel Klavík; Jan Kratochvíl; Yota Otachi; Toshiki Saitoh; Tomás Vyskocil (Algorithmica, 2017)

Ferrers dimension of grid intersection graphs. - Steven Chaplick; Pavol Hell; Yota Otachi; Toshiki Saitoh; Ryuhei Uehara (Discret. Appl. Math., 2017)

Thin strip graphs. - Takashi Hayashi 002; Akitoshi Kawamura; Yota Otachi; Hidehiro Shinohara; Koichi Yamazaki (Discret. Appl. Math., 2017)

Alliances in graphs of bounded clique-width. - Masashi Kiyomi; Yota Otachi (Discret. Appl. Math., 2017)

Hitori Numbers. - Akira Suzuki 001; Masashi Kiyomi; Yota Otachi; Kei Uchizawa; Takeaki Uno (J. Inf. Process., 2017)

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 (FAW, 2018)

Computational Complexity of Robot Arm Simulation Problems. - Tianfeng Feng; Takashi Horiyama; Yoshio Okamoto; Yota Otachi; Toshiki Saitoh; Takeaki Uno; Ryuhei Uehara (IWOCA, 2018)

Induced Minor Free Graphs: Isomorphism and Clique-Width. - Rémy Belmonte; Yota Otachi; Pascal Schweitzer (Algorithmica, 2018)

Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. - Hans L. Bodlaender; Hirotaka Ono 001; Yota Otachi (Algorithmica, 2018)

A faster parameterized algorithm for Pseudoforest Deletion. - Hans L. Bodlaender; Hirotaka Ono 001; Yota Otachi (Discret. Appl. Math., 2018)

Safe sets in graphs: Graph classes and structural parameters. - Raquel Águeda; Nathann Cohen; Shinya Fujita 001; Sylvain Legay; Yannis Manoussakis; Yasuko Matsui; Leandro Montero; Reza Naserasr; Hirotaka Ono 001; Yota Otachi; Tadashi Sakuma; Zsolt Tuza; et al. (J. Comb. Optim., 2018)

Vertex deletion problems on chordal graphs. - Yixin Cao 001; Yuping Ke; Yota Otachi; Jie You (Theor. Comput. Sci., 2018)

Swapping colored tokens on graphs. - Katsuhisa Yamanaka; Takashi Horiyama; J. Mark Keil; David G. Kirkpatrick; Yota Otachi; Toshiki Saitoh; Ryuhei Uehara; Yushi Uno (Theor. Comput. Sci., 2018)

Subgraph Isomorphism on Graph Classes that Exclude a Substructure. - Hans L. Bodlaender; Tesshu Hanaka; Yoshio Okamoto; Yota Otachi; Tom C. van der Zanden (CIAC, 2019)

On the Classes of Interval Graphs of Limited Nesting and Count of Lengths. - Pavel Klavík; Yota Otachi; Jirí Sejnoha (Algorithmica, 2019)

A lower bound on opaque sets. - Akitoshi Kawamura; Sonoko Moriyama; Yota Otachi; János Pach (Comput. Geom., 2019)

On Computational Complexity of Pipe Puzzles. - Takumu Shirayama; Takuto Shigemura; Yota Otachi; Shuichi Miyazaki; Ryuhei Uehara (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019)

How Bad is the Freedom to Flood-It? - Rémy Belmonte; Mehdi Khosravian Ghadikolaei; Masashi Kiyomi; Michael Lampis; Yota Otachi (J. Graph Algorithms Appl., 2019)

On structural parameterizations of firefighting. - Bireswar Das; Murali Krishna Enduri; Masashi Kiyomi; Neeldhara Misra; Yota Otachi; I. Vinod Reddy; Shunya Yoshimura (Theor. Comput. Sci., 2019)

Reconfiguration of colorable sets in classes of perfect graphs. - Takehiro Ito; Yota Otachi (Theor. Comput. Sci., 2019)

A Survey on Spanning Tree Congestion. - Yota Otachi (Treewidth, Kernels, and Algorithms, 2020)

Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs. - Taisuke Izumi; Yota Otachi (ICALP, 2020)

Independent Set Reconfiguration Parameterized by Modular-Width. - Rémy Belmonte; Tesshu Hanaka; Michael Lampis; Hirotaka Ono 001; Yota Otachi (Algorithmica, 2020)

Subgraph Isomorphism on Graph Classes that Exclude a Substructure. - Hans L. Bodlaender; Tesshu Hanaka; Yasuaki Kobayashi; Yusuke Kobayashi 001; Yoshio Okamoto; Yota Otachi; Tom C. van der Zanden (Algorithmica, 2020)

Parameterized Orientable Deletion. - Tesshu Hanaka; Ioannis Katsikarelis; Michael Lampis; Yota Otachi; Florian Sikora (Algorithmica, 2020)

Symmetric assembly puzzles are hard, beyond a few pieces. - Erik D. Demaine; Matias Korman; Jason S. Ku; Joseph S. B. Mitchell; Yota Otachi; André van Renssen; Marcel Roeloffzen; Ryuhei Uehara; Yushi Uno (Comput. Geom., 2020)

Parameterized Complexity of Safe Set. - Rémy Belmonte; Tesshu Hanaka; Ioannis Katsikarelis; Michael Lampis; Hirotaka Ono 001; Yota Otachi (J. Graph Algorithms Appl., 2020)

K3 Edge Cover Problem in a Wide Sense. - Kyohei Chiba; Rémy Belmonte; Hiro Ito; Michael Lampis; Atsuki Nagao; Yota Otachi (J. Inf. Process., 2020)

Space-Efficient Algorithms for Longest Increasing Subsequence. - Masashi Kiyomi; Hirotaka Ono 001; Yota Otachi; Pascal Schweitzer; Jun Tarui (Theory Comput. Syst., 2020)

Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph. - Alessio Conte; Mamadou Moustapha Kanté; Yota Otachi; Takeaki Uno; Kunihiro Wasa (Theor. Comput. Sci., 2020)

Finding Diverse Trees, Paths, and More. - Tesshu Hanaka; Yasuaki Kobayashi; Kazuhiro Kurita; Yota Otachi (AAAI, 2021)

Reconfiguring Directed Trees in a Digraph. - Takehiro Ito; Yuni Iwamasa; Yasuaki Kobayashi; Yu Nakahata; Yota Otachi; Kunihiro Wasa (COCOON, 2021)

Computational Complexity of Jumping Block Puzzles. - Masaaki Kanzaki; Yota Otachi; Ryuhei Uehara (COCOON, 2021)

Distributed Reconfiguration of Spanning Trees. - Yukiko Yamauchi; Naoyuki Kamiyama; Yota Otachi (SSS, 2021)

On the security number of the Cartesian product of graphs. - Marko Jakovac; Yota Otachi (Discret. Appl. Math., 2021)

Low-congestion shortcut and graph parameters. - Naoki Kitamura; Hirotaka Kitagawa; Yota Otachi; Taisuke Izumi (Distributed Comput., 2021)

Longest common subsequence in sublinear space. - Masashi Kiyomi; Takashi Horiyama; Yota Otachi (Inf. Process. Lett., 2021)

Token Sliding on Split Graphs. - Rémy Belmonte; Eun Jung Kim 002; Michael Lampis; Valia Mitsou; Yota Otachi; Florian Sikora (Theory Comput. Syst., 2021)

Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study. - Tesshu Hanaka; Yasuaki Kobayashi; Kazuhiro Kurita; See Woo Lee; Yota Otachi (AAAI, 2022)

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 001 (MFCS, 2022)

Independent Set Reconfiguration on Directed Graphs. - Takehiro Ito; Yuni Iwamasa; Yasuaki Kobayashi; Yu Nakahata; Yota Otachi; Masahiro Takahashi; Kunihiro Wasa (MFCS, 2022)

Reconfiguration of Regular Induced Subgraphs. - Hiroshi Eto; Takehiro Ito; Yasuaki Kobayashi; Yota Otachi; Kunihiro Wasa (WALCOM, 2022)

Parameterized Complexity of (A, ℓ )-Path Packing. - Rémy Belmonte; Tesshu Hanaka; Masaaki Kanzaki; Masashi Kiyomi; Yasuaki Kobayashi; Yusuke Kobayashi 001; Michael Lampis; Hirotaka Ono 001; Yota Otachi (Algorithmica, 2022)

Parameterized Complexity of Graph Burning. - Yasuaki Kobayashi; Yota Otachi (Algorithmica, 2022)

Linear-Time Recognition of Double-Threshold Graphs. - Yusuke Kobayashi 001; Yoshio Okamoto; Yota Otachi; Yushi Uno (Algorithmica, 2022)

Finding shortest non-separating and non-disconnecting paths. - Yasuaki Kobayashi; Shunsuke Nagano; Yota Otachi (CoRR, 2022)

An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion. - Yuuki Aoike; Tatsuya Gima; Tesshu Hanaka; Masashi Kiyomi; Yasuaki Kobayashi; Yusuke Kobayashi 001; Kazuhiro Kurita; Yota Otachi (Theory Comput. Syst., 2022)

Exploring the gap between treedepth and vertex cover through vertex integrity. - Tatsuya Gima; Tesshu Hanaka; Masashi Kiyomi; Yasuaki Kobayashi; Yota Otachi (Theor. Comput. Sci., 2022)

Grundy Distinguishes Treewidth from Pathwidth. - Rémy Belmonte; Eun Jung Kim 002; Michael Lampis; Valia Mitsou; Yota Otachi (SIAM J. Discret. Math., 2022)

A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems. - Tesshu Hanaka; Masashi Kiyomi; Yasuaki Kobayashi; Yusuke Kobayashi 001; Kazuhiro Kurita; Yota Otachi (AAAI, 2023)

Minimum Consistent Subset for Trees Revisited. - Hiroki Arimura; Tatsuya Gima; Yasuaki Kobayashi; Hiroomi Nochide; Yota Otachi (CoRR, 2023)

Reconfiguring (non-spanning) arborescences. - Takehiro Ito; Yuni Iwamasa; Yasuaki Kobayashi; Yu Nakahata; Yota Otachi; Kunihiro Wasa (Theor. Comput. Sci., 2023)

Reconfiguration of cliques in a graph. - Takehiro Ito; Hirotaka Ono 001; Yota Otachi (Discret. Appl. Math., 2023)

Sorting balls and water: Equivalence and computational complexity. - Takehiro Ito; Jun Kawahara; Shin-ichi Minato; Yota Otachi; Toshiki Saitoh; Akira Suzuki 001; Ryuhei Uehara; Takeaki Uno; Katsuhisa Yamanaka; Ryo Yoshinaka (Theor. Comput. Sci., 2023)

Finding Induced Subgraphs from Graphs with Small Mim-Width. - Yota Otachi; Akira Suzuki 001; Yuma Tamura (SWAT, 2024)

Computing diverse pair of solutions for tractable SAT. - Tatsuya Gima; Yuni Iwamasa; Yasuaki Kobayashi; Kazuhiro Kurita; Yota Otachi; Rin Saito (CoRR, 2024)

Finding a Reconfiguration Sequence between Longest Increasing Subsequences. - Yuuki Aoike; Masashi Kiyomi; Yasuaki Kobayashi; Yota Otachi (IEICE Trans. Inf. Syst., 2024)

On a Spectral Lower Bound of Treewidth. - Tatsuya Gima; Tesshu Hanaka; Kohei Noro; Hirotaka Ono 001; Yota Otachi (IEICE Trans. Inf. Syst., 2024)

Collecting Balls on a Line by Robots with Limited Energy. - Tesshu Hanaka; Nicolás Honorato Droguett; Kazuhiro Kurita; Hirotaka Ono 001; Yota Otachi (IEICE Trans. Inf. Syst., 2024)

Grouped domination parameterized by vertex cover, twin cover, and beyond. - Tesshu Hanaka; Hirotaka Ono 001; Yota Otachi; Saeki Uda (Theor. Comput. Sci., 2024)

Extended MSO Model Checking via Small Vertex Integrity. - Tatsuya Gima; Yota Otachi (Algorithmica, 2024)

Computational complexity of jumping block puzzles. - Masaaki Kanzaki; Yota Otachi; Giovanni Viglietta; Ryuhei Uehara (Theor. Comput. Sci., 2024)

Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. - Tatsuya Gima; Takehiro Ito; Yasuaki Kobayashi; Yota Otachi (Algorithmica, 2024)

Broadcasting Under Structural Restrictions. - Yudai Egami; Tatsuya Gima; Tesshu Hanaka; Yasuaki Kobayashi; Michael Lampis; Valia Mitsou; Edouard Nemery; Yota Otachi; Manolis Vasilakis; Daniel Vaz 001 (MFCS, 2025)

Parameterized Spanning Tree Congestion. - Michael Lampis; Valia Mitsou; Edouard Nemery; Yota Otachi; Manolis Vasilakis; Daniel Vaz 001 (MFCS, 2025)

Orientable burning number of graphs. - Julien Courtiel; Paul Dorbec; Tatsuya Gima; Romain Lecoq; Yota Otachi (Discret. Appl. Math., 2025)

An improved spectral lower bound of treewidth. - Tatsuya Gima; Tesshu Hanaka; Kohei Noro; Hirotaka Ono 001; Yota Otachi (Inf. Process. Lett., 2025)

Structural parameterizations of vertex integrity. - Tatsuya Gima; Tesshu Hanaka; Yasuaki Kobayashi; Ryota Murai; Hirotaka Ono 001; Yota Otachi (Theor. Comput. Sci., 2025)

On the complexity of list H-packing for sparse graph classes. - Tatsuya Gima; Tesshu Hanaka; Yasuaki Kobayashi; Yota Otachi; Tomohito Shirai; Akira Suzuki 001; Yuma Tamura; Xiao Zhou 001 (Theor. Comput. Sci., 2025)

Dichotomies for tree minor containment with structural parameters. - Tatsuya Gima; Soh Kumabe; Kazuhiro Kurita; Yuto Okada; Yota Otachi (Theor. Comput. Sci., 2025)

Interval Graphs are Reconstructible. - Irene Heinrich; Masashi Kiyomi; Yota Otachi; Pascal Schweitzer (CoRR, 2025)

Finding Order-Preserving Subgraphs. - Haruya Imamura; Yasuaki Kobayashi; Yota Otachi; Toshiki Saitoh; Keita Sato; Asahi Takaoka; Ryo Yoshinaka; Tom C. van der Zanden (CoRR, 2025)

Hedonic seat arrangement problems. - Hans L. Bodlaender; Tesshu Hanaka; Lars Jaffke; Hirotaka Ono 001; Yota Otachi; Tom C. van der Zanden (Auton. Agents Multi Agent Syst., 2025)

Sequentially swapping tokens: Further on graph classes. - Hironori Kiya; Yuto Okada; Hirotaka Ono 001; Yota Otachi (J. Comput. Syst. Sci., 2026)