Charalambos Tzamos

Bio

Charalambos Tzamos obtained his BSc in Computer Science from NKU Athens in 2019, and his MSc in Algorithms, Logic and Discrete Mathematics from NKU Athens in 2021. Currently, he is a Ph.D. student working on combining algebraic and learning-based approaches for Camera Geometry Estimation at the Visual Recognition Group, Czech Technical University in Prague under the supervision of Professor Zuzana Kúkelová. His research focuses on providing approximate solutions to minimal problems in computer vision, using machine learning algorithms. He has also worked on counting solutions of polynomial systems that correspond to certain combinatorial objects. He has been a member of ΕρΓα Lab since 2018, working with Professor Ioannis Emiris.

News

07/12/2022

One paper accepted to be published in Discrete Applied Mathematics Journal.

01/09/2022

Started my Ph.D. at Visual Recognition Group, Czech Technical University.

30/07/2022

One paper has been selected to appear in the ACM Showcase.

08/05/2022

One paper got accepted at ISSAC'22.

01/05/2022

Just started my new position as a Research Fellow at Visual Recognition Group, Czech Technical University.

Journal Publications

J. DAM 2023
[link]

E. Bartzos, I.Z. Emiris, C. Tzamos. An asymptotic upper bound for graph embeddings, Discrete Applied Mathematics, vol. 327, pp. 157–177, 2023. Acceptance rate: 29%

Conference Publications

ISSAC 2022
[link]

E. Bartzos, I.Z. Emiris, I.S. Kotsireas, and C. Tzamos. 2022. Bounding the Number of Roots of Multi-Homogeneous Systems. In Proceedings of the 2022 Int’l Symposium on Symbolic and Algebraic Computation (ISSAC ’22), July 4–7, 2022, Villeneuve-d’Ascq, France. ACM, New York, NY, USA, 8 pages. (A*)

CASC 2021
[link]

E. Bartzos, I.Z. Emiris, C. Tzamos. 2021. The m-Bézout Bound and Distance Geometry. In: Boulier F., England M., Sadykov T.M., Vorozhtsov E.V. (eds) Computer Algebra in Scientific Computing. CASC 2021. Lecture Notes in Computer Science, vol 12865. Springer, Cham.

Theme adapted from orderedlist/minimal.