Takao Nishizeki

According to our database, Takao Nishizeki authored at least 172 papers between 1978 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

Generalized edge-colorings of weighted graphs.

Yuji Obata, Takao Nishizeki

Discret. Math. Algorithms Appl., 2016

2015

Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs.

Yuji Obata, Takao Nishizeki

Theor. Comput. Sci., 2015

Parametric power supply networks.

Shiho Morishita, Takao Nishizeki

J. Comb. Optim., 2015

Edge-Colorings of Weighted Graphs - (Extended Abstract).

Yuji Obata, Takao Nishizeki

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

2014

Bandwidth consecutive multicolorings of graphs.

Kazuhide Nishikawa, Takao Nishizeki, Xiao Zhou

Theor. Comput. Sci., 2014

Spanning Distribution Trees of Graphs.

Masaki Kawabata, Takao Nishizeki

IEICE Trans. Inf. Syst., 2014

Approximation Algorithms for Bandwidth Consecutive Multicolorings - (Extended Abstract).

Yuji Obata, Takao Nishizeki

Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

Spanning Distribution Forests of Graphs - (Extended Abstract).

Keisuke Inoue, Takao Nishizeki

Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

2013

Rectangular Drawing Algorithms.

Takao Nishizeki, Md. Saidur Rahman

Proceedings of the Handbook on Graph Drawing and Visualization., 2013

Partitioning Trees with Supply, Demand and Edge-Capacity.

Masaki Kawabata, Takao Nishizeki

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

2012

Small grid drawings of planar graphs with balanced partition.

Xiao Zhou, Takashi Hikino, Takao Nishizeki

J. Comb. Optim., 2012

Absolutely Secure Message Transmission using a Key Sharing Graph.

Yoshihiro Indo, Takaaki Mizuki, Takao Nishizeki

Discret. Math. Algorithms Appl., 2012

Partitioning a Weighted Tree into Subtrees with Weights in a Given Range.

Takehiro Ito, Takao Nishizeki, Michael Schröder, Takeaki Uno, Xiao Zhou

Algorithmica, 2012

Minimum Cost Partitions of Trees with Supply and Demand.

Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki

Algorithmica, 2012

Algorithms for Bandwidth Consecutive Multicolorings of Graphs - (Extended Abstract).

Kazuhide Nishikawa, Takao Nishizeki, Xiao Zhou

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011

Size-energy tradeoffs for unate circuits computing symmetric Boolean functions.

Kei Uchizawa, Eiji Takimoto, Takao Nishizeki

Theor. Comput. Sci., 2011

Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings.

Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki

IEICE Trans. Inf. Syst., 2011

2010

Energy and depth of threshold circuits.

Kei Uchizawa, Takao Nishizeki, Eiji Takimoto

Theor. Comput. Sci., 2010

Minimizing AND-EXOR Expressions for Two-Variable Multiple-Valued Input Binary Output Functions.

Takaaki Mizuki, Hitoshi Tsubata, Takao Nishizeki

J. Multiple Valued Log. Soft Comput., 2010

Convex Drawings of Internally Triconnected Plane Graphs on O(N²) Grids.

Xiao Zhou, Takao Nishizeki

Discret. Math. Algorithms Appl., 2010

Small Grid Drawings of Planar Graphs with Balanced Bipartition.

Xiao Zhou, Takashi Hikino, Takao Nishizeki

Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

2009

Guest Editors' Foreword.

Seok-Hee Hong, Takao Nishizeki

J. Graph Algorithms Appl., 2009

Efficient Compression of Web Graphs.

Yasuhito Asano, Yuya Miyawaki, Takao Nishizeki

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009

Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs.

Kazuyuki Miura, Tetsuya Matsuno, Takao Nishizeki

Discret. Comput. Geom., 2009

Partitioning graphs of supply and demand.

Takehiro Ito, Xiao Zhou, Takao Nishizeki

Discret. Appl. Math., 2009

Octagonal drawings of plane graphs with prescribed face areas.

Md. Saidur Rahman, Kazuyuki Miura, Takao Nishizeki

Comput. Geom., 2009

Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions.

Takaaki Mizuki, Hitoshi Tsubata, Takao Nishizeki

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

