@article{Dragan-Abu-Ata/14,
AUTHOR = {Dragan, Feodor F. and Abu-Ata, Muad},
TITLE = {Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {547},
PAGES = {1-17},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {graph algorithms, approximation algorithms, tree spanner problem, collective tree spanners, spanners of bounded tree-width, robertson-seymour's tree-decomposition, balanced separators},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514004319},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Heuberger-Mazzoli/14,
AUTHOR = {Heuberger, Clemens and Mazzoli, Michela},
TITLE = {Symmetric digit sets for elliptic curve scalar multiplication without precomputation},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {547},
PAGES = {18-33},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {elliptic curve scalar multiplication, frobenius endomorphism, integer digit expansion, width-w non-adjacent form, gaussian integers, eisenstein integers},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514004344},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Hu-Lai-Lin/14,
AUTHOR = {Chen, Hung-Hsun and Hu, Wen-Guei and Lai, De-Jan and Lin, Song-Sun},
TITLE = {Nonemptiness problems of Wang tiles with three colors},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {547},
PAGES = {34-45},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {nonemptiness, wang tiles, decidability, edge coloring, periodic patterns, transition matrix},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514004393},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kobayashi/14,
AUTHOR = {Kobayashi, Kojiro},
TITLE = {The minimum firing time of the generalized firing squad synchronization problem for squares},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {547},
PAGES = {46-69},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {firing squad synchronization problem, cellular automata, automata theory, distributed computing},
URL = {http://www.sciencedirect.com/science/article/pii/S030439751400440X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Milanic-Rizzi-Tomescu/14,
AUTHOR = {Milani{\v{c}}, Martin and Rizzi, Romeo and Tomescu, Alexandru I.},
TITLE = {Set graphs. II. Complexity of set graph recognition and similar problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {547},
PAGES = {70-81},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {acyclic orientation, extensionality, set graph, np-complete problem, \#p-complete problem, hyper-extensional digraph, separating code, open-out-separating code},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514004411},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Calamoneri-Petreschi/14a,
AUTHOR = {Calamoneri, Tiziana and Petreschi, Rossella},
TITLE = {On pairwise compatibility graphs having Dilworth number $k$},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {547},
PAGES = {82-89},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {graphs with dilworth number k, leaf power graphs, minimum leaf power graphs, pairwise compatibility graphs},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514004605},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Elor-Bruckstein/14,
AUTHOR = {Elor, Yotam and Bruckstein, Alfred M.},
TITLE = {``Robot Cloud'' gradient climbing with point measurements},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {547},
PAGES = {90-103},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {source-seeking, point measurement, gradient, fume tracking},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514004617},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chatterjee-Henzinger-Krinninger-Loitzenbauer-Raskin/14,
AUTHOR = {Chatterjee, Krishnendu and Henzinger, Monika and Krinninger, Sebastian and Loitzenbauer, Veronika and Raskin, Michael A.},
TITLE = {Approximating the minimum cycle mean},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {547},
PAGES = {104-116},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {quantitative verification, graph algorithm, mean-payoff objective, approximation algorithm},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514004782},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shparlinski/14a,
AUTHOR = {Shparlinski, Igor E.},
TITLE = {Evasive properties of sparse graphs and some linear equations in primes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {547},
PAGES = {117-121},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {evasiveness, sparse graphs, prime numbers},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514004290},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fraenkel-Simpson/14,
AUTHOR = {Fraenkel, Aviezri S. and Simpson, Jamie},
TITLE = {Corrigendum to ``The exact number of squares in Fibonacci words''},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {547},
PAGES = {122-122},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514004356},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
NOTE = {Originally in Theor.~Comput.~Sci., Vol. 218, 1999, No. 1, 95-106},
}