Takao Nishizeki
#49,228
Most Influential Person Now
Japanese mathematician and computer scientist
Takao Nishizeki's AcademicInfluence.com Rankings
Takao Nishizekimathematics Degrees
Mathematics
#6810
World Rank
#9364
Historical Rank
Graph Theory
#90
World Rank
#98
Historical Rank
Measure Theory
#2307
World Rank
#2762
Historical Rank
Download Badge
Computer Science Mathematics
Takao Nishizeki's Degrees
- PhD Mathematics University of Tokyo
Why Is Takao Nishizeki Influential?
(Suggest an Edit or Addition)According to Wikipedia, was a Japanese mathematician and computer scientist who specialized in graph algorithms and graph drawing. Education and career Nishizeki was born in 1947 in Fukushima, and was a student at Tohoku University, earning a bachelor's degree in 1969, a master's in 1971, and a doctorate in 1974. He continued at Tohoku as a faculty member, and became a full professor there in 1988. He was the Dean of the Graduate School of Information Sciences, Tohoku University, from April 2008 to March 2010. He retired in 2010, becoming a professor emeritus at Tohoku University, but continued teaching as a professor at Kwansei Gakuin University until March 2015. He was an Auditor of Japan Advanced Institute of Science and Technology from April 2016 to October 2018.
Takao Nishizeki's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Secret sharing scheme realizing general access structure (1989) (730)
- Arboricity and Subgraph Listing Algorithms (1985) (638)
- Planar Graphs: Theory and Algorithms (1988) (295)
- Linear-time computability of combinatorial problems on series-parallel graphs (1982) (282)
- A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees (1985) (246)
- Planar Graph Drawing (2004) (115)
- The Hamiltonian Cycle Problem is Linear-Time Solvable for 4-Connected Planar Graphs (1989) (110)
- NP-Completeness of the Hamiltonian Cycle Problem for Bipartite Graphs (1980) (109)
- On the 1.1 Edge-Coloring of Multigraphs (1990) (105)
- Multiple assignment scheme for sharing secret (1993) (97)
- Graph Theory and Algorithms (1981) (83)
- Algorithms for Routing around a Rectangle (1992) (73)
- The edge-disjoint paths problem is NP-complete for series-parallel graphs (2001) (67)
- Handbook of graph theory, combinatorial optimization, and algorithms (2016) (63)
- Lower bounds on the cardinality of the maximum matchings of planar graphs (1979) (61)
- A Linear 5-Coloring Algorithm of Planar Graphs (1981) (55)
- A Better than "Best Possible" Algorithm to Edge Color Multigraphs (1986) (52)
- Orthogonal Drawings of Plane Graphs Without Bends (2001) (50)
- A Linear Algorithm for Bipartition of Biconnected Graphs (1990) (46)
- Rectangular grid drawings of plane graphs (1996) (45)
- A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs (1996) (45)
- Edge-Coloring and f-Coloring for Various Classes of Graphs (1994) (44)
- Drawing plane graphs nicely (1985) (43)
- Generalized Vertex-Colorings of Partial K-Trees (2000) (42)
- On the f-coloring of multigraphs (1988) (42)
- Edge-Coloring Partial k-Trees (1996) (41)
- Grid Drawings of 4-Connected Plane Graphs (2001) (41)
- Rectangular drawings of planar graphs (2002) (39)
- An approximation algorithm for the hamiltonian walk problem on maximal planar graphs (1980) (38)
- A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four Connected Planar Graphs (1999) (38)
- An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks (1985) (37)
- Efficient Compression of Web Graphs (2008) (35)
- An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs (1982) (34)
- A Linear-Time Routing Algorithm for Convex Grids (1985) (33)
- Planar Multicommodity Flows, Maximum Matchings and Negative Cycles (1986) (32)
- Box-Rectangular Drawings of Plane Graphs (1999) (31)
- A 1-tough nonhamiltonian maximal planar graph (1980) (30)
- An upper bound on the length of a Hamiltonian walk of a maximal planar graph (1980) (30)
- Edge-Coloring Algorithms (1995) (29)
- Improved Edge-Coloring Algorithms for Planar Graphs (1990) (29)
- Partitioning trees of supply and demand (2002) (27)
- Generalized Edge-Rankings of Trees (1995) (27)
- Rectangular drawings of plane graphs without designated corners (2000) (27)
- Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size (2006) (27)
- Finding Steiner forests in planar graphs (1990) (26)
- Algorithms for generalized vertex-rankings of partial k-trees (2000) (24)
- Applications of the Lipton and Tarjan's Planar Separator Theorem (1981) (23)
- Octagonal drawings of plane graphs with prescribed face areas (2004) (23)
- A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs (1996) (22)
- Approximability of partitioning graphs with supply and demand (2006) (22)
- No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs (2003) (21)
- Improvements of HITS Algorithms for Spam Links (2007) (20)
- Generalized Vertex-Rankings of Trees (1995) (20)
- Algorithm for the Cost Edge-Coloring of Trees (2001) (20)
- Canonical Decomposition, Realizer, Schnyder Labeling And Orderly Spanning Trees Of Plane Graphs (2004) (19)
- Convex Grid Drawings of Four-connected Plane Graphs (2000) (19)
- Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends (2005) (19)
- Finding Edge-Disjoint Paths in Partial k -Trees (2000) (18)
- Partitioning Trees with Supply, Demand and Edge-Capacity (2013) (18)
- Bend-Minimum Orthogonal Drawings of Plane 3-Graphs (2002) (18)
- A theorem on paths in planar graphs (1986) (18)
- A complete characterization of a family of key exchange protocols (2002) (17)
- Size-energy tradeoffs for unate circuits computing symmetric Boolean functions (2011) (17)
- List Edge-Colorings of Series-Parallel Graphs (2003) (17)
- Partitioning a Weighted Tree into Subtrees with Weights in a Given Range (2012) (17)
- Inner Rectangular Drawings of Plane Graphs (2004) (16)
- A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs (1997) (16)
- A linear algorithm for five-coloring a planar graph (1980) (16)
- An algorithm for edge-coloring of multigraphs (1984) (16)
- No-bend Orthogonal Drawings of Series-Parallel Graphs (2005) (15)
- A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees (1998) (15)
- Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key (1999) (15)
- Grid Drawings of Four-Connected Plane Graphs (1999) (15)
- Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming (1994) (15)
- Shortest noncrossing paths in plane graphs (1996) (15)
- Total Colorings Of Degenerate Graphs (2007) (15)
- Convex Drawings of Plane Graphs of Minimum Outer Apices (2005) (14)
- Parametric power supply networks (2013) (14)
- Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs (1992) (14)
- Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions (1993) (14)
- Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs (2006) (14)
- Finding optimal edge-rankings of trees (1995) (13)
- Labeling Points with Rectangles of Various Shapes (2000) (12)
- On the maximum matchings of regular multigraphs (1981) (12)
- Minimum Cost Partitions of Trees with Supply and Demand (2010) (12)
- Scheduling File Transfers under Port and Channel Constraints (1991) (12)
- Total Colorings of Degenerated Graphs (2001) (12)
- List total colorings of series-parallel graphs (2003) (12)
- Energy and depth of threshold circuits (2010) (11)
- A Linear Algorithm for Edge-Coloring Partial k-Trees (1993) (11)
- Rectangle-of-Influence Drawings of Four-Connected Plane Graphs (2005) (11)
- Characterization of optimal key set protocols (2000) (10)
- Algorithms for finding distance-edge-colorings of graphs (2005) (10)
- A linear algorithm for compact box‐drawings of trees (2003) (10)
- A note on nongraphic matroids (1984) (10)
- The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees (1998) (10)
- Scheduling File Transfers Under Port and Channe; Constraints (1993) (10)
- Necessary and Sufficient Numbers of Cards for the Transformation Protocol (2004) (10)
- An Algorithm for Finding a Region with the Minimum Lotal L1 from Prescribed Terminals (1997) (9)
- An upper bound on the chromatic index of multigraphs (1985) (9)
- Mining Communities on the Web Using a Max-Flow and a Site-Oriented Framework (2005) (9)
- An Efficient Algorithm for Edge-Ranking Trees (1994) (9)
- k-Connectivity and Decomposition of Graphs into Forests (1994) (9)
- Optimal parallel algorithm for edge-coloring partial k-trees with bounded degrees (1994) (9)
- A Parallel Algorithm for Edge-Coloring Partial k-Trees (1994) (9)
- Finding a Noncrossing Steiner Forest in Plane Graphs Under a 2-Face Condition (2001) (9)
- On the relationship between the genus and the cardinality of the maximum matchings of a graph (1979) (9)
- An algorithm for finding a large independent set in planar graphs (1983) (8)
- A Linear Algorithm for Finding Total Colorings of Partial k-Trees (1999) (8)
- Sequential and parallel algorithms for edge-coloring series-parallel multigraphs (1993) (8)
- Convex Grid Drwaings of Four-Connected Plane Graphs (2000) (8)
- Rectangular Drawing Algorithms (2013) (7)
- Parallel Algorithms for Finding Steiner Forests in Planar Graphs (1990) (7)
- Multicommodity flows in planar undirected graphs and shortest paths (1985) (7)
- Edge-disjoint paths in a grid bounded by two nested rectangles (1990) (7)
- Edge-Coloring Problems for Graphs (1994) (7)
- New Security Index for Digital Fingerprinting and Its Bounds (2003) (7)
- Partitioning graphs of supply and demand (2005) (7)
- Partitioning a Weighted Tree to Subtrees of Almost Uniform Size (2008) (7)
- Spanning Distribution Trees of Graphs (2014) (7)
- Combinatorial problems on series-parallel graphs (1980) (6)
- A Note on the Critical Problem for Matroids (1984) (6)
- Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size (2006) (6)
- Necessary and sufficient condition for a graph to be three-terminal series-parallel (1975) (6)
- Planar Graph Problems (1990) (6)
- A Linear Algorithm for Finding \boldmath[{g,f }]-Colorings of Partial \boldmath{k }-Trees (2000) (6)
- Small grid drawings of planar graphs with balanced partition (2010) (6)
- Algorithms for Drawing Plane Graphs (2004) (6)
- Variable-Priority Queue and Doughnut Routing (1992) (5)
- An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs (1997) (5)
- Eulerian Secret Key Exchange (1998) (5)
- Necessary and sufficient conditions for a graph to be three-terminal series-parallel-cascade (1978) (5)
- On thefg-coloring of graphs (1990) (5)
- Cost Total Colorings of Trees (2004) (4)
- Convex Grid Drawings of Plane Graphs with Rectangular Contours (2006) (4)
- Multicolorings of Series-Parallel Graphs (2004) (4)
- Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size (2004) (4)
- An NC parallel algorithm for generalized vertex-rankings of partial k-trees (1997) (4)
- Algorithms for Finding f-Colorings of Partial k-Trees (1995) (4)
- Size and Energy of Threshold Circuits Computing Mod Functions (2009) (4)
- An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs (1992) (4)
- Algorithms for the Multicolorings of Partial k-Trees (2002) (4)
- Embedding planar graphs using PQ-tree algorithms (1984) (4)
- An algorithm for finding a short closed spanning walk in a graph (1980) (4)
- Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs (2009) (4)
- A Linear-Time Algorithm for c-Triangulating Three-Colored Graphs (1994) (4)
- A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs (1998) (4)
- Algorithms for finding internally disjoint paths in a planar graph (1989) (4)
- Extended Rectangular Drawings of Plane Graphs with Designated Corners (2002) (4)
- Shortest Non-Crossing Rectilinear Paths in Plane Regions (1997) (4)
- Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas (1995) (4)
- A Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas (1999) (4)
- Energy Complexity and Depth of Threshold Circuits (2009) (4)
- Simple Reduction of f-Colorings to Edge-Colorings (1995) (3)
- On the Average Length of Secret Key Exchange Eulerian Circuits (2000) (3)
- Linear Algorithm for Finding List Edge-Colorings of Series-Parallel Graphs (2003) (3)
- An O(p^3) Algorithm for Finding Hamiltonian Cycles in Certain Digraphs (1980) (3)
- A Revised Transformation Protocol for Unconditionally Secure Secret Key Exchange (2008) (3)
- Nearly uniform scheduling of file transfers (1993) (3)
- Minimizing AND-EXOR Expressions for Two-Variable Multiple-Valued Input Binary Output Functions (2010) (3)
- Small grid drawings of planar graphs with balanced partition (2012) (3)
- Algorithms for finding noncrossing paths with minimum total length in plane graphs (1995) (3)
- Graph Algorithms and Applications (2022) (3)
- Convex Drawings of Internally Triconnected Plane Graphs on O(N2) Grids (2009) (3)
- Bandwidth consecutive multicolorings of graphs (2014) (3)
- Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups (2002) (3)
- An algorithm for finding a forest in a planar graph-case in which a net may have terminals on the two specified face boundaries (1989) (3)
- Generalized Vertex-Rankings of Partial k-trees (1997) (3)
- On the One-Way Algebraic Homomorphism (1996) (3)
- Lower Bounds for Combinatorial Problems on Graphs (1985) (2)
- Approximation Algorithms for Bandwidth Consecutive Multicolorings - (Extended Abstract) (2014) (2)
- Finding a Region with the Minimum Total L 1 Distance from Prescribed Terminals (2003) (2)
- Spanning Distribution Forests of Graphs - (Extended Abstract) (2014) (2)
- Best Security Index for Digital Fingerprinting (2005) (2)
- Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs (1999) (2)
- Graph Theory and Algorithms, 17th Symposium of Research Institute of Electric Communication, Tohoku University, Sendai, Japan, October 24-25, 1980, Proceedings (1981) (2)
- Planar Reconfiguration of Monotone Trees (2002) (2)
- A Variable Priority Queue and its Applications (1987) (2)
- Generalized Edge-Ranking of Trees (Extended Abstract) (1996) (2)
- Graph Coloring Algorithms (2000) (2)
- Algorithms for Bandwidth Consecutive Multicolorings of Graphs - (Extended Abstract) (2012) (2)
- Parametric Power Supply Networks with Edge-Capacities∗ (2015) (1)
- Sharing secret keys along a Eulerian circuit (2000) (1)
- Editors' Introduction to Special Section on Discrete Algorithms and Complexity (1991) (1)
- Decompositions to Degree-Constrainded Subgraphs Are Simply Reducible to Edge-Colorings (1999) (1)
- One-Way Functions over Finite Near-Rings (1995) (1)
- Box-Rectangular Drawings of Plane Graphs (Extended Abstract) (1999) (1)
- Necessary and Sufficient Numbers of Cards for the Transformation Protocol (Extended Abstract) (2004) (1)
- Orthogonal Drawings of Plane Graphs without Bends (Extended Abstract) (2002) (1)
- Automatic Drawings of Graphs (1999) (1)
- Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs (2015) (1)
- An algorithm for multicommodity flows in a class of planar networks (1987) (1)
- Absolutely Secure Message Transmission using a Key Sharing Graph (2012) (1)
- Algorithms for Routing around a Rectangle: Extended Abstract (1987) (1)
- Proceedings of the Third International Symposium on Algorithms and Computation (1992) (1)
- Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract) (1996) (1)
- Drawing Plane Graphs (2003) (1)
- Minimum Cost Partitions of Trees with Supply and Demand (2011) (1)
- An Algorithm for Finding [g,f] - Colorings of Partial k - Trees (1996) (0)
- Editors' foreword (1994) (0)
- Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups (New Developments of Theory of Computation and Algorithms) (2001) (0)
- Our bound improves all the previous bounds Sh ] , Go (0)
- Algorithms for Bandwidth Consecutive Multicolorings of Graphs (2011) (0)
- On the three-dimensional orthogonal drawing of outerplanar graphs (2008) (0)
- Algorithms for Finding Spanning Distribution Forests of Graphs (2015) (0)
- Partitioning a Weighted Tree into Subtrees with Weights in a Given Range (2011) (0)
- Edge Addition Planarity Testing Algorithm (2015) (0)
- Algorithms for multicommodity flows in planar graphs (1989) (0)
- Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions (2009) (0)
- Guest Editors' Foreword (2001) (0)
- Proceedings of the 15th international conference on Graph drawing (2007) (0)
- Inner Rectangular Drawings of Plane Graphs (Extended Abstract) (2004) (0)
- Upper bounds for the fg‐chromatic index of graphs (1989) (0)
- Characterization of Optimal Key Set Protocols (Extended Abstract) (2000) (0)
- Proceedings of the Japan-US joint seminar on discrete algorithms and complexity (1987) (0)
- Maximum Supply Rate and Minimum Supply Increase Rate of Supply and Demand Networks (2015) (0)
- Algorithms and Computation (1992) (0)
- Web-Linkage Viewer: Drawing Links in the Web Based on a Site-Oriented Framework (2003) (0)
- On the One-Way Algebraic Homomorphism (Special Section on Cryprography and Information Security) (1996) (0)
- On the Minimization of AND-EXOR Expressions for Multiple-Valued Two-Input Logical Functions (2008) (0)
- Finding Independent Spanning Trees in Partial k-Trees (2000) (0)
- A Necessary and Sufficient Condition on the Numbers of Dealt Cards for Sharing a Secret Key (1999) (0)
- Parametric power supply networks (2013) (0)
- Proceedings of the 17th Symposium of Research Institute of Electric Communication on Graph Theory and Algorithms (1980) (0)
- Planarity Testing Based on PC-Trees (2015) (0)
- Graph Algorithms and Applications (Dagstuhl Seminar 98301) (2021) (0)
- LA-10 A Linear Algorithm for Rectangular Drawings of Planar Graphs (2002) (0)
- PARTITIONING TREES OF SUPPLY A N D D E M A N D TAKEHIRO ITO (0)
- Algorithms for Drawing Plane Graphs( Foundations of Computer Science) (2004) (0)
- Inner Rectangular Drawings of Plane Graphs: Application of Graph Drawing to VLSI Layouts (2007) (0)
- Generalized vertex-rankings of partial k-trees (Extended Abstract) (1997) (0)
- Efficient Algorithms for the Weighted Coloring of Series-Parallel Graphs (2001) (0)
- Su ffi cient Condition and Algorithm for List Total Colorings of Series-Parallel Graphs (2007) (0)
- Algorithms for plane multicommodity flows (1984) (0)
- Sufficient Condition and Algorithm for List Total Colorings of Series-Parallel Graphs (2007) (0)
- On the Complexity of Languages Associated with Discrete Log Cryptosystems (1999) (0)
- Edge-Colorings of Weighted Graphs - (Extended Abstract) (2015) (0)
- Proceedings of the International Symposium on Algorithms (1990) (0)
- Generalized edge-colorings of weighted graphs (2016) (0)
- Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings (2010) (0)
- Quantum Card Dealing (2003) (0)
This paper list is powered by the following services:
Other Resources About Takao Nishizeki
What Schools Are Affiliated With Takao Nishizeki?
Takao Nishizeki is affiliated with the following schools:
