@article{Sun-He-Hsu-Fan/14,
AUTHOR = {Sun, Hongyang and He, Yuxiong and Hsu, Wen-Jing and Fan, Rui},
TITLE = {Energy-efficient multiprocessor scheduling for flow time and makespan},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {550},
PAGES = {1-20},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {multiprocessors, online scheduling, dynamic speed scaling, energy-performance tradeoff, competitive analysis, total flow time, makespan},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514005246},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Asahiro-Eto-Ito-Miyano/14,
AUTHOR = {Asahiro, Yuichi and Eto, Hiroshi and Ito, Takehiro and Miyano, Eiji},
TITLE = {Complexity of finding maximum regular induced subgraphs with prescribed degree},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {550},
PAGES = {21-35},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {bipartite graph, chordal graph, graph algorithm, inapproximability, planar graph, regular induced subgraph, treewidth},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514005386},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fazli-Ghodsi-Habibi-Jalaly-Mirrokni-Sadeghian/14,
AUTHOR = {Fazli, MohammadAmin and Ghodsi, Mohammad and Habibi, Jafar and Jalaly, Pooya and Mirrokni, Vahab and Sadeghian, Sina},
TITLE = {On non-progressive spread of influence through social networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {550},
PAGES = {36-50},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {spread of influence, non-progressive, minpts problem, np-hardness, approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514005398},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bille-Cording-Gortz/14a,
AUTHOR = {Bille, Philip and Cording, Patrick Hagge and G{\o}rtz, Inge Li},
TITLE = {Compact q-gram profiling of compressed strings},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {550},
PAGES = {51-58},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {q-gram profile, grammar compression, slp},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514005404},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Fu-Goebel-Lin-Tong-Xu-Yang-Zhao-Zhu/14,
AUTHOR = {Chen, Zhixiang and Fu, Bin and Goebel, Randy and Lin, Guohui and Tong, Weitian and Xu, Jinhui and Yang, Boting and Zhao, Zhiyu and Zhu, Binhai},
TITLE = {On the approximability of the exemplar adjacency number problem for genomes with gene repetitions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {550},
PAGES = {59-65},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {genome comparison, adjacency, breakpoint, np-hard, approximation algorithm},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514005416},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Simpson/14,
AUTHOR = {Simpson, Jamie},
TITLE = {Palindromes in circular words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {550},
PAGES = {66-78},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {circular words, palindromes},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514005428},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kari-Konstantinidis-Kopecki/14,
AUTHOR = {Kari, Lila and Konstantinidis, Stavros and Kopecki, Steffen},
TITLE = {On the maximality of languages with combined types of code properties},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {550},
PAGES = {79-89},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {code properties, deciphering delay, decoding delay, decidable, maximal codes, syntactic monoids},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514005581},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cho-Han-Ko/14,
AUTHOR = {Cho, Da-Jung and Han, Yo-Sub and Ko, Sang-Ki},
TITLE = {Decidability of involution hypercodes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {550},
PAGES = {90-99},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {involution hypercodes, decidability, dna codes, edit-distance},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514005593},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Haslegrave/14a,
AUTHOR = {Haslegrave, John},
TITLE = {Bounds on Herman's algorithm},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {550},
PAGES = {100-106},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {randomized algorithms, probabilistic self-stabilization, herman's algorithm},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514005660},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dekking/14,
AUTHOR = {Dekking, Michel},
TITLE = {On the structure of Thue-Morse subwords, with an application to dynamical systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {550},
PAGES = {107-112},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {thue-morse sequence, thue-morse factors, substitution dynamical system, conjugacy},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514005672},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}