( en | de | ru )

 

Disambiguation of "Nagamochi, Hiroshi"

Author of the publication

copydeleteadd this publication to your clipboard
Enumerating Chemical Graphs with Two Disjoint Cycles Satisfying Given Path Frequency Specifications.

, , , , , , and . CoRR, (2020)

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

Kernel Methods for Chemical Compounds: From Classification to Design., and . IEICE Trans. Inf. Syst., 94-D (10): 1846-1853 (2011)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)An improved approximation algorithm for capacitated multicast routings in networks., and . Theor. Comput. Sci., 390 (1): 81-91 (2008)Bounded-Degree Cut is Fixed-Parameter Tractable., and . CoRR, (2020)Multicommodity flows in certain planar directed networks., and . Discret. Appl. Math., 27 (1-2): 125-145 (1990)Minmax Tree Cover in the Euclidean Space., , and . WALCOM, volume 5431 of Lecture Notes in Computer Science, page 202-213. Springer, (2009)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)