Concepedia

Hiroshi Nagamochi

HN

98

Publications

3.7K

Citations

30

H-Index

1988

Active since

Affiliations

Kyoto University(Current)

Kyoto University Institute for Chemical Research

Toyohashi University of Technology

Kyoto Institute of Technology

University of Electronic Science and Technology of China

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

Top concepts

EngineeringCombinatorial OptimizationDiscrete MathematicsGraph TheoryMathematical ProgrammingComputer ScienceNetwork AnalysisNetwork ScienceComputational ComplexityOperations Research

Publications per year

1988–2021

98

Publications

98

Computing Edge-Connectivity in Multigraphs and Capacitated Graphs

Hiroshi Nagamochi, Toshihide Ibaraki · SIAM Journal on Discrete Mathematics · 1992 · 393 citations

Directed Graph, Engineering, Planar Graph +21

A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph

Hiroshi Nagamochi, Toshihide Ibaraki · Algorithmica · 1992 · 363 citations

Graph Sparsity, Network Science, Graph Theory +13

Algorithmic Aspects of the Core of Combinatorial Optimization Games

Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi · Mathematics of Operations Research · 1999 · 189 citations

Mathematical Programming, Engineering, Combinatorial Game +17

Exact algorithms for maximum independent set

Mingyu Xiao, Hiroshi Nagamochi · Information and Computation · 2017 · 133 citations · Full text

Mathematical Programming, Engineering, Maximum Independent Set +7

Exact algorithms for the two-dimensional strip packing problem with and without rotations

Mitsutoshi Kenmochi, Takashi Imamichi, Koji Nonobe et al. · European Journal of Operational Research · 2008 · 126 citations

Geometric Modeling, Mathematical Programming, Discrete Geometry +13

Rows per page

1–5 of 98