DBLP: Takao Nishizeki

	2012
j96		Takehiro Ito, Takao Nishizeki, Michael Schröder, Takeaki Uno, Xiao Zhou: Partitioning a Weighted Tree into Subtrees with Weights in a Given Range. Algorithmica 62(3-4): 823-841 (2012)
j95		Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki: Minimum Cost Partitions of Trees with Supply and Demand. Algorithmica 64(3): 400-415 (2012)
j94		Yoshihiro Indo, Takaaki Mizuki, Takao Nishizeki: Absolutely Secure Message Transmission using a Key Sharing Graph. Discrete Math., Alg. and Appl. 4(4) (2012)
j93		Xiao Zhou, Takashi Hikino, Takao Nishizeki: Small grid drawings of planar graphs with balanced partition. J. Comb. Optim. 24(2): 99-115 (2012)
c87		Kazuhide Nishikawa, Takao Nishizeki, Xiao Zhou: Algorithms for Bandwidth Consecutive Multicolorings of Graphs - (Extended Abstract). FAW-AAIM 2012: 117-128
	2011
j92		Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki: Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. IEICE Transactions 94-D(2): 190-195 (2011)
j91		Kei Uchizawa, Eiji Takimoto, Takao Nishizeki: Size-energy tradeoffs for unate circuits computing symmetric Boolean functions. Theor. Comput. Sci. 412(8-10): 773-782 (2011)
	2010
j90		Xiao Zhou, Takao Nishizeki: Convex Drawings of Internally Triconnected Plane Graphs on O(N²) Grids. Discrete Math., Alg. and Appl. 2(3): 347-362 (2010)
j89		Takaaki Mizuki, Hitoshi Tsubata, Takao Nishizeki: Minimizing AND-EXOR Expressions for Two-Variable Multiple-Valued Input Binary Output Functions. Multiple-Valued Logic and Soft Computing 16(1-2): 197-208 (2010)
j88		Kei Uchizawa, Takao Nishizeki, Eiji Takimoto: Energy and depth of threshold circuits. Theor. Comput. Sci. 411(44-46): 3938-3946 (2010)
c86		Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki: Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. FAW 2010: 274-284
c85		Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki: Minimum Cost Partitions of Trees with Supply and Demand. ISAAC (2) 2010: 351-362
c84		Xiao Zhou, Takashi Hikino, Takao Nishizeki: Small Grid Drawings of Planar Graphs with Balanced Bipartition. WALCOM 2010: 47-57
	2009
j87		Md. Saidur Rahman, Kazuyuki Miura, Takao Nishizeki: Octagonal drawings of plane graphs with prescribed face areas. Comput. Geom. 42(3): 214-230 (2009)
j86		Takehiro Ito, Xiao Zhou, Takao Nishizeki: Partitioning graphs of supply and demand. Discrete Applied Mathematics 157(12): 2620-2633 (2009)
j85		Kazuyuki Miura, Tetsuya Matsuno, Takao Nishizeki: Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs. Discrete & Computational Geometry 41(4): 643-670 (2009)
j84		Yasuhito Asano, Yuya Miyawaki, Takao Nishizeki: Efficient Compression of Web Graphs. IEICE Transactions 92-A(10): 2454-2462 (2009)
j83		Seok-Hee Hong, Takao Nishizeki: Guest Editors' Foreword. J. Graph Algorithms Appl. 13(3): 285-287 (2009)
c83		Kei Uchizawa, Takao Nishizeki, Eiji Takimoto: Energy Complexity and Depth of Threshold Circuits. FCT 2009: 335-345
c82		Xiao Zhou, Takao Nishizeki: Convex Drawings of Internally Triconnected Plane Graphs on O(n²) Grids. ISAAC 2009: 760-770
c81		Kei Uchizawa, Takao Nishizeki, Eiji Takimoto: Size and Energy of Threshold Circuits Computing Mod Functions. MFCS 2009: 724-735
c80		Takaaki Mizuki, Hitoshi Tsubata, Takao Nishizeki: Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions. TAMC 2009: 301-310
	2008
j82		Yasuhito Asano, Yu Tezuka, Takao Nishizeki: Improvements of HITS Algorithms for Spam Links. IEICE Transactions 91-D(2): 200-208 (2008)
j81		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)
j80		Kazuyuki Miura, Akira Kamada, Takao Nishizeki: Convex Grid Drawings of Plane Graphs with Rectangular Contours. J. Graph Algorithms Appl. 12(2): 197-224 (2008)
j79		Koichi Koizumi, Takaaki Mizuki, Takao Nishizeki: A Revised Transformation Protocol for Unconditionally Secure Secret Key Exchange. Theory Comput. Syst. 42(2): 187-221 (2008)
j78		Xiao Zhou, Takao Nishizeki: Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends. SIAM J. Discrete Math. 22(4): 1570-1604 (2008)
c79		Yasuhito Asano, Yuya Miyawaki, Takao Nishizeki: Efficient Compression of Web Graphs. COCOON 2008: 1-11
c78		Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki: Partitioning a Weighted Tree to Subtrees of Almost Uniform Size. ISAAC 2008: 196-207
e4		Seok-Hee Hong, Takao Nishizeki, Wu Quan (Eds.): Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers. Lecture Notes in Computer Science 4875, Springer 2008, isbn 978-3-540-77536-2
	2007
j77		Shuji Isobe, Xiao Zhou, Takao Nishizeki: Total Colorings Of Degenerate Graphs. Combinatorica 27(2): 167-182 (2007)
j76		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)
j75		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)
j74		Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki: Algorithms for finding distance-edge-colorings of graphs. J. Discrete Algorithms 5(2): 304-322 (2007)
c77		Yasuhito Asano, Yu Tezuka, Takao Nishizeki: Improvements of HITS Algorithms for Spam Links. APWeb/WAIM 2007: 479-490
c76		Takao Nishizeki: Inner Rectangular Drawings of Plane Graphs: Application of Graph Drawing to VLSI Layouts. WALCOM 2007: 1-2
c75		Xiao Zhou, Takao Nishizeki: Orthogonal drawings of series-parallel graphs with minimum bends. WALCOM 2007: 3-12
	2006
j73		Kozo Banno, Shingo Orihara, Takaaki Mizuki, Takao Nishizeki: Best Security Index for Digital Fingerprinting. IEICE Transactions 89-A(1): 169-177 (2006)
j72		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)
j71		Kazuyuki Miura, Hiroki Haga, Takao Nishizeki: Inner Rectangular Drawings of Plane Graphs. Int. J. Comput. Geometry Appl. 16(2-3): 249-270 (2006)
j70		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)
j69		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)
j68		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)
c74		Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki: Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size. COCOON 2006: 63-72
c73		Kazuyuki Miura, Tetsuya Matsuno, Takao Nishizeki: Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs. Graph Drawing 2006: 138-149
c72		Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki: Approximability of Partitioning Graphs with Supply and Demand. ISAAC 2006: 121-130
c71		Akira Kamada, Kazuyuki Miura, Takao Nishizeki: Convex Grid Drawings of Plane Graphs with Rectangular Contours. ISAAC 2006: 131-140
	2005
j67		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)
j66		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)
j65		Takehiro Ito, Xiao Zhou, Takao Nishizeki: Partitioning trees of supply and demand. Int. J. Found. Comput. Sci. 16(4): 803-827 (2005)
j64		Xiao Zhou, Yuki Matsuo, Takao Nishizeki: List total colorings of series-parallel graphs. J. Discrete Algorithms 3(1): 47-60 (2005)
c70		Kazuyuki Miura, Takao Nishizeki: Rectangle-of-Influence Drawings of Four-Connected Plane Graphs. APVIS 2005: 75-80
c69		Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki: Algorithms for Finding Distance-Edge-Colorings of Graphs. COCOON 2005: 798-807
c68		Kazuyuki Miura, Machiko Azuma, Takao Nishizeki: Convex Drawings of Plane Graphs of Minimum Outer Apices. Graph Drawing 2005: 297-308
c67		Md. Saidur Rahman, Noritsugu Egi, Takao Nishizeki: No-bend Orthogonal Drawings of Series-Parallel Graphs. Graph Drawing 2005: 409-420
c66		Kozo Banno, Shingo Orihara, Takaaki Mizuki, Takao Nishizeki: Best Security Index for Digital Fingerprinting. Information Hiding 2005: 398-412
c65		Xiao Zhou, Takao Nishizeki: Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends. ISAAC 2005: 166-175
c64		Takehiro Ito, Xiao Zhou, Takao Nishizeki: Partitioning graphs of supply and demand. ISCAS (1) 2005: 160-163
c63		Yasuhito Asano, Takao Nishizeki, Masashi Toyoda: Mining Communities on the Web Using a Max-Flow and a Site-Oriented Framework. WISE 2005: 1-14
	2004
j63		Takao Nishizeki, Kazuyuki Miura, Md. Saidur Rahman: Algorithms for Drawing Plane Graphs. IEICE Transactions 87-D(2): 281-289 (2004)
j62		Shuji Isobe, Xiao Zhou, Takao Nishizeki: Cost Total Colorings of Trees. IEICE Transactions 87-D(2): 337-342 (2004)
j61		Md. Saidur Rahman, Takao Nishizeki, Shubhashis Ghosh: Rectangular drawings of planar graphs. J. Algorithms 50(1): 62-78 (2004)
j60		Xiao Zhou, Takao Nishizeki: Algorithm for the Cost Edge-Coloring of Trees. J. Comb. Optim. 8(1): 97-108 (2004)
c62		Koichi Koizumi, Takaaki Mizuki, Takao Nishizeki: Necessary and Sufficient Numbers of Cards for the Transformation Protocol. COCOON 2004: 92-101
c61		Kazuyuki Miura, Machiko Azuma, Takao Nishizeki: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs. COCOON 2004: 309-318
c60		Kazuyuki Miura, Hiroki Haga, Takao Nishizeki: Inner Rectangular Drawings of Plane Graphs. ISAAC 2004: 693-704
c59		Md. Saidur Rahman, Kazuyuki Miura, Takao Nishizeki: Octagonal Drawings of Plane Graphs with Prescribed Face Areas. WG 2004: 320-331
c58		Takehiro Ito, Xiao Zhou, Takao Nishizeki: Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size. WG 2004: 365-376
	2003
j59		Xiao Zhou, Takao Nishizeki: Multicolorings of Series-Parallel Graphs. Algorithmica 38(2): 271-297 (2003)
j58		Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki: Characterization of optimal key set protocols. Discrete Applied Mathematics 131(1): 213-236 (2003)
j57		Md. Saidur Rahman, Takao Nishizeki, Mahmuda Naznin: Orthogonal Drawings of Plane Graphs Without Bends. J. Graph Algorithms Appl. 7(4): 335-362 (2003)
j56		Masud Hasan, Md. Saidur Rahman, Takao Nishizeki: A linear algorithm for compact box-drawings of trees. Networks 42(3): 160-164 (2003)
c57		Xiao Zhou, Yuki Matsuo, Takao Nishizeki: List Total Colorings of Series-Parallel Graphs. COCOON 2003: 172-181
c56		Md. Saidur Rahman, Noritsugu Egi, Takao Nishizeki: No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs. Graph Drawing 2003: 387-392
c55		Yasuhito Asano, Takao Nishizeki: Web-Linkage Viewer: Drawing Links in the Web Based on a Site-Oriented Framework. Graph Drawing 2003: 498-499
c54		Takao Nishizeki: Drawing Plane Graphs. ISAAC 2003: 2-5
	2002
j55		Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki: Rectangular drawings of plane graphs without designated corners. Comput. Geom. 21(3): 121-138 (2002)
j54		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)
j53		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)
c53		Masud Hasan, Md. Saidur Rahman, Takao Nishizeki: A linear algorithm for compact box-drawings of trees. CCCG 2002: 154-157
c52		Takehiro Ito, Takao Nishizeki, Xiao Zhou: Algorithms for the Multicolorings of Partial k-Trees. COCOON 2002: 430-439
c51		Md. Saidur Rahman, Takao Nishizeki, Shubhashis Ghosh: Rectangular Drawings of Planar Graphs. Graph Drawing 2002: 244-255
c50		Kazuyuki Miura, Ayako Miyazawa, Takao Nishizeki: Extended Rectangular Drawings of Plane Graphs with Designated Corners. Graph Drawing 2002: 256-267
c49		Takehiro Ito, Xiao Zhou, Takao Nishizeki: Partitioning Trees of Supply and Demand. ISAAC 2002: 612-623
c48		Md. Saidur Rahman, Takao Nishizeki: Bend-Minimum Orthogonal Drawings of Plane 3-Graphs. WG 2002: 367-378
	2001
j52		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)
j51		Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki: Grid Drawings of 4-Connected Plane Graphs. Discrete & Computational Geometry 26(1): 73-87 (2001)
j50		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)
j49		Takao Nishizeki, Roberto Tamassia, Dorothea Wagner: Guest Editors' Foreword. J. Graph Algorithms Appl. 5(5): 1 (2001)
c47		Xiao Zhou, Takao Nishizeki: Algorithm for the Cost Edge-Coloring of Trees. COCOON 2001: 288-297
c46		Md. Saidur Rahman, Mahmuda Naznin, Takao Nishizeki: Orthogonal Drawings of Plane Graphs without Bends. Graph Drawing 2001: 392-406
c45		Shuji Isobe, Xiao Zhou, Takao Nishizeki: Total Colorings of Degenerated Graphs. ICALP 2001: 506-517
c44		Takaaki Mizuki, Takao Nishizeki: Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups. ISAAC 2001: 196-207
c43		Xiao Zhou, Takao Nishizeki: Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs. ISAAC 2001: 514-524
	2000
