| |
| 2007 | ||
|---|---|---|
| 3 | EE | Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi: Bisecting a 4-connected graph with three resource sets. Discrete Applied Mathematics 155(11): 1441-1450 (2007) |
| 2005 | ||
| 2 | EE | Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi: Bisecting a Four-Connected Graph with Three Resource Sets. ISAAC 2005: 176-185 |
| 1 | EE | Hiroshi Nagamochi, Kengo Iwata, Toshimasa Ishii: A robust algorithm for bisecting a triconnected graph with two resource sets. Theor. Comput. Sci. 341(1-3): 364-378 (2005) |
| 1 | Toshimasa Ishii | [1] [2] [3] |
| 2 | Hiroshi Nagamochi | [1] [2] [3] |