Follow
Takao Nishizeki
Takao Nishizeki
Tohoku University (Emeritus Professor)
Verified email at ecei.tohoku.ac.jp - Homepage
Title
Cited by
Cited by
Year
Secret sharing scheme realizing general access structure
M Ito, A Saito, T Nishizeki
Electronics and Communications in Japan (Part III: Fundamental Electronic …, 1989
11301989
Arboricity and subgraph listing algorithms
N Chiba, T Nishizeki
SIAM Journal on computing 14 (1), 210-223, 1985
8151985
Planar graphs: Theory and algorithms
T Nishizeki, N Chiba
Elsevier, 1988
5411988
Linear-time computability of combinatorial problems on series-parallel graphs
K Takamizawa, T Nishizeki, N Saito
Journal of the ACM (JACM) 29 (3), 623-641, 1982
4041982
Planar graph drawing
T Nishizeki, MS Rahman
World Scientific, 2004
3622004
A linear algorithm for embedding planar graphs using PQ-trees
N Chiba, T Nishizeki, S Abe, T Ozawa
Journal of computer and system sciences 30 (1), 54-76, 1985
3461985
Drawing plane graphs nicely
N Chiba, K Onoguchi, T Nishizeki
Acta Informatica 22, 187-201, 1985
1701985
On the 1.1 edge-coloring of multigraphs
T Nishizeki, K Kashiwagi
SIAM Journal on Discrete Mathematics 3 (3), 391-410, 1990
1431990
Linear algorithms for convex drawings of planar graphs
N Chiba
Progress in graph theory, 153-173, 1984
1401984
NP-completeness of the Hamiltonian cycle problem for bipartite graphs
T Akiyama, T Nishizeki, N Saito
Journal of Information processing 3 (2), 73-76, 1980
1401980
The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
N Chiba, T Nishizeki
Journal of Algorithms 10 (2), 187-211, 1989
1361989
Multiple assignment scheme for sharing secret
M Ito, A Saito, T Nishizeki
Journal of Cryptology 6 (1), 15-20, 1993
1281993
Algorithms for edge coloring bipartite graphs
HN Gabow, O Kariv
Proceedings of the tenth annual ACM symposium on Theory of computing, 184-192, 1978
1001978
The edge-disjoint paths problem is NP-complete for series–parallel graphs
T Nishizeki, J Vygen, X Zhou
Discrete Applied Mathematics 115 (1-3), 177-186, 2001
972001
Algorithms for routing around a rectangle
A Frank, T Nishizeki, N Saito, H Suzuki, É Tardos
Discrete Applied Mathematics 40 (3), 363-378, 1992
921992
Handbook of graph theory, combinatorial optimization, and algorithms
K Thulasiraman, S Arumugam, A Brandstädt
(No Title), 2016
782016
Lower bounds on the cardinality of the maximum matchings of planar graphs
T Nishizeki, I Baybars
Discrete Mathematics 28 (3), 255-267, 1979
781979
A better than “best possible” algorithm to edge color multigraphs
DS Hochbaum, T Nishizeki, DB Shmoys
Journal of Algorithms 7 (1), 79-104, 1986
721986
Edge-coloring partialk-trees
X Zhou, S Nakano, T Nishizeki
Journal of Algorithms 21 (3), 598-617, 1996
681996
A linear algorithm for bend-optimal orthogonal drawings of triconnected cubic plane graphs
MS Rahman, S Nakano, T Nishizeki
Graph Algorithms And Applications I, 343-374, 2002
652002
The system can't perform the operation now. Try again later.
Articles 1–20