j48		Takao Nishizeki, Roberto Tamassia, Dorothea Wagner: Foreword. Algorithmica 26(1): 1-2 (2000)
j47		Xiao Zhou, Syurei Tamura, Takao Nishizeki: Finding Edge-Disjoint Paths in Partial k-Trees. Algorithmica 26(1): 3-30 (2000)
j46		Xiao Zhou, K. Fuse, Takao Nishizeki: A Linear Algorithm for Finding [{g, f}]-Colorings of Partial {k}-Trees. Algorithmica 27(3): 227-243 (2000)
j45		Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki: Box-Rectangular Drawings of Plane Graphs. J. Algorithms 37(2): 363-398 (2000)
j44		Abul Kashem, Xiao Zhou, Takao Nishizeki: Algorithms for generalized vertex-rankings of partial k-trees. Theor. Comput. Sci. 240(2): 407-427 (2000)
c42		Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki: Rectangular Drawings of Plane Graphs Without Designated Corners. COCOON 2000: 85-94
c41		Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe: Labeling Points with Rectangles of Various Shapes. Graph Drawing 2000: 91-102
c40		Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki: Characterization of Optimal Key Set Protocols. IFIP TCS 2000: 273-285
c39		Xiao Zhou, Takao Nishizeki: Finding Independent Spanning Trees in Partial k-Trees. ISAAC 2000: 168-179
c38		Kazuyuki Miura, Takao Nishizeki, Shin-Ichi Nakano: Convex Grid Drwaings of Four-Connected Plane Graphs. ISAAC 2000: 254-265
	1999
j43		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)
j42		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)
j41		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)
j40		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)
j39		Xiao Zhou, Takao Nishizeki: Edge-Coloring and f-Coloring for Various Classes of Graphs. J. Graph Algorithms Appl. 3(1) (1999)
j38		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)
c37		Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki: Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key. EUROCRYPT 1999: 389-401
c36		Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki: Grid Drawings of Four-Connected Plane Graphs. Graph Drawing 1999: 145-154
c35		Yoshiyuki Kusakari, Daisuke Masubuchi, Takao Nishizeki: Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs. ISAAC 1999: 337-346
c34		Shuji Isobe, Xiao Zhou, Takao Nishizeki: A Linear Algorithm for Finding Total Colorings of Partial k-Trees. ISAAC 1999: 347-356
c33		Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki: Box-Rectangular Drawings of Plane Graphs. WG 1999: 250-261
	1998
j37		Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki: Rectangular grid drawings of plane graphs. Comput. Geom. 10(3): 203-220 (1998)
c32		Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki: Eulerian Secret Key Exchange. COCOON 1998: 349-360
c31		Xiao Zhou, Takao Nishizeki: The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees. ISAAC 1998: 417-426
c30		Shuji Isobe, Xiao Zhou, Takao Nishizeki: A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees. WG 1998: 100-113
c29		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
	1997
j36		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)
j35		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)
j34		Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki: An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs. J. Algorithms 23(2): 359-374 (1997)
c28		Abul Kashem, Xiao Zhou, Takao Nishizeki: Generalized Vertex-Rankings of Partial k-trees. COCOON 1997: 212-221
c27		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
c26		Yoshiyuki Kusakari, Takao Nishizeki: An Algorithm for Finding a Region with the Minimum Lotal L₁ from Prescribed Terminals. ISAAC 1997: 324-333
c25		Abul Kashem, Xiao Zhou, Takao Nishizeki: An NC Parallel Algorithm for Generalized Vertex-Rankings of Partial k-Trees. ISPAN 1997: 105-111
	1996
j33		Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki: Shortest Noncrossing Paths in Plane Graphs. Algorithmica 16(3): 339-357 (1996)
j32		Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki: A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs. J. Algorithms 20(1): 174-201 (1996)
j31		Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki: Edge-Coloring Partial k-Trees. J. Algorithms 21(3): 598-617 (1996)
c24		Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki: Rectangular Grid Drawings of Plane Graphs. COCOON 1996: 92-105
c23		Shin-Ichi Nakano, Md. Saidur Rahman, Takao Nishizeki: A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. Graph Drawing 1996: 334-344
c22		Xiao Zhou, Syurei Tamura, Takao Nishizeki: Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract). ISAAC 1996: 203-212
c21		Xiao Zhou, Abul Kashem, Takao Nishizeki: Generalized Edge-Ranking of Trees (Extended Abstract). WG 1996: 390-404
	1995
j30		Xiao Zhou, Nobuaki Nagai, Takao Nishizeki: Generalized Vertex-Rankings of Trees. Inf. Process. Lett. 56(6): 321-328 (1995)
p1		Shin-Ichi Nakano, Xiao Zhou, Takao Nishizeki: Edge-Coloring Algorithms. Computer Science Today 1995: 172-183
c20		Xiao Zhou, Takao Nishizeki: Simple Reduction of f-Colorings to Edge-Colorings. COCOON 1995: 223-228
c19		Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki: Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas. ISAAC 1995: 42-51
c18		Xiao Zhou, Takao Nishizeki: Algorithms for Finding f-Colorings of Partial k-Trees. ISAAC 1995: 332-341
c17		Xiao Zhou, Takao Nishizeki: Finding Optimal Edge-Rankings of Trees. SODA 1995: 122-131
	1994
j29		Takao Nishizeki, Svatopluk Poljak: k-Connectivity and Decomposition of Graphs into Forests. Discrete Applied Mathematics 55(3): 295-301 (1994)
j28		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)
c16		Xiao Zhou, Takao Nishizeki: An Efficient Algorithm for Edge-Ranking Trees. ESA 1994: 118-129
c15		Xiao Zhou, Takao Nishizeki: Edge-Coloring and f-Coloring for Various Classes of Graphs. ISAAC 1994: 199-207
c14		Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki: A Parallel Algorithm for Edge-Coloring Partial k-Trees. SWAT 1994: 359-369
	1993
j27		Shin-Ichi Nakano, Takao Nishizeki: Scheduling File Transfers Under Port and Channe; Constraints. Int. J. Found. Comput. Sci. 4(2): 101-115 (1993)
j26		M. Ito, A. Saio, Takao Nishizeki: Multiple Assignment Scheme for Sharing Secret. J. Cryptology 6(1): 15-20 (1993)
c13		Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki: A Linear Algorithm for Edge-Coloring Partial k-Trees. ESA 1993: 409-418
c12		Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki: Sequential and parallel algorithms for edge-coloring series-parallel multigraphs. IPCO 1993: 129-145
c11		Shin-Ichi Nakano, Takao Nishizeki: Nearly uniform scheduling of file transfers. IPCO 1993: 425-431
c10		Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki: Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions. ISAAC 1993: 98-107
	1992
j25		András Frank, Takao Nishizeki, Nobuji Saito, Hitoshi Suzuki: Algorithms for Routing around a Rectangle. Discrete Applied Mathematics 40(4): 363-378 (1992)
j24		Hitoshi Suzuki, Akira Ishiguro, Takao Nishizeki: Variable-Priority Queue and Doughnut Routing. J. Algorithms 13(4): 606-635 (1992)
c9		Naoyoshi Kanamaru, Takao Nishizeki, Tetsuo Asano: Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming. IPCO 1992: 61-71
c8		Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki: Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs. ISAAC 1992: 400-409
c7		Xiao Zhou, Shin-Ichi Nakano, Hitoshi Suzuki, Takao Nishizeki: An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs. LATIN 1992: 516-529
e3		Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita (Eds.): Algorithms and Computation, Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992, Proceedings. Lecture Notes in Computer Science 650, Springer 1992, isbn 3-540-56279-6
	1991
c6		Shin-Ichi Nakano, Takao Nishizeki: Scheduling File Transfers under Port and Channel Constraints. ISA 1991: 43-51
	1990
