Theoretical Computer Science, Volume 414
Volume 414, Number 1, January 2012
Eric Angel, Evripidis Bampis, Nicolas Thibault: Randomized truthful algorithms for scheduling selfish tasks on parallel machines. 1-8- Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song: Updating the complexity status of coloring graphs without a fixed induced linear forest. 9-19
- Michel Dekking: Paperfolding morphisms, planefilling curves, and fractal tiles. 20-37
- Katarzyna Jesse-Józefczyk: The possible cardinalities of global secure sets in cographs. 38-46
- Marion Le Gonidec: On the complexity of a family of k-context-free sequences. 47-54
- Angsheng Li, Yicheng Pan: Characterizations of locally testable linear- and affine-invariant families. 55-75
- François Petitjean, Pierre Gançarski: Summarizing a set of time series by averaging: From Steiner sequence to compact multiple alignment. 76-91
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-12-04T225754 by the dblp team