E-LIB Suche - Ergebnisse für: Horiyama, Takashi

1

Lower Bounds for the Thickness and the Total Number of Edge..:

KAWAKAMI, Yuki ; TAKAHASHI, Shun ; SETO, Kazuhisa...
IEICE Transactions on Information and Systems. E107.D (2024) 6 - p. 732-740 , 2024

Link: https://doi.org/10.1587/..

2

Enumerating Empty and Surrounding Polygons:

TERUI, Shunta ; YAMANAKA, Katsuhisa ; HIRAYAMA, Takashi...
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. E106.A (2023) 9 - p. 1082-1091 , 2023

Link: https://doi.org/10.1587/..

3

Internal Longest Palindrome Queries in Optimal Time:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,

Mitani, Kazuki ; Mieno, Takuya ; Seto, Kazuhisa. - p. 127-138 , 2023

Link: https://doi.org/10.1007/..

4

Finding top-k longest palindromes in substrings:

Mitani, Kazuki ; Mieno, Takuya ; Seto, Kazuhisa.
Theoretical Computer Science. 979 (2023) - p. 114183 , 2023

Link: https://doi.org/10.1016/..

5

Efficient Folding Algorithms for Convex Polyhedra:

Kamata, Tonan ; Kadoguchi, Akira ; Horiyama, Takashi.
Discrete & Computational Geometry. 70 (2022) 4 - p. 1499-1522 , 2022

Link: https://doi.org/10.1007/..

6

Efficient segment folding is hard:

Horiyama, Takashi ; Klute, Fabian ; Korman, Matias...
Computational Geometry. 104 (2022) - p. 101860 , 2022

Link: https://doi.org/10.1016/..

7

Longest common subsequence in sublinear space:

Kiyomi, Masashi ; Horiyama, Takashi ; Otachi, Yota
Information Processing Letters. 168 (2021) - p. 106084 , 2021

Link: https://doi.org/10.1016/..

8

Finding well-optimized special quasirandom structures with ..:

Shinohara, Kohei ; Seko, Atsuto ; Horiyama, Takashi.
Physical Review Materials. 5 (2021) 11 - p. , 2021

Link: https://doi.org/10.1103/..

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

Algorithmic enumeration of surrounding polygons:

Yamanaka, Katsuhisa ; Avis, David ; Horiyama, Takashi...
Discrete Applied Mathematics. 303 (2021) - p. 305-313 , 2021

Link: https://doi.org/10.1016/..

11

Optimal reconfiguration of optimal ladder lotteries:

Yamanaka, Katsuhisa ; Horiyama, Takashi ; Wasa, Kunihiro
Theoretical Computer Science. 859 (2021) - p. 57-69 , 2021

Link: https://doi.org/10.1016/..

12

Efficient Algorithm for Box Folding:

Mizunashi, Koichi ; Horiyama, Takashi ; Uehara, Ryuhei
Journal of Graph Algorithms and Applications. 24 (2020) 2 - p. 89-103 , 2020

Link: https://doi.org/10.7155/..

13

Implicit Enumeration of Topological-Minor-Embeddings and It..:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,

Nakahata, Yu ; Kawahara, Jun ; Horiyama, Takashi. - p. 211-222 , 2020

Link: https://doi.org/10.1007/..

14

Enumeration of nonequivalent substitutional structures usin..:

Shinohara, Kohei ; Seko, Atsuto ; Horiyama, Takashi...
The Journal of Chemical Physics. 153 (2020) 10 - p. , 2020

Link: https://doi.org/10.1063/..

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/..