Author of the publication

Approximating the path-distance-width for AT-free graphs and graphs in related classes.

, , , , , , , and . Discrete Applied Mathematics, (2014)

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.

No persons found for author name Yamanaka, Katsuhisa
add a person with the name Yamanaka, Katsuhisa
 

Other publications of authors with the same name

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 Transactions, 91-A (9): 2284-2291 (2008)Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract)., , and . WALCOM, volume 5431 of Lecture Notes in Computer Science, page 141-150. Springer, (2009)On the Parameterized Complexity for Token Jumping on Graphs., , , , , and . TAMC, volume 8402 of Lecture Notes in Computer Science, page 341-351. Springer, (2014)Random generation and enumeration of bipartite permutation graphs., , , and . J. Discrete Algorithms, (2012)More Routes for Evacuation., , and . COCOON, volume 10976 of Lecture Notes in Computer Science, page 76-83. Springer, (2018)Efficient enumeration of ordered trees with k leaves., , and . Theor. Comput. Sci., (2012)Computational Complexity of Competitive Diffusion on (Un)weighted Graphs., , , , , , , , and . CoRR, (2014)Exact Exponential Algorithm for Distance-3 Independent Set Problem., , and . IEICE Transactions, 102-D (3): 499-501 (2019)Random Generation and Enumeration of Proper Interval Graphs., , , and . IEICE Transactions, 93-D (7): 1816-1823 (2010)