’˜‘E•Ò’˜E–ó‘

’˜‘

  1. T. Nishizeki and N. Chiba, Planar Graphs : Theory and Algorithms, North-Holland, Amsterdam, 1988.
  2. ç—t‘¥–ÎC¼ŠÖ—²•vCÖ“¡LŽ©C—£ŽU”ŠwC’©‘q‘“XC1989.
  3. “¿ŽR‹CŽº“cˆê—YC‰Á“¡’¼Ž÷C¼ŠÖ—²•vC’†–ìáÁˆêCã–ìCˆêC—£ŽU\‘¢‚ƃAƒ‹ƒSƒŠƒYƒ€‡TC‹ß‘ã‰ÈŠwŽÐC1992.
  4. T. Nishizeki and M. S. Rahman, Planar Graph Drawing, World Scientific, Singapore, 2004.

•ÒW

  1. N. Saito and T. Nishizeki (Ed.)CGraph Theory and Algorithms, Springer, Lecture Notes in Computer Science, 108, 1981.
  2. D. S. Johnson, T. Nishizeki, A. Nozaki and H.S. Wilf (Ed.)CDiscrete Algorithms and Complexity, Academic Press, 1987.
  3. T. Asano, T. Ibaraki, H. Imai and T. Nishizeki (Ed.), Algorithms, Proc. Int. Symp. SIGAL f90, Springer, Lecture Notes in Computer Science, 450, 1987.
  4. T. Ibaraki, N. Inagaki, K. Iwama, T. Nishizeki and M. Yamashita (Ed.), Algorithms and Computation, Proc. of ISAAC f92, Springer, Lecture Notes in Computer Science, 650, 1992.
  5. A. Maruoka, T. Nishizeki and S. Horiguchi, Brain, Mind and Society, Proc. of GSIS Int. Symp. on Information Sciences of New Era, GSIS, Tohoku University, Sendai, 2005.
  6. S.-H. Hong, T. Nishizeki and W. Quan (Ed.), Graph Drawing, Proc. 15th Int. Symp. GD 2007, Springer Lecture Notes in Computer Science, 4875, 2008.

–ó‘

  1. ƒOƒ‰ƒt‚ƃ_ƒCƒOƒ‰ƒt‚Ì—˜_D[‹¤—§o”ÅC(1981)] HŽRmC¼ŠÖ—²•v
  2. ƒOƒ‰ƒt—˜_“ü–å (ƒ{ƒƒoƒVƒ…’˜)D[”|•—ŠÙC(1983)] Ö“¡LŽ©C¼ŠÖ—²•v
  3. ƒOƒ‰ƒt—˜_“ü–å (ƒEƒBƒ‹ƒ\ƒ“’˜)D[‹ß‘ã‰ÈŠwŽÐC(1985)] Ö“¡LŽ©C¼ŠÖ—²•v
  4. ƒAƒ‹ƒSƒŠƒYƒ€‚ÆŒvŽZ—Ê“ü–å (ƒEƒBƒ‹ƒt’˜)D[‘Œ¤o”ÅC(1988)10ŒŽ] ¼ŠÖ—²•vC‚‹´Œh
  5. ƒOƒ‰ƒt—˜_“ü–å‘æ‚S”Å (ƒEƒBƒ‹ƒ\ƒ“’˜)D[‹ß‘ã‰ÈŠwŽÐC(2001)] ¼ŠÖ—²•vC¼ŠÖ—TŽq
–ß‚é