Size and Energy of Threshold Circuits Computing Mod Functions.

Kei Uchizawa, Takao Nishizeki, Eiji Takimoto

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Convex Drawings of Internally Triconnected Plane Graphs on <i>O</i>(<i>n</i>²) Grids.

Xiao Zhou, Takao Nishizeki

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Energy Complexity and Depth of Threshold Circuits.

Kei Uchizawa, Takao Nishizeki, Eiji Takimoto

Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

2008

Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends.

Xiao Zhou, Takao Nishizeki

SIAM J. Discret. Math., 2008

A Revised Transformation Protocol for Unconditionally Secure Secret Key Exchange.

Koichi Koizumi, Takaaki Mizuki, Takao Nishizeki

Theory Comput. Syst., 2008

Convex Grid Drawings of Plane Graphs with Rectangular Contours.

Kazuyuki Miura, Akira Kamada, Takao Nishizeki

J. Graph Algorithms Appl., 2008

Approximability of partitioning graphs with supply and demand.

Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki

J. Discrete Algorithms, 2008

Improvements of HITS Algorithms for Spam Links.

Yasuhito Asano, Yu Tezuka, Takao Nishizeki

IEICE Trans. Inf. Syst., 2008

Partitioning a Weighted Tree to Subtrees of Almost Uniform Size.

Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

Algorithms for finding distance-edge-colorings of graphs.

Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki

J. Discrete Algorithms, 2007

Sufficient Condition and Algorithm for List Total Colorings of Series-Parallel Graphs.

Yuki Matsuo, Xiao Zhou, Takao Nishizeki

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007

Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size.

Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki

IEICE Trans. Inf. Syst., 2007

Total Colorings Of Degenerate Graphs.

Shuji Isobe, Xiao Zhou, Takao Nishizeki

Comb., 2007

Inner Rectangular Drawings of Plane Graphs: Application of Graph Drawing to VLSI Layouts.

Takao Nishizeki

Proceedings of the Workshop on Algorithms and Computation 2007, 2007

2006

Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size.

Takehiro Ito, Xiao Zhou, Takao Nishizeki

J. Discrete Algorithms, 2006

Convex Grid Drawings of Four-connected Plane Graphs.

Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki

Int. J. Found. Comput. Sci., 2006

Convex Drawings of Plane Graphs of Minimum Outer Apices.

Kazuyuki Miura, Machiko Azuma, Takao Nishizeki

Int. J. Found. Comput. Sci., 2006

Inner Rectangular Drawings of Plane Graphs.

Kazuyuki Miura, Hiroki Haga, Takao Nishizeki

Int. J. Comput. Geom. Appl., 2006

Best Security Index for Digital Fingerprinting.

Kozo Banno, Shingo Orihara, Takaaki Mizuki, Takao Nishizeki

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

Mining Communities on the Web Using a Max-Flow and a Site-Oriented Framework.

Yasuhito Asano, Takao Nishizeki, Masashi Toyoda, Masaru Kitsuregawa

IEICE Trans. Inf. Syst., 2006

2005

List total colorings of series-parallel graphs.

Xiao Zhou, Yuki Matsuo, Takao Nishizeki

J. Discrete Algorithms, 2005

Canonical Decomposition, Realizer, Schnyder Labeling And Orderly Spanning Trees Of Plane Graphs.

Kazuyuki Miura, Machiko Azuma, Takao Nishizeki

Int. J. Found. Comput. Sci., 2005

Partitioning trees of supply and demand.

Takehiro Ito, Xiao Zhou, Takao Nishizeki

Int. J. Found. Comput. Sci., 2005

No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs.

Md. Saidur Rahman, Noritsugu Egi, Takao Nishizeki

IEICE Trans. Inf. Syst., 2005

Mining Communities on the Web Using a Max-Flow and a Site-Oriented Framework.

Yasuhito Asano, Takao Nishizeki, Masashi Toyoda

Proceedings of the Web Information Systems Engineering, 2005

No-bend Orthogonal Drawings of Series-Parallel Graphs.

Md. Saidur Rahman, Noritsugu Egi, Takao Nishizeki

