( en | de | ru )

 

Disambiguation of "Yamanaka, Katsuhisa"

Author of the publication

copydeleteadd this publication to your clipboard
Swapping colored tokens on graphs.

, , , , , , , and . Theor. Comput. Sci., (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Katsuhisa Shibuya

Yukio Yamanaka

Nobuyuki Yamanaka

Yuri Yamanaka

 

Other publications of authors with the same name

Random generation and enumeration of bipartite permutation graphs., , , and . J. Discrete Algorithms, (2012)Efficient enumeration of all ladder lotteries and its application., , , , and . Theor. Comput. Sci., 411 (16-18): 1714-1722 (2010)A Compact Encoding of Rectangular Drawings with Efficient Query Supports., and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 91-A (9): 2284-2291 (2008)More Routes for Evacuation., , and . COCOON, volume 10976 of Lecture Notes in Computer Science, page 76-83. Springer, (2018)Compiling Crossing-free Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and Optimization., , , and . CoRR, (2020)Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract)., , and . WALCOM, volume 5431 of Lecture Notes in Computer Science, page 141-150. Springer, (2009)Efficient Segment Folding is Hard., , , , , and . CoRR, (2020)Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries., , and . IWOCA, volume 13889 of Lecture Notes in Computer Science, page 331-342. Springer, (2023)On the Parameterized Complexity for Token Jumping on Graphs., , , , , and . TAMC, volume 8402 of Lecture Notes in Computer Science, page 341-351. Springer, (2014)Computational Complexity of Competitive Diffusion on (Un)weighted Graphs., , , , , , , , and . CoRR, (2014)