| Syllabus Mining for Faculty Development in Science and Engineering Courses | 0 | 0.34 | 2019 |
| Thin strip graphs | 0 | 0.34 | 2017 |
| Computer Science Education for Primary and Lower Secondary School Students: Teaching the Concept of Automata. | 1 | 0.36 | 2017 |
| Anti-Slide. | 0 | 0.34 | 2015 |
| Approximating the path-distance-width for AT-free graphs and graphs in related classes. | 1 | 0.35 | 2014 |
| Lower bounds for treewidth of product graphs | 1 | 0.36 | 2014 |
| How To Solve The Torus Puzzle | 2 | 0.51 | 2012 |
| Outerplanar obstructions for matroid pathwidth | 3 | 0.39 | 2011 |
| Approximability of the path-distance-width for AT-free graphs | 2 | 0.39 | 2011 |
| The carving-width of generalized hypercubes | 3 | 0.39 | 2010 |
| On spanning tree congestion of graphs | 7 | 0.58 | 2009 |
| Tree-length equals branch-length | 3 | 0.42 | 2009 |
| Security number of grid-like graphs | 8 | 0.68 | 2009 |
| A lower bound for the vertex boundary-width of complete k-ary trees | 2 | 0.40 | 2008 |
| An improved algorithm for the longest induced path problem on k-chordal graphs | 2 | 0.41 | 2008 |
| Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs | 12 | 0.61 | 2007 |
| Hiroyuki Nagashima and Koichi Yamazaki | 0 | 0.34 | 2004 |
| Worst case analysis of a greedy algorithm for graph thickness | 3 | 0.43 | 2003 |
| A note on greedy algorithms for the maximum weighted independent set problem | 126 | 9.04 | 2003 |
| Pagenumber of pathwidth-k graphs and strong pathwidth-k graphs | 4 | 0.47 | 2002 |
| A Characterization of k-th Powers Pn, k of Paths in Terms of k-Trees | 0 | 0.34 | 2001 |
| On approximation intractability of the path—distance—width problem | 5 | 0.45 | 2001 |
| A Hierarchy of the Class of Apex NLC Graph Languages by Bounds on the Number of Nonterminal Nodes in Productions | 0 | 0.34 | 1997 |
| It is hard to know when greedy is good for finding independent sets | 7 | 0.61 | 1997 |
| Isomorphism for Graphs of Bounded Distance Width | 22 | 0.79 | 1997 |
| A normal form problem for unlabeled boundary NLC graph languages | 2 | 0.38 | 1995 |
| Learning of Restricted RNLC Graph Languages | 1 | 0.43 | 1995 |
| The generating power of boundary NLC graph grammars and cycle graphs | 0 | 0.34 | 1994 |
| The generating power of the boundary NLC graph grammars | 1 | 0.41 | 1993 |
| A pumping lemma and the structure of derivations in the boundary NLC graph languages | 4 | 0.61 | 1993 |
