Publications

  1. Journals

    1. T. Mizuki, H. Tsubata and T. Nishizeki, ``Minimizing AND-EXOR Expressions for Two-Variable Multiple-Valued Input Binary Output Functions,'' Journal of Multiple-Valued Logic and Soft Computing, Vol.16, No.1-2, pp.197-208, 2010.
    2. Y. Asano, Y. Miyawaki and T. Nishizeki, ``Efficient compression of web graphs,'' IEICE Trans. Fundamentals, Vol.E92-A, No.10, pp.2454-2462, 2009.
    3. T. Ito, X, Zhou and T. Nishizeki, ``Partitioning graphs of supply and demand,” Discrete Applied Mathematics, 157, pp.2620-2633, 2009.
    4. K. Miura, T. Matsuno and T. Nishizeki, ``Open rectangle-of-influence drawings of inner triangulated plane graphs,'' Discrete and Computational Geometry, 41, pp.643-670, 2009.
    5. Md. S. Rahman, K. Miura and T. Nishizeki, ``Octagonal drawings of plane graphs with prescribed face areas,'' Computational Geometry: Theory and Applications, Vol.42, No.3, pp.214-230, 2009. [pdf]
    6. X. Zhou and T. Nishizeki, ``Orthogonal drawings of series-parallel graphs with minimum bends,'' SIAM J. Discrete Math., Vol.22, No.4, pp.1570-1604, 2008. [pdf]
    7. T. Ito, E. D. Demaine, X. Zhou and T. Nishizeki, ``Approximability of partitioning graphs with supply and demand,'' Journal of Discrete Algorithms, Vol.6, No.4, pp.627-650, 2008.
    8. K. Miura, A. Kamada and T. Nishizeki, ``Convex grid drawings of plane graphs with rectangular contours,'' J. Graph Alg. and Appl., Vol.12, No.2, pp.197-224, 2008. [pdf]
    9. Y. Asano, Y. Tezuka and T. Nishizeki, ``Improvements of HITS algorithms for spam links,'' IEICE Trans. INF. & SYST., Vol.E91-D, No.2, pp.200-208, 2008.
    10. K. Koizumi, T. Mizuki and T. Nishizeki, ``A revised transformation protocol for unconditionally secure secret key exchange,'' Theory of Computing Systems, Vol.42, No.2, pp.187-221, 2008.
    11. S. Isobe, X. Zhou and T. Nishizeki, ``Total colorings of degenerate graphs,'' Combinatorica, Vol.27, No.2, pp.167-182, 2007.
    12. Y. Matsuo, X. Zhou and T. Nishizeki, ``Sufficient condetion and Algorithm for list total colorings of series-paralle graphs,'' IEICE Trans. Fundamentals, vol.E90-A, No.5, pp.907-916, 2007.
    13. T. Ito, A. Kato, X. Zhou and T. Nishizeki, ``Algorithms for finding distance-edge-colorings of graphs,'' Journal of Discrete Algorithms, Vol.5, No.2, pp.304-322, 2007.
    14. T. Ito, K. Goto, X. Zhou and T. Nishizeki, ``Partitioning a multi-weighted graph to connected subgraphs of almost uniform size,'' IEICE Trans. INF. & SYST., Vol.E90-D, No.2, pp.449-456, 2007.
    15. Y. Asano, T. Nishizeki, M. Toyoda and M. Kitsuregawa, ``Mining communities on the web using a max-flow and site-oriented framework,'' IEICE Trans. INF. & SYST., Vol.E89-D, No.10, pp.2606-2615, 2006.
    16. K. Miura, M. Azuma and T. Nishizeki, ``Convex drawings of plane graphs of minimum outer apices,'' International Journal of Foundations of Computer Science, Vol.17, No.5, pp.1115-1127, 2006.
    17. K. Miura, S.-I. Nakano and T. Nishizeki, ``Convex grid drawings of four-connected plane graphs,'' International Journal of Foundations of Computer Science, Vol.17, No.5, pp.1032-1060, 2006.
    18. K. Miura, H. Haga and T. Nishizeki, ``Inner rectangular drawings of plane graphs,'' International Journal of Computational Geometry \& Applications, Vol.16, Nos.2 & 3, pp.249-270, 2006.
    19. T. Ito, X. Zhou and T. Nishizeki, ``Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size,'' Journal of Discrete Algorithms, Vol.4, pp. 142-154, 2006.
    20. K. Banno, S. Orihara, T. Mizuki and T. Nishizeki, ``Security index for digital fingerprinting,'' IEICE Trans. Fundamentals, Vol.E-89-A, No.1, pp.169-177, 2006.
    21. T. Ito, X. Zhou and T. Nishizeki, ``Partitioning trees of supply and demand,'' International Journal of Foundations of Computer Science, Vol.16, No.4, pp.803-827, 2005.
    22. K. Miura, M. Azuma and T. Nishizeki, ``Canonical decomposition, realizer, Schnyder labeling and orderly spanning trees of plane graphs,'' International Journal of Foundations of Computer Science, Vol.16, No.1, pp.117-141, 2005.
    23. X. Zhou, Y. Matsuo and T. Nishizeki, ``List total colorings of series-parallel graphs,'' Journal of Discrete Algorithms, 3, pp.47-60, 2005.
    24. Md. S. Rahman, N. Egi and T. Nishizeki, ``No-bend orthogonal drawings of subdivisions of planar triconnected cubic graphs,'' IEICE Trans. INF. & SYST., Vol.E88-D, No.1, pp.23-30, 2005.
    25. X. Zhou and T. Nishizeki, ``Algorithm for the cost edge-coloring of trees,'' Journal of Combinatorial Optimization, 8, pp.97-108, 2004.
    26. X. Zhou and T. Nishizeki, ``Multicolorings of series-parallel graphs,'' Algorithmica, 38, pp.271-297, 2004.
    27. T. Nishizeki, K. Miura and Md. S. Rahman, ``Algorithms for drawing plane graphs,'' IEICE Trans. INF. & SYST., Vol.E-87, No.2, pp.281-289, 2004.
    28. S. Isobe, X. Zhou and T. Nishizeki, ``Cost total colorings of trees,'' IEICE Trans. INF. & SYST., Vol.E-87, No.2, pp.337-342, 2004.
    29. Md. Saidur Rahman, Takao Nishizeki and Shubhashis Ghosh, ``Rectangular Drawings of Planar Graphs,'' Journal of Algorithms, 50, pp.62-78, 2004.
    30. Md. Saidur Rahman, Takao Nishizeki and Mahmuda Naznin, ``Orthogonal Drawings of Plane Graphs Without Bends,'' Journal of Graph Algorithms and Applications, Vol. 7(4), pp. 335-362, 2003.
    31. T. Mizuki, H. Shizuya and T. Nishizeki, ``Characterization of optimal key set protocols,'' Discrete Applied Mathematics, 131, pp.213-236, 2003.
    32. Masud Hasan, Md. Saidur Rahman and Takao Nishizeki, ``A Linear Algorithm for Compact Box-Drawings of Trees,'' NETWORKS, Vol.42(3), pp.160-164, 2003.
    33. S. Orihara, T. Mizuki and T. Nishizeki, ``New security index for digital fingerprinting and its bounds,'' IEICE Trans. Fundamentals, vol.E86-A, No.5, pp.1156-1163, 2003.
    34. T. Fujino, X. Zhou and T. Nishizeki, ``List edge-colorings of series-parallel graphs,'' IEICE Trans. Fundamentals, vol.E86-A, No.5, pp.1034-1045, 2003.
    35. 小泉 康一, 水木 敬明, 西関 隆夫, ``量子カード配布,'' 電子情報通信学会論文誌 Vol.J86-A, No.4, pp.465-473, 2003.
    36. Y. Kusakari and T. Nishizeki, ``Finding a region with the minimum total $L_1$ distance from prescribed terminals,'' Algorithmica, 35, pp.225-256, 2003.
    37. T. Fijino, I. Isobe, X. Zhou and T. Nishizeki, ``Linear algorithm for finding list edge-colorings of series-parallel graphs,'' IEICE Trans. Inf. & Syst., vol.E86-D, No.2, pp.186-190, 2003.
    38. T. Ito, X. Zhou and T. Nishizeki, ``Algorithms for multicolorings of partial k-trees,'' IEICE Trans. Inf. & Syst., vol.E86-D, No.2, pp.191-200, 2003.
    39. A. Koike, S. Nakano, T. Nishizeki, T. Tokuyama and S. Watanabe, ``Labeling points with rectangles of various shapes,'' International Journal of Computational Geometry & Applications, Vol.12, No.6, pp.511-528, 2002.
    40. Y. Kusakari, M. Sato and T. Nishizeki, ``Planar Reconfiguration of Monotone Trees,'' IEICE Trans. Fundamentals Vol.E85-A, No.5, pp.938-943, 2002.
    41. T. Mizuki, H. Shizuya and T. Nishizeki, ``A complete characterization of a family of key exchange protocols,'' Int. J. Information Security, 1, pp.131-142, 2002.
    42. T. Mizuki and T. Nishizeki, ``Necessary and sufficient numbers of cards for sharing secret keys on hierarchical groups,'' IEICE Trans. Inf. & Syst., Vol.E85-D, No.2, pp.333-345, 2002.
    43. Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki, ``Rectangular Drawings of Plane Graphs without Designated Corners,'' Computational Geometry Theory and Applications, vol 21(3), pp.121-138, 2002.
    44. T. Nishizeki, J. Vygen and X. Zhou ``The edge-disjoint paths problem is NP-complete for series-parallel graphs,'' Discrete Applied Math., 155, pp.177-186, 2001.
    45. Kazuyuki Miura, Shin-ichi Nakano and Takao Nishizeki, ``Grid Drawings of 4-Connected Plane Graphs,'' Discrete & Computational Geometry, 26, pp.73-87, 2001.
    46. Yoshiyuki Kusakari, Daisuke Masubuchi and Takao Nishizeki, ``Finding a noncrossing Steiner forest in plane graphs under a 2-face condition,'' Journal of Combinatorial Optimization, 5, pp.249-266, 2001.
    47. Md. Saidur Rahaman, Shin-ichi Nakano and Takao Nishizeki, ``Box-rectangular drawings of plane graphs,'' Journal of Algorithms 37, pp.363-398, 2000.
    48. Takaaki Mizuki, Hiroki Shizuya and Takao Nishizeki, ``Sharing secret keys along a Eulerian circuit,'' Electronics and Communications in Japan, Part 3, Vol.83, No.4, pp.703-713, 2000.
    49. Md. Abul Kashem, Xiao Zhou and Takao Nishizeki, ``Algorithms for generalized vertex-rankings of partial k-trees,'' Theoretical Computer Science, Vol.240, pp.407-427, 2000.
    50. T. Mizuki, H. Shizuya and T. Nishizeki, ``A Necessary and Sufficient Condition for a Key Set Protocol Using a Random Deal of Cards to be Optimal,'' Trans. on IEICE,Vol.J83-A, No.5, pp.545-553, 2000. (In Japanese)
    51. Xiao Zhou, Kazuki Fuse, and Takao Nishizeki, ``A Linear Algorithm for Finding [g,f]-Colorings of Partial k-Trees,'' Algorithmica, 27, pp.227-243, 2000.
    52. Xiao Zhou, Yasuaki Kanari, and Takao Nishizeki, ``Generalized vertex-colorings of partial k-trees,'' IEICE Trams. Fundamentals, Vol.E83-A, No.4, pp.671-678, 2000.
    53. Takaaki Mizuki, Zhi-Bo Sui, Hiroki Shizuya, and Takao Nishizeki, ``On the Average Length of Secret Key Exchange Eulerian Circuits,'' IEICE Trans. Fundamentals, Vol.E83-A, No.4, pp.662--670, 2000.
    54. Xiao Zhou and Takao Nishizeki, ``Graph Coloring Algorithms,'' IEICE Trans. Inf. & Syst., Vol.E83-D, No.3, pp.407--417, 2000.
    55. Md. Saidur, S. Nakano and T. Nishizeki, ``A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs," Journal of Graphs Algorithms and Applications, Vol.3, no.4, pp.31--62, 1999.
    56. X. Zhou, S. Tamura and T. Nishizeki, ``Finding Edge-Disjoint Paths in Partial k-Trees," Algorithmica(2000), 26: pp.3--30, 1999.
    57. S. Isobe, X. Zhou and T. Nishizeki, ``A Polynomial-Time Algorithm for Finding Total Colorings of Partial $k$-trees," International Journal of Foundations of Computer Science, Vol.10, No.2, pp.171--194, 1999.
    58. K. Miura, D. Takahashi, S. Nakano and T. Nishizeki, ``A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four Connected Planar Graphs," International Journal of Foundations of Computer Science, Vol.10, No.2, pp.195--210, 1999.
    59. Xiao Zhou and Takao Nishizeki, ``Edge-Coloring and f-Coloring for Various Classes of Graphs,'' Journal of Graph Algorithms and Applications, Vol. 3, no. 1, pp.1-18, 1999.
    60. Y. Kusakari, H. Suzuki and T. Nishizeki, ``A Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas,'' International Journal of Computational Geometry & Applications, Vol.9, No.2, pp151-170, 1999.
    61. T. Ohmi, H. Shizuya and T. Nishizeki, ``On the Complex of Languages Associated with Discrete Log Cryptosystems,'' Trans. on IEICE, Vol.82-A, No.3, pp405-414, 1999. (In Japanese)
    62. S. Nakano and T. Nishizeki, ``Automatic Drawings of Graphs,'' Trans. on IEICE, Vol.82, No.2, pp175-180, 1999. (In Japanese)
    63. X. Zhou and T. Nishizeki, ``Decompositions to Degree-Constrained Subgraphs Are Simply Reducible to Edge-Colorings,'' Journal of Combinatorial Theory, Series B75, pp270-287, 1999.
    64. T. Mizuki, H. Shizuya and T. Nishizeki, ``A Necessary and Sufficient Condition on the Numbers of Dealt Cards for Sharing a Secret Key,'' Trans. on IEICE, Vol.J82-A, No.1, pp.90-103, 1999. (In Japanese)
    65. Y. Kusakari and T. Nishizeki ``An Algorithm for Finding a Plane Region with the Minimum Total L_1 Distance from Prescribed Terminals,'' JSIAM, Vol.8, No.4, pp.469-496, 1998. (In Japanese)
    66. Md. S. Rahman, S. Nakano and T. Nishizeki, ``Rectangular Grid Drawings of Plane Graphs,'' Computational Geometry Theory and Applications, Vol.10, pp203-220, 1998.
    67. T. Mizuki, H. Shizuya and T. Nishizeki, ``Sharing Secret Keys along the Shortest Eulerian Circuit,'' Trans. on IEICE, Vol.J81-A, No.4, pp724-732, 1998. (In Japanese)
    68. T. Mizuki, H. Shizuya and T. Nishizeki, ``Sharing Secret Keys along an Eulerian Circuit with the Minimum Number of Cards,'' Trans. on IEICE, Vol.J81-A, No.4, pp714-723, 1998. (In Japanese)
    69. T. Mizuki, H. Shizuya and T. Nishizeki, ``Sharing Secret Keys along an Eulerian Circuit,'' Trans. on IEICE, Vol.J81-A, No.4, pp703-713, 1998. (In Japanese)
    70. X. Zhou, Md. A. Kashem and T. Nishizeki, ``Generalized Edge-Rankings of Trees,'' IEICE Trans. Fundamentals, Vol.E81-A, No.2, February, 1998.
    71. J. Takahashi, H. Suzuki and T. Nishizeki, ``Shortest Noncrossing Rectilinear Paths in Plane Regions,'' International Journal of Computational Geometry & Applications, Vol.7, No.5, pp.419-436, 1997.
    72. H. Hattori, S. Nakano and T. Nishizeki ``Searchlight Schedulings for Simple Polygons,'' JSIAM, Vol.7, No.3, pp.265-279, 1997. (In Japanese)
    73. S. Nakano, Md. S. Rahman and T. Nishizeki, ``A linear-time algorithm for four-artitioning four-connected planar graphs,'' Information Processing Letters 62, pp.315-322, 1997.
    74. X. Zhou and T. Nishizeki, ``An NC Parallel Algorithm for Edge-Colorings Series-Parallel Multigraphs,'' Journal of Algorithms, 23, pp.359-374, 1997.
    75. X. Zhou, S. Nakano and T. Nishizeki, ``Edge-Coloring Partial k-Trees,'' Journal of Algorithms, 21, pp.598-617, 1996.
    76. J. Takahashi, H. Suzuki and T. Nishizeki, ``Shortest Noncrossing Paths in Plane Graphs,'' Algorithmica, 16, pp.339-357, 1996.
    77. M. Iwai, H. Suzuki and T. Nishizeki, ``Shortest Paths in a Plane with Rectilinear Polygonal Obstacles,'' Trans. on IEICE, Vol.J79-D-I No.7, pp409-415, 1996. (In Japanese)
    78. X. Zhou, H. Suzuki and T. Nishizeki, ``A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs,'' Journal of Algorithms, 20, pp.174-201, 1996.
    79. E. Chida, T. Nishizeki, M. Ohmori and H. Shizuya, ``On the One-Way Algebraci Homomorphism,'' IEICE Trans. Fundamentals, Vol.E79-A, No.1, pp.54-60, January 1996.
    80. X. Zhou, N. Nagai and T. Nishizeki, ``Generalized vertex-rankings of trees,'' Information Processing Letters, 56, pp.321-328, 1995.
    81. Y. Kusakari, H. Suzuki and T. Nishizeki, ``An Algorithm for Finding a Shortest Pair of Paths in a Plane Region,'' JSIAM, Vol.5, No.4, pp381-398, 1995. (In Japanese)
    82. S. Nakano, Y. Suzuki and T. Nishizeki, ``An Algorithm for the Nearly Equitable Edge-Coloring of Graphs,'' Trans. on IEICE, Vol.J78-D-I No.5, May, pp437-444, 1995. (In Japanese)
    83. X. Zhou and T. Nishizeki, ``Optimal Parallel Algorithms for Edge-Coloring Partial k-Tree with Bounded Degrees,'' IEICE Trans. Fundamentals, E78-A, 4, April, pp.463-469, 1995.
    84. E. Chida, H. Shizuya and T. Nishizeki, ``One-Way Functions over Finite Near-Rings,'' IEICE Trans. Fundamentals, E78A, 1, 4-10, 1995.
    85. J. Takahashi, H. Suzuki and T. Nishizeki, ``Algorithms for Finding Non-crossing Paths with Minimum Total Length in Plane Region,'' Trans. on IEICE(A), J78A, 391-400, 1995. (In Japanese)
    86. T. Nishizeki and S. Poljak, ``k-Connectivity and decomposition of graphs into forests,''Discrete Applied Mathematics, 55, pp.295-301, 1994.
    87. S. Nakano and T. Nishizeki, ``Edge-Coloring Problems for Graphs,'' Interdisciplinary Information Sciences, Vol.I, No.1, pp.19-32, 1994.
    88. S. Nakano, T. Oguma and T. Nishizeki, ``A Linear-Time Algorithm for c-Triangulating Three-Colored Graphs,'' Trans. on IECE(A), Vol.J77-A, No.3, pp.543-546, 1994. (In Japanese)
    89. N. Kanamaru, T. Nishizeki, Te. Asano, ``Efficient Enumeration of Grid Points in a Convex Polygon and Its Application to Integer Programming,'' International Journal of Computational Geometry & Applications, Vol.4, No.1, pp.69-85, 1994.
    90. J. Takahashi, H. Suzuki and T. Nishizeki, ``Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs,'' Trans. on IECE(A), Vol.J77-A, No.3, pp.447-459, 1994. (In Japanese)
    91. S. Nakano, T. Nishizeki and N. Saito, ``Approximation Algorithms for the F-edge-coloring of Multigraphs,'' Trans. JSIAM, 3, 4, 279-307, 1993. (In Japanese)
    92. S. Nakano and T. Nishizeki, ``Scheduling File Transfers under Port and Channel Constraints,'' Int'l Journal of Foundations of Computer Science, Vol.4, 2, 101-115, 1993.
    93. M. Ito, A. Saito and T. Nishizeki, ``Multiple Assignment Scheme for Sharing Secret,'' J. Cryptology, 6, 15-20, 1993.
    94. A. Frank, T. Nishizeki, N. Saito, H. Suzuki and E. Terdos, ``Algorithms for routing around a rectangle,'' Discrete Applied Mathematics, 40, 363-378, 1992.
    95. H. Suzuki, A. Ishiguro and T. Nishizeki, ``Variable-Priorityx Queue and Doughnut Routing,'' Journal of Algorithms, 13, 606-635, 1992.
    96. S. Nakano and T. Nishizeki, ``An Approximation Algorithm for fg-Edge-Coloring Multigraphs,'' Trans. JSIAM, Vol.1 No.3, pp.195-211, 1991. (In Japanese)
    97. T. Nishizeki and K. Kashiwagi, ``On the 1.1 edge-coloring of multigraphs,'' SIAM J. on Discr. Math., 3, pp.391-410, 1990.
    98. S. Nakano, T. Nishizeki and N. Saito, ``On the fg-coloring of graphs,'' Combinatorica, 10, pp.67-80, 1990.
    99. M. Chrobak and T. Nishizeki, ``Improved edge-coloring algorithms for planar graphs,'' Journal of Algorithms, 11, pp.102-116, 1990.
    100. T. Nishizeki, ``Planar graphs problems,'' Computer, Supp. 7, pp.53-68, 1990.
    101. H. Suzuki, A. Ishiguro and T. Nishizeki, ``Edge-disjoint paths in a grid bounded by two nested rectangles,'' Discrete Applied Math., 27, pp.157-178, 1990.
    102. H. Suzuki, N. Takahashi, T. Nishizeki, H. Miyano and S. Ueno, ``An Algorithm for Tripartitioning 3-Connected Graphs,'' ISPJ, 31, 5, pp.584-592, 1990. (In Japanese)
    103. H. Suzuki, N. Takahashi and T. Nishizeki, ``A linear algorithm for bipartition of biconnected graphs,'' Information Processing Letters, Vol.33, 5, 10 Jan., pp.227-231, 1990.
    104. M. Ito, A. Saito and T. Nishizeki, ``Secret sharing scheme realizing general access structure,'' Electronics and Communications in Japan, Part 3, 72, 9, 1989.
    105. S. Nakano, T. Nishizeki and N. Saito, ``Upper bounds for the fg- chromatic index of graphs,'' Electronics and Communications in Japan, Part 3, 72, 2, pp.54-64, 1989.
    106. N. Chiba and T. Nishizeki, ``The hamiltonian cycle problem is linear time solvable for 4-connected planar graphs,'' Journal of Algorithms, 10, pp.187-211, 1989.
    107. H. Suzuki, T. Nishizeki and N. Saito, ``Algorithms for multicommodity flows in planar graphs,'' Algorithmica, 4, pp.471-501, 1989.
    108. H. Suzuki, T. Akama and T. Nishizeki, ``An Algorithm for Finding a Forest in a Planar Graph - Case in which a Net May Have Terminals on the Two Specified Face Boundaries,'' Trans on IECE(A), J71-A, 10, pp.1897-1905, 1988. (In Japanese)
    109. H. Suzuki, T. Akama and T. Nishizeki, ``An Algorithm for Finding a Forest in a Plane Graph - Case in which All Terminals of Each Net Lie on One of Two Specified Face Boundaries,'' Trans. on IECE(A), J71-A, 12, pp.2163-2171, 1988. (In Japanese)
    110. H. Suzuki, T. Akama and T. Nishizeki, ``Algorithms for Finding Internally-Disjoint Paths in a Plane Graph,'' Trans. on IECE(A), J71-A, 10, pp.1906-1916, 1988. (In Japanese)
    111. M. Ito, A. Saito, T. Nishizeki, ``Secret Sharing Scheme Realizing General Access Structure,'' Trans. on IECE(A), J71-A, 8, pp.1592-1598, 1988. (In Japanese)
    112. S. Nakano, T. Nishizeki and N. Saito, ``On the f-coloring of multigraphs,'' IEEE Trans. Circuits and Systems, 35, 3, pp.345-353, 1988.
    113. H. Suzuki, A. Ishiguro and T. Nishizeki, ``Edge-Disjoint Paths in a Region Bounded by Two Nested Rectangles,'' Trans. on IECE, J70-A, 12, pp.1813-1821, 1987. (In Japanese)
    114. S. Nakano, T. Nishizeki and N. Saito, ``Upper Bounds for the fg-Chromatic Index of Graphs,'' Trans. on IECE, J70-A, 10, pp.1463-1471, 1987. (In Japanese)
    115. H. Suzuki, T. Nishizeki and N. Saito, ``Algorithms for routing around a rectangle (Extended Abstract),'' in Discrete Algorithms and Complexity, (eds.) D. S. Johnson, T. Nishizeki et al., Academic Press, pp.99-105, 1987.
    116. S. Nakano, T. Nishizeki and N. Saito, ``On the f-Coloring of Graphs,'' Trans. on IECE, J70-A, 2, pp.164-174, 1987. (In Japanese)
    117. H. Suzuki, A. Ishiguro, T. Nishizeki, ``Algorithm for Finding Edge-Disjoint Paths in a Region Bounded by Nested Rectangles,'' Trans. on IECE, J70-A, 2, pp.175-184, 1987. (In Japanese)
    118. N. Chiba and T. Nishizeki, ``Theorem on paths in planar graphs,'' Journal of Graph Theory, 10, pp.449-450, 1986.
    119. T. Uehara, T. Nishizeki, E. Okamoto and K. Nakamura, ``Secret Sharing Systems with Matroidal Schemes,'' Trans. on IECE, J69-A, 9, pp.1124-1132, 1986. (In Japanese)
    120. D. S. Hochbaum, T. Nishizeki and D. Shmoys, ``A better than ``best possible'' algorithm to edge color multigraphs,'' Journal of Algorithms, 7, pp.79-104, 1986.
    121. K. Matsumoto, T. Nishizeki and N. Saito, ``Planar multicommodity flows, maximum matchings and negative cycles,'' SIAM J. on Computing, 15, 2, pp.495-510, 1986.
    122. H. Nakayama, T. Nishizeki and N. Saito, ``Lower bounds for combinatorial problems on graphs,'' Journal of Algorithms, 6, pp.393-399, 1985.
    123. T. Nishizeki and K. Kashiwagi, ``An upper bound on the chromatic index of multigraphs,'' in ``Graph Theory and its Applications to Algorithms and Computer Science,'' (eds.) Y. Alavi et al., pp.595-604, John Wiley & Sons, 1985.
    124. N. Chiba, K. Onoguchi and T. Nishizeki, ``Drawing planar graphs nicely,'' Acta Informatica, 22, pp.187-201, 1985.
    125. H. Suzuki, T. Nishizeki and N. Saito, ``An Algorithm for Multicommodity Flows in a Class of Planar Networks,'' Trans. on IECE, J68-A, 9, pp.836-843, 1985. (In Japanese)
    126. H. Suzuki, T. Nishizeki and N. Saito, ``Plane Multicommoditiy Flows and Shortest Paths,'' Trans. on IECE, J68-A, 3, pp.247-254, 1985. (In Japanese)
    127. N. Chiba, T. Nishizeki, S. Abe and T. Ozawa, ``A linear algorithm for embedding planar graphs using PQ-trees,'' J. Comput. Sys. Sci., 30, 1, pp.54-76, 1985.
    128. N. Chiba and T. Nishizeki, ``Arboricity and subgraph listing algorithms,'' SIAM J. on Computing, 14, 1, pp.210-223, 1985.
    129. K. Matsumoto, T. Nishizeki and N. Saito, ``An efficient algorithm for finding multicommodity flows in planar networks,'' SIAM J. on Computing, 14, 2, pp.289-302, 1985.
    130. T. Nishizeki, N. Saito and K. Suzuki, ``A linear-time routing algorithm for convex grids,'' IEEE Trans. on Computer-Aided-Design, CAD-4, 1, pp.68-76, 1985.
    131. T. Asano, T. Nishizeki and P. D. Seymour, ``A note on nongraphic matroids,'' Journal of Combinatorial Theory, Series B, 37, 3, pp.290-293, 1984.
    132. N. Chiba, T. Nishizeki and T. Yamanouchi, ``Linear algorithms for convex drawing of planar graphs,'' in ``Progress in Graph Theory,'' (eds.) J. A. Bondy and U. S. R. Murty, Academic Press, Toronto, pp.153-173, 1984.
    133. N. Chiba, T. Nishizeki, S. Abe and T. Ozawa, ``Embedding Planar Graphs Using PQ-Tree Algorithms,'' Trans. on IECE, J-67-A, 2, pp.87-94, 1984. (In Japanese)
    134. T. Asano, T. Nishizeki, J. Oxley and N. Saito, ``A note on the critical problem for matroids,'' European Journal of Combinatorics, 5, pp.93-97, 1984.
    135. T. Nishizeki and M. Sato, ``An Algorithm for Edge-Coloring Multigraphs,'' Trans. on IECE, J-67-D, 4, pp.466-471, 1984. (In Japanese)
    136. K. Matsumoto, T. Nishizeki and N. Saito, ``Algorithms for Plane Multicommodity Flows,'' Trans. on IECE, J67-A, 1, pp.8-15, 1984. (In Japanese)
    137. K. Suzuki, T. Nishizeki and N. Saito, ``A Linear-Time Algorithm for Finding Edge-Disjoint Paths in Grid Graphs,'' Trans. on IECE, J66-A, pp.1072-1079, 1983. (In Japanese)
    138. H. Nakayama, T. Nishizeki and N. Saito, ``Lower Bounds for Some Graph Problems,'' Trans. on IECE, J66-D, pp.1054-1061, 1983. (In Japanese) (In Japanese)
    139. N. Chiba, T. Nishizeki and N. Saito, ``An algorithm for finding a large independent set in planar graphs,'' NETWORKS, 13, pp.247-252, 1983.
    140. T. Nishizeki, T. Asano and T. Watanabe, ``An approximation algorithm for the hamiltonian walk problem on maximal planar graphs,'' Discrete Applied Mathematics, 5, pp.211-222, 1983.
    141. N. Chiba, T. Nishizeki and N. Saito, ``An approximation algorithm for the maximum independent set problem on planar graphs,'' SIAM J. on Computing, 11, 4, pp.663-675, 1982.
    142. K. Matsumoto, T. Nishizeki and N. Saito ``A Polynomial-Time Algorithm for Finding Multicommodity Flows in Planar Graphs,'' Trans. on IECE, J65-A, 12, pp.1205-1212, 1982. (In Japanese, abstract available in English)
    143. O. Terada and T. Nishizeki, ``Approximate algorithms for the edge-coloring of graphs,'' Trans. IECE, J65-D, 11, pp.1382-1389, 1982. (In Japanese, abstract available in English)
    144. K. Takamizawa, T. Nishizeki and N. Saito, ``Linear-time computability of combinatorial problems on series-parallel graphs,'' J. Assoc. Compt. Mach., 29, 3, pp.623-641, 1982.
    145. T. Nishizeki, ``On the maximum matchings of regular multigraphs,'' Discrete Mathematics, 37, pp.105-114, 1981.
    146. N. Chiba, T. Nishizeki and N. Saito, ``A liner 5-coloring algorithm of planar graphs,'' Journal of Algorithms, 2, pp.317-327, 1981.
    147. N. Chiba, T. Nishizeki and N. Saito, ``Efficient Algorithms for Graph Alternations,''
      Systems Computers Controls, 12, 5, pp.72-78, 1981.(In English)
      Trans. IECE, J64-D, 10, pp.934-939, 1981.(In Japanese)
    148. N. Chiba, T. Nishizeki and N. Saito, ``Applications of the Lipton and Tarjan's planar separator theorem,'' J. of Information Processing, 4, 4, pp.203-207, 1981.
    149. K. Takamizawa, T. Nishizeki and N. Saito, ``Combinatorial problems on series-parallel graphs,'' Discrete Applied Math., 3, pp.75-76, 1981.
    150. T. Nishizeki, ``A 1-tough nonhamiltonian maximal planar graph,'' Discrete Mathematics, 30, pp.305-307, 1980.
    151. T. Akiyama, T. Nishizeki and N. Saito, ``NP-completeness of the hamiltonian cycle problem for bipartite graphs,'' J. of Information Processing, 3, 2, pp.73-76, 1980.
    152. K. Takamizawa, T. Nishizeki and N. Saito, ``An O(p^3) algorithm for finding hamiltonian cycles in certain digraphs,'' J. of Information Processing, 3, 2, pp.68-72, 1980.
    153. K. Takamizawa, T. Nishizeki and N. Saito, ``An algorithm for finding a short closed spanning walk in a graph,'' NETWORKS, 10, 3, pp.249-263, 1980.
    154. T. Asano, T. Nishizeki and N. Watanabe, ``An upper bound on the length of a hamiltonian walk of a maximal planar graph,'' Journal of Graph Theory, 4, 3, pp.315-336, 1980.
    155. K. Takamizawa, T. Nishizeki and N. Saito, ``Series-Parallel Graphs and Computational Complexity,'' Trans. IECE, 63-A, 9, pp.560-567, 1980.(In Japanese)
    156. T. Nishizeki and I. Baybars, ``Lower bounds on the cardinality of the maximum matchings of planar graphs,'' Discrete Mathematics, 28, pp.255-267, 1979.
    157. T. Nishizeki, ``On the relationship between the genus and the cardinality of the maximum matchings of a graph,'' Discrete Mathematics, 25, 2, pp.149-156, 1979.
    158. M. Takiuchi, K. Takamizawa, T. Nishizeki and N. Saito, ``Graph Manipulating Programs-GRAMP-,'' IPSJ, 19, 5, pp.428-435, 1978.(In Japanese)
    159. K. Takamizawa, T. Nishizeki, N. Saito and M. Takiuchi, ``Statistical Analysis of Random Graphs,'' IPSJ, 19, 8, pp.742-748, 1978.(In Japanese)
    160. T. Nishizeki and N. Saito, ``Necessary and sufficient conditions for a graph to be three-terminal series-parallel-cascade,'' J. of Combinatorial Theory, Series B, 24, 3, pp.344-361, 1978.
    161. T. Nishizeki, H. Ogawa and T. Nishizeki, ``Characterizations and Algorithms of k-Maximal Cuts,'' Trans. IECE, 61-A, 5, pp.417-424, 1978.(In Japanese)
    162. T. Nishizeki, T. Asano and N. Saito, ``On the Maximal Even Matroids,'' Trans. IECE, 60-A, 2, pp.192-198, 1977.(In Japanese)
    163. T. Nishizeki, K. Takamizawa, N. Saito, ``Computational Complexities of Obtaining Programs with Minimum Number of GO TO Statements from Flow Charts,'' Trans. IECE, 60-D, 3, pp.201-208, 1977.(In Japanese)
    164. T. Asano, T. Nishizeki and N. Saito, ``NP-Complete Problems of Finding a Maximum Cutset and of Reducing Graphs into Bipartite Ones,''
      Systems Computers Controls, 8, pp.45-52, 1977.
      Trans. IECE, 60-D, 7, pp.531-538, 1977.(In Japanese)
    165. T. Nishizeki, K. Takamizawa and N. Saito, ``Algorithms for Detecting Series-Parallel Graphs and D-charts,'' Trans. IECE, 59-A, 3, pp.259-260, 1976.(In Japanese)
    166. T. Nishizeki and N. Saito, ``Necessary and sufficient conditions for a graph to be three-terminal series-parallel,'' IEEE Trans. on Circuits and Systems CAS-22, 8, pp.648-653, 1975.
    167. T. Nishizeki and N. Saito, ``Three-Terminal Series-Parallel-Cascade Graphs,'' Trans. IECE, 58-A, 7, pp.403-410, 1975.(In Japanese)
    168. T. Nishizeki and N. Saito, ``Necessary and Sufficient Conditions for a Graph to be Three-Terminal Series-Parallel in a Narrow Sense,'' Trans. IECE, 58-A, 5, pp.1-8, 1975.
    169. T. Nishizeki and N. Saito, ``Duffin's Theorem on Two-Terminal Series-Parallel Graphs,'' Trans. IECE, 57-A, 1, pp.70-72, 1974.(In Japanese) ｡｡
    170. T. Nishizeki and N. Saito, ``Interconnection of Transformerless 2-ports and Its Relation to Immitance and Hybrid Matrices,'' Trans. IECE, 57-A, 2, pp.77-84, 1974.(In Japanese)
    171. T. Nishizeki and N. Saito, ``Three-Terminal Series-Parallel-Cascade Graphs,'' Trans. IECE, 56-A, 10, pp.630-637, 1973.(In Japanese)
    172. T. Nishizeki and N. Saito, ``Application of Richards' Hybrid Matrix Theorem to Network Synthesis, ''Trans. IECE, 55-A, 6, pp.317-318, 1972.(In Japanese)
    173. T. Nishizeki and N. Saito, ``Partial Fractions Synthesis of Hybrid Matrix,'' Trans. IECE, 55-A, 6, pp.315-316, 1972.(In Japanese)
    174. T. Nishizeki and N. Saito, ``Base-Band Attenuation Equalizer with Distributed-Parameter Elements,'' Trans. IECE, 55-A, 11, pp.631-632, 1972.(In Japanese)
    175. T. Nishizeki and N. Saito, ``Lossless n-port Synthesis by Pivot-transformation,'' Trans. IECE, 55-A, 11, pp.633-634, 1972.(In Japanese)
    176. T. Nishizeki, M. Noyori and N. Saito, ``On the hybrid matrix of linear passive network'', Sci. Rep. Res. Inst. Tohoku Univ., B-(Elect.Commun.), 24, 2, pp.69-86, 1972.
    177. N. Chiba, T. Nishizeki, N. Saito, ``Analysis of Bandlimited Pulsewaveforms Applying Uncertanity Principle,'' Trans.IECE, 53-A, 5, pp.213-220, 1970.(In Japanese)

    Return to the top

  2. International Conferences

    1. X. Zhou, T. Hikino and T. Nishizeki, ``Small Grid Drawings of Planar Graphs with Balanced Bipartition,'' Proc. of WALCOM 2010, Lect. Notes in Comp. Sci., Springer-Verlag, 5942, pp.47-57, 2010.
    2. X. Zhou and T. Nishizeki, ``Convex drawings of internally triconnected plane graphs on O(n2) grids,'' Proc. of ISAAC 2009, Lect. Notes in Comp. Sci., Springer-Verlag, 5878, pp.760-770, 2009.
    3. K. Uchizawa, T. Nishizeki and E. Takimoto, ``Energy Complexity and Depth of Threshold Circuits,'' Proc. of FCT 2009, Lect. Notes in Comp. Sci., Springer-Verlag, 5699, pp.334-335, 2009.
    4. K. Uchizawa, E. Takimoto and T. Nishizeki, ``Size and Energy of Threshold Circuits Computing Mod Functions,'' Proc. of MFCS 2009, Lect. Notes in Comp. Sci., Springer-Verlag, 5734, pp.724-735, 2009.
    5. T. Mizuki, H. Tsubata and T. Nishizeki, ``Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions (Extended Abstract),'' Proc. of TAMC 2009, Lect. Notes in Comp. Sci., Springer-Verlag, 5532, pp.301-310, 2009.
    6. T. Ito, T. Uno, X. Zhou and T. Nishizeki, ``Partitioning a Weighted Tree to Subtrees of Almost Uniform Size,'' Proc. of ISAAC 2008, Lect. Notes in Comp. Sci., Springer-verlag, 5369, pp.196-207, 2008.
    7. Y. Asano, Y. Miyawaki and T. Nishizeki, ``Efficient compression of web graphs,'' Proc. of COCOON 2008, Lect. Notes in Comp. Sci., Springer-verlag, 5092, pp.1-11, 2008.
    8. Y. Asano, Y. Tezuka and T. Nishizeki, ``Improvements of HITS algorithms for spam links,'' Proc. of APWeb/Waim 2007, Lect. Notes in Comp. Sci., Springer-verlag, 4505, pp.479-490, 2007.
    9. X. Zhou and T. Nishizeki, ``Orthogonal drawings of series-parallel graphs with minimum bends,'' Proc. of WALCOM 2007, pp.3-12, 2007.
    10. T. Nishizeki, ``Inner rectangular drawings of plane graphs : application of graph drawing to VLSI layout,'' Proc. of WALCOM 2007, pp.1-2, 2007.
    11. K. Miura, T. Matsuno and T. Nishizeki, ``Open rectangle-of-influence drawings of inner triangulated plane graphs,'' Proc. of GD 2006, Lect. Notes in Comp. Sci., Springer-verlag, 4372, pp.138-149, 2007.
    12. T. Ito, E. D. Demaine, X. Zhou and T. Nishizeki, ``Approximability of Partitioning Graphs with Supply and Demand,'' Proc. of ISAAC 2006, Lect. Notes in Comp. Sci., Springer-verlag, 4288, pp. 121-130, 2006.
    13. A. Kamada, K. Miura and T. Nishizeki, ``Convex Grid Drawings of Plane Graphs with Rectangular Contours,'' Proc. of ISAAC 2006, Lect. Notes in Comp. Sci., Springer-verlag, 4288, pp. 131-140, 2006.
    14. T. Ito, K. Goto, X. Zhou and T. Nishizeki, ``Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size,'' Proc. of COCOON 2006, Lect. Notes in Comp. Sci., Springer-verlag, 4112, pp.63-72, 2006.
    15. Y. Matsuo, X. Zhou and T. Nishizeki, ``Sufficient condition and algorithm for list total colorings of series-parallel graphs,'' Proc. 9th Japan-Korea joint workshop on Algorithms and Computation, pp.49-56, 2006.
    16. M. S. Rahman, N. Egi and T. Nishizeki, ``No-bend orthogonal drawings of series-parallel graphs (Extended abstract),'' Proc. of GD 2005, Lect. Notes in Comp. Sci., Springer-verlag, 3843, pp.409-420, 2005.
    17. K. Miura, M. Azuma and T. Nishizeki, ``Convex drawings of plane graphs of minimum outer apices,'' Proc. of GD 2005, Lect. Notes in Comp. Sci., Springer-verlag, 3843, pp.297-308, 2005.
    18. X. Zhou and T. Nishizeki, ``Orthogonal drawings of series-parallel graphs with minimum bends,'' Proc. of ISAAC 2005, Lect. Notes in Comp. Sci., Springer-verlag, 3827, pp.166-175, 2005.
    19. K. Banno, S. Orihara, T. Mizuki and T. Nishizeki, ``Best security index for digital fingerprinting (Extended abstract),'' Proc. of IH 2005, Lect. Notes in Comp. Sci., Springer-verlag, 3727, pp.398-412, 2005.
    20. T. Ito, A. Kato, X. Zhou and T. Nishizeki, ``Algorithms for finding distance-edge-colorings of graphs,'' Proc. of COCOON 2005, Lect. Notes in Comp. Sci., Springer-verlag, 3595, pp.798-807, 2005.
    21. T. Ito, X. Zhou and T. Nishizeki, ``Partitioning graphs of supply and demand,'' Proc. of ISCAS 2005, pp.160-163, 2005.
    22. K. Miura and T. Nishizeki, ``Rectangle-of-influence drawings of four-conn-ected plane graphs (extended abstract),'' Proc. of APVIS 2005, pp.75-80, 2005.
    23. Md. S. Rahman, K. Miura and T. Nishizeki, ``Octagonal drawings of plane graphs with prescribed face areas,'' Proc. of WG 2004, Lect. Notes in Comp. Sci., Springer-verlag, 3533, pp. 320-331, 2004.
    24. T. Ito, X. Zhou and T. Nishizeki, ``Partitioning a weighted graph to connected subgraphs of almost uniform size,'' Proc. of WG 2004, Lect. Notes in Comp. Sci., Springer-verlag, 3533, pp. 365-376, 2004.
    25. K. Koizumi, T. Mizuki and T. Nishizeki, ``Necessary and sufficient numbers of cards for the transformation protocol,'' Proc. of COCOON 2004, Lect. Notes in Comp. Sci., Springer-verlag, 3106, pp.92-101, 2004.
    26. K. Miura, H. Haga and T. Nishizeki, ``Inner rectangular drawings of plane graphs (extended abstract),'' Proc. of ISAAC 2004, Lect. Notes in Comp. Sci., Springer-verlag, 3341, pp. 693-704, 2004.
    27. K. Miura, M. Azuma and T. Nishizeki, ``Canonical decomposition, realizer, schnyder labeling and orderly spanning trees of plane graphs (extended abstract),'' Proc. of COCOON 2004, Lect. Notes in Comp. Sci., Springer-verlag, 3106, pp.309-318, 2004.
    28. Md. S. Rahman, N. Egi and T. Nishizeki, ``No-bend orthogonal drawings of subdivisions of planar triconnected cubic graphs,'' Proc. of GD 2003, Lect. Notes in Comp. Sci., Springer-verlag, 2912, pp.387-392, 2004.
    29. Y. Asano and T. Nishizeki, ``Web-linkage viewer: drawing links in the web based on a site-oriented framework,'' Proc. of GD 2003, Lect. Notes in Comp. Sci., Springer-verlag, 2912, pp.498-499, 2004.
    30. T. Nishizeki, ``Drawing plane graphs,'' Proc. of ISAAC 2003, Lect. Notes in Comp. Sci., Springer-verlag, 2906, pp.2-5, 2003.
    31. X. Zhou, Y. Matsuo and T. Nishizeki, ``List total colorings of series-parallel graphs," Proc. of COCOON 2003, Lect. Notes in Comp. Sci., Springer-verlag, 2697, pp.172-181, 2003.
    32. K. Koizumi, T. Mizuki and T. Nishizeki, ``Necessary and sufficient numbers of cards for the transformation protocol,'' Proc. 7th Japan-Korea workshop on Algorithms and Computation, pp.124-137, 2003.
    33. X. Zhou, Y. Matsuo and T. Nishizeki, ``Complexity and algorithm of list total colorings of series-parallel graphs,'' Proc. 7th Japan-Korea workshop on Algorithms and Computation, pp.189-202, 2003.
    34. N. Egi, Md. S. Rahman and T. Nishizeki, ``Algorithm for no-bend orthogonal drawings of subdivisions of planar triconnected cubic graphs,'' Proc. 7th Japan-Korea workshop on Algorithms and Computation, pp.252-266, 2003.
    35. T. Fujino, X. Zhou and T. Nishizeki, ``List edge-colorings of series-parallel graphs,'' Proc. of 3rd Hungarian-Japanese Symposium on Discrete Math. and Its Applications, pp.154-163, 2003.
    36. Md. S. Rahman and T. Nishizeki, ``Bend-minimum orthogonal drawings of plane 3-graphs,'' Proc. of WG 2002, Lect. Notes in Comp. Sci., Springer-verlag, 2573, pp.367-378, 2002.
    37. Md. S. Rahman, T. Nishizeki and S. Ghosh, ``Rectangular drawings of planar graphs,'' Proc. of GD 2002, Lect. Notes in Comp. Sci., Springer-verlag, 2528, pp. 244-255, 2002.
    38. K. Miura, A. Miyazawa and T. Nishizeki, ``Extended rectangular drawings of planar graphs with designated corners,'' Proc. of GD 2002, Lect. Notes in Comp. Sci., Springer-verlag, 2528, pp. 256-267, 2002.
    39. T. Ito, X. Zhou and T. Nishizeki, ``Partitioning trees of supply and demand,'' Proc. of ISAAC 2002, Lect. Notes in Comp. Sci., Springer-verlag, 2518, pp. 612-623, 2002.
    40. T. Ito, X. Zhou and T. Nishizeki, ``Algorithms for the multicolorings of partial k-trees,'' Proc. of COCOON 2002, Lect. Notes in Comp. Sci., Springer-verlag, 2387, pp.430-439, 2002.
    41. Masud Hasan, Md. Saidur Rahman and Takao Nishizeki, ``A Linear Algorithm for Compact Box-Drawing of Trees,'' Proc. of 14th Canadian conference on Computational Geometry, pp.154-157, 2002.
    42. Takao Nishizeki, Kazuyuki Miura and Md. Saidur Rahman, ``Algorithms for Drawing Plane Graphs,'' Proc. 3rd Int. Conf. Parallel and Distributed Computing, Applications and Technologies, pp.143-150, 2002.
    43. Md. Saidur Rahman, Mahmuda Naznin and Takao Nishizeki, ``Orthogonal drawings of plane graphs without bends,'' Proc. of GD'2001, Lecture Notes in Comp. Sci., Springer-verlag, 2265, pp.392-406, 2002.
    44. X. Zhou and T. Nishizeki, ``Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs,'' Proc. of ISAAC 2001, Lect. Notes in Comp. Sci., Springer-verlag, 2223, pp.514-524, 2001.
    45. T. Mizuki and T. Nishizeki, ``Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups,'' Proc. of ISAAC 2001, Lect. Notes in Comp. Sci., Springer-verlag, 2223, pp.196-207, 2001.
    46. X. Zhou and T. Nishizeki, ``Algorithm for the cost edge-coloring of trees,'' Proc. of COCOON 2001, Lect. Notes in Comp. Sci., Springer-verlag, 2108, pp.228-297, 2001.
    47. S. Isobe, X. Zhou and T. Nishizeki, ``Total colorings of degenerated graphs,'' Proc. of ICALP 2001, Lect. Notes in Comp. Sci., Springer-verlag, 2076, pp. 506-517, 2001.
    48. K. Miura and T. Nishizeki, ``Drawings of Four-Connected Plane Graphs,'' Proc. of 2nd Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, pp. 191-201, 2001.
    49. S. Nakano, T. Nishizeki, T. Tokuyama and S. Watanabe, ``Labeling Points with Rectangles or various shapes'' Proc. of GD 2000, Lect. Notes in Comp. Sci., Springer-verlag, 1984, pp. 91-102, 2001.
    50. X. Zhou and T. Nishizeki, ``Finding Independent Spanning Trees in Partial k-trees,'' Proc. of ISAAC 2000, Lect. Notes in Comp. Sci., Springer-verlag, 1969, pp. 168-179, 2000.
    51. K. Miura, S. Nakano and T. Nishizeki, ``Convex Grid Drawings of Four-Connected Plane Graphs,'' Proc. of ISAAC 2000, Lect. Notes in Comp. Sci., Springer-verlag, 1969, pp. 254-265, 2000.
    52. Takaaki Mizuki, Hiroki Shizuya, and Takao Nishizeki, ``Characterization of Optimal Key Set Protocols,'' Proceedings of IFIP TCS 2000, LNCS 1872, pp.273-285, 2000.
    53. Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki, ``Rectangular Drawings of Plane Graphs without Designated Corners,'' Proc. of COCOON 2000, LNCS 1858, pp.85-94, 2000.
    54. Takaaki Mizuki, Zhi-Bo Sui, Hiroki Shizuya, and Takao Nishizeki, ``On the Average Length of Secret Key Exchange Eulerian Circuits,'' Proceedings of the 5th JAPAN-KOREA Joint Workshop on Algorithms and Computation, pp.41-48, 2000.
    55. Md. Saidur Rahman, Shin-ichi Nakano, Takao Nishizeki, ``Rectangular Drawings of Plane Graphs without Designated Corners,'' Proceedings of the 5th JAPAN-KOREA Joint Workshop on Algorithms and Computation, pp.130-137, 2000.
    56. M. S. Rahman, S. Nakano and T. Nishizeki, ``Box-rectangular drawings of plane graphs,'' Proc. of Japan-Korea Joint Workshop on Algorithms and Computation, pp. 72-79, 1999.
    57. M. S. Rahman, S. Nakano and T. Nishizeki, ``Box-rectangular drawings of plane graphs,'' Proc. of WG'99, Lect. Notes in Comp. Sci., Springer-verlag, 1665, pp. 250-261, 1999.
    58. M. S. Rahman, S. Nakano and T. Nishizeki, ``Rectangular drawings of plane graphs without designated corners,'' Proc. of ICCIT'99, pp. 244-248,1999.
    59. M. S. Rahman, M. Naznin, S. Nakano and T. Nishizeki, ``Orthogonal drawings of biconnected plane graphs without bends,'' Proc. of ICCIT'99, pp. 199-203, 1999.
    60. Y. Kusakari,D. Masubuchi and T. Nishizeki, ``Algorithm for Finding Noncrossing Steiner Forests in Plane Graphs,'' Proc. of ISAAC '99, LNCS 1741, pp.337-346, 1999.
    61. S. Isobe,X. Zhou and T. Nishizeki, ``A Linear algorithm for Finding Total Colorings of Planar Partial k-Trees,'' Proc. of ISAAC '99, LNCS 1741, pp.347-356, 1999.
    62. K. Miura, S. Nakano and T. Nishizeki, ``Grid drawings of four-connected plane graphs,'' Proc. of GD'99, Lect. Notes in Comp. Sci., Springer-verlag, 1731, pp. 145-154, 1999.
    63. T. Mizuki, H. Sizuya and T. Nishizeki, ``Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key,'' Proc. of Eurocrypt '99, LNCS 1592, pp.389-401, 1999.
    64. T. Nishizeki, J. Vygen and X. Zhou, ``The Edge-Disjoint Paths Problem is NP-Complete for Series-Parallel Graphs,'' Proc. of 1st Japanese-Hungarian Sympo. on Discrete Math. and its Applications, pp.103-110, 1999.
    65. M. A. Kashem, X. Zhou and T. Nishizeki, ``Algorithms for Generalized Edge-Rankings of Partial k-Trees with Bounded Maximum Degree,'' ICCIT'98, pp.45-51, 1998.
    66. M. S. Rahman, S. Nakano and T. Nishizeki, ``Box-Rectangular Drawings with Designated Four Corners,'' ICCIT'98, pp.37-41, 1998.
    67. X. Zhou and T. Nishizeki, ``The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees,'' ISAAC'98, LNCS 1533, pp.417-426, 1998.
    68. S. Isobe, X. Zhou and T. Nishizeki, ``A Polynominal-Time Algorithm for Finding Total Colorings of Partial k-Trees,'' Proc. of WG'98, LNCS 1517, pp.100-113, 1998.
    69. K. Miura, D. Takahashi, S. Nakano and T. Nishizeki, ``A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs,'' Proc. of WG'98, LNCS 1517, pp.310-323, 1998.
    70. T. Mizuki, H. Shizuya and T. Nishizeki, ``Eulerian Secret Key Exchange,'' COCOON'98, LNCS 1449, pp.349-360, 1998
    71. M. S. Rahman, S. Nakano and T. Nishizeki, ``A Linear-time Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs,'' GD'97, LNCS 1353, pp.99-110, 1997.
    72. Y. Kusakari and T. Nishizeki, ``An Algorithm for Finding a Region with the Minimum Total L_1 from Prescribed Terminals,''ISAAC'97, LNCS 1350, pp.324-333, 1997.
    73. M. A. Kashem, X. Zhou and T. Nishizeki, ``An NC Parallel Algorithm for Generalized Vertex-Rankings of Partial k-Trees,'' ISPAN'97, IEEE Computer Society, pp.105-111, 1997.
    74. M. A. Kashem, X. Zhou and T. Nishizeki, ``Generalized Vertex-Rankings of Partial k-Trees,'' COCOON'97, LNCS 1276, pp.212-221, 1997.
    75. M. S. Rahman, S. Nakano and T. Nishizeki, ``A Linear-Time Algorithm of Orthogonal Drawings of Triconnected Cubic Plane Graphs with the Minimum Number of Bends,'' Japan-Korea Workshop on Algorithms and Computation, Kyushu University, pp.24-31, 1997.
    76. M. A. Kashem, X. Zhou and T. Nishizeki, ``An NC Parallel Algorithm for Generalized Vertex-Rankings of Partial k-Trees,'' Japan-Korea Workshop on Algorithms and Computation, Kyushu University, pp.128-135, 1997.
    77. X. Zhou, M. A. Kashem and T. Nishizeki, ``Generalized Edge-Rankings of Trees,'' WG'96, LNCS 1197, pp.390-404, 1997.
    78. M. S. Rahman, S. Nakano and T. Nishizeki, ``A Linear-Time Algorithm of Four-Partitioning Four-Connected Plane Graphs,'' GD'96, LNCS 1190, pp.334-344, 1996.
    79. M. S. Rahman, S. Nakano and T. Nishizeki, ``Rectangular Grid Drawings of Plane Graphs,'' COCOON'96, LNCS 1090, pp.92-105, 1996.
    80. X. Zhou, S. Tamura and T. Nishizeki, ``Finding Edge-Disjoint Paths in Partial k-Trees,'' ISAAC'96, LNCS 1178, pp.203-212, 1996.
    81. X. Zhou and T. Nishizeki, ``Algorithms for Finding f-Colorings of Partial k-Trees,'' ISAAC'95, LNCS 1004, 332-341, 1995.
    82. Y. Kusakari, H. Suzuki and T. Nishizeki, ``Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas,'' ISAAC'95, LNCS 1004, pp.42-51, 1995.
    83. S. Nakano, X. Zhou and T. Nishizeki,``Edge-Coloring Algorithms,'' Computer Science Today, LNCS 1000, pp.172-183, 1995.
    84. X. Zhou and T. Nishizeki, ``Simple Reduction of f-Colorings to Edge-Colorings,'' COCOON'95, LNCS 959, pp.223-228, 1995.
    85. X. Zhou and T. Nishizeki, ``Finding Optimal Edge-Rankings of Trees,'' 6th SODA, ACM & SIAM, pp.122-131, 1995.
    86. X. Zhou, M. A. Kashem and T. Nishizeki, ``How to Assemble TinkerToys Fast in Parallel-Generalized Edge-Rankings of Trees-,'' 7th RAMP, pp.1-12, 1995.
    87. X. Zhou and T. Nishizeki, ``Finding Optimal Edge-Rankings of Trees,'' JSPS-NUS Seminar on Computing, (eds.) H. Imai, W. F. Wong, K. F. Loe, ``Advances in Computing Techniques,'' World Scientific, pp.23-35, 1994.
    88. X. Zhou and T. Nishizeki, ``Optimal Parallel Algorithm for Edge-Coloring Partial k-Trees with Bounded Degrees,'' ISPAN, IEEE Computer Society Press, pp.167-174, 1994.
    89. X. Zhou and T. Nishizeki, ``An Efficient Algorithm for Edge-Ranking Tree,'' ESA'94, LNCS 855, pp.118-129, 1994.
    90. X. Zhou and T. Nishizeki, ``Edge-Coloring and f-Coloring for Various Classes of Graphs,'' ISAAC'94, LNCS 834, pp.199-207, 1994.
    91. X. Zhou, S. Nakano and T. Nishizeki, ``A Parallel Algorithm for Edge-Coloring Partial k-Trees ,'' SWAT'94, LNCS 824, pp.359-369, 1994.
    92. S. Nakano and T. Nishizeki, ``Uniform Scheduling of File Transfers,'' 第7回回路とシステム軽井沢ワークショップ, pp.327-332, 1994.
    93. J. Takahashi, H. Suzuki and T. Nishizeki, ``Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions,'' ISAAC'93, LNCS 762, pp.98-107, 1993.
    94. X. Zhou, S. Nakano and T. Nishizeki, ``A Linear Algorithm for Edge-Coloring Partial k-Trees,'' ESA'93, LNCS 726, pp.409-418, 1993.
    95. X. Zhou, H. Suzuki and T. Nishizeki, ``Sequential and parallel algorithms for edge-coloring series-parallel multigraphs,'' Third IPCO Conference, G. Rinaldi and L. Wolsey(Eds.), pp.129-145, 1993.
    96. S. Nakano, T. Nishizeki, ``Nearly uiform scheduling of file transfers,'' 3rd IPCO Conference, G. Rinaldi and L. Wolsey(Eds.), pp.425-431, 1993.
    97. J. Takahashi, H. Suzuki and T. Nishizeki, ``Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs,'' ISAAC'92, LNCS 650, pp.400-409, 1992.
    98. N. Kanamaru, T. Nishizeki and Te. Asano, ``Efficient enumeration of grid points in a polygon and its application to integer programming,'' 2nd IPCO, pp.61-71, Carnegie-Mellon Univ. Publ., 1992.
    99. X. Zhou, S. Nakano, H. Suzuki and T. Nishizeki, ``An efficient algorithm for edge-coloring series-parallel multigraphs,'' LATIN'92, I. Simon(Ed.), LNCS 583, pp.516-529, 1992.
    100. S. Nakano, T. Nishizeki, ``Scheduling File Transfers under Port and Channel Constraints,'' ISA'90, LNCS 557, pp.43-51, 1991.
    101. H. Suzuki, C. Yamanaka and T. Nishizeki, ``Parallel algorithms for finding Steiner forests in planar graphs,'' SIGAL'90, LNCS??, pp.458-467, 1990.
    102. H. Suzuki, T. Akama and T. Nishizeki, ``Finding Steiner forests in planar graphs,'' Proc. of 1st Annual ACM-SIAM Sympo. on Discrete Algorithms, pp.444-453, 1990.
    103. H. Suzuki, T. Akama and T. Nishizeki, ``Steiner forests in planar graphs,'' International Symposium on Mathematical Programming, WE/3G3, 1988.
    104. H. Suzuki, T. Nishizeki and N. Saito, ``A variable priority queue an its applications to multicommodity flows,'' Proc. 13th IFIP Conf. System Modelling and Optimization.
    105. T. Nishizeki, S. Nakano and N. Saito, ``Scheduling file transfers in networks,'' Proc. Global Telecoms. Conf., pp.2109-2113, 1987.
    106. M. Ito, A. Saito and T. Nishizeki, ``Secret sharing scheme realizing general access structure,'' Proc. Global Telecoms. Conf., pp.99-102, 1987.
    107. H. Suzuki, T. Nishizeki and N. Saito, ``Multicommodity flows in planar undirected graphs,'' Proc. of Int. Symp. on Circuits and Systems, pp.1643-1646, 1985.
    108. H. Suzuki, T. Nishizeki and N. Saito, ``Multicommodity flows in planar undirected graphs and shortest paths,'' Proc. of 17th Ann. ACM SIGACT Symp. on Theory of Computing, pp.195-204, 1985.
    109. N. Chiba and T. Nishizeki, ``The hamiltonian cycle problem is linear time solvable for 4-connected planar graphs,'' Proc. of Int. Symp. on Circuits and Systems, pp.961-964, 1985.
    110. T. Ozawa and T. Nishizeki, ``Properties of certain types of random graphs,'' Proc. of 1979 Int. Symp. on Circuits and Systems, pp.88-91, 1979.
    111. T. Asano, T. Nishizeki and T. Watanabe, ``On the hamiltonian walks of maximal planar graphs,'' Proc. of 1979 Int. Symp. on Circuits and Systems, pp.449-452, 1979.
    112. T. Nishizeki, ``Lower bound on the cardinality of the maximum matchings of regular multigraphs,'' Proc. of 1979 Int. Symp. on Circuits and Systems, pp.443-444, 1979.
    113. T. Nishizeki, ``Lower bound on the cardinality of the maximum matchings of graphs,'' Proc. of 9th South-Eastern Conf. on Combinatorics, Graph Theory and Computing, pp.527-547, 1977.
    114. T. Nishizeki, H. Ogawa and N. Saito, ``Computational complexity of k-maximal cuts,'' Proc. of 15th Allerton Conf. on Commun., Contr. and Comput., pp.567-576, 1977.

    Return to the top

  3. Books

    1. N. Chiba, T. Nishizeki and N. Saito, Discrete Mathematics, Asakura, 1989. (In Japanese)
    2. T. Nishizeki and N. Chiba, Planar Graphs; Theory and Algorithms, North-Holland, 1988.
    3. T. Nishizeki and M. S. Rahman, Planar Graph Drawing, World Scientific, Singapore, 2004.

  4. Edited Books

    1. 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.
    2. 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.
    3. T. Ibaraki, Y. Inagaki, K. Iwama and M. Yamashita, Algorithms and Computation, LNCS 650, Springer-Verlag, 1992.
    4. T. Asano, T. Ibaraki, H. Imai and T. Nishizeki, Algorithms, LNCS 450, Springer-Verlag, 1990.
    5. D. S. Jhonson, T. Nishizeki, A. Nozaki and H. S. Wilf, Discrete Algorithms and Complexity, Academic Press, 1987.
    6. N. Saito and T. Nishizeki, Graph Theory and Algorithms, LNCS 108, Springer-Verlag, 1981.

  5. Books in Translation

    1. T. Nishizeki and K. Takahashi, Algorithms and Complexity (Herbert S. Wilf), Soken, 1988.
    2. N. Saito and T. Nishizeki, Introduction to Graph Theory (Robin J. Wilson), Kindai-Kagaku, 1985.
    3. N. Saito and T. Nishizeki, Graph Theory: An Introduction Course (Bela Bollobas), Baifukan, 1983.
    4. J. Akiyama and T. Nishizeki, Graph & Digraphs (M. Behzad, G. Chartrand and L. Lesniak-Foster), Kyoritsu, 1981.

  6. Other Writings

    1. T. Nishizeki, ``グラフの平面性判定法, '' IPSJ, 24, 4, pp.521-528, 1983.
    2. T. Nishizeki, ``Planar graph algorithms,'' in ``Computer Science and Technology-1983,'' Japan Annual Review in Electronics, Computer and Telecommunications, (ed.) T. Kitagawa, Vol.7, pp.77-91, Ohm-sha, Tokyo, 1983.
    3. T. Nishizeki, ``多種ネットワークフローとVSLI配線,'' IEICE, 69, 6, pp.572-577, 1986.

  7. Others

    1. 伴野幸造, 折原慎吾, 水野敬明, 西関隆夫, ``電子透かしの最良安全度について,'・ SCIS 2005, pp.727-732, 2005.
    2. Md. S. Rahman, K. Miura and T. Nishizeki, ``A linear algorithm for prescribed-area octagonal drawings of plane graphs," 情報技術レターズ, Vol.2, No.1, pp.15-16, 2003.
    3. K. Miura, T. Nishizeki,
      ``Rectangle-of-influence drawings of four-connected plane graphs," 情報技術レターズ, Vol.1, No.1, pp.17-18, 2002.
    4. Md. S. Rahman, T. Nishizeki and S. Ghosh, ``A linear algorithm for rectangular drawings of planar graphs," 情報技術レターズ, Vol.1, No.1, pp.19-20, 2002.
    5. T. Fujino, X. Zhou and T. Nishizeki,
      ``直並列グラフをリストに辺彩色するアルゴリズム," 情報技術レターズ, Vol.1, No.1, pp.21-22, 2002.
    6. S. Orihara, T. Mizuki and T. Nishizeki,
      ``電子透かしの安全性とその上界と下界," 情報技術レターズ, Vol.1, No.1, pp.227-228, 2002.

Return to the top