Takao Nishizeki

212 papers A* 5A 15B 41C 1Misc 17Journal 112Unranked 16

Year	Rank	Type	Title / Venue / Authors
2016	J	`jnl`	Generalized edge-colorings of weighted graphs. Discret. Math. Algorithms Appl. Yuji Obata, Takao Nishizeki
2015	B	`conf`	Edge-Colorings of Weighted Graphs - (Extended Abstract). WALCOM Yuji Obata, Takao Nishizeki
2015	J	`jnl`	Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs. Theor. Comput. Sci. Yuji Obata, Takao Nishizeki
2015	J	`jnl`	Parametric power supply networks. J. Comb. Optim. Shiho Morishita, Takao Nishizeki
2014	Misc	`conf`	Approximation Algorithms for Bandwidth Consecutive Multicolorings - (Extended Abstract). FAW Yuji Obata, Takao Nishizeki
2014	J	`jnl`	Bandwidth consecutive multicolorings of graphs. Theor. Comput. Sci. Kazuhide Nishikawa, Takao Nishizeki, Xiao Zhou
2014	Misc	`conf`	Spanning Distribution Forests of Graphs - (Extended Abstract). FAW Keisuke Inoue, Takao Nishizeki
2014	J	`jnl`	Spanning Distribution Trees of Graphs. IEICE Trans. Inf. Syst. Masaki Kawabata, Takao Nishizeki
2013	Misc	`conf`	Parametric Power Supply Networks. COCOON Shiho Morishita, Takao Nishizeki
2013	J	`jnl`	Partitioning Trees with Supply, Demand and Edge-Capacity. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Masaki Kawabata, Takao Nishizeki
2013	—	`ch.`	Rectangular Drawing Algorithms. Handbook of Graph Drawing and Visualization Takao Nishizeki, Md. Saidur Rahman
2013	—	`conf`	Spanning Distribution Trees of Graphs. FAW-AAIM Masaki Kawabata, Takao Nishizeki
2012	J	`jnl`	Absolutely Secure Message Transmission using a Key Sharing Graph. Discret. Math. Algorithms Appl. Yoshihiro Indo, Takaaki Mizuki, Takao Nishizeki
2012	—	`conf`	Algorithms for Bandwidth Consecutive Multicolorings of Graphs - (Extended Abstract). FAW-AAIM Kazuhide Nishikawa, Takao Nishizeki, Xiao Zhou
2012	J	`jnl`	Minimum Cost Partitions of Trees with Supply and Demand. Algorithmica Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki
2012	J	`jnl`	Partitioning a Weighted Tree into Subtrees with Weights in a Given Range. Algorithmica Takehiro Ito, Takao Nishizeki, Michael Schröder, Takeaki Uno, Xiao Zhou
2012	J	`jnl`	Small grid drawings of planar graphs with balanced partition. J. Comb. Optim. Xiao Zhou, Takashi Hikino, Takao Nishizeki
2011	J	`jnl`	Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. IEICE Trans. Inf. Syst. Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki
2011	J	`jnl`	Size-energy tradeoffs for unate circuits computing symmetric Boolean functions. Theor. Comput. Sci. Kei Uchizawa, Eiji Takimoto, Takao Nishizeki
2010	J	`jnl`	Convex Drawings of Internally Triconnected Plane Graphs on O(N Discret. Math. Algorithms Appl. Xiao Zhou, Takao Nishizeki
2010	J	`jnl`	Energy and depth of threshold circuits. Theor. Comput. Sci. Kei Uchizawa, Takao Nishizeki, Eiji Takimoto
2010	J	`jnl`	Minimizing AND-EXOR Expressions for Two-Variable Multiple-Valued Input Binary Output Functions. J. Multiple Valued Log. Soft Comput. Takaaki Mizuki, Hitoshi Tsubata, Takao Nishizeki
2010	Misc	`conf`	Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. FAW Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki
2010	—	`conf`	Minimum Cost Partitions of Trees with Supply and Demand. ISAAC (2) Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki
2010	B	`conf`	Small Grid Drawings of Planar Graphs with Balanced Bipartition. WALCOM Xiao Zhou, Takashi Hikino, Takao Nishizeki
2009	B	`conf`	Convex Drawings of Internally Triconnected Plane Graphs on ISAAC Xiao Zhou, Takao Nishizeki
2009	J	`jnl`	Efficient Compression of Web Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Yasuhito Asano, Yuya Miyawaki, Takao Nishizeki
2009	B	`conf`	Energy Complexity and Depth of Threshold Circuits. FCT Kei Uchizawa, Takao Nishizeki, Eiji Takimoto
2009	J	`jnl`	Guest Editors' Foreword. J. Graph Algorithms Appl. Seok-Hee Hong, Takao Nishizeki
2009	C	`conf`	Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions. TAMC Takaaki Mizuki, Hitoshi Tsubata, Takao Nishizeki
2009	J	`jnl`	Octagonal drawings of plane graphs with prescribed face areas. Comput. Geom. Md. Saidur Rahman, Kazuyuki Miura, Takao Nishizeki
2009	J	`jnl`	Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs. Discret. Comput. Geom. Kazuyuki Miura, Tetsuya Matsuno, Takao Nishizeki
2009	J	`jnl`	Partitioning graphs of supply and demand. Discret. Appl. Math. Takehiro Ito, Xiao Zhou, Takao Nishizeki
2009	B	`conf`	Size and Energy of Threshold Circuits Computing Mod Functions. MFCS Kei Uchizawa, Takao Nishizeki, Eiji Takimoto
2008	J	`jnl`	A Revised Transformation Protocol for Unconditionally Secure Secret Key Exchange. Theory Comput. Syst. Koichi Koizumi, Takaaki Mizuki, Takao Nishizeki
2008	J	`jnl`	Approximability of partitioning graphs with supply and demand. J. Discrete Algorithms Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki
2008	J	`jnl`	Convex Grid Drawings of Plane Graphs with Rectangular Contours. J. Graph Algorithms Appl. Kazuyuki Miura, Akira Kamada, Takao Nishizeki
2008	Misc	`conf`	Efficient Compression of Web Graphs. COCOON Yasuhito Asano, Yuya Miyawaki, Takao Nishizeki
2008	A	`ed.`	Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers GD Seok-Hee Hong, Takao Nishizeki, Wu Quan
2008	J	`jnl`	Improvements of HITS Algorithms for Spam Links. IEICE Trans. Inf. Syst. Yasuhito Asano, Yu Tezuka, Takao Nishizeki
2008	J	`jnl`	Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends. SIAM J. Discret. Math. Xiao Zhou, Takao Nishizeki
2008	B	`conf`	Partitioning a Weighted Tree to Subtrees of Almost Uniform Size. ISAAC Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki
2007	J	`jnl`	Algorithms for finding distance-edge-colorings of graphs. J. Discrete Algorithms Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki
2007	—	`conf`	Improvements of HITS Algorithms for Spam Links. APWeb/WAIM Yasuhito Asano, Yu Tezuka, Takao Nishizeki
2007	B	`conf`	Inner Rectangular Drawings of Plane Graphs: Application of Graph Drawing to VLSI Layouts. WALCOM Takao Nishizeki
2007	B	`conf`	Orthogonal drawings of series-parallel graphs with minimum bends. WALCOM Xiao Zhou, Takao Nishizeki
2007	J	`jnl`	Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size. IEICE Trans. Inf. Syst. Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki
2007	J	`jnl`	Sufficient Condition and Algorithm for List Total Colorings of Series-Parallel Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Yuki Matsuo, Xiao Zhou, Takao Nishizeki
2007	J	`jnl`	Total Colorings Of Degenerate Graphs. Comb. Shuji Isobe, Xiao Zhou, Takao Nishizeki
2006	B	`conf`	Approximability of Partitioning Graphs with Supply and Demand. ISAAC Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki
2006	J	`jnl`	Best Security Index for Digital Fingerprinting. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Kozo Banno, Shingo Orihara, Takaaki Mizuki, Takao Nishizeki
2006	J	`jnl`	Convex Drawings of Plane Graphs of Minimum Outer Apices. Int. J. Found. Comput. Sci. Kazuyuki Miura, Machiko Azuma, Takao Nishizeki
2006	J	`jnl`	Convex Grid Drawings of Four-connected Plane Graphs. Int. J. Found. Comput. Sci. Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki
2006	B	`conf`	Convex Grid Drawings of Plane Graphs with Rectangular Contours. ISAAC Akira Kamada, Kazuyuki Miura, Takao Nishizeki
2006	J	`jnl`	Inner Rectangular Drawings of Plane Graphs. Int. J. Comput. Geom. Appl. Kazuyuki Miura, Hiroki Haga, Takao Nishizeki
2006	J	`jnl`	Mining Communities on the Web Using a Max-Flow and a Site-Oriented Framework. IEICE Trans. Inf. Syst. Yasuhito Asano, Takao Nishizeki, Masashi Toyoda, Masaru Kitsuregawa
2006	A	`conf`	Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs. GD Kazuyuki Miura, Tetsuya Matsuno, Takao Nishizeki
2006	Misc	`conf`	Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size. COCOON Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki
2006	J	`jnl`	Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size. J. Discrete Algorithms Takehiro Ito, Xiao Zhou, Takao Nishizeki
2005	Misc	`conf`	Algorithms for Finding Distance-Edge-Colorings of Graphs. COCOON Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki
2005	—	`conf`	Best Security Index for Digital Fingerprinting. Information Hiding Kozo Banno, Shingo Orihara, Takaaki Mizuki, Takao Nishizeki
2005	J	`jnl`	Canonical Decomposition, Realizer, Schnyder Labeling And Orderly Spanning Trees Of Plane Graphs. Int. J. Found. Comput. Sci. Kazuyuki Miura, Machiko Azuma, Takao Nishizeki
2005	A	`conf`	Convex Drawings of Plane Graphs of Minimum Outer Apices. GD Kazuyuki Miura, Machiko Azuma, Takao Nishizeki
2005	J	`jnl`	List total colorings of series-parallel graphs. J. Discrete Algorithms Xiao Zhou, Yuki Matsuo, Takao Nishizeki
2005	B	`conf`	Mining Communities on the Web Using a Max-Flow and a Site-Oriented Framework. WISE Yasuhito Asano, Takao Nishizeki, Masashi Toyoda
2005	J	`jnl`	No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs. IEICE Trans. Inf. Syst. Md. Saidur Rahman, Noritsugu Egi, Takao Nishizeki
2005	A	`conf`	No-bend Orthogonal Drawings of Series-Parallel Graphs. GD Md. Saidur Rahman, Noritsugu Egi, Takao Nishizeki
2005	B	`conf`	Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends. ISAAC Xiao Zhou, Takao Nishizeki
2005	—	`conf`	Partitioning graphs of supply and demand. ISCAS (1) Takehiro Ito, Xiao Zhou, Takao Nishizeki
2005	J	`jnl`	Partitioning trees of supply and demand. Int. J. Found. Comput. Sci. Takehiro Ito, Xiao Zhou, Takao Nishizeki
2005	—	`conf`	Rectangle-of-Influence Drawings of Four-Connected Plane Graphs. APVIS Kazuyuki Miura, Takao Nishizeki
2004	J	`jnl`	Algorithm for the Cost Edge-Coloring of Trees. J. Comb. Optim. Xiao Zhou, Takao Nishizeki
2004	J	`jnl`	Algorithms for Drawing Plane Graphs. IEICE Trans. Inf. Syst. Takao Nishizeki, Kazuyuki Miura, Md. Saidur Rahman
2004	Misc	`conf`	Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs. COCOON Kazuyuki Miura, Machiko Azuma, Takao Nishizeki
2004	J	`jnl`	Cost Total Colorings of Trees. IEICE Trans. Inf. Syst. Shuji Isobe, Xiao Zhou, Takao Nishizeki
2004	B	`conf`	Inner Rectangular Drawings of Plane Graphs. ISAAC Kazuyuki Miura, Hiroki Haga, Takao Nishizeki
2004	J	`jnl`	Multicolorings of Series-Parallel Graphs. Algorithmica Xiao Zhou, Takao Nishizeki
2004	Misc	`conf`	Necessary and Sufficient Numbers of Cards for the Transformation Protocol. COCOON Koichi Koizumi, Takaaki Mizuki, Takao Nishizeki
2004	B	`conf`	Octagonal Drawings of Plane Graphs with Prescribed Face Areas. WG Md. Saidur Rahman, Kazuyuki Miura, Takao Nishizeki
2004	B	`conf`	Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size. WG Takehiro Ito, Xiao Zhou, Takao Nishizeki
2004	—	`book`	Planar Graph Drawing Takao Nishizeki, Md. Saidur Rahman
2004	J	`jnl`	Rectangular drawings of planar graphs. J. Algorithms Md. Saidur Rahman, Takao Nishizeki, Shubhashis Ghosh
2003	J	`jnl`	A linear algorithm for compact box-drawings of trees. Networks Masud Hasan, Md. Saidur Rahman, Takao Nishizeki
2003	J	`jnl`	Characterization of optimal key set protocols. Discret. Appl. Math. Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki
2003	B	`conf`	Drawing Plane Graphs. ISAAC Takao Nishizeki
2003	J	`jnl`	List Edge-Colorings of Series-Parallel Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Tomoya Fujino, Xiao Zhou, Takao Nishizeki
2003	Misc	`conf`	List Total Colorings of Series-Parallel Graphs. COCOON Xiao Zhou, Yuki Matsuo, Takao Nishizeki
2003	J	`jnl`	New Security Index for Digital Fingerprinting and Its Bounds. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Shingo Orihara, Takaaki Mizuki, Takao Nishizeki
2003	A	`conf`	No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs. GD Md. Saidur Rahman, Noritsugu Egi, Takao Nishizeki
2003	J	`jnl`	Orthogonal Drawings of Plane Graphs Without Bends. J. Graph Algorithms Appl. Md. Saidur Rahman, Takao Nishizeki, Mahmuda Naznin
2003	A	`conf`	Web-Linkage Viewer: Drawing Links in the Web Based on a Site-Oriented Framework. GD Yasuhito Asano, Takao Nishizeki
2002	J	`jnl`	A complete characterization of a family of key exchange protocols. Int. J. Inf. Sec. Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki
2002	—	`conf`	A linear algorithm for compact box-drawings of trees. CCCG Masud Hasan, Md. Saidur Rahman, Takao Nishizeki
2002	Misc	`conf`	Algorithms for the Multicolorings of Partial k-Trees. COCOON Takehiro Ito, Takao Nishizeki, Xiao Zhou
2002	B	`conf`	Bend-Minimum Orthogonal Drawings of Plane 3-Graphs. WG Md. Saidur Rahman, Takao Nishizeki
2002	A	`conf`	Extended Rectangular Drawings of Plane Graphs with Designated Corners. GD Kazuyuki Miura, Ayako Miyazawa, Takao Nishizeki
2002	J	`jnl`	Labeling Points with Rectangles of Various Shapes. Int. J. Comput. Geom. Appl. Atsushi Koike, Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe
2002	B	`conf`	Partitioning Trees of Supply and Demand. ISAAC Takehiro Ito, Xiao Zhou, Takao Nishizeki
2002	J	`jnl`	Planar Reconfiguration of Monotone Trees. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Yoshiyuki Kusakari, Masaki Sato, Takao Nishizeki
2002	A	`conf`	Rectangular Drawings of Planar Graphs. GD Md. Saidur Rahman, Takao Nishizeki, Shubhashis Ghosh
2002	J	`jnl`	Rectangular drawings of plane graphs without designated corners. Comput. Geom. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
2001	Misc	`conf`	Algorithm for the Cost Edge-Coloring of Trees. COCOON Xiao Zhou, Takao Nishizeki
2001	B	`conf`	Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs. ISAAC Xiao Zhou, Takao Nishizeki
2001	J	`jnl`	Finding a Noncrossing Steiner Forest in Plane Graphs Under a 2-Face Condition. J. Comb. Optim. Yoshiyuki Kusakari, Daisuke Masubuchi, Takao Nishizeki
2001	J	`jnl`	Grid Drawings of 4-Connected Plane Graphs. Discret. Comput. Geom. Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki
2001	J	`jnl`	Guest Editors' Foreword. J. Graph Algorithms Appl. Takao Nishizeki, Roberto Tamassia, Dorothea Wagner
2001	B	`conf`	Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups. ISAAC Takaaki Mizuki, Takao Nishizeki
2001	A	`conf`	Orthogonal Drawings of Plane Graphs without Bends. GD Md. Saidur Rahman, Mahmuda Naznin, Takao Nishizeki
2001	J	`jnl`	The edge-disjoint paths problem is NP-complete for series-parallel graphs. Discret. Appl. Math. Takao Nishizeki, Jens Vygen, Xiao Zhou
2001	A*	`conf`	Total Colorings of Degenerated Graphs. ICALP Shuji Isobe, Xiao Zhou, Takao Nishizeki
2000	J	`jnl`	A Linear Algorithm for Finding [{ Algorithmica Xiao Zhou, K. Fuse, Takao Nishizeki
2000	J	`jnl`	Algorithms for generalized vertex-rankings of partial k-trees. Theor. Comput. Sci. Mohammod Abul Kashem, Xiao Zhou, Takao Nishizeki
2000	J	`jnl`	Box-Rectangular Drawings of Plane Graphs. J. Algorithms Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
2000	—	`conf`	Characterization of Optimal Key Set Protocols. IFIP TCS Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki
2000	B	`conf`	Convex Grid Drwaings of Four-Connected Plane Graphs. ISAAC Kazuyuki Miura, Takao Nishizeki, Shin-Ichi Nakano
2000	J	`jnl`	Finding Edge-Disjoint Paths in Partial Algorithmica Xiao Zhou, Syurei Tamura, Takao Nishizeki
2000	B	`conf`	Finding Independent Spanning Trees in Partial k-Trees. ISAAC Xiao Zhou, Takao Nishizeki
2000	J	`jnl`	Foreword. Algorithmica Takao Nishizeki, Roberto Tamassia, Dorothea Wagner
2000	A	`conf`	Labeling Points with Rectangles of Various Shapes. GD Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe
2000	Misc	`conf`	Rectangular Drawings of Plane Graphs Without Designated Corners. COCOON Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
1999	J	`jnl`	A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs. J. Graph Algorithms Appl. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
1999	B	`conf`	A Linear Algorithm for Finding Total Colorings of Partial k-Trees. ISAAC Shuji Isobe, Xiao Zhou, Takao Nishizeki
1999	J	`jnl`	A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four Connected Planar Graphs. Int. J. Found. Comput. Sci. Kazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki
1999	J	`jnl`	A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees. Int. J. Found. Comput. Sci. Shuji Isobe, Xiao Zhou, Takao Nishizeki
1999	J	`jnl`	A Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas. Int. J. Comput. Geom. Appl. Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki
1999	B	`conf`	Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs. ISAAC Yoshiyuki Kusakari, Daisuke Masubuchi, Takao Nishizeki
1999	B	`conf`	Box-Rectangular Drawings of Plane Graphs. WG Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
1999	A*	`conf`	Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key. EUROCRYPT Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki
1999	J	`jnl`	Decompositions to Degree-Constrainded Subgraphs Are Simply Reducible to Edge-Colorings. J. Comb. Theory B Xiao Zhou, Takao Nishizeki
1999	J	`jnl`	Edge-Coloring and f-Coloring for Various Classes of Graphs. J. Graph Algorithms Appl. Xiao Zhou, Takao Nishizeki
1999	A	`conf`	Grid Drawings of Four-Connected Plane Graphs. GD Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki
1998	B	`conf`	A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs. WG Kazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki
1998	B	`conf`	A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees. WG Shuji Isobe, Xiao Zhou, Takao Nishizeki
1998	Misc	`conf`	Eulerian Secret Key Exchange. COCOON Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki
1998	J	`jnl`	Rectangular grid drawings of plane graphs. Comput. Geom. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
1998	B	`conf`	The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees. ISAAC Xiao Zhou, Takao Nishizeki
1997	A	`conf`	A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs. GD Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
1997	J	`jnl`	A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. Inf. Process. Lett. Shin-Ichi Nakano, Md. Saidur Rahman, Takao Nishizeki
1997	B	`conf`	An Algorithm for Finding a Region with the Minimum Lotal L ISAAC Yoshiyuki Kusakari, Takao Nishizeki
1997	J	`jnl`	An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs. J. Algorithms Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki
1997	—	`conf`	An NC Parallel Algorithm for Generalized Vertex-Rankings of Partial k-Trees. ISPAN Mohammod Abul Kashem, Xiao Zhou, Takao Nishizeki
1997	Misc	`conf`	Generalized Vertex-Rankings of Partial k-trees. COCOON Mohammod Abul Kashem, Xiao Zhou, Takao Nishizeki
1997	J	`jnl`	Shortest Non-Crossing Rectilinear Paths in Plane Regions. Int. J. Comput. Geom. Appl. Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki
1996	J	`jnl`	A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs. J. Algorithms Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki
1996	A	`conf`	A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. GD Shin-Ichi Nakano, Md. Saidur Rahman, Takao Nishizeki
1996	J	`jnl`	Edge-Coloring Partial k-Trees. J. Algorithms Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki
1996	B	`conf`	Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract). ISAAC Xiao Zhou, Syurei Tamura, Takao Nishizeki
1996	B	`conf`	Generalized Edge-Ranking of Trees (Extended Abstract). WG Xiao Zhou, Mohammod Abul Kashem, Takao Nishizeki
1996	Misc	`conf`	Rectangular Grid Drawings of Plane Graphs. COCOON Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
1996	J	`jnl`	Shortest Noncrossing Paths in Plane Graphs. Algorithmica Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki
1995	B	`conf`	Algorithms for Finding f-Colorings of Partial k-Trees. ISAAC Xiao Zhou, Takao Nishizeki
1995	—	`ch.`	Edge-Coloring Algorithms. Computer Science Today Shin-Ichi Nakano, Xiao Zhou, Takao Nishizeki
1995	A*	`conf`	Finding Optimal Edge-Rankings of Trees. SODA Xiao Zhou, Takao Nishizeki
1995	B	`conf`	Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas. ISAAC Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki
1995	J	`jnl`	Generalized Vertex-Rankings of Trees. Inf. Process. Lett. Xiao Zhou, Nobuaki Nagai, Takao Nishizeki
1995	Misc	`conf`	Simple Reduction of f-Colorings to Edge-Colorings. COCOON Xiao Zhou, Takao Nishizeki
1994	—	`conf`	A Parallel Algorithm for Edge-Coloring Partial k-Trees. SWAT Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki
1994	A	`conf`	An Efficient Algorithm for Edge-Ranking Trees. ESA Xiao Zhou, Takao Nishizeki
1994	B	`conf`	Edge-Coloring and f-Coloring for Various Classes of Graphs. ISAAC Xiao Zhou, Takao Nishizeki
1994	J	`jnl`	Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming. Int. J. Comput. Geom. Appl. Naoyoshi Kanamaru, Takao Nishizeki, Tetsuo Asano
1994	—	`conf`	Optimal parallel algorithm for edge-coloring partial k-trees with bounded degrees. ISPAN Xiao Zhou, Takao Nishizeki
1994	J	`jnl`	k-Connectivity and Decomposition of Graphs into Forests. Discret. Appl. Math. Takao Nishizeki, Svatopluk Poljak
1993	A	`conf`	A Linear Algorithm for Edge-Coloring Partial k-Trees. ESA Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki
1993	B	`conf`	Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions. ISAAC Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki
1993	J	`jnl`	Multiple Assignment Scheme for Sharing Secret. J. Cryptol. Mitsuru Ito, Akira Saio, Takao Nishizeki
1993	B	`conf`	Nearly uniform scheduling of file transfers. IPCO Shin-Ichi Nakano, Takao Nishizeki
1993	J	`jnl`	Scheduling File Transfers Under Port and Channe; Constraints. Int. J. Found. Comput. Sci. Shin-Ichi Nakano, Takao Nishizeki
1993	B	`conf`	Sequential and parallel algorithms for edge-coloring series-parallel multigraphs. IPCO Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki
1992	B	`ed.`	Algorithms and Computation, Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992, Proceedings ISAAC Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita
1992	B	`conf`	Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs. ISAAC Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki
1992	J	`jnl`	Algorithms for Routing around a Rectangle. Discret. Appl. Math. András Frank, Takao Nishizeki, Nobuji Saito, Hitoshi Suzuki, Éva Tardos
1992	B	`conf`	An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs. LATIN Xiao Zhou, Shin-Ichi Nakano, Hitoshi Suzuki, Takao Nishizeki
1992	B	`conf`	Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming. IPCO Naoyoshi Kanamaru, Takao Nishizeki, Tetsuo Asano
1992	J	`jnl`	Variable-Priority Queue and Doughnut Routing. J. Algorithms Hitoshi Suzuki, Akira Ishiguro, Takao Nishizeki
1991	—	`conf`	Scheduling File Transfers under Port and Channel Constraints. ISA Shin-Ichi Nakano, Takao Nishizeki
1990	J	`jnl`	A Linear Algorithm for Bipartition of Biconnected Graphs. Inf. Process. Lett. Hitoshi Suzuki, Naomi Takahashi, Takao Nishizeki
1990	—	`ed.`	Algorithms, International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990, Proceedings SIGAL International Symposium on Algorithms Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki
1990	J	`jnl`	Edge-disjoint paths in a grid bounded by two nested rectangles. Discret. Appl. Math. Hitoshi Suzuki, Akira Ishiguro, Takao Nishizeki
1990	A*	`conf`	Finding Steiner Forests in Planar Graphs. SODA Hitoshi Suzuki, Takehiro Akama, Takao Nishizeki
1990	J	`jnl`	Improved Edge-Coloring Algorithms for Planar Graphs. J. Algorithms Marek Chrobak, Takao Nishizeki
1990	J	`jnl`	On the 1.1 Edge-Coloring of Multigraphs. SIAM J. Discret. Math. Takao Nishizeki, Kenichi Kashiwagi
1990	J	`jnl`	On the fg-coloring of graphs. Comb. Shin-Ichi Nakano, Takao Nishizeki, Nobuji Saito
1990	—	`conf`	Parallel Algorithms for Finding Steiner Forests in Planar Graphs. SIGAL International Symposium on Algorithms Hitoshi Suzuki, Chiseko Yamanaka, Takao Nishizeki
1989	J	`jnl`	Algorithms for Multicommodity Flows in Planar Graphs. Algorithmica Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito
1989	J	`jnl`	The Hamiltonian Cycle Problem is Linear-Time Solvable for 4-Connected Planar Graphs. J. Algorithms Norishige Chiba, Takao Nishizeki
1986	J	`jnl`	A Better than "Best Possible" Algorithm to Edge Color Multigraphs. J. Algorithms Dorit S. Hochbaum, Takao Nishizeki, David B. Shmoys
1986	J	`jnl`	Planar Multicommodity Flows, Maximum Matchings and Negative Cycles. SIAM J. Comput. Kazuhiko Matsumoto, Takao Nishizeki, Nobuji Saito
1985	J	`jnl`	A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees. J. Comput. Syst. Sci. Norishige Chiba, Takao Nishizeki, Shigenobu Abe, Takao Ozawa
1985	J	`jnl`	A Linear-Time Routing Algorithm for Convex Grids. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Takao Nishizeki, Nobuji Saito, Kiminobu Suzuki
1985	J	`jnl`	An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks. SIAM J. Comput. Kazuhiko Matsumoto, Takao Nishizeki, Nobuji Saito
1985	J	`jnl`	Arboricity and Subgraph Listing Algorithms. SIAM J. Comput. Norishige Chiba, Takao Nishizeki
1985	J	`jnl`	Drawing Plane Graphs Nicely. Acta Informatica Norishige Chiba, Kazunori Onoguchi, Takao Nishizeki
1985	J	`jnl`	Lower Bounds for Combinatorial Problems on Graphs. J. Algorithms Hiroyuki Nakayama, Takao Nishizeki, Nobuji Saito
1985	A*	`conf`	Multicommodity Flows in Planar Undirected Graphs and Shortest Paths STOC Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito
1984	J	`jnl`	A Note on the Critical Problem for Matroids. Eur. J. Comb. Takao Asano, Takao Nishizeki, Nobuji Saito, James G. Oxley
1984	J	`jnl`	A note on nongraphic matroids. J. Comb. Theory B Takao Asano, Takao Nishizeki, Paul D. Seymour
1983	J	`jnl`	An algorithm for finding a large independent set in planar graphs. Networks Norishige Chiba, Takao Nishizeki, Nobuji Saito
1983	J	`jnl`	An approximation algorithm for the hamiltonian walk problem on maximal planar graphs. Discret. Appl. Math. Takao Nishizeki, Takao Asano, Takahiro Watanabe
1982	J	`jnl`	An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs. SIAM J. Comput. Norishige Chiba, Takao Nishizeki, Nobuji Saito
1982	J	`jnl`	Linear-time computability of combinatorial problems on series-parallel graphs. J. ACM K. Takamizawa, Takao Nishizeki, Nobuji Saito
1981	J	`jnl`	A Linear 5-Coloring Algorithm of Planar Graphs. J. Algorithms Norishige Chiba, Takao Nishizeki, Nobuji Saito
1981	J	`jnl`	Combinatorial problems on series-parallel graphs. Discret. Appl. Math. K. Takamizawa, Takao Nishizeki, Nobuji Saito
1981	—	`ed.`	Graph Theory and Algorithms, 17th Symposium of Research Institute of Electric Communication, Tohoku University, Sendai, Japan, October 24-25, 1980, Proceedings Graph Theory and Algorithms Nobuji Saito, Takao Nishizeki
1981	J	`jnl`	On the maximum matchings of regular multigraphs. Discret. Math. Takao Nishizeki
1980	J	`jnl`	A 1-tough nonhamiltonian maximal planar graph. Discret. Math. Takao Nishizeki
1980	—	`conf`	A linear algorithm for five-coloring a planar graph. Graph Theory and Algorithms Norishige Chiba, Takao Nishizeki, Nobuji Saito
1980	J	`jnl`	An algorithm for finding a short closed spanning walk in a graph. Networks K. Takamizawa, Takao Nishizeki, Nobuji Saito
1980	J	`jnl`	An upper bound on the length of a Hamiltonian walk of a maximal planar graph. J. Graph Theory Takao Asano, Takao Nishizeki, Takahiro Watanabe
1980	—	`conf`	Combinatorial problems on series-parallel graphs. Graph Theory and Algorithms K. Takamizawa, Takao Nishizeki, Nobuji Saito
1979	J	`jnl`	Lower bounds on the cardinality of the maximum matchings of planar graphs. Discret. Math. Takao Nishizeki, Ilker Baybars
1979	J	`jnl`	On the relationship between the genus and the cardinality of the maximum matchings of a graph. Discret. Math. Takao Nishizeki
1978	J	`jnl`	Necessary and sufficient conditions for a graph to be three-terminal series-parallel-cascade. J. Comb. Theory B Takao Nishizeki, Nobuji Saito