Works matching IS 14324350 AND DT 2017 AND VI 61 AND IP 3

Results: 10

Online Regenerator Placement.

Published in:

Theory of Computing Systems, 2017, v. 61, n. 3, p. 739, doi. 10.1007/s00224-016-9711-3

By:

Mertzios, George;
Shalom, Mordechai;
Wong, Prudence;
Zaks, Shmuel

Publication type:

Article

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

Published in:

Theory of Computing Systems, 2017, v. 61, n. 3, p. 755, doi. 10.1007/s00224-016-9714-0

By:

Razgon, Igor

Publication type:

Article

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

Published in:

Theory of Computing Systems, 2017, v. 61, n. 3, p. 777, doi. 10.1007/s00224-016-9716-y

By:

Baste, Julien;
Faria, Luerbio;
Klein, Sulamita;
Sau, Ignasi

Publication type:

Article

Parameterized Complexity of Secluded Connectivity Problems.

Published in:

Theory of Computing Systems, 2017, v. 61, n. 3, p. 795, doi. 10.1007/s00224-016-9717-x

By:

Fomin, Fedor;
Golovach, Petr;
Karpov, Nikolay;
Kulikov, Alexander

Publication type:

Article

Adversarial Multiple Access Channels with Individual Injection Rates.

Published in:

Theory of Computing Systems, 2017, v. 61, n. 3, p. 820, doi. 10.1007/s00224-016-9725-x

By:

Anantharamu, Lakshmi;
Chlebus, Bogdan;
Rokicki, Mariusz

Publication type:

Article

The Parameterized Space Complexity of Embedding Along a Path.

Published in:

Theory of Computing Systems, 2017, v. 61, n. 3, p. 851, doi. 10.1007/s00224-016-9728-7

By:

Chen, Hubie;
Müller, Moritz

Publication type:

Article

A PTAS for the Geometric Connected Facility Location Problem.

Published in:

Theory of Computing Systems, 2017, v. 61, n. 3, p. 871, doi. 10.1007/s00224-017-9749-x

By:

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

Publication type:

Article

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

Published in:

Theory of Computing Systems, 2017, v. 61, n. 3, p. 893, doi. 10.1007/s00224-017-9756-y

By:

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

Publication type:

Article

The Complexity of Optimal Design of Temporally Connected Graphs.

Published in:

Theory of Computing Systems, 2017, v. 61, n. 3, p. 907, doi. 10.1007/s00224-017-9757-x

By:

Akrida, Eleni;
Gąsieniec, Leszek;
Mertzios, George;
Spirakis, Paul

Publication type:

Article

Parameterized Algorithms for Graph Partitioning Problems.

Published in:

Theory of Computing Systems, 2017, v. 61, n. 3, p. 721, doi. 10.1007/s00224-016-9706-0

By:

Shachnai, Hadas;
Zehavi, Meirav

Publication type:

Article