| 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 | 375 | 2003 |
| Isomorphism for graphs of bounded distance width K Yamazaki, HL Bodlaender, B de Fluiter, DM Thilikos Algorithmica 24, 105-127, 1999 | 50 | 1999 |
| 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 | 34 | 1997 |
| On spanning tree congestion of graphs K Kozawa, Y Otachi, K Yamazaki Discrete Mathematics 309 (13), 4215-4224, 2009 | 30 | 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 | 26 | 2016 |
| 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 | 23 | 2007 |
| Outerplanar obstructions for matroid pathwidth A Koutsonas, DM Thilikos, K Yamazaki Discrete Mathematics 315, 95-101, 2014 | 18 | 2014 |
| Security number of grid-like graphs K Kozawa, Y Otachi, K Yamazaki Discrete applied mathematics 157 (11), 2555-2561, 2009 | 18 | 2009 |
| 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 | 17 | 2008 |
| Lower bounds for treewidth of product graphs K Kozawa, Y Otachi, K Yamazaki Discrete Applied Mathematics 162, 251-258, 2014 | 14 | 2014 |
| Tree-length equals branch-length K Umezawa, K Yamazaki Discrete Mathematics 309 (13), 4656-4660, 2009 | 13 | 2009 |
| Pagenumber of pathwidth-k graphs and strong pathwidth-k graphs M Togasaki, K Yamazaki Discrete mathematics 259 (1-3), 361-368, 2002 | 13 | 2002 |
| IEICE Technical Report RN CIT, R Nakazato, SY UEC, M Ueno, Y Tanaka, Y Akage, T Sakamoto, ... Evaluation, 11, 2018 | 12* | 2018 |
| A revisit of the scheme for computing treewidth and minimum fill-in M Furuse, K Yamazaki Theoretical Computer Science 531, 66-76, 2014 | 12 | 2014 |
| On approximation intractability of the path–distance–width problem K Yamazaki Discrete applied mathematics 110 (2-3), 317-325, 2001 | 12 | 2001 |
| Isomorphism for graphs of bounded distance width K Yamazaki, HL Bodlaender, B De Fluiter, DM Thilikos Algorithms and Complexity: Third Italian Conference, CIAC'97 Rome, Italy …, 1997 | 12 | 1997 |
| 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 | 12 | 1993 |
| Inapproximability of rank, clique, boolean, and maximum induced matching-widths under small set expansion hypothesis K Yamazaki Algorithms 11 (11), 173, 2018 | 11 | 2018 |
| Equivalence between Linear Tangle and Maximal Single Ideal T Fujita, K Yamazaki Open Journal of Discrete Mathematics 9 (01), 7, 2018 | 10 | 2018 |
| How to solve the torus puzzle K Amano, Y Kojima, T Kurabayashi, K Kurihara, M Nakamura, A Omi, ... Algorithms 5 (1), 18-29, 2012 | 9 | 2012 |
