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