Evangelos Bartzos

Orcid: 0000-0002-3117-9694

According to our database1, Evangelos Bartzos authored at least 8 papers between 2018 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
An asymptotic upper bound for graph embeddings.
Discret. Appl. Math., 2023

2022
Bounds on the maximal number of graph embeddings. (Bornes sur le nombre maximal de plongements de graphes).
PhD thesis, 2022

New Upper Bounds for the Number of Embeddings of Minimally Rigid Graphs.
Discret. Comput. Geom., 2022

Bounding the Number of Roots of Multi-Homogeneous Systems.
Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

2021
On the maximal number of real embeddings of minimally rigid graphs in R2, R3 and <i>S</i><sup>2</sup>.
J. Symb. Comput., 2021

The m-Bézout Bound and Distance Geometry.
Proceedings of the Computer Algebra in Scientific Computing - 23rd International Workshop, 2021

2020
On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs.
Appl. Algebra Eng. Commun. Comput., 2020

2018
On the Maximal Number of Real Embeddings of Spatial Minimally Rigid Graphs.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018


  Loading...