Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Saitoh, Toshiki
193  Ergebnisse:
Personensuche X
?
1

Overlapping edge unfoldings for convex regular-faced polyhe..:

Shiota, Takumi ; Saitoh, Toshiki
Theoretical Computer Science.  1002 (2024)  - p. 114593 , 2024
Link: https://doi.org/10.1016/..
 
?
2

Efficient non-isomorphic graph enumeration algorithms for s..:

Kawahara, Jun ; Saitoh, Toshiki ; Takeda, Hirokazu..
Theoretical Computer Science.  1003 (2024)  - p. 114591 , 2024
Link: https://doi.org/10.1016/..
 
?
3

Path Cover Problems with Length Cost:

Kobayashi, Kenya ; Lin, Guohui ; Miyano, Eiji...
Algorithmica.  85 (2023)  11 - p. 3348-3375 , 2023
Link: https://doi.org/10.1007/..
 
?
4

Efficient Non-isomorphic Graph Enumeration Algorithms for S..:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,
Kawahara, Jun ; Saitoh, Toshiki ; Takeda, Hirokazu.. - p. 151-163 , 2023
Link: https://doi.org/10.1007/..
 
?
5

Overlapping Edge Unfoldings for Archimedean Solids and (Ant..:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,
Shiota, Takumi ; Saitoh, Toshiki - p. 36-48 , 2023
Link: https://doi.org/10.1007/..
 
?
6

Sorting balls and water: Equivalence and computational comp..:

Ito, Takehiro ; Kawahara, Jun ; Minato, Shin-ichi...
Theoretical Computer Science.  978 (2023)  - p. 114158 , 2023
Link: https://doi.org/10.1016/..
 
?
7

Path Cover Problems with Length Cost:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,
Kobayashi, Kenya ; Lin, Guohui ; Miyano, Eiji... - p. 396-408 , 2022
Link: https://doi.org/10.1007/..
 
?
8

Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to I..:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,
Saitoh, Toshiki ; Yoshinaka, Ryo ; Bodlaender, Hans L. - p. 142-153 , 2021
Link: https://doi.org/10.1007/..
 
?
9

Max-Min 3-Dispersion Problems:

HORIYAMA, Takashi ; NAKANO, Shin-ichi ; SAITOH, Toshiki...
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences.  E104.A (2021)  9 - p. 1101-1107 , 2021
Link: https://doi.org/10.1587/..
 
?
10

Enumeration of nonisomorphic interval graphs and nonisomorp..:

Yamazaki, Kazuaki ; Saitoh, Toshiki ; Kiyomi, Masashi.
Theoretical Computer Science.  806 (2020)  - p. 310-322 , 2020
Link: https://doi.org/10.1016/..
 
?
11

Complexity of the Maximum k-Path Vertex Cover Problem:

MIYANO, Eiji ; SAITOH, Toshiki ; UEHARA, Ryuhei..
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences.  E103.A (2020)  10 - p. 1193-1201 , 2020
Link: https://doi.org/10.1587/..
 
?
12

The Time Complexity of Permutation Routing via Matching, To..:

Kawahara, Jun ; Saitoh, Toshiki ; Yoshinaka, Ryo
Journal of Graph Algorithms and Applications.  23 (2019)  1 - p. 29-70 , 2019
Link: https://doi.org/10.7155/..
 
?
13

Preface for the Special Issue on the Project "Foundation of..:

Katoh, Naoki ; Higashikawa, Yuya ; Ito, Hiro...
The Review of Socionetwork Strategies.  13 (2019)  2 - p. 99-100 , 2019
Link: https://doi.org/10.1007/..
 
?
14

Max-Min 3-Dispersion Problems:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,
Horiyama, Takashi ; Nakano, Shin-ichi ; Saitoh, Toshiki... - p. 291-300 , 2019
Link: https://doi.org/10.1007/..
 
?
15

Sequentially Swapping Colored Tokens on Graphs:

Yamanaka, Katsuhisa ; Demaine, Erik D. ; Horiyama, Takashi...
Journal of Graph Algorithms and Applications.  23 (2019)  1 - p. 3-27 , 2019
Link: https://doi.org/10.7155/..
 
1-15