Toshiki Saitoh

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 40

Top Topics

Greedy Algorithm

Top Venues

Theor. Comput. Sci.

Publications

Jun Kawahara, Toshiki Saitoh, Hirokazu Takeda, Ryo Yoshinaka, Yui Yoshioka
Efficient non-isomorphic graph enumeration algorithms for several intersection graph classes. Theor. Comput. Sci. 1003 (2024)
Takumi Shiota, Toshiki Saitoh
Overlapping edge unfoldings for convex regular-faced polyhedra. Theor. Comput. Sci. 1002 (2024)
Jun Kawahara, Toshiki Saitoh, Hirokazu Takeda, Ryo Yoshinaka, Yui Yoshioka
Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs. WALCOM (2023)
Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita
Path Cover Problems with Length Cost. Algorithmica 85 (11) (2023)
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
Sorting balls and water: Equivalence and computational complexity. Theor. Comput. Sci. 978 (2023)
Takumi Shiota, Toshiki Saitoh
Overlapping Edge Unfoldings for Archimedean Solids and (Anti)prisms. WALCOM (2023)
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
Sorting Balls and Water: Equivalence and Computational Complexity. CoRR (2022)
Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita
Path Cover Problems with Length Cost. WALCOM (2022)
Jun Kawahara, Toshiki Saitoh, Hirokazu Takeda, Ryo Yoshinaka, Yui Yoshioka
Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs. CoRR (2022)
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
Sorting Balls and Water: Equivalence and Computational Complexity. FUN (2022)
Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
Max-Min 3-Dispersion Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2021)
Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes. WALCOM (2021)
Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden
-Path Vertex Cover Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (10) (2020)
Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara
Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs. Theor. Comput. Sci. 806 (2020)
Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Intersection Graph Classes. CoRR (2020)
Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno
Sequentially Swapping Colored Tokens on Graphs. J. Graph Algorithms Appl. 23 (1) (2019)
Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
Max-Min 3-Dispersion Problems. COCOON (2019)
Jun Kawahara, Toshiki Saitoh, Ryo Yoshinaka
The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant. J. Graph Algorithms Appl. 23 (1) (2019)
Naoki Katoh, Yuya Higashikawa, Hiro Ito, Shun Kataoka, Takuya Kida, Toshiki Saitoh, Tetsuo Shibuya, Kazuyuki Tanaka, Yushi Uno
Preface for the Special Issue on the Project "Foundation of Innovative Algorithms for Big Data". Rev. Socionetwork Strateg. 13 (2) (2019)
Jun Kawahara, Toshiki Saitoh, Hirofumi Suzuki, Ryo Yoshinaka
Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs. SEA² (2019)
Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden
Complexity of the Maximum k-Path Vertex Cover Problem. WALCOM (2018)
Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
Exact Algorithms for the Max-Min Dispersion Problem. FAW (2018)
Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
Swapping colored tokens on graphs. Theor. Comput. Sci. 729 (2018)
Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
Swapping Colored Tokens on Graphs. CoRR (2018)
Jun Kawahara, Toshiki Saitoh, Hirofumi Suzuki, Ryo Yoshinaka
Enumerating All Subgraphs without Forbidden Induced Subgraphs via Multivalued Decision Diagrams. CoRR (2018)
Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara
Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs. WALCOM (2018)
Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara
Computational Complexity of Robot Arm Simulation Problems. IWOCA (2018)
Toshiki Saitoh, David G. Kirkpatrick
Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals. WALCOM (2017)
Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil
Extending Partial Representations of Proper and Unit Interval Graphs. Algorithmica 77 (4) (2017)
Jun Kawahara, Toshiki Saitoh, Ryo Yoshinaka
The Time Complexity of the Token Swapping Problem and Its Parallel Variants. WALCOM (2017)
Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno
Sequentially Swapping Colored Tokens on Graphs. WALCOM (2017)
Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara
Ferrers dimension of grid intersection graphs. Discret. Appl. Math. 216 (2017)
Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh, Tomás Vyskocil
Extending Partial Representations of Interval Graphs. Algorithmica 78 (3) (2017)
Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, Sumio Masuda
Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-bound. Discret. Appl. Math. 223 (2017)
Jun Kawahara, Toshiki Saitoh, Ryo Yoshinaka
The Time Complexity of the Token Swapping Problem and Its Parallel Variants. CoRR (2016)
Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, Sumio Masuda
A fast heuristic for the minimum weight vertex cover problem. ICIS (2016)
Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh
Extending partial representations of subclasses of chordal graphs. Theor. Comput. Sci. 576 (2015)
Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou
Competitive Diffusion on Weighted Graphs. WADS (2015)
Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
Swapping labeled tokens on graphs. Theor. Comput. Sci. 586 (2015)
Katsuhisa Yamanaka, Takashi Horiyama, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
Swapping Colored Tokens on Graphs. WADS (2015)
Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
Swapping Labeled Tokens on Graphs. FUN (2014)
Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil
Extending Partial Representations of Proper and Unit Interval Graphs. SWAT (2014)
Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara
Intersection Dimension of Bipartite Graphs. TAMC (2014)
Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki
Approximating the path-distance-width for AT-free graphs and graphs in related classes. Discret. Appl. Math. 168 (2014)
Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou
Computational Complexity of Competitive Diffusion on (Un)weighted Graphs. CoRR (2014)
Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito, Yoshio Okamoto
The complexity of the stamp folding problem. Theor. Comput. Sci. 497 (2013)
Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh, Tomás Vyskocil
Linear-time Algorithm for Partial Representation Extension of Interval Graphs. CoRR (2013)
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs. IEICE Trans. Inf. Syst. (3) (2013)
Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil
Extending Partial Representations of Proper and Unit Interval Graphs CoRR (2012)
Ryo Yoshinaka, Toshiki Saitoh, Jun Kawahara, Koji Tsuruma, Hiroaki Iwashita, Shin-ichi Minato
Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs. Algorithms 5 (2) (2012)
Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh
Extending Partial Representations of Subclasses of Chordal Graphs. ISAAC (2012)
Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara
Random generation and enumeration of bipartite permutation graphs. J. Discrete Algorithms 10 (2012)
Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh
Extending Partial Representations of Subclasses of Chordal Graphs CoRR (2012)
Shuji Kijima, Yota Otachi, Toshiki Saitoh, Takeaki Uno
Subgraph isomorphism in graph classes. Discret. Math. 312 (21) (2012)
Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh
Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data. SEA (2012)
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
Bipartite Permutation Graphs are reconstructible. Discret. Math. Algorithms Appl. 4 (3) (2012)
Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh
Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data CoRR (2012)
Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki
Approximability of the Path-Distance-Width for AT-free Graphs. WG (2011)
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
Voronoi Game on a Path. IEICE Trans. Inf. Syst. (6) (2011)
Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito
Complexity of the Stamp Folding Problem. COCOA (2011)
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
Bipartite Permutation Graphs Are Reconstructible. COCOA (2) (2010)
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
Reconstruction Algorithm for Permutation Graphs. WALCOM (2010)
Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara
Random Generation and Enumeration of Proper Interval Graphs. IEICE Trans. Inf. Syst. (7) (2010)
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
Reconstruction of interval graphs. Theor. Comput. Sci. 411 (43) (2010)
Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara
Random Generation and Enumeration of Proper Interval Graphs. WALCOM (2009)
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
Reconstruction of Interval Graphs. COCOON (2009)
Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara
Random Generation and Enumeration of Bipartite Permutation Graphs. ISAAC (2009)