8 citations · 31 across the 33 of their papers we have counts for
Showing 2010Show all
3 papers · 1 filter
cs.DS2010
Hardness and Approximation of The Asynchronous Border Minimization Problem
Alexandru Popa, Prudence W. H. Wong, Fencol C. C. Yung
We study a combinatorial problem arising from microarrays synthesis. The synthesis is done by a light-directed chemical process. The objective is to minimize unintended illuminatio…
math.MG2010
Uniform Model of Geometric Spaces
Alexandru Popa
Author developed a uniform model for different spaces where distance and angle measure kinds are parameters. This model is calculus centric, but can also be used in theoretical res…
cs.DS2010
Restricted Common Superstring and Restricted Common Supersequence
Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein +1
The {\em shortest common superstring} and the {\em shortest common supersequence} are two well studied problems having a wide range of applications. In this paper we consider both…