Ehab Morsy (Selection)

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

6 Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi: Minmax Tree Cover in the Euclidean Space. WALCOM 2009: 202-213

5 Ehab Morsy, Hiroshi Nagamochi: Approximating the Generalized Capacitated Tree-Routing Problem. COCOON 2008: 621-630

4 Ehab Morsy, Hiroshi Nagamochi: An improved approximation algorithm for capacitated multicast routings in networks. Theor. Comput. Sci. 390(1): 81-91 (2008)

3 Ehab Morsy, Hiroshi Nagamochi: Approximation to the Minimum Cost Edge Installation Problem. ISAAC 2007: 292-303

2 Ehab Morsy, Hiroshi Nagamochi: Approximating Capacitated Tree-Routings in Networks. TAMC 2007: 342-353

1 Ehab Morsy, Hiroshi Nagamochi: Approximation Algorithms for Multicast Routings in a Network with Multi-Sources. IEICE Transactions 90-A(5): 900-906 (2007)

Selection of 6 from 6 records - Ehab Morsy has 2 coauthors

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