default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical 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 - Richard Schmied, Claus Viehmann:
Approximating edge dominating set in dense graphs. 92-99
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-11 21:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
