( en | de | ru )

 

Disambiguation of "Nishizeki, Takao"

Author of the publication

copydeleteadd this publication to your clipboard
Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs.

, , and . Discret. Comput. Geom., 41 (4): 643-670 (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Takao Tsuboi

Takao Ito

Mario Takao Inoue

 

Other publications of authors with the same name

Sufficient Condition and Algorithm for List Total Colorings of Series-Parallel Graphs., , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 90-A (5): 907-916 (2007)Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends., and . SIAM J. Discret. Math., 22 (4): 1570-1604 (2008)Orthogonal drawings of series-parallel graphs with minimum bends., and . WALCOM, page 3-12. Bangladesh Academy of Sciences (BAS), (2007)Sequential and parallel algorithms for edge-coloring series-parallel multigraphs., , and . IPCO, page 129-145. CIACO, (1993)A Linear Algorithm for Edge-Coloring Partial k-Trees., , and . ESA, volume 726 of Lecture Notes in Computer Science, page 409-418. Springer, (1993)The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees., and . ISAAC, volume 1533 of Lecture Notes in Computer Science, page 417-426. Springer, (1998)Edge-Coloring Partial k-Trees., , and . J. Algorithms, 21 (3): 598-617 (1996)A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees., , and . Int. J. Found. Comput. Sci., 10 (2): 171-194 (1999)Partitioning Trees of Supply and Demand., , and . ISAAC, volume 2518 of Lecture Notes in Computer Science, page 612-623. Springer, (2002)Approximability of Partitioning Graphs with Supply and Demand., , , and . ISAAC, volume 4288 of Lecture Notes in Computer Science, page 121-130. Springer, (2006)