Toshiki Saitoh

According to our database, Toshiki Saitoh authored at least 51 papers between 2009 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

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, July, 2025

Approximability of Longest Run Subsequence and Complementary Minimization Problems.

Yuichi Asahiro, Mingyang Gong, Jesper Jansson, Guohui Lin, Sichen Lu, Eiji Miyano, Hirotaka Ono, Toshiki Saitoh, Shunichi Tanaka

Proceedings of the 25th International Conference on Algorithms for Bioinformatics, 2025

Enumeration of Ordered Trees with Leaf Restrictions.

Yasuaki Kobayashi, Dominik Köppl, Yasuko Matsui, Hirotaka Ono, Toshiki Saitoh, Yushi Uno

Proceedings of the From Strings to Graphs, 2025

2024

Overlapping edge unfoldings for convex regular-faced polyhedra.

Takumi Shiota, Toshiki Saitoh

Theor. Comput. Sci., 2024

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

2023

Overlapping Edge Unfoldings for Archimedean Solids and (Anti)prisms.

Takumi Shiota, Toshiki Saitoh

Proceedings of the WALCOM: Algorithms and Computation, 2023

Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs.

Jun Kawahara, Toshiki Saitoh, Hirokazu Takeda, Ryo Yoshinaka, Yui Yoshioka

Proceedings of the WALCOM: Algorithms and Computation, 2023

2022

Path Cover Problems with Length Cost.

Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita

Proceedings of the WALCOM: Algorithms and Computation, 2022

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

Proceedings of the 11th International Conference on Fun with Algorithms, 2022

2021

Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes.

Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender

Proceedings of the WALCOM: Algorithms and Computation, 2021

2020

Complexity of the Maximum <i>k</i>-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

Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Intersection Graph Classes.

Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender

CoRR, 2020

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

The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant.

Jun Kawahara, Toshiki Saitoh, Ryo Yoshinaka

J. Graph Algorithms Appl., 2019

Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs.

Jun Kawahara, Toshiki Saitoh, Hirofumi Suzuki, Ryo Yoshinaka

Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

Max-Min 3-Dispersion Problems.

Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

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

Enumerating All Subgraphs without Forbidden Induced Subgraphs via Multivalued Decision Diagrams.

Jun Kawahara, Toshiki Saitoh, Hirofumi Suzuki, Ryo Yoshinaka

CoRR, 2018

Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs.

Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara

Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

Complexity of the Maximum k-Path Vertex Cover Problem.

Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden

Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

Computational Complexity of Robot Arm Simulation Problems.

Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

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

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

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

Ferrers dimension of grid intersection graphs.

Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara

Discret. Appl. Math., 2017

Extending Partial Representations of Interval Graphs.

Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh, Tomás Vyskocil

Algorithmica, 2017

Sequentially Swapping Colored Tokens on Graphs.

Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno

Proceedings of the WALCOM: Algorithms and Computation, 2017

Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals.

Toshiki Saitoh, David G. Kirkpatrick

Proceedings of the WALCOM: Algorithms and Computation, 2017

The Time Complexity of the Token Swapping Problem and Its Parallel Variants.

Jun Kawahara, Toshiki Saitoh, Ryo Yoshinaka

Proceedings of the WALCOM: Algorithms and Computation, 2017

2016

A fast heuristic for the minimum weight vertex cover problem.

Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, Sumio Masuda

Proceedings of the 15th IEEE/ACIS International Conference on Computer and Information Science, 2016

2015

Swapping Colored Tokens on Graphs.

Katsuhisa Yamanaka, Takashi Horiyama, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Competitive Diffusion on Weighted Graphs.

Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

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, Yushi Uno, Koichi Yamazaki

Discret. Appl. Math., 2014

Computational Complexity of Competitive Diffusion on (Un)weighted Graphs.

Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou

CoRR, 2014

Intersection Dimension of Bipartite Graphs.

Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara

Proceedings of the Theory and Applications of Models of Computation, 2014

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

Proceedings of the Algorithm Theory - SWAT 2014, 2014

Swapping Labeled Tokens on Graphs.

Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013

The complexity of the stamp folding problem.

Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito, Yoshio Okamoto

Theor. Comput. Sci., 2013

Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs.

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara

IEICE Trans. Inf. Syst., 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

2012

Subgraph isomorphism in graph classes.

Shuji Kijima, Yota Otachi, Toshiki Saitoh, Takeaki Uno

Discret. Math., 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

Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data.

Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Extending Partial Representations of Subclasses of Chordal Graphs.

Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

2011

Voronoi Game on a Path.

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara

IEICE Trans. Inf. Syst., 2011

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

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Complexity of the Stamp Folding Problem.

Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito

Proceedings of the Combinatorial Optimization and Applications, 2011

2010

Reconstruction Algorithm for Permutation Graphs.

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara

Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

Bipartite Permutation Graphs Are Reconstructible.

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara

Proceedings of the Combinatorial Optimization and Applications, 2010

2009

Random Generation and Enumeration of Proper Interval Graphs.

Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Random Generation and Enumeration of Bipartite Permutation Graphs.

Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Reconstruction of Interval Graphs.

Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009