| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Atsuko Yamaguchi Atsuko Yamaguchi, Hiroshi Mamitsuka : Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees. ISAAC 2003 : 58-67 Atsuko Yamaguchi, Akihiro Sugimoto : An Approximation Algorithm for the Two-Layered Graph Drawing Problem. COCOON 1999 : 81-91 Atsuko Yamaguchi, Koji Nakano , Satoru Miyano : An Approximation Algorithm for the Minimum Common Supertree Problem. Nord. J. Comput. 4 (2): 303-316 (1997) 1 [ 3 ] 2 [ 1 ] 3 [ 1 ] 4 [ 2 ]  ©2004 Association for Computing Machinery |
