( en | de | ru )

 

Disambiguation of "Yamanaka, Katsuhisa"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient Segment Folding is Hard.

, , , , , and . CoRR, (2020)

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

Computational Complexity of Competitive Diffusion on (Un)weighted Graphs., , , , , , , , and . CoRR, (2014)A Polynomial Delay Algorithm for Enumerating 2-Edge-Connected Induced Subgraphs., , and . FAW, volume 12340 of Lecture Notes in Computer Science, page 13-24. Springer, (2020)Floorplans with Walls., and . TAMC, volume 12337 of Lecture Notes in Computer Science, page 50-59. Springer, (2020)Efficient enumeration of ordered trees with k leaves., , and . Theor. Comput. Sci., (2012)The Complexity of Induced Tree Reconfiguration Problems., , and . LATA, volume 9618 of Lecture Notes in Computer Science, page 330-342. Springer, (2016)Sorting Balls and Water: Equivalence and Computational Complexity., , , , , , , , , and . FUN, volume 226 of LIPIcs, page 16:1-16:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Quick Computation of the Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits., , , and . ISMVL, page 153-157. IEEE, (2023)Competitive Diffusion on Weighted Graphs., , , , , , , , and . WADS, volume 9214 of Lecture Notes in Computer Science, page 422-433. Springer, (2015)A Compact Encoding of Rectangular Drawings with Edge Lengths., and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 96-A (6): 1032-1035 (2013)A Compact Encoding of Rectangular Drawings with Efficient Query Supports., and . AAIM, volume 4508 of Lecture Notes in Computer Science, page 68-81. Springer, (2007)