Toshiki Saitoh

73 papers B 18C 5Misc 5Journal 39Unranked 6
YearRankTypeTitle / Venue / Authors
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
2025 C conf
Approximability of Longest Run Subsequence and Complementary Minimization Problems.
WABI
Yuichi Asahiro, Mingyang Gong, Jesper Jansson, Guohui Lin, Sichen Lu, Eiji Miyano, Hirotaka Ono, Toshiki Saitoh, Shunichi Tanaka
2025 — conf
Enumeration of Ordered Trees with Leaf Restrictions.
From Strings to Graphs, and Back Again
Yasuaki Kobayashi, Dominik Köppl, Yasuko Matsui, Hirotaka Ono, Toshiki Saitoh, Yushi Uno
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 — conf
Happy Vertex Game.
CANDAR
Hiroshi Eto, Akiko Fujimoto, Hironori Kiya, Ruka Matsushita, Eiji Miyano, Yuto Murao, Toshiki Saitoh
2025 — conf
The Number of Non-overlapping Unfoldings in Convex Polyhedra.
CCCG
Takumi Shiota, Yudai Enomoto, Masashi Gorobe, Takashi Horiyama, Tonan Kamata, Toshiki Saitoh, Ryuhei Uehara
2024 J jnl
Efficient non-isomorphic graph enumeration algorithms for several intersection graph classes.
Theor. Comput. Sci.
Jun Kawahara, Toshiki Saitoh, Hirokazu Takeda, Ryo Yoshinaka, Yui Yoshioka
2024 J jnl
Overlapping edge unfoldings for convex regular-faced polyhedra.
Theor. Comput. Sci.
Takumi Shiota, Toshiki Saitoh
2023 B conf
Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs.
WALCOM
Jun Kawahara, Toshiki Saitoh, Hirokazu Takeda, Ryo Yoshinaka, Yui Yoshioka
2023 B conf
Overlapping Edge Unfoldings for Archimedean Solids and (Anti)prisms.
WALCOM
Takumi Shiota, Toshiki Saitoh
2023 J jnl
Path Cover Problems with Length Cost.
Algorithmica
Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita
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
2022 J jnl
Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs.
CoRR
Jun Kawahara, Toshiki Saitoh, Hirokazu Takeda, Ryo Yoshinaka, Yui Yoshioka
2022 B conf
Path Cover Problems with Length Cost.
WALCOM
Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita
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 B conf
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes.
WALCOM
Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender
2021 J jnl
Max-Min 3-Dispersion Problems.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
2020 J jnl
Complexity of the Maximum
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden
2020 J jnl
Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs.
Theor. Comput. Sci.
Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara
2020 J jnl
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Intersection Graph Classes.
CoRR
Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender
2019 — conf
Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs.
SEA²
Jun Kawahara, Toshiki Saitoh, Hirofumi Suzuki, Ryo Yoshinaka
2019 Misc conf
Max-Min 3-Dispersion Problems.
COCOON
Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
2019 J jnl
Preface for the Special Issue on the Project "Foundation of Innovative Algorithms for Big Data".
Rev. Socionetwork Strateg.
Naoki Katoh, Yuya Higashikawa, Hiro Ito, Shun Kataoka, Takuya Kida, Toshiki Saitoh, Tetsuo Shibuya, Kazuyuki Tanaka, Yushi Uno
2019 J jnl
Sequentially Swapping Colored Tokens on Graphs.
J. Graph Algorithms Appl.
Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno
2019 J jnl
The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant.
J. Graph Algorithms Appl.
Jun Kawahara, Toshiki Saitoh, Ryo Yoshinaka
2018 B conf
Complexity of the Maximum k-Path Vertex Cover Problem.
WALCOM
Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden
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
Enumerating All Subgraphs without Forbidden Induced Subgraphs via Multivalued Decision Diagrams.
CoRR
Jun Kawahara, Toshiki Saitoh, Hirofumi Suzuki, Ryo Yoshinaka
2018 B conf
Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs.
WALCOM
Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara
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
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
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
Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-bound.
Discret. Appl. Math.
Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, Sumio Masuda
2017 J jnl
Ferrers dimension of grid intersection graphs.
Discret. Appl. Math.
Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara
2017 B conf
Sequentially Swapping Colored Tokens on Graphs.
WALCOM
Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno
2017 B conf
Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals.
WALCOM
Toshiki Saitoh, David G. Kirkpatrick
2017 B conf
The Time Complexity of the Token Swapping Problem and Its Parallel Variants.
WALCOM
Jun Kawahara, Toshiki Saitoh, Ryo Yoshinaka
2016 C conf
A fast heuristic for the minimum weight vertex cover problem.
ICIS
Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, Sumio Masuda
2016 J jnl
The Time Complexity of the Token Swapping Problem and Its Parallel Variants.
CoRR
Jun Kawahara, Toshiki Saitoh, Ryo Yoshinaka
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
Extending partial representations of subclasses of chordal graphs.
Theor. Comput. Sci.
Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh
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 J jnl
Swapping labeled tokens on graphs.
Theor. Comput. Sci.
Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
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
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 — 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 Misc conf
Swapping Labeled Tokens on Graphs.
FUN
Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
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
Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs.
IEICE Trans. Inf. Syst.
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
2013 J jnl
The complexity of the stamp folding problem.
Theor. Comput. Sci.
Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito, Yoshio Okamoto
2012 J jnl
Bipartite Permutation Graphs are reconstructible.
Discret. Math. Algorithms Appl.
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
2012 J jnl
Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data
CoRR
Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh
2012 B conf
Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data.
SEA
Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh
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 J jnl
Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs.
Algorithms
Ryo Yoshinaka, Toshiki Saitoh, Jun Kawahara, Koji Tsuruma, Hiroaki Iwashita, Shin-ichi Minato
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 C conf
Complexity of the Stamp Folding Problem.
COCOA
Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito
2011 J jnl
Voronoi Game on a Path.
IEICE Trans. Inf. Syst.
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
2010 — conf
Bipartite Permutation Graphs Are Reconstructible.
COCOA (2)
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
2010 J jnl
Random Generation and Enumeration of Proper Interval Graphs.
IEICE Trans. Inf. Syst.
Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara
2010 B conf
Reconstruction Algorithm for Permutation Graphs.
WALCOM
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
2010 J jnl
Reconstruction of interval graphs.
Theor. Comput. Sci.
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
2009 B conf
Random Generation and Enumeration of Bipartite Permutation Graphs.
ISAAC
Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara
2009 B conf
Random Generation and Enumeration of Proper Interval Graphs.
WALCOM
Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara
2009 Misc conf
Reconstruction of Interval Graphs.
COCOON
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara