10 citations · 15 across the 5 of their papers we have counts for
5 papers
Computing and Bounding the Number of Eulerian Orientations for Certain Classes of -Regular Graphs
Evangelos Bartzos, Michalis Samaris
An Eulerian orientation of a -regular undirected graph (simple or multigraph) with vertices is an assignment of directions to its edges such that every vertex…
New upper bounds for the number of embeddings of minimally rigid graphs
Evangelos Bartzos, Ioannis Z. Emiris, Raimundas Vidunas
By definition, a rigid graph in (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings a…
On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs
Evangelos Bartzos, Ioannis Z. Emiris, Josef Schicho
Rigid graph theory is an active area with many open problems, especially regarding embeddings in or other manifolds, and tight upper bounds on their number for a giv…
On the maximal number of real embeddings of minimally rigid graphs in , and
Evangelos Bartzos, Ioannis Z. Emiris, Jan Legerský +1
Rigidity theory studies the properties of graphs that can have rigid embeddings in a euclidean space or on a sphere and which in addition satisfy certain edge length…
On the maximal number of real embeddings of spatial minimally rigid graphs
Evangelos Bartzos, Ioannis Emiris, Jan Legerský +1
The number of embeddings of minimally rigid graphs in is (by definition) finite, modulo rigid transformations, for every generic choice of edge lengths. Even though…