Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=414
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Randomized truthful algorithms for scheduling selfish tasks on parallel machines
Eric Angel
,
Evripidis Bampis
,
Nicolas Thibault
Theoretical Computer Science
414
(1), 2012, pp. 1-8
Updating the complexity status of coloring graphs without a fixed induced linear forest
Hajo Broersma
,
Petr A. Golovach
,
Daniël Paulusma
,
Jian Song
Theoretical Computer Science
414
(1), 2012, pp. 9-19
Paperfolding morphisms, planefilling curves, and fractal tiles
Michel Dekking
Theoretical Computer Science
414
(1), 2012, pp. 20-37
The possible cardinalities of global secure sets in cographs
Katarzyna Jesse-Józefczyk
Theoretical Computer Science
414
(1), 2012, pp. 38-46
On the complexity of a family of
k
-context-free sequences
Marion Le Gonidec
Theoretical Computer Science
414
(1), 2012, pp. 47-54
Characterizations of locally testable linear- and affine-invariant families
Angsheng Li
,
Yicheng Pan
Theoretical Computer Science
414
(1), 2012, pp. 55-75
Summarizing a set of time series by averaging: From Steiner sequence to compact multiple alignment
François Petitjean
,
Pierre Gançarski
Theoretical Computer Science
414
(1), 2012, pp. 76-91
Approximating edge dominating set in dense graphs
Richard Schmied
,
Claus Viehmann
Theoretical Computer Science
414
(1), 2012, pp. 92-99