Reconstruction Algorithm for Permutation Graphs. - Masashi Kiyomi; Toshiki Saitoh; Ryuhei Uehara (WALCOM, 2010)

Random Generation and Enumeration of Proper Interval Graphs. - Toshiki Saitoh; Katsuhisa Yamanaka; Masashi Kiyomi; Ryuhei Uehara (IEICE Trans. Inf. Syst., 2010)

Reconstruction of interval graphs. - Masashi Kiyomi; Toshiki Saitoh; Ryuhei Uehara (Theor. Comput. Sci., 2010)

Complexity of the Stamp Folding Problem. - Takuya Umesato; Toshiki Saitoh; Ryuhei Uehara; Hiro Ito (COCOA, 2011)

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)

Voronoi Game on a Path. - Masashi Kiyomi; Toshiki Saitoh; Ryuhei Uehara (IEICE Trans. Inf. Syst., 2011)

Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data. - Masashi Kiyomi; Yoshio Okamoto; Toshiki Saitoh (SEA, 2012)

Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs. - Ryo Yoshinaka; Toshiki Saitoh; Jun Kawahara; Koji Tsuruma; Hiroaki Iwashita; Shin-ichi Minato (Algorithms, 2012)

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

Bipartite Permutation Graphs are reconstructible. - Masashi Kiyomi; Toshiki Saitoh; Ryuhei Uehara (Discret. Math. Algorithms Appl., 2012)

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

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)

Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs. - Masashi Kiyomi; Toshiki Saitoh; Ryuhei Uehara (IEICE Trans. Inf. Syst., 2013)

The complexity of the stamp folding problem. - Takuya Umesato; Toshiki Saitoh; Ryuhei Uehara; Hiro Ito; Yoshio Okamoto (Theor. Comput. Sci., 2013)

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)

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)

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)

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

Swapping labeled tokens on graphs. - Katsuhisa Yamanaka; Erik D. Demaine; Takehiro Ito; Jun Kawahara; Masashi Kiyomi; Yoshio Okamoto; Toshiki Saitoh; Akira Suzuki 001; Kei Uchizawa; Takeaki Uno (Theor. Comput. Sci., 2015)

A fast heuristic for the minimum weight vertex cover problem. - Satoshi Shimizu; Kazuaki Yamaguchi; Toshiki Saitoh; Sumio Masuda (ICIS, 2016)

The Time Complexity of the Token Swapping Problem and Its Parallel Variants. - Jun Kawahara; Toshiki Saitoh; Ryo Yoshinaka (WALCOM, 2017)

Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals. - Toshiki Saitoh; David G. Kirkpatrick (WALCOM, 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)

Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-bound. - Satoshi Shimizu; Kazuaki Yamaguchi; Toshiki Saitoh; Sumio Masuda (Discret. Appl. Math., 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)

Complexity of the Maximum k-Path Vertex Cover Problem. - Eiji Miyano; Toshiki Saitoh; Ryuhei Uehara; Tsuyoshi Yagita; Tom C. van der Zanden (WALCOM, 2018)

Enumerating All Subgraphs without Forbidden Induced Subgraphs via Multivalued Decision Diagrams. - Jun Kawahara; Toshiki Saitoh; Hirofumi Suzuki; Ryo Yoshinaka (CoRR, 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)

Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs. - Jun Kawahara; Toshiki Saitoh; Hirofumi Suzuki; Ryo Yoshinaka (SEA², 2019)

The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant. - Jun Kawahara; Toshiki Saitoh; Ryo Yoshinaka (J. Graph Algorithms Appl., 2019)

Sequentially Swapping Colored Tokens on Graphs. - Katsuhisa Yamanaka; Erik D. Demaine; Takashi Horiyama; Akitoshi Kawamura; Shin-Ichi Nakano; Yoshio Okamoto; Toshiki Saitoh; Akira Suzuki 001; Ryuhei Uehara; Takeaki Uno (J. Graph Algorithms Appl., 2019)

Preface for the Special Issue on the Project "Foundation of Innovative Algorithms for Big Data". - Naoki Katoh; Yuya Higashikawa; Hiro Ito; Shun Kataoka; Takuya Kida; Toshiki Saitoh; Tetsuo Shibuya; Kazuyuki Tanaka; Yushi Uno (Rev. Socionetwork Strateg., 2019)

Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Intersection Graph Classes. - Toshiki Saitoh; Ryo Yoshinaka; Hans L. Bodlaender (CoRR, 2020)

Complexity of the Maximum k-Path Vertex Cover Problem. - Eiji Miyano; Toshiki Saitoh; Ryuhei Uehara; Tsuyoshi Yagita; Tom C. van der Zanden (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020)

Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs. - Kazuaki Yamazaki; Toshiki Saitoh; Masashi Kiyomi; Ryuhei Uehara (Theor. Comput. Sci., 2020)

Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes. - Toshiki Saitoh; Ryo Yoshinaka; Hans L. Bodlaender (WALCOM, 2021)

Max-Min 3-Dispersion Problems. - Takashi Horiyama; Shin-Ichi Nakano; Toshiki Saitoh; Koki Suetsugu; Akira Suzuki 001; Ryuhei Uehara; Takeaki Uno; Kunihiro Wasa (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021)

Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs. - Jun Kawahara; Toshiki Saitoh; Hirokazu Takeda; Ryo Yoshinaka; Yui Yoshioka (WALCOM, 2023)

Overlapping Edge Unfoldings for Archimedean Solids and (Anti)prisms. - Takumi Shiota; Toshiki Saitoh (WALCOM, 2023)

Path Cover Problems with Length Cost. - Kenya Kobayashi; Guohui Lin; Eiji Miyano; Toshiki Saitoh; Akira Suzuki 001; Tadatoshi Utashima; Tsuyoshi Yagita (Algorithmica, 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)

Efficient non-isomorphic graph enumeration algorithms for several intersection graph classes. - Jun Kawahara; Toshiki Saitoh; Hirokazu Takeda; Ryo Yoshinaka; Yui Yoshioka (Theor. Comput. Sci., 2024)

Overlapping edge unfoldings for convex regular-faced polyhedra. - Takumi Shiota; Toshiki Saitoh (Theor. Comput. Sci., 2024)

Enumeration of Ordered Trees with Leaf Restrictions. - Yasuaki Kobayashi; Dominik Köppl; Yasuko Matsui; Hirotaka Ono 001; Toshiki Saitoh; Yushi Uno (From Strings to Graphs, and Back Again, 2025)

Approximability of Longest Run Subsequence and Complementary Minimization Problems. - Yuichi Asahiro; Mingyang Gong; Jesper Jansson 001; Guohui Lin; Sichen Lu; Eiji Miyano; Hirotaka Ono 001; Toshiki Saitoh; Shunichi Tanaka (WABI, 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)