The following pages link to Hiroshi Nagamochi (Q187130):
Displaying 50 items.
- An edge-splitting algorithm in planar graphs (Q1402535) (← links)
- 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. (Q1406038) (← links)
- On the minimum local-vertex-connectivity augmentation in graphs (Q1406041) (← links)
- Convex embeddings and bisections of 3-connected graphs (Q1410408) (← links)
- Totally balanced combinatorial optimization games (Q1575068) (← links)
- A faster algorithm for computing minimum 5-way and 6-way cuts in graphs (Q1583693) (← links)
- A fast algorithm for computing minimum 3-way and 4-way cuts (Q1587938) (← links)
- A 2-approximation algorithm for the minimum weight edge dominating set problem (Q1602689) (← links)
- Minimum cost source location problem with vertex-connectivity requirements in digraphs (Q1607133) (← links)
- A linear-time algorithm for testing full outer-2-planarity (Q1727743) (← links)
- Simpler algorithms for testing two-page book embedding of partitioned graphs (Q1748996) (← links)
- Greedy splitting algorithms for approximating multiway partition problems (Q1769071) (← links)
- On the one-sided crossing minimization in a bipartite graph with large degrees (Q1770400) (← links)
- Implementing an efficient minimum capacity cut algorithm (Q1804650) (← links)
- A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree (Q1827840) (← links)
- Polyhedral structure of submodular and posi-modular systems (Q1841887) (← links)
- An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree (Q1861569) (← links)
- A primal-dual approximation algorithm for the survivable network design problem in hypergraphs (Q1861578) (← links)
- An approximability result of the multi-vehicle scheduling problem on a path with release and handling times (Q1884949) (← links)
- On generalized greedy splitting algorithms for multiway partition problems (Q1887049) (← links)
- Confining sets and avoiding bottleneck cases: a simple maximum independent set algorithm in degree-3 graphs (Q1935804) (← links)
- FPTASs for trimming weighted trees (Q1935805) (← links)
- A simplified \(\widetilde{O}(nm)\) time edge-splitting algorithm in undirected graphs (Q1969943) (← links)
- Optimal augmentation of a 2-vertex-connected multigraph to an \(\ell\)-edge-connected and 3-vertex-connected multigraph (Q1977862) (← links)
- A method for enumerating pairwise compatibility graphs with a given number of vertices (Q1983131) (← links)
- Exact algorithms for maximum independent set (Q2013558) (← links)
- Path-monotonic upward drawings of graphs (Q2019444) (← links)
- Enumeration of support-closed subsets in confluent systems (Q2134743) (← links)
- Re-embedding a 1-plane graph for a straight-line drawing in linear time (Q2235768) (← links)
- An approximation of the minimum vertex cover in a graph (Q2258357) (← links)
- A fast algorithm for cactus representations of minimum cuts (Q2258383) (← links)
- Some reduction operations to pairwise compatibility graphs (Q2338220) (← links)
- Exact algorithms for dominating induced matching based on graph partition (Q2352792) (← links)
- An improved exact algorithm for undirected feedback vertex set (Q2355979) (← links)
- Approximating the minmax rooted-tree cover in a tree (Q2380018) (← links)
- Counting edge crossings in a 2-layered drawing (Q2390316) (← links)
- A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners (Q2428681) (← links)
- Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems (Q2428700) (← links)
- Approximability of the capacitated \(b\)-edge dominating set problem (Q2456372) (← links)
- The source location problem with local 3-vertex-connectivity requirements (Q2462389) (← links)
- Generalizing the induced matching by edge capacity constraints (Q2467130) (← links)
- An improved approximation algorithm for capacitated multicast routings in networks (Q2474074) (← links)
- Approximating a vehicle scheduling problem with time windows and handling times (Q2481960) (← links)
- An improved bound on the one-sided minimum crossing number in two-layered drawings (Q2484013) (← links)
- Straight-line drawing algorithms for hierarchical graphs and clustered graphs (Q2492625) (← links)
- Augmenting a \((k-1)\)-vertex-connected multigraph to an \(\ell\)-edge-connected and \(k\)-vertex-connected multigraph (Q2492637) (← links)
- Minmax subtree cover problem on cacti (Q2495907) (← links)
- Augmenting forests to meet odd diameter requirements (Q2506822) (← links)
- A robust algorithm for bisecting a triconnected graph with two resource sets (Q2566018) (← links)
- Packing unit squares in a rectangle (Q2571280) (← links)
