The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Takao Nishizeki: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Norishige Chiba, Kazunori Onoguchi, Takao Nishizeki
    Drawing Plane Graphs Nicely. [Citation Graph (1, 0)][DBLP]
    Acta Inf., 1985, v:22, n:2, pp:187-201 [Journal]
  2. Kazuyuki Miura, Takao Nishizeki
    Rectangle-of-Influence Drawings of Four-Connected Plane Graphs. [Citation Graph (0, 0)][DBLP]
    APVIS, 2005, pp:75-80 [Conf]
  3. Masud Hasan, Md. Saidur Rahman, Takao Nishizeki
    A linear algorithm for compact box-drawings of trees. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:154-157 [Conf]
  4. Koichi Koizumi, Takaaki Mizuki, Takao Nishizeki
    Necessary and Sufficient Numbers of Cards for the Transformation Protocol. [Citation Graph (0, 0)][DBLP]
    COCOON, 2004, pp:92-101 [Conf]
  5. Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki
    Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:63-72 [Conf]
  6. Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki
    Algorithms for Finding Distance-Edge-Colorings of Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:798-807 [Conf]
  7. Takehiro Ito, Takao Nishizeki, Xiao Zhou
    Algorithms for the Multicolorings of Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:430-439 [Conf]
  8. Abul Kashem, Xiao Zhou, Takao Nishizeki
    Generalized Vertex-Rankings of Partial k-trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 1997, pp:212-221 [Conf]
  9. Kazuyuki Miura, Machiko Azuma, Takao Nishizeki
    Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2004, pp:309-318 [Conf]
  10. Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki
    Eulerian Secret Key Exchange. [Citation Graph (0, 0)][DBLP]
    COCOON, 1998, pp:349-360 [Conf]
  11. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
    Rectangular Drawings of Plane Graphs Without Designated Corners. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:85-94 [Conf]
  12. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
    Rectangular Grid Drawings of Plane Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:92-105 [Conf]
  13. Xiao Zhou, Yuki Matsuo, Takao Nishizeki
    List Total Colorings of Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:172-181 [Conf]
  14. Xiao Zhou, Takao Nishizeki
    Algorithm for the Cost Edge-Coloring of Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:288-297 [Conf]
  15. Xiao Zhou, Takao Nishizeki
    Simple Reduction of f-Colorings to Edge-Colorings. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:223-228 [Conf]
  16. Xiao Zhou, Takao Nishizeki
    An Efficient Algorithm for Edge-Ranking Trees. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:118-129 [Conf]
  17. Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki
    A Linear Algorithm for Edge-Coloring Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:409-418 [Conf]
  18. Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki
    Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1999, pp:389-401 [Conf]
  19. Yasuhito Asano, Takao Nishizeki
    Web-Linkage Viewer: Drawing Links in the Web Based on a Site-Oriented Framework. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:498-499 [Conf]
  20. Kazuyuki Miura, Machiko Azuma, Takao Nishizeki
    Convex Drawings of Plane Graphs of Minimum Outer Apices. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:297-308 [Conf]
  21. Kazuyuki Miura, Ayako Miyazawa, Takao Nishizeki
    Extended Rectangular Drawings of Plane Graphs with Designated Corners. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:256-267 [Conf]
  22. Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki
    Grid Drawings of Four-Connected Plane Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:145-154 [Conf]
  23. Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe
    Labeling Points with Rectangles of Various Shapes. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:91-102 [Conf]
  24. Shin-Ichi Nakano, Md. Saidur Rahman, Takao Nishizeki
    A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1996, pp:334-344 [Conf]
  25. Md. Saidur Rahman, Noritsugu Egi, Takao Nishizeki
    No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:387-392 [Conf]
  26. Md. Saidur Rahman, Noritsugu Egi, Takao Nishizeki
    No-bend Orthogonal Drawings of Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:409-420 [Conf]
  27. Md. Saidur Rahman, Takao Nishizeki, Shubhashis Ghosh
    Rectangular Drawings of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:244-255 [Conf]
  28. Md. Saidur Rahman, Mahmuda Naznin, Takao Nishizeki
    Orthogonal Drawings of Plane Graphs without Bends. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:392-406 [Conf]
  29. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
    A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:99-110 [Conf]
  30. Kazuyuki Miura, Tetsuya Matsuno, Takao Nishizeki
    Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:138-149 [Conf]
  31. Norishige Chiba, Takao Nishizeki, Nobuji Saito
    A linear algorithm for five-coloring a planar graph. [Citation Graph (0, 0)][DBLP]
    Graph Theory and Algorithms, 1980, pp:9-19 [Conf]
  32. K. Takamizawa, Takao Nishizeki, Nobuji Saito
    Combinatorial problems on series-parallel graphs. [Citation Graph (0, 0)][DBLP]
    Graph Theory and Algorithms, 1980, pp:79-94 [Conf]
  33. Shuji Isobe, Xiao Zhou, Takao Nishizeki
    Total Colorings of Degenerated Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:506-517 [Conf]
  34. Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki
    Characterization of Optimal Key Set Protocols. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2000, pp:273-285 [Conf]
  35. Kozo Banno, Shingo Orihara, Takaaki Mizuki, Takao Nishizeki
    Best Security Index for Digital Fingerprinting. [Citation Graph (0, 0)][DBLP]
    Information Hiding, 2005, pp:398-412 [Conf]
  36. Naoyoshi Kanamaru, Takao Nishizeki, Tetsuo Asano
    Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming. [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:61-71 [Conf]
  37. Shin-Ichi Nakano, Takao Nishizeki
    Nearly uniform scheduling of file transfers. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:425-431 [Conf]
  38. Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki
    Sequential and parallel algorithms for edge-coloring series-parallel multigraphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:129-145 [Conf]
  39. Shin-Ichi Nakano, Takao Nishizeki
    Scheduling File Transfers under Port and Channel Constraints. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:43-51 [Conf]
  40. Shuji Isobe, Xiao Zhou, Takao Nishizeki
    A Linear Algorithm for Finding Total Colorings of Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:347-356 [Conf]
  41. Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki
    Approximability of Partitioning Graphs with Supply and Demand. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:121-130 [Conf]
  42. Takehiro Ito, Xiao Zhou, Takao Nishizeki
    Partitioning Trees of Supply and Demand. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:612-623 [Conf]
  43. Akira Kamada, Kazuyuki Miura, Takao Nishizeki
    Convex Grid Drawings of Plane Graphs with Rectangular Contours. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:131-140 [Conf]
  44. Yoshiyuki Kusakari, Daisuke Masubuchi, Takao Nishizeki
    Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:337-346 [Conf]
  45. Yoshiyuki Kusakari, Takao Nishizeki
    An Algorithm for Finding a Region with the Minimum Lotal L1 from Prescribed Terminals. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:324-333 [Conf]
  46. Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki
    Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:42-51 [Conf]
  47. Kazuyuki Miura, Hiroki Haga, Takao Nishizeki
    Inner Rectangular Drawings of Plane Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:693-704 [Conf]
  48. Kazuyuki Miura, Takao Nishizeki, Shin-Ichi Nakano
    Convex Grid Drwaings of Four-Connected Plane Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:254-265 [Conf]
  49. Takaaki Mizuki, Takao Nishizeki
    Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:196-207 [Conf]
  50. Takao Nishizeki
    Drawing Plane Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:2-5 [Conf]
  51. Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki
    Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:400-409 [Conf]
  52. Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki
    Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:98-107 [Conf]
  53. Xiao Zhou, Takao Nishizeki
    Finding Independent Spanning Trees in Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:168-179 [Conf]
  54. Xiao Zhou, Takao Nishizeki
    Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:514-524 [Conf]
  55. Xiao Zhou, Takao Nishizeki
    Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:166-175 [Conf]
  56. Xiao Zhou, Takao Nishizeki
    Edge-Coloring and f-Coloring for Various Classes of Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:199-207 [Conf]
  57. Xiao Zhou, Takao Nishizeki
    Algorithms for Finding f-Colorings of Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:332-341 [Conf]
  58. Xiao Zhou, Takao Nishizeki
    The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:417-426 [Conf]
  59. Xiao Zhou, Syurei Tamura, Takao Nishizeki
    Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ISAAC, 1996, pp:203-212 [Conf]
  60. Takehiro Ito, Xiao Zhou, Takao Nishizeki
    Partitioning graphs of supply and demand. [Citation Graph (0, 0)][DBLP]
    ISCAS (1), 2005, pp:160-163 [Conf]
  61. Abul Kashem, Xiao Zhou, Takao Nishizeki
    An NC Parallel Algorithm for Generalized Vertex-Rankings of Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    ISPAN, 1997, pp:105-111 [Conf]
  62. Xiao Zhou, Shin-Ichi Nakano, Hitoshi Suzuki, Takao Nishizeki
    An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 1992, pp:516-529 [Conf]
  63. Hitoshi Suzuki, Chiseko Yamanaka, Takao Nishizeki
    Parallel Algorithms for Finding Steiner Forests in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:458-467 [Conf]
  64. Hitoshi Suzuki, Takehiro Akama, Takao Nishizeki
    Finding Steiner Forests in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:444-453 [Conf]
  65. Xiao Zhou, Takao Nishizeki
    Finding Optimal Edge-Rankings of Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:122-131 [Conf]
  66. Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito
    Multicommodity Flows in Planar Undirected Graphs and Shortest Paths [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:195-204 [Conf]
  67. Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki
    A Parallel Algorithm for Edge-Coloring Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:359-369 [Conf]
  68. Shuji Isobe, Xiao Zhou, Takao Nishizeki
    A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:100-113 [Conf]
  69. Takehiro Ito, Xiao Zhou, Takao Nishizeki
    Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:365-376 [Conf]
  70. Kazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki
    A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:310-323 [Conf]
  71. Md. Saidur Rahman, Kazuyuki Miura, Takao Nishizeki
    Octagonal Drawings of Plane Graphs with Prescribed Face Areas. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:320-331 [Conf]
  72. Md. Saidur Rahman, Takao Nishizeki
    Bend-Minimum Orthogonal Drawings of Plane 3-Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:367-378 [Conf]
  73. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
    Box-Rectangular Drawings of Plane Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:250-261 [Conf]
  74. Xiao Zhou, Abul Kashem, Takao Nishizeki
    Generalized Edge-Ranking of Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:390-404 [Conf]
  75. Yasuhito Asano, Takao Nishizeki, Masashi Toyoda
    Mining Communities on the Web Using a Max-Flow and a Site-Oriented Framework. [Citation Graph (0, 0)][DBLP]
    WISE, 2005, pp:1-14 [Conf]
  76. Takao Nishizeki
    Inner Rectangular Drawings of Plane Graphs: Application of Graph Drawing to VLSI Layouts. [Citation Graph (0, 0)][DBLP]
    WALCOM, 2007, pp:1-2 [Conf]
  77. Xiao Zhou, Takao Nishizeki
    Orthogonal drawings of series-parallel graphs with minimum bends. [Citation Graph (0, 0)][DBLP]
    WALCOM, 2007, pp:3-12 [Conf]
  78. Takao Nishizeki, Roberto Tamassia, Dorothea Wagner
    Foreword. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:26, n:1, pp:1-2 [Journal]
  79. Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito
    Algorithms for Multicommodity Flows in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1989, v:4, n:4, pp:471-501 [Journal]
  80. Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki
    Shortest Noncrossing Paths in Plane Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:3, pp:339-357 [Journal]
  81. Xiao Zhou, K. Fuse, Takao Nishizeki
    A Linear Algorithm for Finding [{g, f}]-Colorings of Partial {k}-Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:3, pp:227-243 [Journal]
  82. Xiao Zhou, Takao Nishizeki
    Multicolorings of Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:38, n:2, pp:271-297 [Journal]
  83. Xiao Zhou, Syurei Tamura, Takao Nishizeki
    Finding Edge-Disjoint Paths in Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:26, n:1, pp:3-30 [Journal]
  84. Shin-Ichi Nakano, Takao Nishizeki, Nobuji Saito
    On the fg-coloring of graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:1, pp:67-80 [Journal]
  85. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
    Rectangular drawings of plane graphs without designated corners. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:21, n:3, pp:121-138 [Journal]
  86. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
    Rectangular grid drawings of plane graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:3, pp:203-220 [Journal]
  87. András Frank, Takao Nishizeki, Nobuji Saito, Hitoshi Suzuki
    Algorithms for Routing around a Rectangle. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:40, n:4, pp:363-378 [Journal]
  88. Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki
    Characterization of optimal key set protocols. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:1, pp:213-236 [Journal]
  89. Takao Nishizeki, Svatopluk Poljak
    k-Connectivity and Decomposition of Graphs into Forests. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:55, n:3, pp:295-301 [Journal]
  90. Takao Nishizeki, Jens Vygen, Xiao Zhou
    The edge-disjoint paths problem is NP-complete for series-parallel graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:115, n:1-3, pp:177-186 [Journal]
  91. Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki
    Grid Drawings of 4-Connected Plane Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:1, pp:73-87 [Journal]
  92. Md. Saidur Rahman, Noritsugu Egi, Takao Nishizeki
    No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    IEICE Transactions, 2005, v:88, n:1, pp:23-30 [Journal]
  93. Atsushi Koike, Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe
    Labeling Points with Rectangles of Various Shapes. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:6, pp:511-528 [Journal]
  94. Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki
    A Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1999, v:9, n:2, pp:151-170 [Journal]
  95. Naoyoshi Kanamaru, Takao Nishizeki, Tetsuo Asano
    Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1994, v:4, n:1, pp:69-85 [Journal]
  96. Kazuyuki Miura, Hiroki Haga, Takao Nishizeki
    Inner Rectangular Drawings of Plane Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2006, v:16, n:2-3, pp:249-270 [Journal]
  97. Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki
    Shortest Non-Crossing Rectilinear Paths in Plane Regions. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:5, pp:419-436 [Journal]
  98. Shuji Isobe, Xiao Zhou, Takao Nishizeki
    A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:2, pp:171-194 [Journal]
  99. Takehiro Ito, Xiao Zhou, Takao Nishizeki
    Partitioning trees of supply and demand. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:4, pp:803-827 [Journal]
  100. Kazuyuki Miura, Machiko Azuma, Takao Nishizeki
    Canonical Decomposition, Realizer, Schnyder Labeling And Orderly Spanning Trees Of Plane Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:1, pp:117-141 [Journal]
  101. Kazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki
    A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four Connected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:2, pp:195-210 [Journal]
  102. Shin-Ichi Nakano, Takao Nishizeki
    Scheduling File Transfers Under Port and Channe; Constraints. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1993, v:4, n:2, pp:101-115 [Journal]
  103. Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki
    Convex Grid Drawings of Four-connected Plane Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:5, pp:1031-1060 [Journal]
  104. Kazuyuki Miura, Machiko Azuma, Takao Nishizeki
    Convex Drawings of Plane Graphs of Minimum Outer Apices. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:5, pp:1115-1128 [Journal]
  105. Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki
    A complete characterization of a family of key exchange protocols. [Citation Graph (0, 0)][DBLP]
    Int. J. Inf. Sec., 2002, v:1, n:2, pp:131-142 [Journal]
  106. Shin-Ichi Nakano, Md. Saidur Rahman, Takao Nishizeki
    A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:62, n:6, pp:315-322 [Journal]
  107. Xiao Zhou, Nobuaki Nagai, Takao Nishizeki
    Generalized Vertex-Rankings of Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:6, pp:321-328 [Journal]
  108. Hitoshi Suzuki, Naomi Takahashi, Takao Nishizeki
    A Linear Algorithm for Bipartition of Biconnected Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:33, n:5, pp:227-231 [Journal]
  109. K. Takamizawa, Takao Nishizeki, Nobuji Saito
    Linear-time computability of combinatorial problems on series-parallel graphs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:3, pp:623-641 [Journal]
  110. Norishige Chiba, Takao Nishizeki
    The Hamiltonian Cycle Problem is Linear-Time Solvable for 4-Connected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1989, v:10, n:2, pp:187-211 [Journal]
  111. Norishige Chiba, Takao Nishizeki, Nobuji Saito
    A Linear 5-Coloring Algorithm of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1981, v:2, n:4, pp:317-327 [Journal]
  112. Marek Chrobak, Takao Nishizeki
    Improved Edge-Coloring Algorithms for Planar Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1990, v:11, n:1, pp:102-116 [Journal]
  113. Dorit S. Hochbaum, Takao Nishizeki, David B. Shmoys
    A Better than "Best Possible" Algorithm to Edge Color Multigraphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1986, v:7, n:1, pp:79-104 [Journal]
  114. Hiroyuki Nakayama, Takao Nishizeki, Nobuji Saito
    Lower Bounds for Combinatorial Problems on Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:3, pp:393-399 [Journal]
  115. Md. Saidur Rahman, Takao Nishizeki, Shubhashis Ghosh
    Rectangular drawings of planar graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:50, n:1, pp:62-78 [Journal]
  116. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
    Box-Rectangular Drawings of Plane Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:363-398 [Journal]
  117. Hitoshi Suzuki, Akira Ishiguro, Takao Nishizeki
    Variable-Priority Queue and Doughnut Routing. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:4, pp:606-635 [Journal]
  118. Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki
    Edge-Coloring Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:21, n:3, pp:598-617 [Journal]
  119. Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki
    A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:20, n:1, pp:174-201 [Journal]
  120. Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki
    An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:23, n:2, pp:359-374 [Journal]
  121. Yoshiyuki Kusakari, Daisuke Masubuchi, Takao Nishizeki
    Finding a Noncrossing Steiner Forest in Plane Graphs Under a 2-Face Condition. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2001, v:5, n:2, pp:249-266 [Journal]
  122. Xiao Zhou, Takao Nishizeki
    Algorithm for the Cost Edge-Coloring of Trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2004, v:8, n:1, pp:97-108 [Journal]
  123. Norishige Chiba, Takao Nishizeki, Shigenobu Abe, Takao Ozawa
    A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1985, v:30, n:1, pp:54-76 [Journal]
  124. Takao Asano, Takao Nishizeki, Paul D. Seymour
    A note on nongraphic matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:3, pp:290-293 [Journal]
  125. Xiao Zhou, Takao Nishizeki
    Decompositions to Degree-Constrainded Subgraphs Are Simply Reducible to Edge-Colorings. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:75, n:2, pp:270-287 [Journal]
  126. Takao Nishizeki, Nobuji Saito
    Necessary and sufficient conditions for a graph to be three-terminal series-parallel-cascade. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1978, v:24, n:3, pp:344-361 [Journal]
  127. Xiao Zhou, Yuki Matsuo, Takao Nishizeki
    List total colorings of series-parallel graphs. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:1, pp:47-60 [Journal]
  128. Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki
    Algorithms for finding distance-edge-colorings of graphs. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:2, pp:304-322 [Journal]
  129. Takehiro Ito, Xiao Zhou, Takao Nishizeki
    Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:1, pp:142-154 [Journal]
  130. Takao Nishizeki, Roberto Tamassia, Dorothea Wagner
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2001, v:5, n:5, pp:1- [Journal]
  131. Md. Saidur Rahman, Takao Nishizeki, Mahmuda Naznin
    Orthogonal Drawings of Plane Graphs Without Bends. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2003, v:7, n:4, pp:335-362 [Journal]
  132. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
    A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1999, v:3, n:4, pp:31-62 [Journal]
  133. Xiao Zhou, Takao Nishizeki
    Edge-Coloring and f-Coloring for Various Classes of Graphs. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1999, v:3, n:1, pp:- [Journal]
  134. M. Ito, A. Saio, Takao Nishizeki
    Multiple Assignment Scheme for Sharing Secret. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1993, v:6, n:1, pp:15-20 [Journal]
  135. Masud Hasan, Md. Saidur Rahman, Takao Nishizeki
    A linear algorithm for compact box-drawings of trees. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:42, n:3, pp:160-164 [Journal]
  136. Norishige Chiba, Takao Nishizeki
    Arboricity and Subgraph Listing Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:1, pp:210-223 [Journal]
  137. Norishige Chiba, Takao Nishizeki, Nobuji Saito
    An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:4, pp:663-675 [Journal]
  138. Kazuhiko Matsumoto, Takao Nishizeki, Nobuji Saito
    An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:2, pp:289-302 [Journal]
  139. Kazuhiko Matsumoto, Takao Nishizeki, Nobuji Saito
    Planar Multicommodity Flows, Maximum Matchings and Negative Cycles. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:495-510 [Journal]
  140. Takao Nishizeki, Kenichi Kashiwagi
    On the 1.1 Edge-Coloring of Multigraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:3, pp:391-0 [Journal]
  141. Takao Nishizeki, Nobuji Saito, Kiminobu Suzuki
    A Linear-Time Routing Algorithm for Convex Grids. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1985, v:4, n:1, pp:68-76 [Journal]
  142. Abul Kashem, Xiao Zhou, Takao Nishizeki
    Algorithms for generalized vertex-rankings of partial k-trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:240, n:2, pp:407-427 [Journal]
  143. Yasuhito Asano, Yu Tezuka, Takao Nishizeki
    Improvements of HITS Algorithms for Spam Links. [Citation Graph (0, 0)][DBLP]
    APWeb/WAIM, 2007, pp:479-490 [Conf]
  144. Shuji Isobe, Xiao Zhou, Takao Nishizeki
    Total Colorings Of Degenerate Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2007, v:27, n:2, pp:167-182 [Journal]
  145. Takao Nishizeki
    On the maximum matchings of regular multigraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:37, n:1, pp:105-114 [Journal]

  146. Efficient Compression of Web Graphs. [Citation Graph (, )][DBLP]


  147. Energy Complexity and Depth of Threshold Circuits. [Citation Graph (, )][DBLP]


  148. Partitioning a Weighted Tree to Subtrees of Almost Uniform Size. [Citation Graph (, )][DBLP]


  149. Convex Drawings of Internally Triconnected Plane Graphs on O(n2) Grids. [Citation Graph (, )][DBLP]


  150. Size and Energy of Threshold Circuits Computing Mod Functions. [Citation Graph (, )][DBLP]


  151. Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions. [Citation Graph (, )][DBLP]


  152. Small Grid Drawings of Planar Graphs with Balanced Bipartition. [Citation Graph (, )][DBLP]


  153. Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. [Citation Graph (, )][DBLP]


  154. Octagonal drawings of plane graphs with prescribed face areas. [Citation Graph (, )][DBLP]


  155. Edge-disjoint paths in a grid bounded by two nested rectangles. [Citation Graph (, )][DBLP]


  156. Partitioning graphs of supply and demand. [Citation Graph (, )][DBLP]


  157. Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs. [Citation Graph (, )][DBLP]


Search in 0.093secs, Finished in 0.104secs
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