Proceedings of the Graph Drawing, 13th International Symposium, 2005

Rectangle-of-Influence Drawings of Four-Connected Plane Graphs.

Kazuyuki Miura, Takao Nishizeki

Proceedings of the Asia-Pacific Symposium on Information Visualisation, 2005

2004

Algorithm for the Cost Edge-Coloring of Trees.

Xiao Zhou, Takao Nishizeki

J. Comb. Optim., 2004

Rectangular drawings of planar graphs.

Md. Saidur Rahman, Takao Nishizeki, Shubhashis Ghosh

J. Algorithms, 2004

Algorithms for Drawing Plane Graphs.

Takao Nishizeki, Kazuyuki Miura, Md. Saidur Rahman

IEICE Trans. Inf. Syst., 2004

Cost Total Colorings of Trees.

Shuji Isobe, Xiao Zhou, Takao Nishizeki

IEICE Trans. Inf. Syst., 2004

Multicolorings of Series-Parallel Graphs.

Xiao Zhou, Takao Nishizeki

Algorithmica, 2004

Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size.

Takehiro Ito, Xiao Zhou, Takao Nishizeki

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

Necessary and Sufficient Numbers of Cards for the Transformation Protocol.

Koichi Koizumi, Takaaki Mizuki, Takao Nishizeki

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

Planar Graph Drawing

Takao Nishizeki, Md. Saidur Rahman

Lecture Notes Series on Computing 12, World Scientific, ISBN: 981-256-033-5, 2004

2003

A linear algorithm for compact box-drawings of trees.

Masud Hasan, Md. Saidur Rahman, Takao Nishizeki

Networks, 2003

Orthogonal Drawings of Plane Graphs Without Bends.

Md. Saidur Rahman, Takao Nishizeki, Mahmuda Naznin

J. Graph Algorithms Appl., 2003

New Security Index for Digital Fingerprinting and Its Bounds.

Shingo Orihara, Takaaki Mizuki, Takao Nishizeki

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

List Edge-Colorings of Series-Parallel Graphs.

Tomoya Fujino, Xiao Zhou, Takao Nishizeki

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

Characterization of optimal key set protocols.

Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki

Discret. Appl. Math., 2003

Drawing Plane Graphs.

Takao Nishizeki

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Web-Linkage Viewer: Drawing Links in the Web Based on a Site-Oriented Framework.

Yasuhito Asano, Takao Nishizeki

Proceedings of the Graph Drawing, 11th International Symposium, 2003

2002

A complete characterization of a family of key exchange protocols.

Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki

Int. J. Inf. Sec., 2002

Labeling Points with Rectangles of Various Shapes.

Atsushi Koike, Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe

Int. J. Comput. Geom. Appl., 2002

Planar Reconfiguration of Monotone Trees.

Yoshiyuki Kusakari, Masaki Sato, Takao Nishizeki

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002

Rectangular drawings of plane graphs without designated corners.

Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki

Comput. Geom., 2002

Bend-Minimum Orthogonal Drawings of Plane 3-Graphs.

Md. Saidur Rahman, Takao Nishizeki

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

Extended Rectangular Drawings of Plane Graphs with Designated Corners.

Kazuyuki Miura, Ayako Miyazawa, Takao Nishizeki

Proceedings of the Graph Drawing, 10th International Symposium, 2002

Algorithms for the Multicolorings of Partial k-Trees.

Takehiro Ito, Takao Nishizeki, Xiao Zhou

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001

Guest Editors' Foreword.

Takao Nishizeki, Roberto Tamassia, Dorothea Wagner

J. Graph Algorithms Appl., 2001

Finding a Noncrossing Steiner Forest in Plane Graphs Under a 2-Face Condition.

Yoshiyuki Kusakari, Daisuke Masubuchi, Takao Nishizeki

J. Comb. Optim., 2001

Grid Drawings of 4-Connected Plane Graphs.

Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki

Discret. Comput. Geom., 2001

The edge-disjoint paths problem is NP-complete for series-parallel graphs.

Takao Nishizeki, Jens Vygen, Xiao Zhou

Discret. Appl. Math., 2001

Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs.

Xiao Zhou, Takao Nishizeki

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups.

