In: Networks, 2008, vol. 51, no. 4, p. 256-267
An extension of the basic image reconstruction problem in discrete tomography is considered: given a graph G = (V,E) and a family equation image of chains Pi together with vectors h(Pi) = (h1, . . . , hik), one wants to find a partition V1,…,Vk of V such that for each Pi and each color j, |Vj ∩ Pi| = hij. An interpretation in terms of scheduling is presented. We consider special cases of...
|
In: Journal of The American Society for Mass Spectrometry, 2013, vol. 24, no. 2, p. 249-256
|
In: Skeletal Radiology, 2012, vol. 41, no. 8, p. 971-980
|
In: Journal of Nonverbal Behavior, 2011, vol. 35, no. 1, p. 1-16
|
In: at - Automatisierungstechnik, 2010, vol. 58, no. 1, p. 15-25
|