( en | de | ru )

 

Disambiguation of "Nagamochi, Hiroshi"

Author of the publication

copydeleteadd this publication to your clipboard
A Linear-Time Algorithm for Integral Multiterminal Flows in Trees.

, and . ISAAC, volume 64 of LIPIcs, page 62:1-62:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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 Murata

Hiroshi Kawabe

Hiroshi Kubota

Hiroshi Uchida

Hiroshi Fukuzaki

 

Other publications of authors with the same name

Counting edge crossings in a 2-layered drawing., and . Inf. Process. Lett., 91 (5): 221-225 (2004)Multigraph augmentation under biconnectivity and general edge-connectivity requirements., , and . Networks, 37 (3): 144-155 (2001)Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks., , and . Networks, 39 (4): 203-209 (2002)Packing Soft Rectangles.. Int. J. Found. Comput. Sci., 17 (5): 1165-1178 (2006)Network Design with Edge-Connectivity and Degree Constraints., and . Theory Comput. Syst., 45 (3): 512-532 (2009)Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs., , and . Algorithmica, 56 (4): 413-436 (2010)Practical Algorithms for Two-Dimensional Packing of Rectangles., , and . Handbook of Approximation Algorithms and Metaheuristics (1), Chapman and Hall/CRC, (2018)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)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)