j23		Shin-Ichi Nakano, Takao Nishizeki, Nobuji Saito: On the fg-coloring of graphs. Combinatorica 10(1): 67-80 (1990)
j22		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)
j21		Hitoshi Suzuki, Naomi Takahashi, Takao Nishizeki: A Linear Algorithm for Bipartition of Biconnected Graphs. Inf. Process. Lett. 33(5): 227-231 (1990)
j20		Marek Chrobak, Takao Nishizeki: Improved Edge-Coloring Algorithms for Planar Graphs. J. Algorithms 11(1): 102-116 (1990)
j19		Takao Nishizeki, Kenichi Kashiwagi: On the 1.1 Edge-Coloring of Multigraphs. SIAM J. Discrete Math. 3(3): 391-410 (1990)
c5		Hitoshi Suzuki, Chiseko Yamanaka, Takao Nishizeki: Parallel Algorithms for Finding Steiner Forests in Planar Graphs. SIGAL International Symposium on Algorithms 1990: 458-467
c4		Hitoshi Suzuki, Takehiro Akama, Takao Nishizeki: Finding Steiner Forests in Planar Graphs. SODA 1990: 444-453
e2		Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki (Eds.): Algorithms, International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990, Proceedings. Lecture Notes in Computer Science 450, Springer 1990, isbn 3-540-52921-7
	1989
j18		Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito: Algorithms for Multicommodity Flows in Planar Graphs. Algorithmica 4(4): 471-501 (1989)
j17		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
j16		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)
j15		Kazuhiko Matsumoto, Takao Nishizeki, Nobuji Saito: Planar Multicommodity Flows, Maximum Matchings and Negative Cycles. SIAM J. Comput. 15(2): 495-510 (1986)
	1985
j14		Norishige Chiba, Kazunori Onoguchi, Takao Nishizeki: Drawing Plane Graphs Nicely. Acta Inf. 22(2): 187-201 (1985)
j13		Hiroyuki Nakayama, Takao Nishizeki, Nobuji Saito: Lower Bounds for Combinatorial Problems on Graphs. J. Algorithms 6(3): 393-399 (1985)
j12		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)
j11		Norishige Chiba, Takao Nishizeki: Arboricity and Subgraph Listing Algorithms. SIAM J. Comput. 14(1): 210-223 (1985)
j10		Kazuhiko Matsumoto, Takao Nishizeki, Nobuji Saito: An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks. SIAM J. Comput. 14(2): 289-302 (1985)
j9		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)
c3		Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito: Multicommodity Flows in Planar Undirected Graphs and Shortest Paths. STOC 1985: 195-204
	1984
j8		Takao Asano, Takao Nishizeki, Paul D. Seymour: A note on nongraphic matroids. J. Comb. Theory, Ser. B 37(3): 290-293 (1984)
	1983
j7		Norishige Chiba, Takao Nishizeki, Nobuji Saito: An algorithm for finding a large independent set in planar graphs. Networks 13(2): 247-252 (1983)
	1982
j6		K. Takamizawa, Takao Nishizeki, Nobuji Saito: Linear-time computability of combinatorial problems on series-parallel graphs. J. ACM 29(3): 623-641 (1982)
j5		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
j4		Takao Nishizeki: On the maximum matchings of regular multigraphs. Discrete Mathematics 37(1): 105-114 (1981)
j3		Norishige Chiba, Takao Nishizeki, Nobuji Saito: A Linear 5-Coloring Algorithm of Planar Graphs. J. Algorithms 2(4): 317-327 (1981)
e1		Nobuji Saito, Takao Nishizeki (Eds.): Graph Theory and Algorithms, 17th Symposium of Research Institute of Electric Communication, Tohoku University, Sendai, Japan, October 24-25, 1980, Proceedings. Lecture Notes in Computer Science 108, Springer 1981, isbn 3-540-10704-5
	1980
j2		K. Takamizawa, Takao Nishizeki, Nobuji Saito: An algorithm for finding a short closed spanning walk in a graph. Networks 10(3): 249-263 (1980)
c2		Norishige Chiba, Takao Nishizeki, Nobuji Saito: A linear algorithm for five-coloring a planar graph. Graph Theory and Algorithms 1980: 9-19
c1		K. Takamizawa, Takao Nishizeki, Nobuji Saito: Combinatorial problems on series-parallel graphs. Graph Theory and Algorithms 1980: 79-94
	1978
j1		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)

2012

j96

Takehiro Ito, Takao Nishizeki, Michael Schröder, Takeaki Uno, Xiao Zhou: Partitioning a Weighted Tree into Subtrees with Weights in a Given Range. Algorithmica 62(3-4): 823-841 (2012)

j95

Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki: Minimum Cost Partitions of Trees with Supply and Demand. Algorithmica 64(3): 400-415 (2012)

j94

Yoshihiro Indo, Takaaki Mizuki, Takao Nishizeki: Absolutely Secure Message Transmission using a Key Sharing Graph. Discrete Math., Alg. and Appl. 4(4) (2012)

j93

Xiao Zhou, Takashi Hikino, Takao Nishizeki: Small grid drawings of planar graphs with balanced partition. J. Comb. Optim. 24(2): 99-115 (2012)

c87

Kazuhide Nishikawa, Takao Nishizeki, Xiao Zhou: Algorithms for Bandwidth Consecutive Multicolorings of Graphs - (Extended Abstract). FAW-AAIM 2012: 117-128

2011

j92

Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki: Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. IEICE Transactions 94-D(2): 190-195 (2011)

j91

Kei Uchizawa, Eiji Takimoto, Takao Nishizeki: Size-energy tradeoffs for unate circuits computing symmetric Boolean functions. Theor. Comput. Sci. 412(8-10): 773-782 (2011)

2010

j90

Xiao Zhou, Takao Nishizeki: Convex Drawings of Internally Triconnected Plane Graphs on O(N²) Grids. Discrete Math., Alg. and Appl. 2(3): 347-362 (2010)

j89

Takaaki Mizuki, Hitoshi Tsubata, Takao Nishizeki: Minimizing AND-EXOR Expressions for Two-Variable Multiple-Valued Input Binary Output Functions. Multiple-Valued Logic and Soft Computing 16(1-2): 197-208 (2010)

j88

Kei Uchizawa, Takao Nishizeki, Eiji Takimoto: Energy and depth of threshold circuits. Theor. Comput. Sci. 411(44-46): 3938-3946 (2010)

c86

Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki: Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. FAW 2010: 274-284

c85

Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki: Minimum Cost Partitions of Trees with Supply and Demand. ISAAC (2) 2010: 351-362

c84

Xiao Zhou, Takashi Hikino, Takao Nishizeki: Small Grid Drawings of Planar Graphs with Balanced Bipartition. WALCOM 2010: 47-57

2009

j87

Md. Saidur Rahman, Kazuyuki Miura, Takao Nishizeki: Octagonal drawings of plane graphs with prescribed face areas. Comput. Geom. 42(3): 214-230 (2009)

j86

Takehiro Ito, Xiao Zhou, Takao Nishizeki: Partitioning graphs of supply and demand. Discrete Applied Mathematics 157(12): 2620-2633 (2009)

j85

Kazuyuki Miura, Tetsuya Matsuno, Takao Nishizeki: Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs. Discrete & Computational Geometry 41(4): 643-670 (2009)

j84

Yasuhito Asano, Yuya Miyawaki, Takao Nishizeki: Efficient Compression of Web Graphs. IEICE Transactions 92-A(10): 2454-2462 (2009)

