Schmied, Richard; Viehmann, Claus Approximating edge dominating set in dense graphs. (English) Zbl 1235.68079 Theor. Comput. Sci. 414, No. 1, 92-99 (2012). MSC: 68Q17 05C85 68W25 PDFBibTeX XMLCite \textit{R. Schmied} and \textit{C. Viehmann}, Theor. Comput. Sci. 414, No. 1, 92--99 (2012; Zbl 1235.68079) Full Text: DOI
Petitjean, François; Gançarski, Pierre Summarizing a set of time series by averaging: from Steiner sequence to compact multiple alignment. (English) Zbl 1232.68105 Theor. Comput. Sci. 414, No. 1, 76-91 (2012). MSC: 68T05 68T20 68W32 PDFBibTeX XMLCite \textit{F. Petitjean} and \textit{P. Gançarski}, Theor. Comput. Sci. 414, No. 1, 76--91 (2012; Zbl 1232.68105) Full Text: DOI
Li, Angsheng; Pan, Yicheng Characterizations of locally testable linear- and affine-invariant families. (English) Zbl 1235.94066 Theor. Comput. Sci. 414, No. 1, 55-75 (2012). MSC: 94B25 11T71 68W30 PDFBibTeX XMLCite \textit{A. Li} and \textit{Y. Pan}, Theor. Comput. Sci. 414, No. 1, 55--75 (2012; Zbl 1235.94066) Full Text: DOI
Le Gonidec, Marion On the complexity of a family of \(k\)-context-free sequences. (English) Zbl 1239.68057 Theor. Comput. Sci. 414, No. 1, 47-54 (2012). Reviewer: Anton Cerny (Safat) MSC: 68R15 68Q45 68Q19 PDFBibTeX XMLCite \textit{M. Le Gonidec}, Theor. Comput. Sci. 414, No. 1, 47--54 (2012; Zbl 1239.68057) Full Text: DOI
Jesse-Józefczyk, Katarzyna The possible cardinalities of global secure sets in cographs. (English) Zbl 1235.05106 Theor. Comput. Sci. 414, No. 1, 38-46 (2012). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C69 05C85 05C75 PDFBibTeX XMLCite \textit{K. Jesse-Józefczyk}, Theor. Comput. Sci. 414, No. 1, 38--46 (2012; Zbl 1235.05106) Full Text: DOI
Dekking, Michel Paperfolding morphisms, planefilling curves, and fractal tiles. (English) Zbl 1243.68231 Theor. Comput. Sci. 414, No. 1, 20-37 (2012). Reviewer: Zoltán Kása (Cluj-Napoca) MSC: 68R15 68Q45 28A78 PDFBibTeX XMLCite \textit{M. Dekking}, Theor. Comput. Sci. 414, No. 1, 20--37 (2012; Zbl 1243.68231) Full Text: DOI arXiv
Broersma, Hajo; Golovach, Petr A.; Paulusma, Daniël; Song, Jian Updating the complexity status of coloring graphs without a fixed induced linear forest. (English) Zbl 1234.68129 Theor. Comput. Sci. 414, No. 1, 9-19 (2012). MSC: 68Q17 05C15 PDFBibTeX XMLCite \textit{H. Broersma} et al., Theor. Comput. Sci. 414, No. 1, 9--19 (2012; Zbl 1234.68129) Full Text: DOI
Angel, Eric; Bampis, Evripidis; Thibault, Nicolas Randomized truthful algorithms for scheduling selfish tasks on parallel machines. (English) Zbl 1234.68041 Theor. Comput. Sci. 414, No. 1, 1-8 (2012). MSC: 68M20 68W25 68R10 PDFBibTeX XMLCite \textit{E. Angel} et al., Theor. Comput. Sci. 414, No. 1, 1--8 (2012; Zbl 1234.68041) Full Text: DOI