default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDToshiki Saitoh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Takumi Shiota, Toshiki Saitoh:
Overlapping edge unfoldings for convex regular-faced polyhedra. Theor. Comput. Sci. 1002: 114593 (2024)- [j26]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: 114591 (2024) - 2023
- [j25]Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita:
Path Cover Problems with Length Cost. Algorithmica 85(11): 3348-3375 (2023) - [j24]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: 114158 (2023) - [c29]Takumi Shiota, Toshiki Saitoh:
Overlapping Edge Unfoldings for Archimedean Solids and (Anti)prisms. WALCOM 2023: 36-48 - [c28]Jun Kawahara, Toshiki Saitoh, Hirokazu Takeda, Ryo Yoshinaka, Yui Yoshioka:
Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs. WALCOM 2023: 151-163 - 2022
- [c27]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: 16:1-16:17 - [c26]Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita:
Path Cover Problems with Length Cost. WALCOM 2022: 396-408 - [i11]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 abs/2202.09495 (2022) - [i10]Jun Kawahara, Toshiki Saitoh, Hirokazu Takeda, Ryo Yoshinaka, Yui Yoshioka:
Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs. CoRR abs/2212.07119 (2022) - 2021
- [j23]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. 104-A(9): 1101-1107 (2021) - [c25]Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender:
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes. WALCOM 2021: 142-153 - 2020
- [j22]Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden:
Complexity of the Maximum k-Path Vertex Cover Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(10): 1193-1201 (2020) - [j21]Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara:
Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs. Theor. Comput. Sci. 806: 310-322 (2020) - [i9]Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender:
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Intersection Graph Classes. CoRR abs/2007.03859 (2020)
2010 – 2019
- 2019
- [j20]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): 3-27 (2019) - [j19]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): 29-70 (2019) - [j18]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): 99-100 (2019) - [c24]Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa:
Max-Min 3-Dispersion Problems. COCOON 2019: 291-300 - [c23]Jun Kawahara, Toshiki Saitoh, Hirofumi Suzuki, Ryo Yoshinaka:
Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs. SEA² 2019: 125-141 - 2018
- [j17]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: 1-10 (2018) - [c22]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: 263-272 - [c21]Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara:
Computational Complexity of Robot Arm Simulation Problems. IWOCA 2018: 177-188 - [c20]Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara:
Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs. WALCOM 2018: 8-19 - [c19]Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden:
Complexity of the Maximum k-Path Vertex Cover Problem. WALCOM 2018: 240-251 - [i8]Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno:
Swapping Colored Tokens on Graphs. CoRR abs/1803.06816 (2018) - [i7]Jun Kawahara, Toshiki Saitoh, Hirofumi Suzuki, Ryo Yoshinaka:
Enumerating All Subgraphs without Forbidden Induced Subgraphs via Multivalued Decision Diagrams. CoRR abs/1804.03822 (2018) - 2017
- [j16]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): 1071-1104 (2017) - [j15]Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh, Tomás Vyskocil:
Extending Partial Representations of Interval Graphs. Algorithmica 78(3): 945-967 (2017) - [j14]Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara:
Ferrers dimension of grid intersection graphs. Discret. Appl. Math. 216: 130-135 (2017) - [j13]Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, Sumio Masuda:
Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-bound. Discret. Appl. Math. 223: 120-134 (2017) - [c18]Toshiki Saitoh, David G. Kirkpatrick:
Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals. WALCOM 2017: 320-332 - [c17]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: 435-447 - [c16]Jun Kawahara, Toshiki Saitoh, Ryo Yoshinaka:
The Time Complexity of the Token Swapping Problem and Its Parallel Variants. WALCOM 2017: 448-459 - 2016
- [c15]Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, Sumio Masuda:
A fast heuristic for the minimum weight vertex cover problem. ICIS 2016: 1-5 - [i6]Jun Kawahara, Toshiki Saitoh, Ryo Yoshinaka:
The Time Complexity of the Token Swapping Problem and Its Parallel Variants. CoRR abs/1612.02948 (2016) - 2015
- [j12]Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh:
Extending partial representations of subclasses of chordal graphs. Theor. Comput. Sci. 576: 85-101 (2015) - [j11]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: 81-94 (2015) - [c14]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: 422-433 - [c13]Katsuhisa Yamanaka, Takashi Horiyama, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno:
Swapping Colored Tokens on Graphs. WADS 2015: 619-628 - 2014
- [j10]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: 69-77 (2014) - [c12]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: 364-375 - [c11]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: 253-264 - [c10]Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara:
Intersection Dimension of Bipartite Graphs. TAMC 2014: 323-340 - [i5]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 abs/1412.3334 (2014) - 2013
- [j9]Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara:
Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs. IEICE Trans. Inf. Syst. 96-D(3): 426-432 (2013) - [j8]Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito, Yoshio Okamoto:
The complexity of the stamp folding problem. Theor. Comput. Sci. 497: 13-19 (2013) - [i4]Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh, Tomás Vyskocil:
Linear-time Algorithm for Partial Representation Extension of Interval Graphs. CoRR abs/1306.2182 (2013) - 2012
- [j7]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): 176-213 (2012) - [j6]Shuji Kijima, Yota Otachi, Toshiki Saitoh, Takeaki Uno:
Subgraph isomorphism in graph classes. Discret. Math. 312(21): 3164-3173 (2012) - [j5]Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara:
Bipartite Permutation Graphs are reconstructible. Discret. Math. Algorithms Appl. 4(3) (2012) - [j4]Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara:
Random generation and enumeration of bipartite permutation graphs. J. Discrete Algorithms 10: 84-97 (2012) - [c9]Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh:
Extending Partial Representations of Subclasses of Chordal Graphs. ISAAC 2012: 444-454 - [c8]Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh:
Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data. SEA 2012: 248-259 - [i3]Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh:
Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data. CoRR abs/1203.3284 (2012) - [i2]Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh:
Extending Partial Representations of Subclasses of Chordal Graphs. CoRR abs/1207.0255 (2012) - [i1]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 abs/1207.6960 (2012) - 2011
- [j3]Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara:
Voronoi Game on a Path. IEICE Trans. Inf. Syst. 94-D(6): 1185-1189 (2011) - [c7]Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito:
Complexity of the Stamp Folding Problem. COCOA 2011: 311-321 - [c6]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: 271-282 - 2010
- [j2]Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara:
Random Generation and Enumeration of Proper Interval Graphs. IEICE Trans. Inf. Syst. 93-D(7): 1816-1823 (2010) - [j1]Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara:
Reconstruction of interval graphs. Theor. Comput. Sci. 411(43): 3859-3866 (2010) - [c5]Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara:
Bipartite Permutation Graphs Are Reconstructible. COCOA (2) 2010: 362-373 - [c4]Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara:
Reconstruction Algorithm for Permutation Graphs. WALCOM 2010: 125-135
2000 – 2009
- 2009
- [c3]Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara:
Reconstruction of Interval Graphs. COCOON 2009: 106-115 - [c2]Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara:
Random Generation and Enumeration of Bipartite Permutation Graphs. ISAAC 2009: 1104-1113 - [c1]Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara:
Random Generation and Enumeration of Proper Interval Graphs. WALCOM 2009: 177-189
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
