( en | de | ru )

 

Disambiguation of "Nagamochi, Hiroshi"

Author of the publication

copydeleteadd this publication to your clipboard
A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags.

, and . ISAAC, volume 2906 of Lecture Notes in Computer Science, page 309-318. Springer, (2003)

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.

Hiroshi Kawabe

Hiroshi Murata

Hiroshi Kubota

Hiroshi Uchida

Hiroshi Fukuzaki

 

Other publications of authors with the same name

Bisecting Two Subsets in 3-Connected Graphs., , , and . ISAAC, volume 1741 of Lecture Notes in Computer Science, page 425-434. Springer, (1999)Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems., , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 55-64. Springer, (2009)On the Minimum Local-Vertex-Connectivity Augmentation in Graphs., and . ISAAC, volume 2223 of Lecture Notes in Computer Science, page 124-135. Springer, (2001)A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts., and . IPCO, volume 1610 of Lecture Notes in Computer Science, page 377-390. Springer, (1999)A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs., , and . JCDCGG, volume 9943 of Lecture Notes in Computer Science, page 228-240. Springer, (2015)A Detachment Algorithm for Inferring a Graph from Path Frequency.. COCOON, volume 4112 of Lecture Notes in Computer Science, page 274-283. Springer, (2006)Kernel Methods for Chemical Compounds: From Classification to Design., and . IEICE Trans. Inf. Syst., 94-D (10): 1846-1853 (2011)An improved approximation algorithm for capacitated multicast routings in networks., and . Theor. Comput. Sci., 390 (1): 81-91 (2008)On the approximation of the generalized capacitated tree-routing problem., and . J. Discrete Algorithms, 8 (3): 311-320 (2010)Unranking of small combinations from large sets., , and . J. Discrete Algorithms, (2014)