Antonios Varvitsiotis

most citedAlgebraic methods for counting Euclidean embeddings of rigid graphs

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2011

Computing the Grothendieck constant of some graph classes

Monique Laurent, Antonios Varvitsiotis

Given a graph $G = ([n], E)$ and $w \in R^{E}$ , consider the integer program $max_{x \in {\pm 1}^{n}} \sum_{ij \in E} w_{ij} x_{i} x_{j}$ and its canonical semidefinite programming relaxatio…

cs.CG2009★ 1 cited

Algebraic methods for counting Euclidean embeddings of rigid graphs

Ioannis Z. Emiris, Elias P. Tsigaridas, Antonios Varvitsiotis

The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings of such g…