( en | de | ru )

 

Disambiguation of "Ishii, Toshimasa"

Author of the publication

copydeleteadd this publication to your clipboard
A tight upper bound on the (2,1)-total labeling number of outerplanar graphs

, , , and . CoRR, (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.

Kei Ishii

Nobuhisa Ishii

Kiyoko Finger-Ishii

 

Other publications of authors with the same name

Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph., , and . Algorithmica, 44 (3): 257-280 (2006)Posi-modular Systems with Modulotone Requirements under Permutation Constraints., and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 473-482. Springer, (2009)A robust algorithm for bisecting a triconnected graph with two resource sets., , and . Theor. Comput. Sci., 341 (1-3): 364-378 (2005)An O(n1.75) algorithm for L(2, 1)-labeling of trees., , , and . Theor. Comput. Sci., 410 (38-40): 3702-3710 (2009)Algorithmic aspects of distance constrained labeling: a survey., , , and . Int. J. Netw. Comput., 4 (2): 251-259 (2014)A linear time algorithm for L(2,1)-labeling of trees, , , and . CoRR, (2008)The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2., , , and . IWOCA, volume 6460 of Lecture Notes in Computer Science, page 103-106. Springer, (2010)Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs., , and . Algorithmica, 56 (4): 413-436 (2010)Multigraph augmentation under biconnectivity and general edge-connectivity requirements., , and . Networks, 37 (3): 144-155 (2001)On the Minimum Local-Vertex-Connectivity Augmentation in Graphs., and . ISAAC, volume 2223 of Lecture Notes in Computer Science, page 124-135. Springer, (2001)