@article{Bjorklund-Ohman/13,
AUTHOR = {Bj{\"o}rklund, Johanna and {\"O}hman, Lars-Daniel},
TITLE = {Simulation relations for pattern matching in directed graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {485},
PAGES = {1-15},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {pattern matching, simulation, graphs, treebanks, complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S030439751300234X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Blanchet-Sadri-Fox/13,
AUTHOR = {Blanchet-Sadri, F. and Fox, Nathan},
TITLE = {Abelian-primitive partial words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {485},
PAGES = {16-37},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {algorithms on words, combinatorics on words, partial words, abelian-primitive partial words},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513001989},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Droste-Kuich/13,
AUTHOR = {Droste, Manfred and Kuich, Werner},
TITLE = {Weighted finite automata over hemirings},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {485},
PAGES = {38-48},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513001606},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Beaulieu-Burke-Duchene/13,
AUTHOR = {Beaulieu, G. and Burke, K. and Duch{\^e}ne, E.},
TITLE = {Impartial coloring games},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {485},
PAGES = {49-60},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorial games, sprague-grundy function, graph coloring},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513001783},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Feldmann/13,
AUTHOR = {Feldmann, Andreas Emil},
TITLE = {Fast balanced partitioning is hard even on grids and trees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {485},
PAGES = {61-68},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {balanced partitioning, bicriteria approximation, inapproximability, grid graphs, trees},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513002259},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Broersma-Golovach-Patel/13,
AUTHOR = {Broersma, Hajo and Golovach, Petr A. and Patel, Viresh},
TITLE = {Tight complexity bounds for FPT subgraph problems parameterized by the clique-width},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {485},
PAGES = {69-84},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {parameterized complexity, clique-width, exponential time hypothesis},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513001990},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kasprzik/13,
AUTHOR = {Kasprzik, Anna},
TITLE = {Four one-shot learners for regular tree languages and their polynomial characterizability},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {485},
PAGES = {85-106},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {grammatical inference, one-shot learning, query learning, learning from finite samples, polynomial characterizability},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513000303},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}