default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTakao Nishizeki
Person information
- affiliation: Tohoku University, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2016
[j112]Yuji Obata, Takao Nishizeki:
Generalized edge-colorings of weighted graphs. Discret. Math. Algorithms Appl. 8(1): 1650015:1-1650015:14 (2016)- 2015
- [j111]Shiho Morishita, Takao Nishizeki:
Parametric power supply networks. J. Comb. Optim. 29(1): 1-15 (2015) - [j110]Yuji Obata, Takao Nishizeki:
Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs. Theor. Comput. Sci. 607: 208-220 (2015) - [c93]Yuji Obata, Takao Nishizeki:
Edge-Colorings of Weighted Graphs - (Extended Abstract). WALCOM 2015: 32-43 - 2014
- [j109]Masaki Kawabata, Takao Nishizeki:
Spanning Distribution Trees of Graphs. IEICE Trans. Inf. Syst. 97-D(3): 406-412 (2014) - [j108]Kazuhide Nishikawa, Takao Nishizeki, Xiao Zhou:
Bandwidth consecutive multicolorings of graphs. Theor. Comput. Sci. 532: 64-72 (2014) - [c92]Keisuke Inoue, Takao Nishizeki:
Spanning Distribution Forests of Graphs - (Extended Abstract). FAW 2014: 117-127 - [c91]Yuji Obata, Takao Nishizeki:
Approximation Algorithms for Bandwidth Consecutive Multicolorings - (Extended Abstract). FAW 2014: 194-204 - 2013
- [j107]Masaki Kawabata, Takao Nishizeki:
Partitioning Trees with Supply, Demand and Edge-Capacity. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(6): 1036-1043 (2013) - [c90]Masaki Kawabata, Takao Nishizeki:
Spanning Distribution Trees of Graphs. FAW-AAIM 2013: 153-162 - [c89]Shiho Morishita, Takao Nishizeki:
Parametric Power Supply Networks. COCOON 2013: 245-256 - [r1]Takao Nishizeki, Md. Saidur Rahman:
Rectangular Drawing Algorithms. Handbook of Graph Drawing and Visualization 2013: 317-348 - 2012
- [j106]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) - [j105]Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki:
Minimum Cost Partitions of Trees with Supply and Demand. Algorithmica 64(3): 400-415 (2012) - [j104]Yoshihiro Indo, Takaaki Mizuki
, Takao Nishizeki:
Absolutely Secure Message Transmission using a Key Sharing Graph. Discret. Math. Algorithms Appl. 4(4) (2012) - [j103]Xiao Zhou, Takashi Hikino, Takao Nishizeki:
Small grid drawings of planar graphs with balanced partition. J. Comb. Optim. 24(2): 99-115 (2012) - [c88]Kazuhide Nishikawa, Takao Nishizeki, Xiao Zhou:
Algorithms for Bandwidth Consecutive Multicolorings of Graphs - (Extended Abstract). FAW-AAIM 2012: 117-128 - 2011
- [j102]Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki:
Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. IEICE Trans. Inf. Syst. 94-D(2): 190-195 (2011) - [j101]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
- [j100]Xiao Zhou, Takao Nishizeki:
Convex Drawings of Internally Triconnected Plane Graphs on O(N2) Grids. Discret. Math. Algorithms Appl. 2(3): 347-362 (2010) - [j99]Takaaki Mizuki, Hitoshi Tsubata, Takao Nishizeki:
Minimizing AND-EXOR Expressions for Two-Variable Multiple-Valued Input Binary Output Functions. J. Multiple Valued Log. Soft Comput. 16(1-2): 197-208 (2010) - [j98]Kei Uchizawa, Takao Nishizeki, Eiji Takimoto:
Energy and depth of threshold circuits. Theor. Comput. Sci. 411(44-46): 3938-3946 (2010) - [c87]Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki:
Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. FAW 2010: 274-284 - [c86]Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki:
Minimum Cost Partitions of Trees with Supply and Demand. ISAAC (2) 2010: 351-362 - [c85]Xiao Zhou, Takashi Hikino, Takao Nishizeki:
Small Grid Drawings of Planar Graphs with Balanced Bipartition. WALCOM 2010: 47-57
2000 – 2009
- 2009
- [j97]Md. Saidur Rahman, Kazuyuki Miura, Takao Nishizeki:
Octagonal drawings of plane graphs with prescribed face areas. Comput. Geom. 42(3): 214-230 (2009) - [j96]Takehiro Ito, Xiao Zhou, Takao Nishizeki:
Partitioning graphs of supply and demand. Discret. Appl. Math. 157(12): 2620-2633 (2009) - [j95]Kazuyuki Miura, Tetsuya Matsuno, Takao Nishizeki:
Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs. Discret. Comput. Geom. 41(4): 643-670 (2009) - [j94]Yasuhito Asano, Yuya Miyawaki, Takao Nishizeki:
Efficient Compression of Web Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(10): 2454-2462 (2009) - [j93]Seok-Hee Hong, Takao Nishizeki:
Guest Editors' Foreword. J. Graph Algorithms Appl. 13(3): 285-287 (2009) - [c84]Kei Uchizawa, Takao Nishizeki, Eiji Takimoto:
Energy Complexity and Depth of Threshold Circuits. FCT 2009: 335-345 - [c83]Xiao Zhou, Takao Nishizeki:
Convex Drawings of Internally Triconnected Plane Graphs on O(n2) Grids. ISAAC 2009: 760-770 - [c82]Kei Uchizawa, Takao Nishizeki, Eiji Takimoto:
Size and Energy of Threshold Circuits Computing Mod Functions. MFCS 2009: 724-735 - [c81]Takaaki Mizuki, Hitoshi Tsubata, Takao Nishizeki:
Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions. TAMC 2009: 301-310 - 2008
- [j92]Yasuhito Asano, Yu Tezuka, Takao Nishizeki:
Improvements of HITS Algorithms for Spam Links. IEICE Trans. Inf. Syst. 91-D(2): 200-208 (2008) - [j91]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) - [j90]Kazuyuki Miura, Akira Kamada, Takao Nishizeki:
Convex Grid Drawings of Plane Graphs with Rectangular Contours. J. Graph Algorithms Appl. 12(2): 197-224 (2008) - [j89]Koichi Koizumi, Takaaki Mizuki, Takao Nishizeki:
A Revised Transformation Protocol for Unconditionally Secure Secret Key Exchange. Theory Comput. Syst. 42(2): 187-221 (2008) - [j88]Xiao Zhou, Takao Nishizeki:
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends. SIAM J. Discret. Math. 22(4): 1570-1604 (2008) - [c80]Yasuhito Asano, Yuya Miyawaki, Takao Nishizeki:
Efficient Compression of Web Graphs. COCOON 2008: 1-11 - [c79]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:
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 [contents] - 2007
- [j87]Shuji Isobe, Xiao Zhou, Takao Nishizeki:
Total Colorings Of Degenerate Graphs. Comb. 27(2): 167-182 (2007) - [j86]Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki:
Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size. IEICE Trans. Inf. Syst. 90-D(2): 449-456 (2007) - [j85]Yuki Matsuo, Xiao Zhou, Takao Nishizeki:
Sufficient Condition and Algorithm for List Total Colorings of Series-Parallel Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(5): 907-916 (2007) - [j84]Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki:
Algorithms for finding distance-edge-colorings of graphs. J. Discrete Algorithms 5(2): 304-322 (2007) - [c78]Yasuhito Asano, Yu Tezuka, Takao Nishizeki:
Improvements of HITS Algorithms for Spam Links. APWeb/WAIM 2007: 479-490 - [c77]Takao Nishizeki:
Inner Rectangular Drawings of Plane Graphs: Application of Graph Drawing to VLSI Layouts. WALCOM 2007: 1-2 - [c76]Xiao Zhou, Takao Nishizeki:
Orthogonal drawings of series-parallel graphs with minimum bends. WALCOM 2007: 3-12 - 2006
- [j83]Kozo Banno, Shingo Orihara, Takaaki Mizuki, Takao Nishizeki:
Best Security Index for Digital Fingerprinting. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(1): 169-177 (2006) - [j82]Yasuhito Asano, Takao Nishizeki, Masashi Toyoda, Masaru Kitsuregawa:
Mining Communities on the Web Using a Max-Flow and a Site-Oriented Framework. IEICE Trans. Inf. Syst. 89-D(10): 2606-2615 (2006) - [j81]Kazuyuki Miura, Hiroki Haga, Takao Nishizeki:
Inner Rectangular Drawings of Plane Graphs. Int. J. Comput. Geom. Appl. 16(2-3): 249-270 (2006) - [j80]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) - [j79]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) - [j78]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) - [c75]Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki:
Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size. COCOON 2006: 63-72 - [c74]Kazuyuki Miura, Tetsuya Matsuno, Takao Nishizeki:
Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs. GD 2006: 138-149 - [c73]Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki:
Approximability of Partitioning Graphs with Supply and Demand. ISAAC 2006: 121-130 - [c72]Akira Kamada, Kazuyuki Miura, Takao Nishizeki:
Convex Grid Drawings of Plane Graphs with Rectangular Contours. ISAAC 2006: 131-140 - 2005
- [j77]Md. Saidur Rahman, Noritsugu Egi, Takao Nishizeki:
No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs. IEICE Trans. Inf. Syst. 88-D(1): 23-30 (2005) - [j76]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) - [j75]Takehiro Ito, Xiao Zhou, Takao Nishizeki:
Partitioning trees of supply and demand. Int. J. Found. Comput. Sci. 16(4): 803-827 (2005) - [j74]Xiao Zhou, Yuki Matsuo, Takao Nishizeki:
List total colorings of series-parallel graphs. J. Discrete Algorithms 3(1): 47-60 (2005) - [c71]Kazuyuki Miura, Takao Nishizeki:
Rectangle-of-Influence Drawings of Four-Connected Plane Graphs. APVIS 2005: 75-80 - [c70]Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki:
Algorithms for Finding Distance-Edge-Colorings of Graphs. COCOON 2005: 798-807 - [c69]Kazuyuki Miura, Machiko Azuma, Takao Nishizeki:
Convex Drawings of Plane Graphs of Minimum Outer Apices. GD 2005: 297-308 - [c68]Md. Saidur Rahman, Noritsugu Egi, Takao Nishizeki:
No-bend Orthogonal Drawings of Series-Parallel Graphs. GD 2005: 409-420 - [c67]Kozo Banno, Shingo Orihara, Takaaki Mizuki, Takao Nishizeki:
Best Security Index for Digital Fingerprinting. Information Hiding 2005: 398-412 - [c66]Xiao Zhou, Takao Nishizeki:
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends. ISAAC 2005: 166-175 - [c65]Takehiro Ito, Xiao Zhou, Takao Nishizeki:
Partitioning graphs of supply and demand. ISCAS (1) 2005: 160-163 - [c64]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
- [b1]Takao Nishizeki, Md. Saidur Rahman:
Planar Graph Drawing. Lecture Notes Series on Computing 12, World Scientific 2004, ISBN 981-256-033-5, pp. 1-312 - [j73]Xiao Zhou, Takao Nishizeki:
Multicolorings of Series-Parallel Graphs. Algorithmica 38(2): 271-297 (2004) - [j72]Takao Nishizeki, Kazuyuki Miura, Md. Saidur Rahman:
Algorithms for Drawing Plane Graphs. IEICE Trans. Inf. Syst. 87-D(2): 281-289 (2004) - [j71]Shuji Isobe, Xiao Zhou, Takao Nishizeki:
Cost Total Colorings of Trees. IEICE Trans. Inf. Syst. 87-D(2): 337-342 (2004) - [j70]Md. Saidur Rahman, Takao Nishizeki, Shubhashis Ghosh:
Rectangular drawings of planar graphs. J. Algorithms 50(1): 62-78 (2004) - [j69]Xiao Zhou, Takao Nishizeki:
Algorithm for the Cost Edge-Coloring of Trees. J. Comb. Optim. 8(1): 97-108 (2004) - [c63]Koichi Koizumi, Takaaki Mizuki, Takao Nishizeki:
Necessary and Sufficient Numbers of Cards for the Transformation Protocol. COCOON 2004: 92-101 - [c62]Kazuyuki Miura, Machiko Azuma, Takao Nishizeki:
Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs. COCOON 2004: 309-318 - [c61]Kazuyuki Miura, Hiroki Haga, Takao Nishizeki:
Inner Rectangular Drawings of Plane Graphs. ISAAC 2004: 693-704 - [c60]Md. Saidur Rahman, Kazuyuki Miura, Takao Nishizeki:
Octagonal Drawings of Plane Graphs with Prescribed Face Areas. WG 2004: 320-331 - [c59]Takehiro Ito, Xiao Zhou, Takao Nishizeki:
Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size. WG 2004: 365-376 - 2003
- [j68]Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki:
Characterization of optimal key set protocols. Discret. Appl. Math. 131(1): 213-236 (2003) - [j67]Tomoya Fujino, Xiao Zhou, Takao Nishizeki:
List Edge-Colorings of Series-Parallel Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(5): 1034-1045 (2003) - [j66]Shingo Orihara, Takaaki Mizuki, Takao Nishizeki:
New Security Index for Digital Fingerprinting and Its Bounds. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(5): 1156-1163 (2003) - [j65]Md. Saidur Rahman, Takao Nishizeki, Mahmuda Naznin:
Orthogonal Drawings of Plane Graphs Without Bends. J. Graph Algorithms Appl. 7(4): 335-362 (2003) - [j64]Masud Hasan, Md. Saidur Rahman, Takao Nishizeki:
A linear algorithm for compact box-drawings of trees. Networks 42(3): 160-164 (2003) - [c58]Xiao Zhou, Yuki Matsuo, Takao Nishizeki:
List Total Colorings of Series-Parallel Graphs. COCOON 2003: 172-181 - [c57]Md. Saidur Rahman, Noritsugu Egi, Takao Nishizeki:
No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs. GD 2003: 387-392 - [c56]Yasuhito Asano, Takao Nishizeki:
Web-Linkage Viewer: Drawing Links in the Web Based on a Site-Oriented Framework. GD 2003: 498-499 - [c55]Takao Nishizeki:
Drawing Plane Graphs. ISAAC 2003: 2-5 - 2002
- [j63]Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki:
Rectangular drawings of plane graphs without designated corners. Comput. Geom. 21(3): 121-138 (2002) - [j62]Yoshiyuki Kusakari, Masaki Sato, Takao Nishizeki:
Planar Reconfiguration of Monotone Trees. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(5): 938-943 (2002) - [j61]Atsushi Koike, Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe:
Labeling Points with Rectangles of Various Shapes. Int. J. Comput. Geom. Appl. 12(6): 511-528 (2002) - [j60]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) - [c54]Masud Hasan, Md. Saidur Rahman, Takao Nishizeki:
A linear algorithm for compact box-drawings of trees. CCCG 2002: 154-157 - [c53]Takehiro Ito, Takao Nishizeki, Xiao Zhou:
Algorithms for the Multicolorings of Partial k-Trees. COCOON 2002: 430-439 - [c52]Md. Saidur Rahman, Takao Nishizeki, Shubhashis Ghosh:
Rectangular Drawings of Planar Graphs. GD 2002: 244-255 - [c51]Kazuyuki Miura, Ayako Miyazawa, Takao Nishizeki:
Extended Rectangular Drawings of Plane Graphs with Designated Corners. GD 2002: 256-267 - [c50]Takehiro Ito, Xiao Zhou, Takao Nishizeki:
Partitioning Trees of Supply and Demand. ISAAC 2002: 612-623 - [c49]Md. Saidur Rahman, Takao Nishizeki:
Bend-Minimum Orthogonal Drawings of Plane 3-Graphs. WG 2002: 367-378 - 2001
- [j59]Takao Nishizeki, Jens Vygen, Xiao Zhou:
The edge-disjoint paths problem is NP-complete for series-parallel graphs. Discret. Appl. Math. 115(1-3): 177-186 (2001) - [j58]Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki:
Grid Drawings of 4-Connected Plane Graphs. Discret. Comput. Geom. 26(1): 73-87 (2001) - [j57]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) - [j56]Takao Nishizeki, Roberto Tamassia, Dorothea Wagner:
Guest Editors' Foreword. J. Graph Algorithms Appl. 5(5): 1 (2001) - [c48]Xiao Zhou, Takao Nishizeki:
Algorithm for the Cost Edge-Coloring of Trees. COCOON 2001: 288-297 - [c47]Md. Saidur Rahman, Mahmuda Naznin, Takao Nishizeki:
Orthogonal Drawings of Plane Graphs without Bends. GD 2001: 392-406 - [c46]Shuji Isobe, Xiao Zhou, Takao Nishizeki:
Total Colorings of Degenerated Graphs. ICALP 2001: 506-517 - [c45]Takaaki Mizuki, Takao Nishizeki:
Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups. ISAAC 2001: 196-207 - [c44]Xiao Zhou, Takao Nishizeki:
Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs. ISAAC 2001: 514-524 - 2000
- [j55]Takao Nishizeki, Roberto Tamassia, Dorothea Wagner:
Foreword. Algorithmica 26(1): 1-2 (2000) - [j54]Xiao Zhou, Syurei Tamura, Takao Nishizeki:
Finding Edge-Disjoint Paths in Partial k-Trees. Algorithmica 26(1): 3-30 (2000) - [j53]Xiao Zhou, K. Fuse, Takao Nishizeki:
A Linear Algorithm for Finding [{g, f}]-Colorings of Partial {k}-Trees. Algorithmica 27(3): 227-243 (2000) - [j52]Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki:
Box-Rectangular Drawings of Plane Graphs. J. Algorithms 37(2): 363-398 (2000) - [j51]Mohammod Abul Kashem, Xiao Zhou, Takao Nishizeki:
Algorithms for generalized vertex-rankings of partial k-trees. Theor. Comput. Sci. 240(2): 407-427 (2000) - [c43]Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki:
Rectangular Drawings of Plane Graphs Without Designated Corners. COCOON 2000: 85-94 - [c42]Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe:
Labeling Points with Rectangles of Various Shapes. GD 2000: 91-102 - [c41]Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki:
Characterization of Optimal Key Set Protocols. IFIP TCS 2000: 273-285 - [c40]Xiao Zhou, Takao Nishizeki:
Finding Independent Spanning Trees in Partial k-Trees. ISAAC 2000: 168-179 - [c39]Kazuyuki Miura, Takao Nishizeki, Shin-Ichi Nakano:
Convex Grid Drwaings of Four-Connected Plane Graphs. ISAAC 2000: 254-265
1990 – 1999
- 1999
- [j50]Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki:
A Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas. Int. J. Comput. Geom. Appl. 9(2): 151-170 (1999) - [j49]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) - [j48]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) - [j47]Xiao Zhou, Takao Nishizeki:
Decompositions to Degree-Constrainded Subgraphs Are Simply Reducible to Edge-Colorings. J. Comb. Theory B 75(2): 270-287 (1999) - [j46]Xiao Zhou, Takao Nishizeki:
Edge-Coloring and f-Coloring for Various Classes of Graphs. J. Graph Algorithms Appl. 3(1): 1-18 (1999) - [j45]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) - [c38]Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki:
Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key. EUROCRYPT 1999: 389-401 - [c37]Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki:
Grid Drawings of Four-Connected Plane Graphs. GD 1999: 145-154 - [c36]Yoshiyuki Kusakari, Daisuke Masubuchi, Takao Nishizeki:
Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs. ISAAC 1999: 337-346 - [c35]Shuji Isobe, Xiao Zhou, Takao Nishizeki:
A Linear Algorithm for Finding Total Colorings of Partial k-Trees. ISAAC 1999: 347-356 - [c34]Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki:
Box-Rectangular Drawings of Plane Graphs. WG 1999: 250-261 - 1998
- [j44]Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki:
Rectangular grid drawings of plane graphs. Comput. Geom. 10(3): 203-220 (1998) - [c33]Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki:
Eulerian Secret Key Exchange. COCOON 1998: 349-360 - [c32]Xiao Zhou, Takao Nishizeki:
The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees. ISAAC 1998: 417-426 - [c31]Shuji Isobe, Xiao Zhou, Takao Nishizeki:
A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees. WG 1998: 100-113 - [c30]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
- [j43]Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki:
Shortest Non-Crossing Rectilinear Paths in Plane Regions. Int. J. Comput. Geom. Appl. 7(5): 419-436 (1997) - [j42]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) - [j41]Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki:
An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs. J. Algorithms 23(2): 359-374 (1997) - [c29]Mohammod Abul Kashem, Xiao Zhou, Takao Nishizeki:
Generalized Vertex-Rankings of Partial k-trees. COCOON 1997: 212-221 - [c28]Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki:
A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs. GD 1997: 99-110 - [c27]Yoshiyuki Kusakari, Takao Nishizeki:
An Algorithm for Finding a Region with the Minimum Lotal L1 from Prescribed Terminals. ISAAC 1997: 324-333 - [c26]Mohammod Abul Kashem, Xiao Zhou, Takao Nishizeki:
An NC Parallel Algorithm for Generalized Vertex-Rankings of Partial k-Trees. ISPAN 1997: 105-111 - 1996
- [j40]Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki:
Shortest Noncrossing Paths in Plane Graphs. Algorithmica 16(3): 339-357 (1996) - [j39]Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki:
A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs. J. Algorithms 20(1): 174-201 (1996) - [j38]Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki:
Edge-Coloring Partial k-Trees. J. Algorithms 21(3): 598-617 (1996) - [c25]Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki:
Rectangular Grid Drawings of Plane Graphs. COCOON 1996: 92-105 - [c24]Shin-Ichi Nakano, Md. Saidur Rahman, Takao Nishizeki:
A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. GD 1996: 334-344 - [c23]Xiao Zhou, Syurei Tamura, Takao Nishizeki:
Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract). ISAAC 1996: 203-212 - [c22]Xiao Zhou, Mohammod Abul Kashem, Takao Nishizeki:
Generalized Edge-Ranking of Trees (Extended Abstract). WG 1996: 390-404 - 1995
- [j37]Xiao Zhou, Nobuaki Nagai, Takao Nishizeki:
Generalized Vertex-Rankings of Trees. Inf. Process. Lett. 56(6): 321-328 (1995) - [c21]Xiao Zhou, Takao Nishizeki:
Simple Reduction of f-Colorings to Edge-Colorings. COCOON 1995: 223-228 - [c20]Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki:
Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas. ISAAC 1995: 42-51 - [c19]Xiao Zhou, Takao Nishizeki:
Algorithms for Finding f-Colorings of Partial k-Trees. ISAAC 1995: 332-341 - [c18]Xiao Zhou, Takao Nishizeki:
Finding Optimal Edge-Rankings of Trees. SODA 1995: 122-131 - [p1]Shin-Ichi Nakano, Xiao Zhou, Takao Nishizeki:
Edge-Coloring Algorithms. Computer Science Today 1995: 172-183 - 1994
- [j36]Takao Nishizeki, Svatopluk Poljak:
k-Connectivity and Decomposition of Graphs into Forests. Discret. Appl. Math. 55(3): 295-301 (1994) - [j35]Naoyoshi Kanamaru, Takao Nishizeki, Tetsuo Asano:
Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming. Int. J. Comput. Geom. Appl. 4(1): 69-85 (1994) - [c17]Xiao Zhou, Takao Nishizeki:
An Efficient Algorithm for Edge-Ranking Trees. ESA 1994: 118-129 - [c16]Xiao Zhou, Takao Nishizeki:
Edge-Coloring and f-Coloring for Various Classes of Graphs. ISAAC 1994: 199-207 - [c15]Xiao Zhou, Takao Nishizeki:
Optimal parallel algorithm for edge-coloring partial k-trees with bounded degrees. ISPAN 1994: 167-174 - [c14]Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki:
A Parallel Algorithm for Edge-Coloring Partial k-Trees. SWAT 1994: 359-369 - 1993
- [j34]Shin-Ichi Nakano, Takao Nishizeki:
Scheduling File Transfers Under Port and Channe; Constraints. Int. J. Found. Comput. Sci. 4(2): 101-115 (1993) - [j33]Mitsuru Ito, Akira Saio, Takao Nishizeki:
Multiple Assignment Scheme for Sharing Secret. J. Cryptol. 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
- [j32]András Frank, Takao Nishizeki, Nobuji Saito, Hitoshi Suzuki, Éva Tardos:
Algorithms for Routing around a Rectangle. Discret. Appl. Math. 40(4): 363-378 (1992) - [j31]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:
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 [contents] - 1991
- [c6]Shin-Ichi Nakano, Takao Nishizeki:
Scheduling File Transfers under Port and Channel Constraints. ISA 1991: 43-51 - 1990
- [j30]Shin-Ichi Nakano, Takao Nishizeki, Nobuji Saito:
On the fg-coloring of graphs. Comb. 10(1): 67-80 (1990) - [j29]Hitoshi Suzuki, Akira Ishiguro, Takao Nishizeki:
Edge-disjoint paths in a grid bounded by two nested rectangles. Discret. Appl. Math. 27(1-2): 157-178 (1990) - [j28]Hitoshi Suzuki, Naomi Takahashi, Takao Nishizeki:
A Linear Algorithm for Bipartition of Biconnected Graphs. Inf. Process. Lett. 33(5): 227-231 (1990) - [j27]Marek Chrobak, Takao Nishizeki:
Improved Edge-Coloring Algorithms for Planar Graphs. J. Algorithms 11(1): 102-116 (1990) - [j26]Takao Nishizeki, Kenichi Kashiwagi:
On the 1.1 Edge-Coloring of Multigraphs. SIAM J. Discret. 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:
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 [contents]
1980 – 1989
- 1989
- [j25]Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito:
Algorithms for Multicommodity Flows in Planar Graphs. Algorithmica 4(4): 471-501 (1989) - [j24]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
- [j23]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) - [j22]Kazuhiko Matsumoto, Takao Nishizeki, Nobuji Saito:
Planar Multicommodity Flows, Maximum Matchings and Negative Cycles. SIAM J. Comput. 15(2): 495-510 (1986) - 1985
- [j21]Norishige Chiba, Kazunori Onoguchi, Takao Nishizeki:
Drawing Plane Graphs Nicely. Acta Informatica 22(2): 187-201 (1985) - [j20]Hiroyuki Nakayama, Takao Nishizeki, Nobuji Saito:
Lower Bounds for Combinatorial Problems on Graphs. J. Algorithms 6(3): 393-399 (1985) - [j19]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) - [j18]Norishige Chiba, Takao Nishizeki:
Arboricity and Subgraph Listing Algorithms. SIAM J. Comput. 14(1): 210-223 (1985) - [j17]Kazuhiko Matsumoto, Takao Nishizeki, Nobuji Saito:
An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks. SIAM J. Comput. 14(2): 289-302 (1985) - [j16]Takao Nishizeki, Nobuji Saito, Kiminobu Suzuki:
A Linear-Time Routing Algorithm for Convex Grids. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 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
- [j15]Takao Asano, Takao Nishizeki, Nobuji Saito, James G. Oxley:
A Note on the Critical Problem for Matroids. Eur. J. Comb. 5(2): 93-97 (1984) - [j14]Takao Asano, Takao Nishizeki, Paul D. Seymour:
A note on nongraphic matroids. J. Comb. Theory B 37(3): 290-293 (1984) - 1983
- [j13]Takao Nishizeki, Takao Asano, Takahiro Watanabe:
An approximation algorithm for the hamiltonian walk problem on maximal planar graphs. Discret. Appl. Math. 5(2): 211-222 (1983) - [j12]Norishige Chiba, Takao Nishizeki, Nobuji Saito:
An algorithm for finding a large independent set in planar graphs. Networks 13(2): 247-252 (1983) - 1982
- [j11]K. Takamizawa, Takao Nishizeki, Nobuji Saito:
Linear-time computability of combinatorial problems on series-parallel graphs. J. ACM 29(3): 623-641 (1982) - [j10]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
- [j9]K. Takamizawa, Takao Nishizeki, Nobuji Saito:
Combinatorial problems on series-parallel graphs. Discret. Appl. Math. 3(1): 75-76 (1981) - [j8]Takao Nishizeki:
On the maximum matchings of regular multigraphs. Discret. Math. 37(1): 105-114 (1981) - [j7]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:
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 [contents] - 1980
- [j6]Takao Nishizeki:
A 1-tough nonhamiltonian maximal planar graph. Discret. Math. 30(3): 305-307 (1980) - [j5]Takao Asano, Takao Nishizeki, Takahiro Watanabe:
An upper bound on the length of a Hamiltonian walk of a maximal planar graph. J. Graph Theory 4(3): 315-336 (1980) - [j4]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
1970 – 1979
- 1979
- [j3]Takao Nishizeki:
On the relationship between the genus and the cardinality of the maximum matchings of a graph. Discret. Math. 25(2): 149-156 (1979) - [j2]Takao Nishizeki, Ilker Baybars:
Lower bounds on the cardinality of the maximum matchings of planar graphs. Discret. Math. 28(3): 255-267 (1979) - 1978
- [j1]Takao Nishizeki, Nobuji Saito:
Necessary and sufficient conditions for a graph to be three-terminal series-parallel-cascade. J. Comb. Theory B 24(3): 344-361 (1978)
Coauthor Index
[j108] [j106] [j105] [j103] [c88] [j102] [j100] [c87] [c86] [c85] [j96] [c83] [j91] [j88] [c79] [j87] [j86] [j85] [j84] [c76] [j78] [c75] [c73] [j75] [j74] [c70] [c66] [c65] [j73] [j71] [j69] [c59] [j67] [c58] [c53] [c50] [j59] [c48] [c46] [c44] [j54] [j53] [j51] [c40] [j49] [j47] [j46] [c35] [c32] [c31] [j41] [c29] [c26] [j39] [j38] [c23] [c22] [j37] [c21] [c19] [c18] [p1] [c17] [c16] [c15] [c14] [c13] [c12] [c7]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
