Ehab Morsy - RankMe

25 papers B 4C 2Misc 1Journal 14Unranked 3

Year	Rank	Type	Title / Venue / Authors
2022	J	`jnl`	A Discrete Chimp Optimization Algorithm for Minimizing Tardy/Lost Penalties on a Single Machine Scheduling Problem. IEEE Access Riham Moharam, Ahmed Fouad Ali, Ehab Morsy, Mohamed Ali Ahmed, Mostafa-Sami M. Mostafa
2017	J	`jnl`	Genetic algorithms to balanced tree structures in graphs. Swarm Evol. Comput. Riham Moharam, Ehab Morsy
2016	J	`jnl`	An extension of Hall's theorem for partitioned bipartite graphs. Inf. Process. Lett. Ehab Morsy
2016	J	`jnl`	Approximating the k-splittable capacitated network design problem. Discret. Optim. Ehab Morsy
2016	J	`jnl`	Efficient computation of sparse structures. Random Struct. Algorithms David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Aravind Srinivasan
2015	J	`jnl`	Approximation algorithms for inventory constrained scheduling on a single machine. J. Sched. Ehab Morsy, Erwin Pesch
2015	—	`conf`	Genetic Algorithms for the Tree T-Spanner Problem. AISI Riham Moharam, Ehab Morsy, Ismail A. Ismail
2015	C	`conf`	Genetic algorithms for balanced spanning tree problem. FedCSIS Riham Moharam, Ehab Morsy, Ismail A. Ismail
2015	—	`conf`	Multi-Objective transmitters Placement Problem in wireless Networks. SoICT Mahmoud Gamal, Ehab Morsy, Ahmed Fathy
2013	B	`conf`	Approximating the k-Splittable Capacitated Network Design Problem. SOFSEM Ehab Morsy
2013	—	`conf`	Efficient Computation of Balanced Structures. ICALP (2) David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Aravind Srinivasan
2013	J	`jnl`	Storage and Search in Dynamic Peer-to-Peer Networks CoRR John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Eli Upfal
2013	B	`conf`	Storage and search in dynamic peer-to-peer networks. SPAA John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Eli Upfal
2011	J	`jnl`	Approximating capacitated tree-routings in networks. J. Comb. Optim. Ehab Morsy, Hiroshi Nagamochi
2011	J	`jnl`	Minmax Tree Cover in the Euclidean Space. J. Graph Algorithms Appl. Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi
2010	J	`jnl`	A plane graph representation of triconnected graphs. Theor. Comput. Sci. Shunsuke Ota, Ehab Morsy, Hiroshi Nagamochi
2010	J	`jnl`	Approximation to the Minimum Cost Edge Installation Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Ehab Morsy, Hiroshi Nagamochi
2010	J	`jnl`	On the approximation of the generalized capacitated tree-routing problem. J. Discrete Algorithms Ehab Morsy, Hiroshi Nagamochi
2009	—	`—`	Approximation algorithms to the capacitated tree-routings in networks. Ehab Morsy
2009	B	`conf`	Minmax Tree Cover in the Euclidean Space. WALCOM Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi
2008	J	`jnl`	An improved approximation algorithm for capacitated multicast routings in networks. Theor. Comput. Sci. Ehab Morsy, Hiroshi Nagamochi
2008	Misc	`conf`	Approximating the Generalized Capacitated Tree-Routing Problem. COCOON Ehab Morsy, Hiroshi Nagamochi
2007	C	`conf`	Approximating Capacitated Tree-Routings in Networks. TAMC Ehab Morsy, Hiroshi Nagamochi
2007	J	`jnl`	Approximation Algorithms for Multicast Routings in a Network with Multi-Sources. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Ehab Morsy, Hiroshi Nagamochi
2007	B	`conf`	Approximation to the Minimum Cost Edge Installation Problem. ISAAC Ehab Morsy, Hiroshi Nagamochi