@article{Borodin-Ivan-Ye-Zimny/12,
AUTHOR = {Borodin, Allan and Ivan, Ioana and Ye, Yuli and Zimny, Bryce},
TITLE = {On sum coloring and sum multi-coloring for restricted families of graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {418},
PAGES = {1-13},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {sum coloring, sum multi-coloring, approximation algorithms, greedy algorithms, priority lower bound, graph algorithms, np-hardness, geometric intersection graphs, clawfree graphs, unit disk graphs, interval graphs},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397511009170},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Droste-Vogler/12,
AUTHOR = {Droste, Manfred and Vogler, Heiko},
TITLE = {Weighted automata and multi-valued logics over arbitrary bounded lattices},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {418},
PAGES = {14-36},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {weighted automata, lattice-valued logic, rational formal power series, strong bimonoids, aperiodic series, weighted ltl-definable series},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397511009157},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fernandez_Anta-Mosteiro-Thraves/12,
AUTHOR = {Fern{\'a}ndez Anta, Antonio and Mosteiro, Miguel A. and Thraves, Christopher},
TITLE = {Deterministic recurrent communication in restricted Sensor Networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {418},
PAGES = {37-47},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {radio networks, sensor networks, deterministic communication, recurrent communication},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397511008887},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fratani/12,
AUTHOR = {Fratani, S{\'e}verine},
TITLE = {Regular sets over extended tree structures},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {418},
PAGES = {48-70},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {labeled tree structures, mso definable sets, automata with oracle, iterated pushdown structures},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397511008905},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kolpakov/12,
AUTHOR = {Kolpakov, Roman},
TITLE = {On primary and secondary repetitions in words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {418},
PAGES = {71-81},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorics on words, runs, maximal repetitions in strings, exponents of repetitions},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397511008942},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lai/12,
AUTHOR = {Lai, Cheng-Nan},
TITLE = {Two conditions for reducing the maximal length of node-disjoint paths in hypercubes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {418},
PAGES = {82-91},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {hypercube, node-disjoint paths, matching, optimization problem},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397511009169},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Xu-Huang-Liu-Zhang-Sun/12,
AUTHOR = {Xu, Hongli and Huang, Liusheng and Liu, Wang and Zhang, Yindong and Sun, Yanjing},
TITLE = {Degree-bounded minimum spanning tree for unit disk graph},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {418},
PAGES = {92-105},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {degree-bounded minimum spanning tree, unit disk graph, wireless sensor network, necessary condition},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397511008899},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Chee-Ling-Liu-Wang/12,
AUTHOR = {Zhang, Zhifang and Chee, Yeow Meng and Ling, San and Liu, Mulan and Wang, Huaxiong},
TITLE = {Threshold changeable secret sharing schemes revisited},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {418},
PAGES = {106-115},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {secret sharing schemes, threshold changeable secret sharing schemes, perfect security, computational security},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397511008206},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Seki/12,
AUTHOR = {Seki, Shinnosuke},
TITLE = {Absoluteness of subword inequality is undecidable},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {418},
PAGES = {116-120},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {subword history, subword inequality, hilbert's 10th problem, diophantine equation, undecidability, np-hardness},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397511008875},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}