The following pages link to Koichi Yamazaki (Q187147):
Displaying 41 items.
- It is hard to know when greedy is good for finding independent sets (Q286978) (← links)
- Thin strip graphs (Q344860) (← links)
- Outerplanar obstructions for matroid pathwidth (Q393173) (← links)
- The carving-width of generalized hypercubes (Q710586) (← links)
- Lower bounds for treewidth of product graphs (Q741743) (← links)
- Security number of grid-like graphs (Q967295) (← links)
- An improved algorithm for the longest induced path problem on \(k\)-chordal graphs (Q1005252) (← links)
- Worst case analysis of a greedy algorithm for graph thickness (Q1007554) (← links)
- On spanning tree congestion of graphs (Q1043936) (← links)
- Tree-length equals branch-length (Q1044006) (← links)
- (Q1293877) (redirect page) (← links)
- Isomorphism for graphs of bounded distance width (Q1293880) (← links)
- A pumping lemma and the structure of derivations in the boundary NLC graph languages (Q1328510) (← links)
- The generating power of boundary NLC graph grammars and cycle graphs (Q1338850) (← links)
- Hardness of approximation for non-overlapping local alignments. (Q1427808) (← links)
- Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis (Q1712018) (← links)
- How to solve the torus puzzle (Q1736499) (← links)
- Pagenumber of pathwidth-\(k\) graphs and strong pathwidth-\(k\) graphs (Q1861235) (← links)
- A note on greedy algorithms for the maximum weighted independent set problem (Q1861582) (← links)
- A normal form problem for unlabeled boundary NLC graph languages (Q1898472) (← links)
- A hierarchy of the class of apex NLC graph languages by bounds on the number of nonterminal nodes in productions (Q1920234) (← links)
- Tangle and ultrafilter: game theoretical interpretation (Q2308502) (← links)
- A lower bound for the vertex boundary-width of complete \(k\)-ary trees (Q2427498) (← links)
- A revisit of the scheme for computing treewidth and minimum fill-in (Q2441783) (← links)
- Approximating the path-distance-width for AT-free graphs and graphs in related classes (Q2442209) (← links)
- Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs (Q2457021) (← links)
- (Q2743803) (← links)
- (Q2857402) (← links)
- Tangle and Maximal Ideal (Q2980900) (← links)
- Approximability of the Path-Distance-Width for AT-free Graphs (Q3104783) (← links)
- (Q4253326) (← links)
- (Q4253363) (← links)
- (Q4331284) (← links)
- (Q4505397) (← links)
- (Q4703656) (← links)
- (Q4705515) (← links)
- (Q4705516) (← links)
- (Q4761857) (← links)
- (Q4937851) (← links)
- On approximation intractability of the path-distance-width problem (Q5936467) (← links)
- Learning of restricted RNLC graph languages (Q6487959) (← links)