( en | de | ru )

 

Disambiguation of "Nagamochi, Hiroshi"

Author of the publication

copydeleteadd this publication to your clipboard
An Approximation Algorithm for Locating Maximal Disks within Convex Polygons.

, , and . Int. J. Comput. Geom. Appl., 21 (6): 661-684 (2011)

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

Practical Algorithms for Two-Dimensional Packing of Rectangles., , and . Handbook of Approximation Algorithms and Metaheuristics (1), Chapman and Hall/CRC, (2018)An A* Algorithm Framework for the Point-to-Point Time-Dependent Shortest Path Problem., , , and . CGGA, volume 7033 of Lecture Notes in Computer Science, page 154-163. Springer, (2010)An Improved Bound on the One-Sided Minimum Crossing Number in Two-Layered Drawings.. Discret. Comput. Geom., 33 (4): 569-591 (2005)Packing Soft Rectangles.. Int. J. Found. Comput. Sci., 17 (5): 1165-1178 (2006)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)Counting edge crossings in a 2-layered drawing., and . Inf. Process. Lett., 91 (5): 221-225 (2004)Computing All Small Cuts in an Undirected Network., , and . SIAM J. Discret. Math., 10 (3): 469-481 (1997)Contention-Free lambda-Planes in Optically Burst-Switched WDM Networks., , , and . IEICE Trans. Commun., 90-B (9): 2524-2531 (2007)Generation of Symmetric and Asymmetric Biconnected Rooted Triangulated Planar Graphs., and . IEICE Trans. Inf. Syst., 94-D (2): 200-210 (2011)