E-LIB Suche - Ergebnisse für: Yamanaka, Katsuhisa

1

WALCOM: Algorithms and Computation: 18th International Conf..

Lecture Notes in Computer Science, 14549

Uehara, Ryuhei ; Yamanaka, Katsuhisa ; Yen, Hsu-Chun - 1st ed. 2024 . , 2024

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

2

Enumerating floorplans with walls:

Yamanaka, Katsuhisa ; Nakano, Shin-ichi
Discrete Applied Mathematics. 342 (2024) - p. 1-11 , 2024

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

3

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

4

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

5

Quick Computation of the Lower Bound on the Gate Count of T..:

, In: 2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL),

Hirayama, Takashi ; Suzuki, Rin ; Yamanaka, Katsuhisa. - p. 153-157 , 2023

Link: https://doi.org/10.1109/..

6

Reconfiguration and Enumeration of Optimal Cyclic Ladder Lo..:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,

Nozaki, Yuta ; Wasa, Kunihiro ; Yamanaka, Katsuhisa - p. 331-342 , 2023

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

7

Efficient segment folding is hard:

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

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

8

An O(n2)-Time Algorithm for Computing a Max-Min 3-Dispersio..:

KOBAYASHI, Yasuaki ; NAKANO, Shin-ichi ; UCHIZAWA, Kei...
IEICE Transactions on Information and Systems. E105.D (2022) 3 - p. 503-507 , 2022

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

9

A Polynomial Delay Algorithm for Enumerating 2-Edge-Connect..:

ITO, Taishu ; SANO, Yusuke ; YAMANAKA, Katsuhisa.
IEICE Transactions on Information and Systems. E105.D (2022) 3 - p. 466-473 , 2022

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

10

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

11

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

12

Floorplans with Walls:

, In: Lecture Notes in Computer Science; Theory and Applications of Models of Computation,

Yamanaka, Katsuhisa ; Nakano, Shin-ichi - p. 50-59 , 2020

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

13

A Polynomial Delay Algorithm for Enumerating 2-Edge-Connect..:

, In: Frontiers in Algorithmics; Lecture Notes in Computer Science,

Sano, Yusuke ; Yamanaka, Katsuhisa ; Hirayama, Takashi - p. 13-24 , 2020

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

14

Parameterized complexity of independent set reconfiguration..:

Ito, Takehiro ; Kamiński, Marcin ; Ono, Hirotaka...
Discrete Applied Mathematics. 283 (2020) - p. 336-345 , 2020

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

15

The Complexity of Induced Tree Reconfiguration Problems:

WASA, Kunihiro ; YAMANAKA, Katsuhisa ; ARIMURA, Hiroki
IEICE Transactions on Information and Systems. E102.D (2019) 3 - p. 464-469 , 2019

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