| |
| 2009 | ||
|---|---|---|
| 6 | EE | Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi: Minmax Tree Cover in the Euclidean Space. WALCOM 2009: 202-213 |
| 2008 | ||
| 5 | EE | Ehab Morsy, Hiroshi Nagamochi: Approximating the Generalized Capacitated Tree-Routing Problem. COCOON 2008: 621-630 |
| 4 | EE | Ehab Morsy, Hiroshi Nagamochi: An improved approximation algorithm for capacitated multicast routings in networks. Theor. Comput. Sci. 390(1): 81-91 (2008) |
| 2007 | ||
| 3 | EE | Ehab Morsy, Hiroshi Nagamochi: Approximation to the Minimum Cost Edge Installation Problem. ISAAC 2007: 292-303 |
| 2 | EE | Ehab Morsy, Hiroshi Nagamochi: Approximating Capacitated Tree-Routings in Networks. TAMC 2007: 342-353 |
| 1 | EE | Ehab Morsy, Hiroshi Nagamochi: Approximation Algorithms for Multicast Routings in a Network with Multi-Sources. IEICE Transactions 90-A(5): 900-906 (2007) |
| 1 | Seigo Karakawa | [6] |
| 2 | Hiroshi Nagamochi | [1] [2] [3] [4] [5] [6] |