j83

Seok-Hee Hong, Takao Nishizeki: Guest Editors' Foreword. J. Graph Algorithms Appl. 13(3): 285-287 (2009)

c83

Kei Uchizawa, Takao Nishizeki, Eiji Takimoto: Energy Complexity and Depth of Threshold Circuits. FCT 2009: 335-345

c82

Xiao Zhou, Takao Nishizeki: Convex Drawings of Internally Triconnected Plane Graphs on O(n²) Grids. ISAAC 2009: 760-770

c81

Kei Uchizawa, Takao Nishizeki, Eiji Takimoto: Size and Energy of Threshold Circuits Computing Mod Functions. MFCS 2009: 724-735

c80

Takaaki Mizuki, Hitoshi Tsubata, Takao Nishizeki: Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions. TAMC 2009: 301-310

2008

j82

Yasuhito Asano, Yu Tezuka, Takao Nishizeki: Improvements of HITS Algorithms for Spam Links. IEICE Transactions 91-D(2): 200-208 (2008)

j81

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)

j80

Kazuyuki Miura, Akira Kamada, Takao Nishizeki: Convex Grid Drawings of Plane Graphs with Rectangular Contours. J. Graph Algorithms Appl. 12(2): 197-224 (2008)

j79

Koichi Koizumi, Takaaki Mizuki, Takao Nishizeki: A Revised Transformation Protocol for Unconditionally Secure Secret Key Exchange. Theory Comput. Syst. 42(2): 187-221 (2008)

j78

Xiao Zhou, Takao Nishizeki: Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends. SIAM J. Discrete Math. 22(4): 1570-1604 (2008)

c79

Yasuhito Asano, Yuya Miyawaki, Takao Nishizeki: Efficient Compression of Web Graphs. COCOON 2008: 1-11

c78

Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki: Partitioning a Weighted Tree to Subtrees of Almost Uniform Size. ISAAC 2008: 196-207

Seok-Hee Hong, Takao Nishizeki, Wu Quan (Eds.): Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers. Lecture Notes in Computer Science 4875, Springer 2008, isbn 978-3-540-77536-2

2007

j77

Shuji Isobe, Xiao Zhou, Takao Nishizeki: Total Colorings Of Degenerate Graphs. Combinatorica 27(2): 167-182 (2007)

j76

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)

j75

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)

j74

Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki: Algorithms for finding distance-edge-colorings of graphs. J. Discrete Algorithms 5(2): 304-322 (2007)

c77

Yasuhito Asano, Yu Tezuka, Takao Nishizeki: Improvements of HITS Algorithms for Spam Links. APWeb/WAIM 2007: 479-490

c76

Takao Nishizeki: Inner Rectangular Drawings of Plane Graphs: Application of Graph Drawing to VLSI Layouts. WALCOM 2007: 1-2

c75

Xiao Zhou, Takao Nishizeki: Orthogonal drawings of series-parallel graphs with minimum bends. WALCOM 2007: 3-12

2006

j73

Kozo Banno, Shingo Orihara, Takaaki Mizuki, Takao Nishizeki: Best Security Index for Digital Fingerprinting. IEICE Transactions 89-A(1): 169-177 (2006)

j72

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)

j71

Kazuyuki Miura, Hiroki Haga, Takao Nishizeki: Inner Rectangular Drawings of Plane Graphs. Int. J. Comput. Geometry Appl. 16(2-3): 249-270 (2006)

j70

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)

j69

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)

j68

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)

c74

Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki: Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size. COCOON 2006: 63-72

c73

Kazuyuki Miura, Tetsuya Matsuno, Takao Nishizeki: Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs. Graph Drawing 2006: 138-149

c72

Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki: Approximability of Partitioning Graphs with Supply and Demand. ISAAC 2006: 121-130

c71

Akira Kamada, Kazuyuki Miura, Takao Nishizeki: Convex Grid Drawings of Plane Graphs with Rectangular Contours. ISAAC 2006: 131-140

2005

j67

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)

j66

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)

j65

Takehiro Ito, Xiao Zhou, Takao Nishizeki: Partitioning trees of supply and demand. Int. J. Found. Comput. Sci. 16(4): 803-827 (2005)

j64

Xiao Zhou, Yuki Matsuo, Takao Nishizeki: List total colorings of series-parallel graphs. J. Discrete Algorithms 3(1): 47-60 (2005)

c70

Kazuyuki Miura, Takao Nishizeki: Rectangle-of-Influence Drawings of Four-Connected Plane Graphs. APVIS 2005: 75-80

c69

Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki: Algorithms for Finding Distance-Edge-Colorings of Graphs. COCOON 2005: 798-807

c68

Kazuyuki Miura, Machiko Azuma, Takao Nishizeki: Convex Drawings of Plane Graphs of Minimum Outer Apices. Graph Drawing 2005: 297-308

c67

Md. Saidur Rahman, Noritsugu Egi, Takao Nishizeki: No-bend Orthogonal Drawings of Series-Parallel Graphs. Graph Drawing 2005: 409-420

c66

Kozo Banno, Shingo Orihara, Takaaki Mizuki, Takao Nishizeki: Best Security Index for Digital Fingerprinting. Information Hiding 2005: 398-412

c65

Xiao Zhou, Takao Nishizeki: Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends. ISAAC 2005: 166-175

c64

Takehiro Ito, Xiao Zhou, Takao Nishizeki: Partitioning graphs of supply and demand. ISCAS (1) 2005: 160-163

c63

Yasuhito Asano, Takao Nishizeki, Masashi Toyoda: Mining Communities on the Web Using a Max-Flow and a Site-Oriented Framework. WISE 2005: 1-14

2004

j63

Takao Nishizeki, Kazuyuki Miura, Md. Saidur Rahman: Algorithms for Drawing Plane Graphs. IEICE Transactions 87-D(2): 281-289 (2004)

j62

Shuji Isobe, Xiao Zhou, Takao Nishizeki: Cost Total Colorings of Trees. IEICE Transactions 87-D(2): 337-342 (2004)

j61

Md. Saidur Rahman, Takao Nishizeki, Shubhashis Ghosh: Rectangular drawings of planar graphs. J. Algorithms 50(1): 62-78 (2004)

j60

Xiao Zhou, Takao Nishizeki: Algorithm for the Cost Edge-Coloring of Trees. J. Comb. Optim. 8(1): 97-108 (2004)

c62

Koichi Koizumi, Takaaki Mizuki, Takao Nishizeki: Necessary and Sufficient Numbers of Cards for the Transformation Protocol. COCOON 2004: 92-101

c61

Kazuyuki Miura, Machiko Azuma, Takao Nishizeki: Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs. COCOON 2004: 309-318

c60

Kazuyuki Miura, Hiroki Haga, Takao Nishizeki: Inner Rectangular Drawings of Plane Graphs. ISAAC 2004: 693-704

c59

Md. Saidur Rahman, Kazuyuki Miura, Takao Nishizeki: Octagonal Drawings of Plane Graphs with Prescribed Face Areas. WG 2004: 320-331

c58

Takehiro Ito, Xiao Zhou, Takao Nishizeki: Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size. WG 2004: 365-376

2003

j59

Xiao Zhou, Takao Nishizeki: Multicolorings of Series-Parallel Graphs. Algorithmica 38(2): 271-297 (2003)

