Zobrazeno 1 - 10 of 99 pro vyhledávání: '"Katsuhisa YAMANAKA"'
3
Algorithmic enumeration of surrounding polygons
Autor: Ryuhei Uehara, Yoshio Okamoto, David Avis, Tanami Yamauchi, Katsuhisa Yamanaka, Takashi Horiyama
Publikováno v: Discrete Applied Mathematics. 303:305-313
We are given a set S of points in the Euclidean plane. We assume that S is in general position. A simple polygon P is a surrounding polygon of S if each vertex of P is a point in S and every point in S is either inside P or a vertex of P . In this pa
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::59b522f2594cd7382378638c26eb963f
https://doi.org/10.1016/j.dam.2020.03.034
Zobrazit plný text záznamu
5
Parameterized complexity of independent set reconfiguration problems
Autor: Akira Suzuki, Hirotaka Ono, Takehiro Ito, Marcin Kamiński, Katsuhisa Yamanaka, Ryuhei Uehara
Publikováno v: Discrete Applied Mathematics. 283:336-345
Suppose that we are given two independent sets I 0 and I r of a graph such that | I 0 | = | I r | , and imagine that a token is placed on each vertex in I 0 . Then, the token jumping problem is to determine whether there exists a sequence of independ
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::a04b05979401243ff8d6b3f31ac54537
https://doi.org/10.1016/j.dam.2020.01.022
Zobrazit plný text záznamu
7
The Complexity of Induced Tree Reconfiguration Problems
Autor: Hiroki Arimura, Katsuhisa Yamanaka, Kunihiro Wasa
Publikováno v: IEICE Transactions on Information and Systems. :464-469
A reconfiguration problem asks when we are given two feasible solutions A and B, whether there exists a reconfiguration sequence \((A_0 = A, A_1, \dots , A_\ell = B)\) such that (i) \(A_0, \dots , A_\ell \) are feasible solutions and (ii) we can obta
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::fb21fd9fe7c6a1caf18241e96313551c
https://doi.org/10.1587/transinf.2018fcp0010
Zobrazit plný text záznamu
8
Elektronická kniha
WALCOM: Algorithms and Computation : 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18–20, 2024, Proceedings
Autor: Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen
This book constitutes the refereed proceedings of the 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, held in Kanazawa, Japan, during March 18–20, 2024. The 28 full papers presented in this book, together wit
Zobrazit plný text záznamu
9
Sequentially Swapping Colored Tokens on Graphs
Autor: Takeaki Uno, Takashi Horiyama, Ryuhei Uehara, Toshiki Saitoh, Katsuhisa Yamanaka, Akira Suzuki, Yoshio Okamoto, Akitoshi Kawamura, Erik D. Demaine, Shin-ichi Nakano
Publikováno v: Journal of Graph Algorithms and Applications. 23:3-27
We consider a puzzle consisting of colored tokens on an n-vertex graph, where each token has a distinct starting vertex and a set of allowable target vertices for it to reach, and the only allowed transformation is to “sequentially” move the chos
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::81c2f993eda44e462b7053565b77cf91
https://doi.org/10.7155/jgaa.00482
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje