A note on greedy algorithms for the maximum weighted independent set problem S Sakai, M Togasaki, K Yamazaki Discrete applied mathematics 126 (2-3), 313-322, 2003 | 315 | 2003 |

Isomorphism for graphs of bounded distance width K Yamazaki, HL Bodlaender, B de Fluiter, DM Thilikos Algorithmica 24 (2), 105-127, 1999 | 43 | 1999 |

On spanning tree congestion of graphs K Kozawa, Y Otachi, K Yamazaki Discrete mathematics 309 (13), 4215-4224, 2009 | 25 | 2009 |

It is hard to know when greedy is good for finding independent sets HL Bodlaender, DM Thilikos, K Yamazaki Information Processing Letters 61 (2), 101-106, 1997 | 25 | 1997 |

Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs Y Otachi, Y Okamoto, K Yamazaki Discrete Applied Mathematics 155 (17), 2383-2390, 2007 | 19 | 2007 |

Security number of grid-like graphs K Kozawa, Y Otachi, K Yamazaki Discrete applied mathematics 157 (11), 2555-2561, 2009 | 18 | 2009 |

Computer science education for primary and lower secondary school students: Teaching the concept of automata D Isayama, M Ishiyama, R Relator, K Yamazaki ACM Transactions on Computing Education (TOCE) 17 (1), 1-28, 2016 | 15 | 2016 |

Outerplanar obstructions for matroid pathwidth A Koutsonas, DM Thilikos, K Yamazaki Discrete Mathematics 315, 95-101, 2014 | 13 | 2014 |

An improved algorithm for the longest induced path problem on k-chordal graphs T Ishizeki, Y Otachi, K Yamazaki Discrete applied mathematics 156 (15), 3057-3059, 2008 | 13 | 2008 |

A pumping lemma and the structure of derivations in the boundary NLC graph languages K Yamazaki, T Yaku Information sciences 75 (1-2), 81-97, 1993 | 13 | 1993 |

Pagenumber of pathwidth-k graphs and strong pathwidth-k graphs M Togasaki, K Yamazaki Discrete mathematics 259 (1-3), 361-368, 2002 | 12 | 2002 |

Isomorphism for graphs of bounded distance width K Yamazaki, HL Bodlaender, B De Fluiter, DM Thilikos Italian Conference on Algorithms and Complexity, 276-287, 1997 | 11 | 1997 |

A revisit of the scheme for computing treewidth and minimum fill-in M Furuse, K Yamazaki Theoretical Computer Science 531, 66-76, 2014 | 9 | 2014 |

On approximation intractability of the path–distance–width problem K Yamazaki Discrete applied mathematics 110 (2-3), 317-325, 2001 | 9 | 2001 |

Lower bounds for treewidth of product graphs K Kozawa, Y Otachi, K Yamazaki Discrete Applied Mathematics 162, 251-258, 2014 | 8 | 2014 |

Tree-length equals branch-length K Umezawa, K Yamazaki Discrete Mathematics 309 (13), 4656-4660, 2009 | 8 | 2009 |

Worst case analysis of a greedy algorithm for graph thickness S Kawano, K Yamazaki Information processing letters 85 (6), 333-337, 2003 | 7 | 2003 |

The carving-width of generalized hypercubes K Kozawa, Y Otachi, K Yamazaki Discrete mathematics 310 (21), 2867-2876, 2010 | 6 | 2010 |

Hardness of approximation for non-overlapping local alignments H Nagashima, K Yamazaki Discrete applied mathematics 137 (3), 293-309, 2004 | 6 | 2004 |

Outerplanar obstructions for matroid pathwidth A Koutsonas, DM Thilikos, K Yamazaki Electronic Notes in Discrete Mathematics 38, 541-546, 2011 | 5 | 2011 |