j58

Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki: Characterization of optimal key set protocols. Discrete Applied Mathematics 131(1): 213-236 (2003)

j57

Md. Saidur Rahman, Takao Nishizeki, Mahmuda Naznin: Orthogonal Drawings of Plane Graphs Without Bends. J. Graph Algorithms Appl. 7(4): 335-362 (2003)

j56

Masud Hasan, Md. Saidur Rahman, Takao Nishizeki: A linear algorithm for compact box-drawings of trees. Networks 42(3): 160-164 (2003)

c57

Xiao Zhou, Yuki Matsuo, Takao Nishizeki: List Total Colorings of Series-Parallel Graphs. COCOON 2003: 172-181

c56

Md. Saidur Rahman, Noritsugu Egi, Takao Nishizeki: No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs. Graph Drawing 2003: 387-392

c55

Yasuhito Asano, Takao Nishizeki: Web-Linkage Viewer: Drawing Links in the Web Based on a Site-Oriented Framework. Graph Drawing 2003: 498-499

c54

Takao Nishizeki: Drawing Plane Graphs. ISAAC 2003: 2-5

2002

j55

Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki: Rectangular drawings of plane graphs without designated corners. Comput. Geom. 21(3): 121-138 (2002)

j54

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)

j53

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)

c53

Masud Hasan, Md. Saidur Rahman, Takao Nishizeki: A linear algorithm for compact box-drawings of trees. CCCG 2002: 154-157

c52

Takehiro Ito, Takao Nishizeki, Xiao Zhou: Algorithms for the Multicolorings of Partial k-Trees. COCOON 2002: 430-439

c51

Md. Saidur Rahman, Takao Nishizeki, Shubhashis Ghosh: Rectangular Drawings of Planar Graphs. Graph Drawing 2002: 244-255

c50

Kazuyuki Miura, Ayako Miyazawa, Takao Nishizeki: Extended Rectangular Drawings of Plane Graphs with Designated Corners. Graph Drawing 2002: 256-267

c49

Takehiro Ito, Xiao Zhou, Takao Nishizeki: Partitioning Trees of Supply and Demand. ISAAC 2002: 612-623

c48

Md. Saidur Rahman, Takao Nishizeki: Bend-Minimum Orthogonal Drawings of Plane 3-Graphs. WG 2002: 367-378

2001

j52

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)

j51

Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki: Grid Drawings of 4-Connected Plane Graphs. Discrete & Computational Geometry 26(1): 73-87 (2001)

j50

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)

j49

Takao Nishizeki, Roberto Tamassia, Dorothea Wagner: Guest Editors' Foreword. J. Graph Algorithms Appl. 5(5): 1 (2001)

c47

Xiao Zhou, Takao Nishizeki: Algorithm for the Cost Edge-Coloring of Trees. COCOON 2001: 288-297

c46

Md. Saidur Rahman, Mahmuda Naznin, Takao Nishizeki: Orthogonal Drawings of Plane Graphs without Bends. Graph Drawing 2001: 392-406

c45

Shuji Isobe, Xiao Zhou, Takao Nishizeki: Total Colorings of Degenerated Graphs. ICALP 2001: 506-517

c44

Takaaki Mizuki, Takao Nishizeki: Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups. ISAAC 2001: 196-207

c43

Xiao Zhou, Takao Nishizeki: Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs. ISAAC 2001: 514-524

2000

j48

Takao Nishizeki, Roberto Tamassia, Dorothea Wagner: Foreword. Algorithmica 26(1): 1-2 (2000)

j47

Xiao Zhou, Syurei Tamura, Takao Nishizeki: Finding Edge-Disjoint Paths in Partial k-Trees. Algorithmica 26(1): 3-30 (2000)

j46

Xiao Zhou, K. Fuse, Takao Nishizeki: A Linear Algorithm for Finding [{g, f}]-Colorings of Partial {k}-Trees. Algorithmica 27(3): 227-243 (2000)

j45

Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki: Box-Rectangular Drawings of Plane Graphs. J. Algorithms 37(2): 363-398 (2000)

j44

Abul Kashem, Xiao Zhou, Takao Nishizeki: Algorithms for generalized vertex-rankings of partial k-trees. Theor. Comput. Sci. 240(2): 407-427 (2000)

c42

Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki: Rectangular Drawings of Plane Graphs Without Designated Corners. COCOON 2000: 85-94

c41

Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe: Labeling Points with Rectangles of Various Shapes. Graph Drawing 2000: 91-102

c40

Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki: Characterization of Optimal Key Set Protocols. IFIP TCS 2000: 273-285

c39

Xiao Zhou, Takao Nishizeki: Finding Independent Spanning Trees in Partial k-Trees. ISAAC 2000: 168-179

c38

Kazuyuki Miura, Takao Nishizeki, Shin-Ichi Nakano: Convex Grid Drwaings of Four-Connected Plane Graphs. ISAAC 2000: 254-265

1999

j43

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)

j42

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)

j41

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)

j40

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)

j39

Xiao Zhou, Takao Nishizeki: Edge-Coloring and f-Coloring for Various Classes of Graphs. J. Graph Algorithms Appl. 3(1) (1999)

j38

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)

c37

Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki: Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key. EUROCRYPT 1999: 389-401

c36

Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki: Grid Drawings of Four-Connected Plane Graphs. Graph Drawing 1999: 145-154

c35

Yoshiyuki Kusakari, Daisuke Masubuchi, Takao Nishizeki: Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs. ISAAC 1999: 337-346

c34

Shuji Isobe, Xiao Zhou, Takao Nishizeki: A Linear Algorithm for Finding Total Colorings of Partial k-Trees. ISAAC 1999: 347-356

c33

Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki: Box-Rectangular Drawings of Plane Graphs. WG 1999: 250-261

1998

j37

Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki: Rectangular grid drawings of plane graphs. Comput. Geom. 10(3): 203-220 (1998)

c32

Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki: Eulerian Secret Key Exchange. COCOON 1998: 349-360

c31

Xiao Zhou, Takao Nishizeki: The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees. ISAAC 1998: 417-426

c30

Shuji Isobe, Xiao Zhou, Takao Nishizeki: A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees. WG 1998: 100-113

c29

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

1997

j36

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)

j35

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)

j34

Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki: An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs. J. Algorithms 23(2): 359-374 (1997)

c28

Abul Kashem, Xiao Zhou, Takao Nishizeki: Generalized Vertex-Rankings of Partial k-trees. COCOON 1997: 212-221

c27

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

c26

Yoshiyuki Kusakari, Takao Nishizeki: An Algorithm for Finding a Region with the Minimum Lotal L₁ from Prescribed Terminals. ISAAC 1997: 324-333

c25

Abul Kashem, Xiao Zhou, Takao Nishizeki: An NC Parallel Algorithm for Generalized Vertex-Rankings of Partial k-Trees. ISPAN 1997: 105-111

1996

j33

Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki: Shortest Noncrossing Paths in Plane Graphs. Algorithmica 16(3): 339-357 (1996)

j32

Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki: A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs. J. Algorithms 20(1): 174-201 (1996)

j31

Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki: Edge-Coloring Partial k-Trees. J. Algorithms 21(3): 598-617 (1996)