Takaaki Mizuki, Takao Nishizeki

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Total Colorings of Degenerated Graphs.

Shuji Isobe, Xiao Zhou, Takao Nishizeki

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000

Algorithms for generalized vertex-rankings of partial k-trees.

Mohammod Abul Kashem, Xiao Zhou, Takao Nishizeki

Theor. Comput. Sci., 2000

Box-Rectangular Drawings of Plane Graphs.

Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki

J. Algorithms, 2000

Finding Edge-Disjoint Paths in Partial <i>k</i>-Trees.

Xiao Zhou, Syurei Tamura, Takao Nishizeki

Algorithmica, 2000

A Linear Algorithm for Finding [{<i>g</i>, <i>f</i>}]-Colorings of Partial {<i>k</i>}-Trees.

Xiao Zhou, K. Fuse, Takao Nishizeki

Algorithmica, 2000

Foreword.

Takao Nishizeki, Roberto Tamassia, Dorothea Wagner

Algorithmica, 2000

Finding Independent Spanning Trees in Partial k-Trees.

Xiao Zhou, Takao Nishizeki

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Convex Grid Drwaings of Four-Connected Plane Graphs.

Kazuyuki Miura, Takao Nishizeki, Shin-Ichi Nakano

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Labeling Points with Rectangles of Various Shapes.

Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe

Proceedings of the Graph Drawing, 8th International Symposium, 2000

1999

Edge-Coloring and f-Coloring for Various Classes of Graphs.

Xiao Zhou, Takao Nishizeki

J. Graph Algorithms Appl., 1999

A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs.

Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki

J. Graph Algorithms Appl., 1999

Decompositions to Degree-Constrainded Subgraphs Are Simply Reducible to Edge-Colorings.

Xiao Zhou, Takao Nishizeki

J. Comb. Theory, Ser. B, 1999

A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four Connected Planar Graphs.

Kazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki

Int. J. Found. Comput. Sci., 1999

A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees.

Shuji Isobe, Xiao Zhou, Takao Nishizeki

Int. J. Found. Comput. Sci., 1999

A Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas.

Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki

Int. J. Comput. Geom. Appl., 1999

Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs.

Yoshiyuki Kusakari, Daisuke Masubuchi, Takao Nishizeki

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

A Linear Algorithm for Finding Total Colorings of Partial k-Trees.

Shuji Isobe, Xiao Zhou, Takao Nishizeki

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

Grid Drawings of Four-Connected Plane Graphs.

Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki

Proceedings of the Graph Drawing, 7th International Symposium, 1999

Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key.

Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki

Proceedings of the Advances in Cryptology, 1999

1998

Rectangular grid drawings of plane graphs.

Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki

Comput. Geom., 1998

The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees.

Xiao Zhou, Takao Nishizeki

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Eulerian Secret Key Exchange.

Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997

An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs.

Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki

J. Algorithms, 1997

A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs.

Shin-Ichi Nakano, Md. Saidur Rahman, Takao Nishizeki

Inf. Process. Lett., 1997

Shortest Non-Crossing Rectilinear Paths in Plane Regions.

Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki

Int. J. Comput. Geom. Appl., 1997

An NC Parallel Algorithm for Generalized Vertex-Rankings of Partial k-Trees.

Mohammod Abul Kashem, Xiao Zhou, Takao Nishizeki

Proceedings of the 1997 International Symposium on Parallel Architectures, 1997

An Algorithm for Finding a Region with the Minimum Lotal L₁ from Prescribed Terminals.

Yoshiyuki Kusakari, Takao Nishizeki

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs.

Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki

Proceedings of the Graph Drawing, 5th International Symposium, 1997

Generalized Vertex-Rankings of Partial k-trees.

Mohammod Abul Kashem, Xiao Zhou, Takao Nishizeki

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996

A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs.

Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki

J. Algorithms, 1996

Edge-Coloring Partial k-Trees.

Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki

J. Algorithms, 1996

Shortest Noncrossing Paths in Plane Graphs.

Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki

Algorithmica, 1996

Generalized Edge-Ranking of Trees (Extended Abstract).

