Possibly Related Publications

The following publications are possibly variants of this publication:

• On approximation intractability of the path-distance-width problemKoichi Yamazaki. DAM, 110(2-3):317-325, 2001.
• The Generating Power of the Boundary NLC Graph GrammarsKoichi Yamazaki. acm 1993: 404-409 [doi]
• A Normal Form Problem for Unlabeled Boundary NLC Graph LanguagesKoichi Yamazaki. iandc, 120(1):1-10, July 1995.
• The Generating Power of Boundary NLC Graph Grammars and Cycle GraphsKoichi Yamazaki. isci, 80(1-2):133-148, 1994.
• A Hierarchy of the Class of Apex NLC Graph Languages by Bounds on the Number of Nonterminal Nodes in ProductionsKoichi Yamazaki. ACTA, 34(5):325-335, 1997.
• ForewordKoichi Yamazaki. ieicet, 95-D(3):711, 2012. [doi]
• Tangle and Maximal IdealKoichi Yamazaki. walcom 2017: 81-92 [doi]
• Inapproximability of Rank, Clique, Boolean, and Maximum Induced Matching-Widths under Small Set Expansion HypothesisKoichi Yamazaki. algorithms, 11(11):173, 2018. [doi]