c24

Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki: Rectangular Grid Drawings of Plane Graphs. COCOON 1996: 92-105

c23

Shin-Ichi Nakano, Md. Saidur Rahman, Takao Nishizeki: A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. Graph Drawing 1996: 334-344

c22

Xiao Zhou, Syurei Tamura, Takao Nishizeki: Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract). ISAAC 1996: 203-212

c21

Xiao Zhou, Abul Kashem, Takao Nishizeki: Generalized Edge-Ranking of Trees (Extended Abstract). WG 1996: 390-404

1995

j30

Xiao Zhou, Nobuaki Nagai, Takao Nishizeki: Generalized Vertex-Rankings of Trees. Inf. Process. Lett. 56(6): 321-328 (1995)

Shin-Ichi Nakano, Xiao Zhou, Takao Nishizeki: Edge-Coloring Algorithms. Computer Science Today 1995: 172-183

c20

Xiao Zhou, Takao Nishizeki: Simple Reduction of f-Colorings to Edge-Colorings. COCOON 1995: 223-228

c19

Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki: Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas. ISAAC 1995: 42-51

c18

Xiao Zhou, Takao Nishizeki: Algorithms for Finding f-Colorings of Partial k-Trees. ISAAC 1995: 332-341

c17

Xiao Zhou, Takao Nishizeki: Finding Optimal Edge-Rankings of Trees. SODA 1995: 122-131

1994

j29

Takao Nishizeki, Svatopluk Poljak: k-Connectivity and Decomposition of Graphs into Forests. Discrete Applied Mathematics 55(3): 295-301 (1994)

j28

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)

c16

Xiao Zhou, Takao Nishizeki: An Efficient Algorithm for Edge-Ranking Trees. ESA 1994: 118-129

c15

Xiao Zhou, Takao Nishizeki: Edge-Coloring and f-Coloring for Various Classes of Graphs. ISAAC 1994: 199-207

c14

Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki: A Parallel Algorithm for Edge-Coloring Partial k-Trees. SWAT 1994: 359-369

1993

j27

Shin-Ichi Nakano, Takao Nishizeki: Scheduling File Transfers Under Port and Channe; Constraints. Int. J. Found. Comput. Sci. 4(2): 101-115 (1993)

j26

M. Ito, A. Saio, Takao Nishizeki: Multiple Assignment Scheme for Sharing Secret. J. Cryptology 6(1): 15-20 (1993)

c13

Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki: A Linear Algorithm for Edge-Coloring Partial k-Trees. ESA 1993: 409-418

c12

Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki: Sequential and parallel algorithms for edge-coloring series-parallel multigraphs. IPCO 1993: 129-145

c11

Shin-Ichi Nakano, Takao Nishizeki: Nearly uniform scheduling of file transfers. IPCO 1993: 425-431

c10

Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki: Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions. ISAAC 1993: 98-107

1992

j25

András Frank, Takao Nishizeki, Nobuji Saito, Hitoshi Suzuki: Algorithms for Routing around a Rectangle. Discrete Applied Mathematics 40(4): 363-378 (1992)

j24

Hitoshi Suzuki, Akira Ishiguro, Takao Nishizeki: Variable-Priority Queue and Doughnut Routing. J. Algorithms 13(4): 606-635 (1992)

Naoyoshi Kanamaru, Takao Nishizeki, Tetsuo Asano: Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming. IPCO 1992: 61-71

Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki: Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs. ISAAC 1992: 400-409

Xiao Zhou, Shin-Ichi Nakano, Hitoshi Suzuki, Takao Nishizeki: An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs. LATIN 1992: 516-529

Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita (Eds.): Algorithms and Computation, Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992, Proceedings. Lecture Notes in Computer Science 650, Springer 1992, isbn 3-540-56279-6

1991

Shin-Ichi Nakano, Takao Nishizeki: Scheduling File Transfers under Port and Channel Constraints. ISA 1991: 43-51

1990

j23

Shin-Ichi Nakano, Takao Nishizeki, Nobuji Saito: On the fg-coloring of graphs. Combinatorica 10(1): 67-80 (1990)

j22

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)

j21

Hitoshi Suzuki, Naomi Takahashi, Takao Nishizeki: A Linear Algorithm for Bipartition of Biconnected Graphs. Inf. Process. Lett. 33(5): 227-231 (1990)

j20

Marek Chrobak, Takao Nishizeki: Improved Edge-Coloring Algorithms for Planar Graphs. J. Algorithms 11(1): 102-116 (1990)

j19

Takao Nishizeki, Kenichi Kashiwagi: On the 1.1 Edge-Coloring of Multigraphs. SIAM J. Discrete Math. 3(3): 391-410 (1990)

Hitoshi Suzuki, Chiseko Yamanaka, Takao Nishizeki: Parallel Algorithms for Finding Steiner Forests in Planar Graphs. SIGAL International Symposium on Algorithms 1990: 458-467

Hitoshi Suzuki, Takehiro Akama, Takao Nishizeki: Finding Steiner Forests in Planar Graphs. SODA 1990: 444-453

Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki (Eds.): Algorithms, International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990, Proceedings. Lecture Notes in Computer Science 450, Springer 1990, isbn 3-540-52921-7

1989

j18

Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito: Algorithms for Multicommodity Flows in Planar Graphs. Algorithmica 4(4): 471-501 (1989)

j17

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

j16

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)

j15

Kazuhiko Matsumoto, Takao Nishizeki, Nobuji Saito: Planar Multicommodity Flows, Maximum Matchings and Negative Cycles. SIAM J. Comput. 15(2): 495-510 (1986)

1985

j14

Norishige Chiba, Kazunori Onoguchi, Takao Nishizeki: Drawing Plane Graphs Nicely. Acta Inf. 22(2): 187-201 (1985)

j13

Hiroyuki Nakayama, Takao Nishizeki, Nobuji Saito: Lower Bounds for Combinatorial Problems on Graphs. J. Algorithms 6(3): 393-399 (1985)

j12

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)

j11

Norishige Chiba, Takao Nishizeki: Arboricity and Subgraph Listing Algorithms. SIAM J. Comput. 14(1): 210-223 (1985)

j10

Kazuhiko Matsumoto, Takao Nishizeki, Nobuji Saito: An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks. SIAM J. Comput. 14(2): 289-302 (1985)

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)

Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito: Multicommodity Flows in Planar Undirected Graphs and Shortest Paths. STOC 1985: 195-204

1984

Takao Asano, Takao Nishizeki, Paul D. Seymour: A note on nongraphic matroids. J. Comb. Theory, Ser. B 37(3): 290-293 (1984)

1983

Norishige Chiba, Takao Nishizeki, Nobuji Saito: An algorithm for finding a large independent set in planar graphs. Networks 13(2): 247-252 (1983)

1982

K. Takamizawa, Takao Nishizeki, Nobuji Saito: Linear-time computability of combinatorial problems on series-parallel graphs. J. ACM 29(3): 623-641 (1982)

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

Takao Nishizeki: On the maximum matchings of regular multigraphs. Discrete Mathematics 37(1): 105-114 (1981)

Norishige Chiba, Takao Nishizeki, Nobuji Saito: A Linear 5-Coloring Algorithm of Planar Graphs. J. Algorithms 2(4): 317-327 (1981)

