Graph Algorithms & Computational Geometry Developer (Remote/Global)

Deep expertise in graph isomorphism theory and graph manipulation algorithms with proven application in complex computational problems. Advanced knowledge of computational geometry, polygon analysis and manipulation techniques. Extensive experience with search trees, spatial data structures, and their optimization for large-scale data processing. Solid foundation in linear algebra and numerical solvers, especially as applied to geometric or optimization problems. Advanced degree (MS or PhD) in Computer Science, Mathematics, or related field with focus on algorithms or computational geometry. 10+ years of professional experience.

Provide expert consultation on graph isomorphism algorithms and graph manipulation techniques to enhance polygon analysis capabilities. Advise on computational geometry approaches, specifically related to scan-line algorithms and spatial data structure optimization for circuit design testing. Guide the development team on implementing efficient search trees and spatial data structures for polygon manipulation in semiconductor design workflows. Offer strategic recommendations on linear algebra applications and numerical solvers as they relate to circuit optimization problems.