Christos Konaxis

Christos Konaxis is a researcher affiliated with the Department of Informatics and Telecommunications at the National and Kapodistrian University of Athens. His academic career spans over a decade, with significant contributions to computational geometry and algebraic algorithms. He serves as Technical Coordinator for major European research projects including GRAPES (Learning, processing and optimising shapes) and previously ARCADES (Algebraic Representations in Computer-Aided Design for complEx Shapes).

Dr. Konaxis specializes in computational geometry, algebraic algorithms, and computer-aided design. His research focuses on implicitization techniques, polynomial systems, resultant polytopes, and sparse interpolation methods. He has developed novel algorithms for computing Newton polygons, Minkowski sums, and geometric operations using matrix representations. His work bridges theoretical algebraic geometry with practical applications in geometric modeling and computer-aided design.

His publication record shows a consistent trajectory of high-impact research in computational geometry, with recent work emphasizing efficient algorithms for shape processing and optimization. His articles demonstrate expertise in both theoretical foundations and practical implementations, particularly in developing output-sensitive algorithms and software frameworks for algebraic computations.

• Technical Coordinator, GRAPES Marie Curie Training Network (2019-2024)
• Technical Coordinator, ARCADES Marie Curie Training Network (2016-2019)
• Researcher, Thales Collaborative Project (2012-2015)
• Post-doctoral researcher, ACMAC, University of Crete (2011-2013)

Dr. Konaxis has contributed to numerous research projects funded by European programs, demonstrating strong grant acquisition capabilities. His teaching portfolio includes Algorithms in Structural Bioinformatics, Discrete Mathematics, Computational Algebra, and Computational Geometry, reflecting the breadth of his expertise across theoretical and applied domains.