Ehab Abdelhamid
Senior Software Engineering at Ford Motor Company
Saint Paul, Minnesota, United States
Summary
👤
Senior🎓
Top SchoolEhab Abdelhamid is a Senior Software Engineer with 12 years of experience building and leading development teams across corporate and consulting environments, currently contributing to Ford Motor Company from Saint Paul, Minnesota. He has a strong track record in system design, quality-driven development, and end-to-end delivery from roles at IBM and as a lead at Winter Partners where he managed teams of seven engineers. Comfortable with both hands-on coding and project-level coordination, he has repeatedly owned complex deployments, troubleshooting, and production support in enterprise settings. His academic background includes a Master of Computer Applications and a bachelor’s in Computer Science, which complement a pragmatic approach to translating requirements into testable, maintainable modules. Known for balancing technical depth with clear communication, he routinely bridges stakeholders and engineering to keep projects on schedule. A detail often missed: he brings international experience from Egypt to the U.S. market, giving him a broader perspective on cross-cultural collaboration and client-facing work.
12 years of coding experience
6 years of employment as a software developer
Bachelor's degree, Computer Science and Information System, Bachelor's degree, Computer Science and Information System at Cairo UniversityMaster of Computer Applications - MCA, Computer Science, Master of Computer Applications - MCA, Computer Science at Maharishi University of Management
Arabic, English
Github Skills (20)
approximate10
pattern-mining10
graph10
matching10
pattern10
friend10
mining10
nodes10
clustering-algorithm9
semantic9
cluster-analysis8
subgraph8
clustering-evaluation8
hdbscan7
clustering7
Programming languages (2)
Github contributions (5)
ehab-abdelhamid/GraMi
Mar 2014 - Jun 2018
GraMi is a novel framework for frequent subgraph mining in a single large graph, GraMi outperforms existing techniques by 2 orders of magnitudes. GraMi supports finding frequent subgraphs as well as frequent patterns, Compared to subgraphs, patterns offer a more powerful version of matching that captures transitive interactions between graph nodes (like friend of a friend) which are very common in modern applications. Also, GraMi supports user-defined structural and semantic constraints over the results, as well as approximate results. For more details, check our paper: Mohammed Elseidy, Ehab Abdelhamid, Spiros Skiadopoulos, and Panos Kalnis. GRAMI: Frequent Subgraph and Pattern Mining in a Single Large Graph. PVLDB, 7(7):517-528, 2014.
Contributions:11 commits, 6 pushes, 13 comments in 4 years 3 months
capturessubgraphpatternsfindinginteractions
ehab-abdelhamid/AnalysisLibrary
Mar 2018 - Mar 2018
Contributions:1 commit, 3 pushes, 1 branch in 1 day
Find and Hire Top DevelopersWe’ve analyzed the programming source code of over 60 million software developers on GitHub and scored them by 50,000 skills. Sign-up on Prog,AI to search for software developers.