Xiao Zhou, Mohammod Abul Kashem, Takao Nishizeki

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract).

Xiao Zhou, Syurei Tamura, Takao Nishizeki

Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

1995

Generalized Vertex-Rankings of Trees.

Xiao Zhou, Nobuaki Nagai, Takao Nishizeki

Inf. Process. Lett., 1995

Finding Optimal Edge-Rankings of Trees.

Xiao Zhou, Takao Nishizeki

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Algorithms for Finding f-Colorings of Partial k-Trees.

Xiao Zhou, Takao Nishizeki

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas.

Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Simple Reduction of f-Colorings to Edge-Colorings.

Xiao Zhou, Takao Nishizeki

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

Edge-Coloring Algorithms.

Shin-Ichi Nakano, Xiao Zhou, Takao Nishizeki

Proceedings of the Computer Science Today: Recent Trends and Developments, 1995

1994

Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming.

Naoyoshi Kanamaru, Takao Nishizeki, Tetsuo Asano

Int. J. Comput. Geom. Appl., 1994

k-Connectivity and Decomposition of Graphs into Forests.

Takao Nishizeki, Svatopluk Poljak

Discret. Appl. Math., 1994

A Parallel Algorithm for Edge-Coloring Partial k-Trees.

Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki

Proceedings of the Algorithm Theory, 1994

Optimal parallel algorithm for edge-coloring partial k-trees with bounded degrees.

Xiao Zhou, Takao Nishizeki

Proceedings of the International Symposium on Parallel Architectures, 1994

An Efficient Algorithm for Edge-Ranking Trees.

Xiao Zhou, Takao Nishizeki

Proceedings of the Algorithms, 1994

1993

Multiple Assignment Scheme for Sharing Secret.

Mitsuru Ito, Akira Saio, Takao Nishizeki

J. Cryptol., 1993

Scheduling File Transfers Under Port and Channe; Constraints.

Shin-Ichi Nakano, Takao Nishizeki

Int. J. Found. Comput. Sci., 1993

Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions.

Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

Sequential and parallel algorithms for edge-coloring series-parallel multigraphs.

Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki

Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

Nearly uniform scheduling of file transfers.

Shin-Ichi Nakano, Takao Nishizeki

Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

A Linear Algorithm for Edge-Coloring Partial k-Trees.

Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki

Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992

Variable-Priority Queue and Doughnut Routing.

Hitoshi Suzuki, Akira Ishiguro, Takao Nishizeki

J. Algorithms, 1992

Algorithms for Routing around a Rectangle.

András Frank, Takao Nishizeki, Nobuji Saito, Hitoshi Suzuki, Éva Tardos

Discret. Appl. Math., 1992

An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs.

Xiao Zhou, Shin-Ichi Nakano, Hitoshi Suzuki, Takao Nishizeki

Proceedings of the LATIN '92, 1992

Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs.

Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki

Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1991

Scheduling File Transfers under Port and Channel Constraints.

Shin-Ichi Nakano, Takao Nishizeki

Proceedings of the ISA '91 Algorithms, 1991

1990

On the 1.1 Edge-Coloring of Multigraphs.

Takao Nishizeki, Kenichi Kashiwagi

SIAM J. Discret. Math., 1990

Improved Edge-Coloring Algorithms for Planar Graphs.

Marek Chrobak, Takao Nishizeki

J. Algorithms, 1990

A Linear Algorithm for Bipartition of Biconnected Graphs.

Hitoshi Suzuki, Naomi Takahashi, Takao Nishizeki

Inf. Process. Lett., 1990

Edge-disjoint paths in a grid bounded by two nested rectangles.

Hitoshi Suzuki, Akira Ishiguro, Takao Nishizeki

Discret. Appl. Math., 1990

On the fg-coloring of graphs.

Shin-Ichi Nakano, Takao Nishizeki, Nobuji Saito

Comb., 1990

Finding Steiner Forests in Planar Graphs.

Hitoshi Suzuki, Takehiro Akama, Takao Nishizeki

Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

Parallel Algorithms for Finding Steiner Forests in Planar Graphs.

Hitoshi Suzuki, Chiseko Yamanaka, Takao Nishizeki

Proceedings of the Algorithms, 1990

