Journal: Theory Comput. Syst.

Volume 61, Issue 4

945 -- 947Ernst W. Mayr. Editorial: Special Issue on "Theoretical Aspects of Computer Science" (STACS 2015)
948 -- 986Sayan Bhattacharya, Wolfgang Dvorák, Monika Henzinger, Martin Starnberger. Welfare Maximization with Friends-of-Friends Network Externalities
987 -- 1010Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert E. Tarjan. Minimum-Cost Flows in Unit-Capacity Networks
1011 -- 1036Telikepalli Kavitha. New Pairwise Spanners
1037 -- 1053Jakub Lacki, Piotr Sankowski. Optimal Decremental Connectivity in Planar Graphs
1054 -- 1083Jacob Holm, Eva Rotenberg. Dynamic Planar Embeddings of Dynamic Graphs
1084 -- 1127Pascal Schweitzer. Towards an Isomorphism Dichotomy for Hereditary Graph Classes
1128 -- 1177Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen. The Advice Complexity of a Class of Hard Online Problems
1178 -- 1213Martin Delacourt, Benjamin Hellouin de Menibus. Characterisation of Limit Measures of Higher-Dimensional Cellular Automata
1214 -- 1236Mathieu Hoyrup, Cristobal Rojas. On the Information Carried by Programs About the Objects they Compute
1237 -- 1251Neeraj Kayal, Chandan Saha 0001. Multi-k-ic Depth Three Circuit Lower Bound
1252 -- 1253Andrew Lewis-Pye, Wolfgang Merkle. Guest Editorial: Tenth International Conference on Computability, Complexity and Randomness (CCR 2015)
1254 -- 1287Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan 0001, Dan Teng, Siyuan Zou. Semiautomatic Structures
1288 -- 1314Ludwig Staiger. Exact Constructive and Computable Dimensions
1315 -- 1336Bruno Bauwens, Alexander Shen, Hayato Takahashi. Conditional Probabilities and van Lambalgen's Theorem Revisited
1337 -- 1352Tom F. Sterkenburg. A Generalized Characterization of Algorithmic Probability
1353 -- 1375Laurent Bienvenu, Mathieu Hoyrup, Alexander Shen. Layerwise Computability and Image Randomness
1376 -- 1426Vasco Brattka, Matthew Hendtlass, Alexander P. Kreuzer. On the Uniform Computational Content of Computability Theory
1427 -- 1439Bjørn Kjos-Hanssen. On the Complexity of Automatic Complexity
1440 -- 1450Nikolai K. Vereshchagin. Short lists with short programs from programs of functions and strings

Volume 61, Issue 3

721 -- 738Hadas Shachnai, Meirav Zehavi. Parameterized Algorithms for Graph Partitioning Problems
739 -- 754George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks. Online Regenerator Placement
755 -- 776Igor Razgon. On Oblivious Branching Programs with Bounded Repetition that Cannot Efficiently Compute CNFs of Bounded Treewidth
777 -- 794Julien Baste, Luérbio Faria, Sulamita Klein, Ignasi Sau. Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion
795 -- 819Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov. Parameterized Complexity of Secluded Connectivity Problems
820 -- 850Lakshmi Anantharamu, Bogdan S. Chlebus, Mariusz A. Rokicki. Adversarial Multiple Access Channels with Individual Injection Rates
851 -- 870Hubie Chen, Moritz Müller. The Parameterized Space Complexity of Embedding Along a Path
871 -- 892Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Renata G. D. de Souza. A PTAS for the Geometric Connected Facility Location Problem
893 -- 906Jia Jie Liu, Shun-Chieh Chang, Chiou-Jiun Lin. The 2-Rainbow Domination of Sierpiński Graphs and Extended Sierpiński Graphs
907 -- 944Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis. The Complexity of Optimal Design of Temporally Connected Graphs

Volume 61, Issue 2

261 -- 262Andrei A. Bulatov, Edward A. Hirsch, Jean-Éric Pin. Preface
263 -- 282Konrad W. Schwerdtfeger. The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits
283 -- 304Martin Fürer, Huiwen Yu. Space Saving by Dynamic Algebraization Based on Tree-Depth
305 -- 321Akinori Kawachi, Benjamin Rossman, Osamu Watanabe 0001. The Query Complexity of Witness Finding
322 -- 351Markus Lohrey, Manfred Schmidt-Schauß. Processing Succinct Matrices and Vectors
352 -- 370Lukas Fleischer, Manfred Kufleitner, Alexander Lauser. The Half-Levels of the FO2 Alternation Hierarchy
371 -- 461Stéphane Demri, Didier Galmiche, Dominique Larchey-Wendling, Daniel Méry. Separation Logic with One Quantified Variable
462 -- 463Lev D. Beklemishev. Guest Editorial: Computer Science Symposium in Russia
464 -- 493Vladimir V. Podolskii. Bounds in Ontology-Based Data Access via Circuit Complexity
494 -- 520Volker Diekert, Florent Martin, Géraud Sénizergues, Pedro V. Silva. Equations Over Free Inverse Monoids with Idempotent Variables
521 -- 535Alexey Milovanov. Some Properties of Antistochastic Strings
536 -- 580Vincent Penelle. Rewriting Higher-Order Stack Trees
581 -- 605Mikhail Barash, Alexander Okhotin. Generalized LR Parsing Algorithm for Grammars with One-Sided Contexts
606 -- 636Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen. Optimizing Binary Heaps
637 -- 655Simone Bova, Friedrich Slivovsky. On Compiling Structured CNFs to OBDDs
656 -- 688Mateus de Oliveira Oliveira. On the Satisfiability of Quantum Circuits of Small Treewidth
689 -- 720Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey. Satisfiability of ECTL∗ with Local Tree Constraints

Volume 61, Issue 1

1 -- 0Marcelo Arenas. Foreword: Special Issue on Database Theory
2 -- 30Paraschos Koutris, Tova Milo, Sudeepa Roy, Dan Suciu. Answering Conjunctive Queries with Inequalities
31 -- 83Juan L. Reutter, Miguel Romero 0001, Moshe Y. Vardi. Regular Queries on Graph Databases
84 -- 155Martin Schuster, Thomas Schwentick. Games for Active XML Revisited
156 -- 190Nadime Francis. Asymptotic Determinacy of Path Queries Using Union-of-Paths Views
191 -- 232Leopoldo E. Bertossi, Babak Salimi. From Causes for Database Queries to Repairs and Model-Based Diagnosis and Back
233 -- 260Bas Ketsman, Frank Neven. Optimal Broadcasting Strategies for Conjunctive Queries over Distributed Data