@article{Beecken-Mittmann-Saxena/13,
AUTHOR = {Beecken, M. and Mittmann, J. and Saxena, N.},
TITLE = {Algebraic independence and blackbox identity testing},
JOURNAL = {Inf.~Comput.},
VOLUME = {222},
PAGES = {2-19},
YEAR = {2013},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {algebraic independence, transcendence degree, arithmetic circuits, polynomial identity testing, blackbox algorithms, depth-4 circuits},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001435},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Hoefer/13,
AUTHOR = {Hoefer, Martin},
TITLE = {Local matching dynamics in social networks},
JOURNAL = {Inf.~Comput.},
VOLUME = {222},
PAGES = {20-35},
YEAR = {2013},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {stable marriage, stable matching, best-response dynamics, convergence},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001447},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Chechik/13,
AUTHOR = {Chechik, Shiri},
TITLE = {Fault-tolerant compact routing schemes for general graphs},
JOURNAL = {Inf.~Comput.},
VOLUME = {222},
PAGES = {36-44},
YEAR = {2013},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {forbidden sets, fault-tolerance, compact routing},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001502},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Li/13,
AUTHOR = {Li, Shi},
TITLE = {A 1.488 approximation algorithm for the uncapacitated facility location problem},
JOURNAL = {Inf.~Comput.},
VOLUME = {222},
PAGES = {45-58},
YEAR = {2013},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {approximation, facility location problem, theory},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001459},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Ahn-Guha/13,
AUTHOR = {Ahn, Kook Jin and Guha, Sudipto},
TITLE = {Linear programming in the semi-streaming model with application to the maximum matching problem},
JOURNAL = {Inf.~Comput.},
VOLUME = {222},
PAGES = {59-79},
YEAR = {2013},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {semi-streaming model, maximum matching},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001460},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Allender-Friedman-Gasarch/13,
AUTHOR = {Allender, Eric and Friedman, Luke and Gasarch, William},
TITLE = {Limits on the computational power of random strings},
JOURNAL = {Inf.~Comput.},
VOLUME = {222},
PAGES = {80-92},
YEAR = {2013},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {kolmogorov complexity, prefix complexity, uniform derandomization, complexity classes},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001472},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Berman-Bhattacharyya-Makarychev-Raskhodnikova-Yaroslavtsev/13,
AUTHOR = {Berman, Piotr and Bhattacharyya, Arnab and Makarychev, Konstantin and Raskhodnikova, Sofya and Yaroslavtsev, Grigory},
TITLE = {Approximation algorithms for spanner problems and Directed Steiner Forest},
JOURNAL = {Inf.~Comput.},
VOLUME = {222},
PAGES = {93-107},
YEAR = {2013},
EDITOR = {Meyer, Albert R.},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001484},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Bova-Chen-Valeriote/13,
AUTHOR = {Bova, Simone and Chen, Hubie and Valeriote, Matthew},
TITLE = {Generic expression hardness results for primitive positive formula comparison},
JOURNAL = {Inf.~Comput.},
VOLUME = {222},
PAGES = {108-120},
YEAR = {2013},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {primitive positive formulas, conjunctive queries, equivalence, computational complexity, clones},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001496},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Brazdil-Brozek-Etessami-Kucera/13,
AUTHOR = {Br{\'a}zdil, Tom{\'a}{\v{s}} and Bro{\v{z}}ek, V{\'a}clav and Etessami, Kousha and Ku{\v{c}}era, Anton{\'{i}}n},
TITLE = {Approximating the termination value of one-counter MDPs and stochastic games},
JOURNAL = {Inf.~Comput.},
VOLUME = {222},
PAGES = {121-138},
YEAR = {2013},
EDITOR = {Meyer, Albert R.},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001599},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Deng-Hennessy/13,
AUTHOR = {Deng, Yuxin and Hennessy, Matthew},
TITLE = {On the semantics of Markov automata},
JOURNAL = {Inf.~Comput.},
VOLUME = {222},
PAGES = {139-168},
YEAR = {2013},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {markov automata, bisimulation, soundness, completeness},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001514},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Durocher-He-Munro-Nicholson-Skala/13,
AUTHOR = {Durocher, Stephane and He, Meng and Munro, J. Ian and Nicholson, Patrick K. and Skala, Matthew},
TITLE = {Range majority in constant time and linear space},
JOURNAL = {Inf.~Comput.},
VOLUME = {222},
PAGES = {169-179},
YEAR = {2013},
EDITOR = {Meyer, Albert R.},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001526},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Huang-Kavitha/13,
AUTHOR = {Huang, Chien-Chung and Kavitha, Telikepalli},
TITLE = {Popular matchings in the stable marriage problem},
JOURNAL = {Inf.~Comput.},
VOLUME = {222},
PAGES = {180-194},
YEAR = {2013},
EDITOR = {Meyer, Albert R.},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001538},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Jansen-Santhanam/13,
AUTHOR = {Jansen, Maurice and Santhanam, Rahul},
TITLE = {Permanent does not have succinct polynomial size arithmetic circuits of constant depth},
JOURNAL = {Inf.~Comput.},
VOLUME = {222},
PAGES = {195-207},
YEAR = {2013},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {arithmetic circuits, lower bounds, permanent, polynomial identity testing},
URL = {http://www.sciencedirect.com/science/article/pii/S089054011200154X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Kapoutsis/13,
AUTHOR = {Kapoutsis, Christos A.},
TITLE = {Nondeterminism is essential in small two-way finite automata with few reversals},
JOURNAL = {Inf.~Comput.},
VOLUME = {222},
PAGES = {208-227},
YEAR = {2013},
EDITOR = {Meyer, Albert R.},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001617},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Katsumata/13,
AUTHOR = {Katsumata, Shin-ya},
TITLE = {Relating computational effects by $\top\top$-lifting},
JOURNAL = {Inf.~Comput.},
VOLUME = {222},
PAGES = {228-246},
YEAR = {2013},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {logical relation, monad, fibration, computational effects, -lifting, algebraic operation, generic effect, fresh name creation},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001551},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Laird-Manzonetto-McCusker/13,
AUTHOR = {Laird, Jim and Manzonetto, Giulio and McCusker, Guy},
TITLE = {Constructing differential categories and deconstructing categories of games},
JOURNAL = {Inf.~Comput.},
VOLUME = {222},
PAGES = {247-264},
YEAR = {2013},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {differential categories, game semantics, full abstraction},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001563},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Kuhn-Mastrolilli/13,
AUTHOR = {Kuhn, Fabian and Mastrolilli, Monaldo},
TITLE = {Vertex cover in graphs with locally few colors},
JOURNAL = {Inf.~Comput.},
VOLUME = {222},
PAGES = {265-277},
YEAR = {2013},
EDITOR = {Meyer, Albert R.},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001629},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Lokshtanov-Marx/13,
AUTHOR = {Lokshtanov, Daniel and Marx, D{\'a}niel},
TITLE = {Clustering with local restrictions},
JOURNAL = {Inf.~Comput.},
VOLUME = {222},
PAGES = {278-292},
YEAR = {2013},
EDITOR = {Meyer, Albert R.},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001575},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}
@article{Moldenhauer/13,
AUTHOR = {Moldenhauer, Carsten},
TITLE = {Primal-dual approximation algorithms for Node-Weighted Steiner Forest on planar graphs},
JOURNAL = {Inf.~Comput.},
VOLUME = {222},
PAGES = {293-306},
YEAR = {2013},
EDITOR = {Meyer, Albert R.},
KEYWORDS = {node-weighted steiner forest, generalized steiner tree, vertex feedback set, primal-dual algorithm, approximation algorithms, planar graphs},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540112001587},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis},
}