@article{Cappelle-Penso-Rautenbach/14,
AUTHOR = {Cappelle, M{\'a}rcia R. and Penso, Lucia and Rautenbach, Dieter},
TITLE = {Recognizing some complementary products},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {521},
PAGES = {1-7},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorial problems, graph algorithms, cartesian product, complementary product, complementary prism},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513008244},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Vagvolgyi/14,
AUTHOR = {V{\'a}gv{\"o}lgyi, S{\'a}ndor},
TITLE = {Tree shuffle},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {521},
PAGES = {8-28},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {unranked tree, hedge mix, shuffle, tree automaton},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513008256},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Crochemore-Iliopoulos-Kubica-Radoszewski-Rytter-Walen/14,
AUTHOR = {Crochemore, M. and Iliopoulos, C.S. and Kubica, M. and Radoszewski, J. and Rytter, W. and Wale{\'n}, T.},
TITLE = {Extracting powers and periods in a word from its runs structure},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {521},
PAGES = {29-41},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {run in a word, square, local period, primitive word},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513008621},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Chen/14,
AUTHOR = {Wang, Hung-Lung and Chen, Kuan-Yu},
TITLE = {One-dimensional approximate point set pattern matching with $L_p$-norm},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {521},
PAGES = {42-50},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {point set pattern matching, l p -norm, dynamic programming},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513008669},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Demaine-Demaine-Harvey-Uehara-Uno-Uno/14,
AUTHOR = {Demaine, Erik D. and Demaine, Martin L. and Harvey, Nicholas J.A. and Uehara, Ryuhei and Uno, Takeaki and Uno, Yushi},
TITLE = {UNO is hard, even for a single player},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {521},
PAGES = {51-61},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {algorithmic combinatorial game theory, dynamic programming, hamiltonian path, mathematical puzzles/games},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513008670},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Luo-Xu-Luo-He/14,
AUTHOR = {Luo, Taibo and Xu, Yinfeng and Luo, Li and He, Changzheng},
TITLE = {Semi-online scheduling with two GoS levels and unit processing time},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {521},
PAGES = {62-72},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {online scheduling, grade of service, unit processing time, lookahead, buffer},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513008700},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Grinshpun-Phalitnonkiat-Rubin-Tarfulea/14,
AUTHOR = {Grinshpun, Andrey and Phalitnonkiat, Pakawat and Rubin, Sasha and Tarfulea, Andrei},
TITLE = {Alternating traps in Muller and parity games},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {521},
PAGES = {73-91},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {parity games, muller games},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513008761},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Samal-Valla/14,
AUTHOR = {{\v{S}}{\'a}mal, R. and Valla, T.},
TITLE = {The guarding game is E-complete},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {521},
PAGES = {92-106},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {pursuit game, cops-and-robber game, graph guarding game, computational complexity, e-completeness, games on propositional formulas},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513008785},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fotakis-Kaporis-Lianeas-Spirakis/14,
AUTHOR = {Fotakis, Dimitris and Kaporis, Alexis C. and Lianeas, Thanasis and Spirakis, Paul G.},
TITLE = {On the hardness of network design for bottleneck routing games},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {521},
PAGES = {107-122},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {bottleneck routing games, braess's paradox, selfish network design},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513008797},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lin-Tan/14,
AUTHOR = {Lin, Ling and Tan, Zhiyi},
TITLE = {Inefficiency of Nash Equilibrium for scheduling games with constrained jobs: A parametric analysis},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {521},
PAGES = {123-134},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {scheduling game, price of anarchy, nash equilibrium},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513008438},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}