Nobuji Saito, Takao Nishizeki (Eds.): Graph Theory and Algorithms, 17th Symposium of Research Institute of Electric Communication, Tohoku University, Sendai, Japan, October 24-25, 1980, Proceedings. Lecture Notes in Computer Science 108, Springer 1981, isbn 3-540-10704-5

1980

K. Takamizawa, Takao Nishizeki, Nobuji Saito: An algorithm for finding a short closed spanning walk in a graph. Networks 10(3): 249-263 (1980)

Norishige Chiba, Takao Nishizeki, Nobuji Saito: A linear algorithm for five-coloring a planar graph. Graph Theory and Algorithms 1980: 9-19

K. Takamizawa, Takao Nishizeki, Nobuji Saito: Combinatorial problems on series-parallel graphs. Graph Theory and Algorithms 1980: 79-94

1978

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)

1	Shigenobu Abe	[j12]
2	Takehiro Akama	[c4]
3	Takao Asano	[j8]
4	Tetsuo Asano	[j28] [c9] [e2]
5	Yasuhito Asano	[j84] [j82] [c79] [c77] [j72] [c63] [c55]
6	Machiko Azuma	[j69] [j66] [c68] [c61]
7	Kozo Banno	[j73] [c66]
8	Norishige Chiba	[j17] [j14] [j12] [j11] [j7] [j5] [j3] [c2]
9	Marek Chrobak	[j20]
10	Erik D. Demaine	[j81] [c72]
11	Noritsugu Egi	[j67] [c67] [c56]
12	András Frank	[j25]
13	K. Fuse	[j46]
14	Shubhashis Ghosh	[j61] [c51]
15	Kazuya Goto	[j76] [c74]
16	Hiroki Haga	[j71] [c60]
17	Takuya Hara	[j95] [c85]
18	Masud Hasan	[j56] [c53]
19	Takashi Hikino	[j93] [c84]
20	Dorit S. Hochbaum	[j16]
21	Seok-Hee Hong	[j83] [e4]
22	Toshihide Ibaraki	[e3] [e2]
23	Hiroshi Imai	[e2]
24	Yasuyoshi Inagaki	[e3]
25	Yoshihiro Indo	[j94]
26	Akira Ishiguro	[j24] [j22]
27	Shuji Isobe	[j77] [j62] [c45] [j42] [c34] [c30]
28	M. Ito	[j26]
29	Takehiro Ito	[j96] [j95] [j92] [c86] [c85] [j86] [j81] [c78] [j76] [j74] [j68] [c74] [c72] [j65] [c69] [c64] [c58] [c52] [c49]
30	Kazuo Iwama	[e3]
31	Akira Kamada	[j80] [c71]
32	Naoyoshi Kanamaru	[j28] [c9]
33	Abul Kashem	[j44] [c28] [c25] [c21]
34	Kenichi Kashiwagi	[j19]
35	Akira Kato	[j74] [c69]
36	Masaru Kitsuregawa	[j72]
37	Atsushi Koike	[j54]
38	Koichi Koizumi	[j79] [c62]
39	Yoshiyuki Kusakari	[j50] [j43] [c35] [c26] [c19]
40	Daisuke Masubuchi	[j50] [c35]
41	Kazuhiko Matsumoto	[j15] [j10]
42	Tetsuya Matsuno	[j85] [c73]
43	Yuki Matsuo	[j75] [j64] [c57]
44	Kazuyuki Miura	[j87] [j85] [j80] [j71] [j70] [j69] [c73] [c71] [j66] [c70] [c68] [j63] [c61] [c60] [c59] [c50] [j51] [c38] [j41] [c36] [c29]
45	Yuya Miyawaki	[j84] [c79]
46	Ayako Miyazawa	[c50]
47	Takaaki Mizuki	[j94] [j89] [c80] [j79] [j73] [c66] [c62] [j58] [j53] [c44] [c40] [c37] [c32]
48	Nobuaki Nagai	[j30]
49	Shin-Ichi Nakano	[j70] [j55] [j54] [j51] [j45] [c42] [c41] [c38] [j41] [j38] [c36] [c33] [j37] [c29] [j35] [c27] [j31] [c24] [c23] [p1] [c14] [j27] [c13] [c11] [c7] [c6] [j23]
50	Hiroyuki Nakayama	[j13]
51	Mahmuda Naznin	[j57] [c46]
52	Kazuhide Nishikawa	[c87]
53	Kazunori Onoguchi	[j14]
54	Shingo Orihara	[j73] [c66]
55	Takao Ozawa	[j12]
56	Svatopluk Poljak	[j29]
57	Wu Quan	[e4]
58	Md. Saidur Rahman 0001	[j87] [j67] [c67] [j63] [j61] [c59] [j57] [j56] [c56] [j55] [c53] [c51] [c48] [c46] [j45] [c42] [j38] [c33] [j37] [j35] [c27] [c24] [c23]
59	A. Saio	[j26]
60	Nobuji Saito	[j25] [j23] [j18] [j15] [j13] [j10] [j9] [c3] [j7] [j6] [j5] [j3] [e1] [j2] [c2] [c1] [j1]
61	Naoki Sakamoto	[j92] [c86]
62	Michael Schröder	[j96]
63	Paul D. Seymour	[j8]
64	Hiroki Shizuya	[j58] [j53] [c40] [c37] [c32]
65	David B. Shmoys	[j16]
66	Hitoshi Suzuki	[j43] [j36] [j34] [j33] [j32] [c19] [c12] [c10] [j25] [j24] [c8] [c7] [j22] [j21] [c5] [c4] [j18] [c3]
67	Kiminobu Suzuki	[j9]
68	Daishiro Takahashi	[j41] [c29]
69	Jun-ya Takahashi	[j36] [j33] [c10] [c8]
70	Naomi Takahashi	[j21]
71	K. Takamizawa	[j6] [j2] [c1]
72	Eiji Takimoto	[j91] [j88] [c83] [c81]
73	Roberto Tamassia	[j49] [j48]
74	Syurei Tamura	[j47] [c22]
75	Yu Tezuka	[j82] [c77]
76	Takeshi Tokuyama	[j54] [c41]
77	Masashi Toyoda	[j72] [c63]
78	Hitoshi Tsubata	[j89] [c80]
79	Kei Uchizawa	[j91] [j88] [c83] [c81]
80	Takeaki Uno	[j96] [c78]
81	Jens Vygen	[j52]
82	Dorothea Wagner	[j49] [j48]
83	Shuhei Watanabe	[j54] [c41]
84	Chiseko Yamanaka	[c5]
85	Masafumi Yamashita	[e3]
86	Xiao Zhou	[j96] [j95] [j93] [c87] [j92] [j90] [c86] [c85] [c84] [j86] [c82] [j81] [j78] [c78] [j77] [j76] [j75] [j74] [c75] [j68] [c74] [c72] [j65] [j64] [c69] [c65] [c64] [j62] [j60] [c58] [j59] [c57] [c52] [c49] [j52] [c47] [c45] [c43] [j47] [j46] [j44] [c39] [j42] [j40] [j39] [c34] [c31] [c30] [j34] [c28] [c25] [j32] [j31] [c22] [c21] [j30] [p1] [c20] [c18] [c17] [c16] [c15] [c14] [c13] [c12] [c7]

Takao Nishizeki

Coauthor Index