( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Robust cost colorings.

, , и . SODA, стр. 1204-1212. SIAM, (2008)

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.

Hiroshi Kawabe

Hiroshi Murata

Hiroshi Kubota

Hiroshi Uchida

Hiroshi Fukuzaki

 

Другие публикации лиц с тем же именем

Packing Soft Rectangles.. Int. J. Found. Comput. Sci., 17 (5): 1165-1178 (2006)Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks., , и . Networks, 39 (4): 203-209 (2002)Counting edge crossings in a 2-layered drawing., и . Inf. Process. Lett., 91 (5): 221-225 (2004)A Detachment Algorithm for Inferring a Graph from Path Frequency.. COCOON, том 4112 из Lecture Notes in Computer Science, стр. 274-283. Springer, (2006)Minmax Tree Cover in the Euclidean Space., , и . WALCOM, том 5431 из Lecture Notes in Computer Science, стр. 202-213. Springer, (2009)A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts., и . IPCO, том 1610 из Lecture Notes in Computer Science, стр. 377-390. Springer, (1999)Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems., , и . ISAAC, том 5878 из Lecture Notes in Computer Science, стр. 55-64. Springer, (2009)On the Minimum Local-Vertex-Connectivity Augmentation in Graphs., и . ISAAC, том 2223 из Lecture Notes in Computer Science, стр. 124-135. Springer, (2001)Bisecting Two Subsets in 3-Connected Graphs., , , и . ISAAC, том 1741 из Lecture Notes in Computer Science, стр. 425-434. Springer, (1999)A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs., , и . JCDCGG, том 9943 из Lecture Notes in Computer Science, стр. 228-240. Springer, (2015)