nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Adversarial Multiple Access Channels with Individual Injection Rates
|
Anantharamu, Lakshmi |
|
2016 |
61 |
3 |
p. 820-850 |
artikel |
2 |
A PTAS for the Geometric Connected Facility Location Problem
|
Miyazawa, Flávio K. |
|
2017 |
61 |
3 |
p. 871-892 |
artikel |
3 |
Online Regenerator Placement
|
Mertzios, George B. |
|
2016 |
61 |
3 |
p. 739-754 |
artikel |
4 |
On Oblivious Branching Programs with Bounded Repetition that Cannot Efficiently Compute CNFs of Bounded Treewidth
|
Razgon, Igor |
|
2016 |
61 |
3 |
p. 755-776 |
artikel |
5 |
Parameterized Algorithms for Graph Partitioning Problems
|
Shachnai, Hadas |
|
2016 |
61 |
3 |
p. 721-738 |
artikel |
6 |
Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion
|
Baste, Julien |
|
2016 |
61 |
3 |
p. 777-794 |
artikel |
7 |
Parameterized Complexity of Secluded Connectivity Problems
|
Fomin, Fedor V. |
|
2016 |
61 |
3 |
p. 795-819 |
artikel |
8 |
The Complexity of Optimal Design of Temporally Connected Graphs
|
Akrida, Eleni C. |
|
2017 |
61 |
3 |
p. 907-944 |
artikel |
9 |
The Parameterized Space Complexity of Embedding Along a Path
|
Chen, Hubie |
|
2016 |
61 |
3 |
p. 851-870 |
artikel |
10 |
The 2-Rainbow Domination of Sierpiński Graphs and Extended Sierpiński Graphs
|
Liu, Jia-Jie |
|
2017 |
61 |
3 |
p. 893-906 |
artikel |