Hiroshi Nagamochi

Computing edge-connectivity in multigraphs and capacitated graphs

Given an undirected graph

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

G = ( V,E )

Algorithmic Aspects of the Core of Combinatorial Optimization Games

, it is known that its edge-connectivity

Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs

\lambda ( G )

Computing All Small Cuts in an Undirected Network

can be computed by solving

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

O( | V | )

An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem

max-flow problems. The best time bounds known for the problem are

A 2-approximation algorithm for the minimum weight edge dominating set problem

O( \lambda ( G ) | V |^2 )

Algorithmic Aspects of Graph Connectivity

, due to Matula (28th IEEE Symposium on the Foundations of Computer Science, 1987, pp. 249–251) if G is simple, and

Implementing an efficient minimum capacity cut algorithm

O( | E |^{3/2} | V | )