default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEhab Morsy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j13]Riham Moharam
, Ahmed Fouad Ali, Ehab Morsy, Mohamed Ali Ahmed, Mostafa-Sami M. Mostafa:
A Discrete Chimp Optimization Algorithm for Minimizing Tardy/Lost Penalties on a Single Machine Scheduling Problem. IEEE Access 10: 52126-52138 (2022)
2010 – 2019
- 2017
- [j12]Riham Moharam, Ehab Morsy:
Genetic algorithms to balanced tree structures in graphs. Swarm Evol. Comput. 32: 132-139 (2017) - 2016
- [j11]Ehab Morsy:
Approximating the k-splittable capacitated network design problem. Discret. Optim. 22: 328-340 (2016) - [j10]Ehab Morsy:
An extension of Hall's theorem for partitioned bipartite graphs. Inf. Process. Lett. 116(11): 706-709 (2016) - [j9]David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Aravind Srinivasan:
Efficient computation of sparse structures. Random Struct. Algorithms 49(2): 322-344 (2016) - 2015
- [j8]Ehab Morsy, Erwin Pesch:
Approximation algorithms for inventory constrained scheduling on a single machine. J. Sched. 18(6): 645-653 (2015) - [c10]Riham Moharam, Ehab Morsy, Ismail A. Ismail:
Genetic Algorithms for the Tree T-Spanner Problem. AISI 2015: 437-448 - [c9]Riham Moharam, Ehab Morsy, Ismail A. Ismail:
Genetic algorithms for balanced spanning tree problem. FedCSIS 2015: 537-545 - [c8]Mahmoud Gamal, Ehab Morsy, Ahmed Fathy:
Multi-Objective transmitters Placement Problem in wireless Networks. SoICT 2015: 156-162 - 2013
- [c7]David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Aravind Srinivasan:
Efficient Computation of Balanced Structures. ICALP (2) 2013: 581-593 - [c6]Ehab Morsy:
Approximating the k-Splittable Capacitated Network Design Problem. SOFSEM 2013: 344-355 - [c5]John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Eli Upfal:
Storage and search in dynamic peer-to-peer networks. SPAA 2013: 53-62 - [i1]John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Eli Upfal:
Storage and Search in Dynamic Peer-to-Peer Networks. CoRR abs/1305.1121 (2013) - 2011
- [j7]Ehab Morsy, Hiroshi Nagamochi:
Approximating capacitated tree-routings in networks. J. Comb. Optim. 21(2): 254-267 (2011) - [j6]Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi:
Minmax Tree Cover in the Euclidean Space. J. Graph Algorithms Appl. 15(3): 345-371 (2011) - 2010
- [j5]Ehab Morsy, Hiroshi Nagamochi:
Approximation to the Minimum Cost Edge Installation Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(4): 778-786 (2010) - [j4]Ehab Morsy, Hiroshi Nagamochi:
On the approximation of the generalized capacitated tree-routing problem. J. Discrete Algorithms 8(3): 311-320 (2010) - [j3]Shunsuke Ota, Ehab Morsy, Hiroshi Nagamochi:
A plane graph representation of triconnected graphs. Theor. Comput. Sci. 411(44-46): 3979-3993 (2010)
2000 – 2009
- 2009
- [b1]Ehab Morsy:
Approximation algorithms to the capacitated tree-routings in networks. Kyoto University, Japan, 2009 - [c4]Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi:
Minmax Tree Cover in the Euclidean Space. WALCOM 2009: 202-213 - 2008
- [j2]Ehab Morsy, Hiroshi Nagamochi:
An improved approximation algorithm for capacitated multicast routings in networks. Theor. Comput. Sci. 390(1): 81-91 (2008) - [c3]Ehab Morsy, Hiroshi Nagamochi:
Approximating the Generalized Capacitated Tree-Routing Problem. COCOON 2008: 621-630 - 2007
- [j1]Ehab Morsy, Hiroshi Nagamochi:
Approximation Algorithms for Multicast Routings in a Network with Multi-Sources. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(5): 900-906 (2007) - [c2]Ehab Morsy, Hiroshi Nagamochi:
Approximation to the Minimum Cost Edge Installation Problem. ISAAC 2007: 292-303 - [c1]Ehab Morsy, Hiroshi Nagamochi:
Approximating Capacitated Tree-Routings in Networks. TAMC 2007: 342-353
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
