The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Koichi Yamazaki: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  17. An improved algorithm for the longest induced path problem on k-chordal graphs. [Citation Graph (, )][DBLP]


  18. Security number of grid-like graphs. [Citation Graph (, )][DBLP]


  19. A lower bound for the vertex boundary-width of complete k-ary trees. [Citation Graph (, )][DBLP]


  20. Tree-length equals branch-length. [Citation Graph (, )][DBLP]


  21. On spanning tree congestion of graphs. [Citation Graph (, )][DBLP]


  22. The carving-width of generalized hypercubes. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002