| 2008 |
|---|
| 18 | EE | Tetsuya Ishizeki,
Yota Otachi,
Koichi Yamazaki:
An improved algorithm for the longest induced path problem on k-chordal graphs.
Discrete Applied Mathematics 156(15): 3057-3059 (2008) |
| 17 | EE | Yota Otachi,
Koichi Yamazaki:
A lower bound for the vertex boundary-width of complete k-ary trees.
Discrete Mathematics 308(12): 2389-2395 (2008) |
| 2007 |
|---|
| 16 | EE | Yota Otachi,
Yoshio Okamoto,
Koichi Yamazaki:
Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs.
Discrete Applied Mathematics 155(17): 2383-2390 (2007) |
| 2004 |
|---|
| 15 | EE | Hiroyuki Nagashima,
Koichi Yamazaki:
Hiroyuki Nagashima and Koichi Yamazaki.
Discrete Applied Mathematics 137(3): 293-309 (2004) |
| 2003 |
|---|
| 14 | | Shuichi Sakai,
Mitsunori Togasaki,
Koichi Yamazaki:
A note on greedy algorithms for the maximum weighted independent set problem.
Discrete Applied Mathematics 126(2-3): 313-322 (2003) |
| 13 | EE | Sinichiro Kawano,
Koichi Yamazaki:
Worst case analysis of a greedy algorithm for graph thickness.
Inf. Process. Lett. 85(6): 333-337 (2003) |
| 2002 |
|---|
| 12 | EE | Mitsunori Togasaki,
Koichi Yamazaki:
Pagenumber of pathwidth-k graphs and strong pathwidth-k graphs.
Discrete Mathematics 259(1-3): 361-368 (2002) |
| 2001 |
|---|
| 11 | | Koichi Yamazaki:
On approximation intractability of the path-distance-width problem.
Discrete Applied Mathematics 110(2-3): 317-325 (2001) |
| 10 | | Koichi Yamazaki,
Sei'ichi Tani,
Tetsuro Nishino:
A Characterization of k-th Powers Pn, k of Paths in Terms of k-Trees.
Int. J. Found. Comput. Sci. 12(4): 435-444 (2001) |
| 1999 |
|---|
| 9 | EE | Koichi Yamazaki,
Hans L. Bodlaender,
Babette de Fluiter,
Dimitrios M. Thilikos:
Isomorphism for Graphs of Bounded Distance Width.
Algorithmica 24(2): 105-127 (1999) |
| 1997 |
|---|
| 8 | | Koichi Yamazaki,
Hans L. Bodlaender,
Babette de Fluiter,
Dimitrios M. Thilikos:
Isomorphism for Graphs of Bounded Distance Width.
CIAC 1997: 276-287 |
| 7 | | Koichi Yamazaki:
A Hierarchy of the Class of Apex NLC Graph Languages by Bounds on the Number of Nonterminal Nodes in Productions.
Acta Inf. 34(5): 325-335 (1997) |
| 6 | EE | Hans L. Bodlaender,
Dimitrios M. Thilikos,
Koichi Yamazaki:
It is Hard to Know when Greedy is Good for Finding Independent Sets.
Inf. Process. Lett. 61(2): 101-111 (1997) |
| 1995 |
|---|
| 5 | | Sei'ichi Tani,
Koichi Yamazaki:
Learning of Restricted RNLC Graph Languages.
ISAAC 1995: 171-180 |
| 4 | | Koichi Yamazaki:
A Normal Form Problem for Unlabeled Boundary NLC Graph Languages
Inf. Comput. 120(1): 1-10 (1995) |
| 1994 |
|---|
| 3 | | Koichi Yamazaki:
The Generating Power of Boundary NLC Graph Grammars and Cycle Graphs.
Inf. Sci. 80(1-2): 133-148 (1994) |
| 1993 |
|---|
| 2 | EE | Koichi Yamazaki:
The Generating Power of the Boundary NLC Graph Grammars.
ACM Conference on Computer Science 1993: 404-409 |
| 1 | EE | Koichi Yamazaki,
Takeo Yaku:
A Pumping lemma and the structure of derivations in the boundary NLC graph languages.
Inf. Sci. 75(1-2): 81-97 (1993) |
