“dŽqξ•ρ’ʐMŠw‰οƒRƒ“ƒsƒ…ƒe[ƒVƒ‡ƒ“Œ€‹†‰ο

  1. ƒTƒCƒhƒDƒ‹, ’†–μαΑˆκ, ΌŠΦ—²•v,
    "A Linear-Time Algorithm for Orthogonal Drawings of Triconnected Cubic Plane Graphs with the Minimum Number of Bends,"
    “dŽqξ•ρ’ʐMŠw‰οƒRƒ“ƒsƒ…ƒe[ƒVƒ‡ƒ“Œ€‹†‰ο (1997.7.11 “d’Κ‘ε).
  2. ŽO‰Yˆκ”V, ’†–μαΑˆκ, ΌŠΦ—²•v,
    "Convex Grid Drawings of Four-Connected Plane Graphs,"
    “dŽqξ•ρ’ʐMŠw‰οƒRƒ“ƒsƒ…ƒe[ƒVƒ‡ƒ“Œ€‹†‰ο (1997.10.31 “Œ–k‘ε).
  3. ŽO‰Yˆκ”V, ‚‹΄‘εŽu˜Y, ’†–μαΑˆκ, ΌŠΦ—²•v,
    "A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs,"
    “dŽqξ•ρ’ʐMŠw‰οƒRƒ“ƒsƒ…ƒe[ƒVƒ‡ƒ“Œ€‹†‰ο (1998.5.29 ŽOd‘ε).
  4. ‘Š‘—ΗŽŠ, ‘ŸΊ‘ε•γ, ΌŠΦ—²•v,
    "•½–ΚƒOƒ‰ƒt‚Ε”ρŒπ·‚ΘƒXƒ^ƒCƒi—Ρ‚π‹‚ί‚ιƒAƒ‹ƒSƒŠƒYƒ€,"
    “dŽqξ•ρ’ʐMŠw‰οƒRƒ“ƒsƒ…ƒe[ƒVƒ‡ƒ“Œ€‹†‰ο (1999.10.25 “Œ–k‘ε).
  5. ˆι•ΣGŽi, Žό‹Ε, ΌŠΦ—²•v,
    "A Linear Algorithm for Finding Total Coloring of Partial k-Trees,"
    “dŽqξ•ρ’ʐMŠw‰οƒRƒ“ƒsƒ…ƒe[ƒVƒ‡ƒ“Œ€‹†‰ο (1999.10.25 “Œ–k‘ε).
  6. ŽO‰Yˆκ”V, ’†–μαΑˆκ, ΌŠΦ—²•v,
    "Grid Drawings of Four-Connected Plane Graphs,"
    “dŽqξ•ρ’ʐMŠw‰οƒRƒ“ƒsƒ…ƒe[ƒVƒ‡ƒ“Œ€‹†‰ο (1999.10.25 “Œ–k‘ε).