Journal: Theory Comput. Syst.

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