@article{Blumensath/13a,
AUTHOR = {Blumensath, Achim},
TITLE = {An algebraic proof of Rabin's Tree Theorem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {478},
PAGES = {1-21},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {monadic second-order logic, infinite trees, recognisability},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513000881},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dutting-Henzinger-Weber/13a,
AUTHOR = {D{\"u}tting, Paul and Henzinger, Monika and Weber, Ingmar},
TITLE = {Bidder optimal assignments for general utilities},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {478},
PAGES = {22-32},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {mechanism design, matching markets, discontinuous utilities, envy freeness, lattice},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513000923},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dabrowski-Demange-Lozin/13,
AUTHOR = {Dabrowski, Konrad K. and Demange, Marc and Lozin, Vadim V.},
TITLE = {New results on maximum induced matchings in bipartite graphs and beyond},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {478},
PAGES = {33-40},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {maximum induced matching, fixed-parameter tractability, regular bipartite graphs, hypercubes},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513000893},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bazgan-Gourves-Monnot-Pascual/13,
AUTHOR = {Bazgan, Cristina and Gourv{\`e}s, Laurent and Monnot, J{\'e}r{\^o}me and Pascual, Fanny},
TITLE = {Single approximation for the biobjective Max TSP},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {478},
PAGES = {41-50},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513000832},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kanj-Zhang/13,
AUTHOR = {Kanj, Iyad and Zhang, Fenghui},
TITLE = {On the independence number of graphs with maximum degree 3},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {478},
PAGES = {51-75},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {independence number, maximum independent set, combinatorial lower bounds, kernelization},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513000935},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Libert-Yung/13,
AUTHOR = {Libert, Beno{\^{i}}t and Yung, Moti},
TITLE = {Adaptively secure non-interactive threshold cryptosystems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {478},
PAGES = {76-100},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {threshold cryptography, encryption schemes, digital signatures, adaptive corruptions, non-interactivity, chosen-ciphertext security, chosen-message attacks},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513000157},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Nevisi-Reidenbach/13,
AUTHOR = {Nevisi, Hossein and Reidenbach, Daniel},
TITLE = {Unambiguous 1-uniform morphisms},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {478},
PAGES = {101-117},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {morphisms, ambiguity, fixed points of morphisms},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512010535},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Baba-Izumi-Ooshita-Kakugawa-Masuzawa/13,
AUTHOR = {Baba, Daisuke and Izumi, Tomoko and Ooshita, Fukuhito and Kakugawa, Hirotsugu and Masuzawa, Toshimitsu},
TITLE = {Linear time and space gathering of anonymous mobile agents in asynchronous trees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {478},
PAGES = {118-126},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {mobile agents, gathering problem, time complexity, space complexity, tree networks},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513000844},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Peng-Wang-Li-Tang-Xiong-Wang/13,
AUTHOR = {Chen, Wenbin and Peng, Lingxi and Wang, Jianxiong and Li, Fufang and Tang, Maobin and Xiong, Wei and Wang, Songtao},
TITLE = {Inapproximability results for the minimum integral solution problem with preprocessing over $\ell_{\infty}$ norm},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {478},
PAGES = {127-131},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {minimum integral solution problem, computational complexity, np-hardness, pcp},
URL = {http://www.sciencedirect.com/science/article/pii/S030439751300090X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}