@article{Angel-Bampis-Thibault/12,
AUTHOR = {Angel, Eric and Bampis, Evripidis and Thibault, Nicolas},
TITLE = {Randomized truthful algorithms for scheduling selfish tasks on parallel machines},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {414},
NUMBER = {1},
PAGES = {1-8},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {scheduling, algorithmic game theory, approximation},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397511008371},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Broersma-Golovach-Paulusma-Song/12,
AUTHOR = {Broersma, Hajo and Golovach, Petr A. and Paulusma, Dani{\"e}l and Song, Jian},
TITLE = {Updating the complexity status of coloring graphs without a fixed induced linear forest},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {414},
NUMBER = {1},
PAGES = {9-19},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph coloring, forbidden induced subgraph, linear forest},
URL = {http://www.sciencedirect.com/science/article/pii/S030439751100836X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dekking/12,
AUTHOR = {Dekking, Michel},
TITLE = {Paperfolding morphisms, planefilling curves, and fractal tiles},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {414},
NUMBER = {1},
PAGES = {20-37},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {automatic sequences, iterated paperfolding, l-systems, ifs, tiles},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397511008085},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jesse-Jozefczyk/12,
AUTHOR = {Jesse-J{\'o}zefczyk, Katarzyna},
TITLE = {The possible cardinalities of global secure sets in cographs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {414},
NUMBER = {1},
PAGES = {38-46},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph, alliance, secure set, dominating set, cograph, cotree},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397511008358},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Le_Gonidec/12,
AUTHOR = {Le Gonidec, Marion},
TITLE = {On the complexity of a family of $k$-context-free sequences},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {414},
NUMBER = {1},
PAGES = {47-54},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {context-free sequences, complexity, subword complexity, pushdown automata},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397511007985},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li-Pan/12,
AUTHOR = {Li, Angsheng and Pan, Yicheng},
TITLE = {Characterizations of locally testable linear- and affine-invariant families},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {414},
NUMBER = {1},
PAGES = {55-75},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {error correcting codes, locally testable codes, (algebraic) property tests},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397511008231},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Petitjean-Gancarski/12,
AUTHOR = {Petitjean, Fran{\c{c}}ois and Gan{\c{c}}arski, Pierre},
TITLE = {Summarizing a set of time series by averaging: From Steiner sequence to compact multiple alignment},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {414},
NUMBER = {1},
PAGES = {76-91},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {time series summarizing, time series averaging, dynamic time warping, multiple alignment, compact multiple alignment, consensus sequence, soft computing},
URL = {http://www.sciencedirect.com/science/article/pii/S030439751100822X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Schmied-Viehmann/12,
AUTHOR = {Schmied, Richard and Viehmann, Claus},
TITLE = {Approximating edge dominating set in dense graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {414},
NUMBER = {1},
PAGES = {92-99},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {edge dominating set, minimum maximal matching, dense instances, approximation algorithms, approximation lower bounds},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397511008243},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}