( en | de | ru )

 

Disambiguation of "Nagamochi, Hiroshi"

Author of the publication

copydeleteadd this publication to your clipboard
A Simple Recognition of Maximal Planar Graphs

, , and . Information Processing Letters, 89 (5): 223--226 (2004)
DOI: 10.1016/j.ipl.2003.11.011

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

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)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)Vehicle scheduling on a tree with release and handling times., , and . Ann. Oper. Res., (1997)A novel method for inference of chemical compounds with prescribed topological substructures based on integer programming., and . CoRR, (2020)An FPT algorithm for edge subset feedback edge set., and . Inf. Process. Lett., 112 (1-2): 5-9 (2012)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)