Hiroshi Nagamochi - Concepedia

Author

Hiroshi Nagamochi

Also Known As

H. NAGAMOCHI, H. Nagamochi, HIROSHI NAGAMOCHI, Hiroshi NAGAMOCHI, Hiroshi Nagamochi, Nagamochi Hiroshi, Nagamochi, Hiroshi, Naor, Moni

466

Publications

5.1K

Citations

H-Index

109

Concepts

All Affiliations

Kyoto University Kyoto University Institute for Chemical Research Toyohashi University of Technology Kyoto Institute of Technology University of Electronic Science and Technology of China

About

Hiroshi Nagamochi is an author at Kyoto University specializing in engineering, combinatorial optimization, and discrete mathematics.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	28	76	3.2K
2	Business	16	20	702
3	Education	15	22	1.3K
4	Natural Sciences	9	9	338
5	Medicine	1	1	16

Hiroshi Nagamochi

Publications

3.7K

Citations

H-Index

Page 1

	Year	Citations
Computing Edge-Connectivity in Multigraphs and Capacitated Graphs Hiroshi Nagamochi, Toshihide Ibaraki SIAM Journal on Discrete Mathematics Directed GraphEngineeringPlanar GraphNetwork AnalysisEducation	1992	393
A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph Hiroshi Nagamochi, Toshihide Ibaraki Algorithmica Graph SparsityNetwork ScienceGraph TheoryEngineeringStructural Graph Theory	1992	363
Algorithmic Aspects of the Core of Combinatorial Optimization Games Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi Mathematics of Operations Research Mathematical ProgrammingEngineeringCombinatorial GameGame TheoryComputational Complexity	1999	189
Exact algorithms for maximum independent set Mingyu Xiao, Hiroshi Nagamochi Information and Computation Mathematical ProgrammingEngineeringMaximum Independent SetAlgorithmic Information TheoryExtremal Set Theory	2017	133
Exact algorithms for the two-dimensional strip packing problem with and without rotations Mitsutoshi Kenmochi, Takashi Imamichi, Koji Nonobe, European Journal of Operational Research Geometric ModelingMathematical ProgrammingDiscrete GeometryEngineeringGeometric Algorithm	2008	126
An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem Takashi Imamichi, Mutsunori Yagiura, Hiroshi Nagamochi Discrete Optimization Mathematical ProgrammingEngineeringNonlinear ProgrammingOptimization ProblemCombinatorial Problem	2009	107
Computing All Small Cuts in an Undirected Network Hiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki SIAM Journal on Discrete Mathematics EngineeringPlanar GraphNetwork AnalysisEducationComputational Complexity	1997	83
Implementing an efficient minimum capacity cut algorithm Hiroshi Nagamochi, Tadashi Ono, Toshihide Ibaraki Mathematical Programming Mathematical ProgrammingEngineeringComputer EngineeringAlgorithmic EfficiencyComputational Complexity	1994	77
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs Peter Eades, Qing-Wen Feng, Xuemin Lin, Algorithmica Cluster ComputingStraight-line Drawing AlgorithmsGeometric Graph TheoryEngineeringGraph Theory	2005	73
Greedy splitting algorithms for approximating multiway partition problems Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki Mathematical Programming Greedy Splitting AlgorithmsEngineeringPartition (Database)Optimization ProblemComputer Science	2004	71

Page 1