1989

The Hamiltonian Cycle Problem is Linear-Time Solvable for 4-Connected Planar Graphs.

Norishige Chiba, Takao Nishizeki

J. Algorithms, 1989

Algorithms for Multicommodity Flows in Planar Graphs.

Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito

Algorithmica, 1989

1986

Planar Multicommodity Flows, Maximum Matchings and Negative Cycles.

Kazuhiko Matsumoto, Takao Nishizeki, Nobuji Saito

SIAM J. Comput., 1986

A Better than "Best Possible" Algorithm to Edge Color Multigraphs.

Dorit S. Hochbaum, Takao Nishizeki, David B. Shmoys

J. Algorithms, 1986

1985

A Linear-Time Routing Algorithm for Convex Grids.

Takao Nishizeki, Nobuji Saito, Kiminobu Suzuki

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1985

An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks.

Kazuhiko Matsumoto, Takao Nishizeki, Nobuji Saito

SIAM J. Comput., 1985

Arboricity and Subgraph Listing Algorithms.

Norishige Chiba, Takao Nishizeki

SIAM J. Comput., 1985

A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees.

Norishige Chiba, Takao Nishizeki, Shigenobu Abe, Takao Ozawa

J. Comput. Syst. Sci., 1985

Lower Bounds for Combinatorial Problems on Graphs.

Hiroyuki Nakayama, Takao Nishizeki, Nobuji Saito

J. Algorithms, 1985

Drawing Plane Graphs Nicely.

Norishige Chiba, Kazunori Onoguchi, Takao Nishizeki

Acta Informatica, 1985

Multicommodity Flows in Planar Undirected Graphs and Shortest Paths

Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

1984

A note on nongraphic matroids.

Takao Asano, Takao Nishizeki, Paul D. Seymour

J. Comb. Theory, Ser. B, 1984

A Note on the Critical Problem for Matroids.

Takao Asano, Takao Nishizeki, Nobuji Saito, James G. Oxley

Eur. J. Comb., 1984

1983

An algorithm for finding a large independent set in planar graphs.

Norishige Chiba, Takao Nishizeki, Nobuji Saito

Networks, 1983

An approximation algorithm for the hamiltonian walk problem on maximal planar graphs.

Takao Nishizeki, Takao Asano, Takahiro Watanabe

Discret. Appl. Math., 1983

1982

An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs.

Norishige Chiba, Takao Nishizeki, Nobuji Saito

SIAM J. Comput., 1982

Linear-time computability of combinatorial problems on series-parallel graphs.

K. Takamizawa, Takao Nishizeki, Nobuji Saito

J. ACM, 1982

1981

A Linear 5-Coloring Algorithm of Planar Graphs.

Norishige Chiba, Takao Nishizeki, Nobuji Saito

J. Algorithms, 1981

On the maximum matchings of regular multigraphs.

Takao Nishizeki

Discret. Math., 1981

Combinatorial problems on series-parallel graphs.

K. Takamizawa, Takao Nishizeki, Nobuji Saito

Discret. Appl. Math., 1981

1980

An algorithm for finding a short closed spanning walk in a graph.

K. Takamizawa, Takao Nishizeki, Nobuji Saito

Networks, 1980

An upper bound on the length of a Hamiltonian walk of a maximal planar graph.

Takao Asano, Takao Nishizeki, Takahiro Watanabe

J. Graph Theory, 1980

A 1-tough nonhamiltonian maximal planar graph.

Takao Nishizeki

Discret. Math., 1980

A linear algorithm for five-coloring a planar graph.

Norishige Chiba, Takao Nishizeki, Nobuji Saito

Proceedings of the Graph Theory and Algorithms, 1980

1979

Lower bounds on the cardinality of the maximum matchings of planar graphs.

Takao Nishizeki, Ilker Baybars

Discret. Math., 1979

On the relationship between the genus and the cardinality of the maximum matchings of a graph.

Takao Nishizeki

Discret. Math., 1979

1978

Necessary and sufficient conditions for a graph to be three-terminal series-parallel-cascade.

Takao Nishizeki, Nobuji Saito

J. Comb. Theory, Ser. B, 1978