@article{Geffert/12,
AUTHOR = {Geffert, Viliam},
TITLE = {An alternating hierarchy for finite automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {445},
PAGES = {1-24},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {descriptional complexity, regular languages, alternating finite automata},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512004094},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hong-Kang/12,
AUTHOR = {Hong, Yanmei and Kang, Liying},
TITLE = {Backup 2-center on interval graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {445},
PAGES = {25-35},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {backup 2-center, interval graph},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512004240},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hong-Nagamochi/12a,
AUTHOR = {Hong, Seok-Hee and Nagamochi, Hiroshi},
TITLE = {Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {445},
PAGES = {36-51},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph drawing, star-shaped drawing, convex drawing, plane graphs, biconnected plane graphs, concave corner, star-shaped polygon},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512004331},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hu-Liao-Cheng/12,
AUTHOR = {Hu, Chunqiang and Liao, Xiaofeng and Cheng, Xiuzhen},
TITLE = {Verifiable multi-secret sharing based on LFSR sequences},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {445},
PAGES = {52-62},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {verifiable multi-secret sharing, lfsr-based public key cryptosystem, threshold scheme, cryptography},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512004276},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Klouda/12,
AUTHOR = {Klouda, Karel},
TITLE = {Bispecial factors in circular non-pushy D0L languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {445},
PAGES = {63-74},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {bispecial factors, circular d0l systems, non-pushy d0l systems, critical exponent},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512004288},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Liu-Zheng-Wang-Huo/12,
AUTHOR = {Liu, Ming and Zheng, Feifeng and Wang, Shijin and Huo, Jiazhen},
TITLE = {Optimal algorithms for online single machine scheduling with deteriorating jobs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {445},
PAGES = {75-81},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {scheduling, online algorithm, deteriorating job, competitive analysis},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512004252},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mezzini/12,
AUTHOR = {Mezzini, Mauro},
TITLE = {Fully dynamic algorithm for chordal graphs with $^{O(1)}$ query-time and $^{O(n^2)}$ update-time},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {445},
PAGES = {82-92},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {chordal graphs, dynamic algorithms, minimal triangulations},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512004239},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}