Toshiki Saitoh
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
27
Venues
11
Active years
2009–2026
Best venue rank
B
Where they publish
Papers
27 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | WALCOM | Finding Order-Preserving Subgraphs. | Haruya Imamura, Yasuaki Kobayashi, Yota Otachi, Toshiki Saitoh, Keita Sato, Asahi Takaoka, Ryo Yoshinaka, Tom C. van der Zanden |
| 2025 | WABI | 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 |
| 2023 | WALCOM | Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs. | Jun Kawahara, Toshiki Saitoh, Hirokazu Takeda, Ryo Yoshinaka, Yui Yoshioka |
| 2023 | WALCOM | Overlapping Edge Unfoldings for Archimedean Solids and (Anti)prisms. | Takumi Shiota, Toshiki Saitoh |
| 2022 | FUN | 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 |
| 2022 | WALCOM | Path Cover Problems with Length Cost. | Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita |
| 2021 | WALCOM | Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes. | Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender |
| 2019 | COCOON | Max-Min 3-Dispersion Problems. | Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa |
| 2018 | FAW | 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 |
| 2018 | IWOCA | Computational Complexity of Robot Arm Simulation Problems. | Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara |
| 2018 | WALCOM | Complexity of the Maximum k-Path Vertex Cover Problem. | Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden |
| 2018 | WALCOM | Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs. | Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara |
| 2017 | WALCOM | The Time Complexity of the Token Swapping Problem and Its Parallel Variants. | Jun Kawahara, Toshiki Saitoh, Ryo Yoshinaka |
| 2017 | WALCOM | Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals. | Toshiki Saitoh, David G. Kirkpatrick |
| 2017 | WALCOM | 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 |
| 2015 | WADS | Competitive Diffusion on Weighted Graphs. | Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou |
| 2015 | WADS | Swapping Colored Tokens on Graphs. | Katsuhisa Yamanaka, Takashi Horiyama, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno |
| 2014 | FUN | 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 |
| 2014 | TAMC | Intersection Dimension of Bipartite Graphs. | Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara |
| 2012 | ISAAC | Extending Partial Representations of Subclasses of Chordal Graphs. | Pavel Klavk, Jan Kratochvl, Yota Otachi, Toshiki Saitoh |
| 2011 | COCOA | Complexity of the Stamp Folding Problem. | Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito |
| 2011 | WG | 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 |
| 2010 | COCOA | Bipartite Permutation Graphs Are Reconstructible. | Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara |
| 2010 | WALCOM | Reconstruction Algorithm for Permutation Graphs. | Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara |
| 2009 | COCOON | Reconstruction of Interval Graphs. | Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara |
| 2009 | ISAAC | Random Generation and Enumeration of Bipartite Permutation Graphs. | Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara |
| 2009 | WALCOM | Random Generation and Enumeration of Proper Interval Graphs. | Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara |