Sciweavers

COMGEO
2010
ACM
14 years 9 months ago
Mixed volume techniques for embeddings of Laman graphs
We use Bernstein's Theorem [1] to obtain combinatorial bounds for the number of embeddings of Laman graph frameworks modulo rigid motions. For this, we study the mixed volume...
Reinhard Steffens, Thorsten Theobald
CCCG
2001
14 years 10 months ago
Geometric permutations of balls with bounded size disparity
We study combinatorial bounds for geometric permutations of balls with bounded size disparity in d-space. Our main contribution is the following theorem: given a set S of n disjoi...
Yunhong Zhou, Subhash Suri
FOCS
1995
IEEE
15 years 11 days ago
Reconstructing Strings from Substrings in Rounds
We establish a variety of combinatorial bounds on the tradeo s inherent in reconstructing strings using few rounds of a given number of substring queries per round. These results ...
Dimitris Margaritis, Steven Skiena