Takao Nishizeki
Takao Nishizeki
Tohoku University (Emeritus Professor)
Email verificata su ecei.tohoku.ac.jp - Home page
Titolo
Citata da
Citata da
Anno
Secret sharing scheme realizing general access structure
M Ito, A Saito, T Nishizeki
Electronics and Communications in Japan (Part III: Fundamental Electronic …, 1989
9371989
Arboricity and subgraph listing algorithms
N Chiba, T Nishizeki
SIAM Journal on computing 14 (1), 210-223, 1985
6321985
Planar graphs: Theory and algorithms
T Nishizeki, N Chiba
Elsevier, 1988
4791988
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
3501982
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
3091985
Planar graph drawing
T Nishizeki, MS Rahman
World Scientific, 2004
2832004
Drawing plane graphs nicely
N Chiba, K Onoguchi, T Nishizeki
Acta Informatica 22 (2), 187-201, 1985
1411985
On the 1.1 edge-coloring of multigraphs
T Nishizeki, K Kashiwagi
SIAM Journal on Discrete Mathematics 3 (3), 391-410, 1990
1381990
Linear algorithms for convex drawings of planar graphs
N Chiba, T Yamanouchi, T Nishizeki
Progress in graph theory 173, 153-173, 1984
1231984
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
1221989
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
1131980
Multiple assignment scheme for sharing secret
M Ito, A Saito, T Nishizeki
Journal of Cryptology 6 (1), 15-20, 1993
1051993
Algorithms for routing around a rectangle
A Frank, T Nishizeki, N Saito, H Suzuki, É Tardos
Discrete Applied Mathematics 40 (3), 363-378, 1992
881992
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
842001
Lower bounds on the cardinality of the maximum matchings of planar graphs
T Nishizeki, I Baybars
Discrete Mathematics 28 (3), 255-267, 1979
701979
A better than “best possible” algorithm to edge color multigraphs
DS Hochbaum, T Nishizeki, DB Shmoys
Journal of Algorithms 7 (1), 79-104, 1986
671986
Algorithms for edge-coloring graphs
HN Gabow
Technical Report, 1985
631985
Analysis and design of univariate subdivision schemes
M Sabin
Springer Science & Business Media, 2010
622010
A linear-time algorithm for four-partitioning four-connected planar graphs
S Nakano, MS Rahman, T Nishizeki
Information Processing Letters 62 (6), 315-322, 1997
611997
A linear algorithm for bipartition of biconnected graphs
H Suzuki, N Takahashi, T Nishizeki
Information Processing Letters 33 (5), 227-231, 1990
601990
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20