@article{Berberich-Emeliyanenko-Kobel-Sagraloff/13,
AUTHOR = {Berberich, Eric and Emeliyanenko, Pavel and Kobel, Alexander and Sagraloff, Michael},
TITLE = {Exact symbolic-numeric computation of planar algebraic curves},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {491},
PAGES = {1-32},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {algebraic curves, topology computation, arrangement, polynomial systems, numerical solver, hybrid methods, symbolic-numeric algorithms, exact computation},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513002983},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cerny/13,
AUTHOR = {{\v{C}}ern{\'y}, Anton},
TITLE = {On Prouhet's solution to the equal powers problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {491},
PAGES = {33-46},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {prouhet-tarry-escott problem, uniform morphism, spectrum, symbol position, sequence of thue-morse},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513002636},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Krenn/13,
AUTHOR = {Krenn, Daniel},
TITLE = {Analysis of the width-$w$ non-adjacent form in conjunction with hyperelliptic curve cryptography and with lattices},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {491},
PAGES = {47-70},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {-adic expansions, width- w non-adjacent forms, redundant digit sets, hyperelliptic curve cryptography, koblitz curves, frobenius endomorphism, scalar multiplication, lattices, numeral systems, sum of digits},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513002685},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cheng-Shah-Shah-Steffy/13,
AUTHOR = {Cheng, Eddie and Shah, Shalin and Shah, Vyom and Steffy, Daniel E.},
TITLE = {Strong matching preclusion for augmented cubes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {491},
PAGES = {71-77},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {interconnection networks, perfect matching, augmented cubes},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513003393},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yang-Wang/13,
AUTHOR = {Yang, Yuxing and Wang, Shiying},
TITLE = {Fault-free Hamiltonian cycles passing through a linear forest in ternary $n$-cubes with faulty edges},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {491},
PAGES = {78-82},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {interconnection networks, fault tolerance, k -ary n -cubes, hamiltonian cycles, linear forests},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512009802},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Seo-Yum-Lee/13,
AUTHOR = {Seo, Jae Woo and Yum, Dae Hyun and Lee, Pil Joong},
TITLE = {Proxy-invisible CCA-secure type-based proxy re-encryption without random oracles},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {491},
PAGES = {83-93},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {public key encryption, type-based proxy re-encryption, proxy invisibility, chosen-ciphertext security},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512010560},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dong-Zhang-Chen-Yang/13,
AUTHOR = {Dong, Jianming and Zhang, An and Chen, Yong and Yang, Qifan},
TITLE = {Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {491},
PAGES = {94-102},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {open shop, batch and delivery, approximation algorithm, worst-case analysis},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513003332},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Wang/13,
AUTHOR = {Zhang, Shurong and Wang, Shiying},
TITLE = {Many-to-many disjoint path covers in $k$-ary $n$-cubes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {491},
PAGES = {103-118},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {interconnection networks, k -ary n -cubes, disjoint paths, parallel computing},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513002648},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jin-Xu-Zhang/13,
AUTHOR = {Jin, Jing and Xu, Baogang and Zhang, Xiaoyan},
TITLE = {On the complexity of injective colorings and its generalizations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {491},
PAGES = {119-126},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {injective coloring, max-injective coloring, on-line injective coloring, algorithm, complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513003344},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yin-Zhu/13,
AUTHOR = {Yin, Xiao and Zhu, Daming},
TITLE = {Sorting genomes by generalized translocations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {491},
PAGES = {127-135},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {algorithm, genome rearrangement, translocation},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513000388},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tassa/13,
AUTHOR = {Tassa, Tamir},
TITLE = {Addendum to ``Finding all maximally-matchable edges in a bipartite graph''},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {491},
PAGES = {136-136},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513002284},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
NOTE = {Originally in Theor.~Comput.~Sci., Vol. 423, 2012, 50-58},
}