Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top

Theory of Computing Systems

Issue 3/2017

Content (10 Articles)

Parameterized Algorithms for Graph Partitioning Problems

Hadas Shachnai, Meirav Zehavi

Online Regenerator Placement

George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks

On Oblivious Branching Programs with Bounded Repetition that Cannot Efficiently Compute CNFs of Bounded Treewidth

Igor Razgon

Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion

Julien Baste, Luerbio Faria, Sulamita Klein, Ignasi Sau

Parameterized Complexity of Secluded Connectivity Problems

Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov

Adversarial Multiple Access Channels with Individual Injection Rates

Lakshmi Anantharamu, Bogdan S. Chlebus, Mariusz A. Rokicki

The Parameterized Space Complexity of Embedding Along a Path

Hubie Chen, Moritz Müller

A PTAS for the Geometric Connected Facility Location Problem

Flávio K. Miyazawa, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Renata G. D. de Souza

The 2-Rainbow Domination of Sierpiński Graphs and Extended Sierpiński Graphs

Jia-Jie Liu, Shun-Chieh Chang, Chiou-Jiun Lin

Open Access

The Complexity of Optimal Design of Temporally Connected Graphs

Eleni C. Akrida, Leszek Gąsieniec, George B. Mertzios, Paul G. Spirakis

Aug 17
Issue: 2/2017
Computer Science Symposium in Russia
Nov 17
Issue: 4/2017
Special Issues on Theoretical Aspects of Computer Science (STACS 2015) and Computability, Complexity and Randomness (CCR 2015)

Current Publications

scroll for more

use your arrow keys for more

scroll or use arrow keys for more

Premium Partner

    Image Credits